Question 23439: Every Element Order Is the First Positive Identity Return

On this page
  1. Original question and givens
  2. Definition and scope
  3. Step-by-step derivation
  4. Reverse checks
  5. Result
  6. This question review and source binding

Return to catalogue page 118

← Question derivation index · Original question batch

R0045-23439 · q-20261014-advance-20261112-r01-cauchy-theorem-finite-groups-0039

Original question and givens

Use complete finite Cayley table=[[10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9], [11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0], [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1], [3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2], [4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3], [5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4], [6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5], [7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6], [8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7], [9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8]] with identity=2, row g/column h meaning g*h. Certify closure, associativity, identity and inverses. Element order is the least positive exponent returning to this same identity, not just one exponent that does so. Give (group_order, element_order_rows, all_orders_divide_group_order, certificate).

  • G001 — Use complete finite Cayley table=[[10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9], [11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0], [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1], [3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2], [4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3], [5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4], [6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5], [7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6], [8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7], [9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8]] with identity=2, row g/column h meaning g*h. Certify closure, associativity, identity and inverses. Element order is the least positive exponent returning to this same identity, not just one exponent that does so. Give (group_order, element_order_rows, all_orders_divide_group_order, certificate).

Definition and scope

Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.

Step-by-step derivation

S001 · implies

Before

source operation=cauchy-element-order-table;original snapshot and mathematics retained

After

explicit ordered source output fields=[group_order, element_order_rows, all_orders_divide_group_order, certificate]

Conditions: none

Retain the historical interface marker while listing source fields without JavaScript.Tags and No retain their claim scope;source-protocol ordering is not a mathematical proof.

Step identifiers and dependencies

Rule: source_ordered_interface_explicit_without_javascript · Uses: G001

S002 · implies

Before

ORIGINAL closed Cayley table=[[10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9], [11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0], [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1], [3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2], [4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3], [5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4], [6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5], [7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6], [8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7], [9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8]];ACTUAL declared group identity=2

After

ALL [g,e*g,g*e,both_equal_g] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes], [10, 10, 10, Yes], [11, 11, 11, Yes]];two-sided group identity=Yes

Conditions: none

Both e*g and g*e in the group table must equal g.This is not certified by an identity-action row on points.

Step identifiers and dependencies

Rule: groupaction_group_identity_both_sides_not_action_identity · Uses: G001, S001

S003 · implies

Before

ORIGINAL group pair(g,h)=[0, 0];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 10, 10, Yes], [3, 11, 11, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes], [10, 6, 6, Yes], [11, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S002

S004 · implies

Before

ORIGINAL group pair(g,h)=[0, 1];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 10, 10, Yes], [2, 11, 11, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes], [10, 7, 7, Yes], [11, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S003

S005 · implies

Before

ORIGINAL group pair(g,h)=[0, 2];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 10, 10, Yes], [1, 11, 11, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes], [10, 8, 8, Yes], [11, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S004

S006 · implies

Before

ORIGINAL group pair(g,h)=[0, 3];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 11, 11, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes], [10, 9, 9, Yes], [11, 10, 10, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S005

S007 · implies

Before

ORIGINAL group pair(g,h)=[0, 4];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes], [10, 10, 10, Yes], [11, 11, 11, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S006

S008 · implies

Before

ORIGINAL group pair(g,h)=[0, 5];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 10, 10, Yes], [10, 11, 11, Yes], [11, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S007

S009 · implies

Before

ORIGINAL group pair(g,h)=[0, 6];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 10, 10, Yes], [9, 11, 11, Yes], [10, 0, 0, Yes], [11, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S008

S010 · implies

Before

ORIGINAL group pair(g,h)=[0, 7];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 10, 10, Yes], [8, 11, 11, Yes], [9, 0, 0, Yes], [10, 1, 1, Yes], [11, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S009

S011 · implies

Before

ORIGINAL group pair(g,h)=[0, 8];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 10, 10, Yes], [7, 11, 11, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes], [10, 2, 2, Yes], [11, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S010

S012 · implies

Before

ORIGINAL group pair(g,h)=[0, 9];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 10, 10, Yes], [6, 11, 11, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes], [10, 3, 3, Yes], [11, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S011

S013 · implies

Before

ORIGINAL group pair(g,h)=[0, 10];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 10, 10, Yes], [5, 11, 11, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes], [10, 4, 4, Yes], [11, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S012

S014 · implies

Before

ORIGINAL group pair(g,h)=[0, 11];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 10, 10, Yes], [4, 11, 11, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes], [10, 5, 5, Yes], [11, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S013

S015 · implies

Before

ORIGINAL group pair(g,h)=[1, 0];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 10, 10, Yes], [2, 11, 11, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes], [10, 7, 7, Yes], [11, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S014

S016 · implies

Before

ORIGINAL group pair(g,h)=[1, 1];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 10, 10, Yes], [1, 11, 11, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes], [10, 8, 8, Yes], [11, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S015

S017 · implies

Before

ORIGINAL group pair(g,h)=[1, 2];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 11, 11, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes], [10, 9, 9, Yes], [11, 10, 10, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S016

S018 · implies

Before

ORIGINAL group pair(g,h)=[1, 3];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes], [10, 10, 10, Yes], [11, 11, 11, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S017

S019 · implies

Before

ORIGINAL group pair(g,h)=[1, 4];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 10, 10, Yes], [10, 11, 11, Yes], [11, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S018

S020 · implies

Before

ORIGINAL group pair(g,h)=[1, 5];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 10, 10, Yes], [9, 11, 11, Yes], [10, 0, 0, Yes], [11, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S019

S021 · implies

Before

ORIGINAL group pair(g,h)=[1, 6];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 10, 10, Yes], [8, 11, 11, Yes], [9, 0, 0, Yes], [10, 1, 1, Yes], [11, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S020

S022 · implies

Before

ORIGINAL group pair(g,h)=[1, 7];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 10, 10, Yes], [7, 11, 11, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes], [10, 2, 2, Yes], [11, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S021

S023 · implies

Before

ORIGINAL group pair(g,h)=[1, 8];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 10, 10, Yes], [6, 11, 11, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes], [10, 3, 3, Yes], [11, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S022

S024 · implies

Before

ORIGINAL group pair(g,h)=[1, 9];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 10, 10, Yes], [5, 11, 11, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes], [10, 4, 4, Yes], [11, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S023

S025 · implies

Before

ORIGINAL group pair(g,h)=[1, 10];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 10, 10, Yes], [4, 11, 11, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes], [10, 5, 5, Yes], [11, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S024

S026 · implies

Before

ORIGINAL group pair(g,h)=[1, 11];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 10, 10, Yes], [3, 11, 11, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes], [10, 6, 6, Yes], [11, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S025

S027 · implies

Before

ORIGINAL group pair(g,h)=[2, 0];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 10, 10, Yes], [1, 11, 11, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes], [10, 8, 8, Yes], [11, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S026

S028 · implies

Before

ORIGINAL group pair(g,h)=[2, 1];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 11, 11, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes], [10, 9, 9, Yes], [11, 10, 10, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S027

S029 · implies

Before

ORIGINAL group pair(g,h)=[2, 2];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes], [10, 10, 10, Yes], [11, 11, 11, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S028

S030 · implies

Before

ORIGINAL group pair(g,h)=[2, 3];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 10, 10, Yes], [10, 11, 11, Yes], [11, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S029

S031 · implies

Before

ORIGINAL group pair(g,h)=[2, 4];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 10, 10, Yes], [9, 11, 11, Yes], [10, 0, 0, Yes], [11, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S030

S032 · implies

Before

ORIGINAL group pair(g,h)=[2, 5];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 10, 10, Yes], [8, 11, 11, Yes], [9, 0, 0, Yes], [10, 1, 1, Yes], [11, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S031

S033 · implies

Before

ORIGINAL group pair(g,h)=[2, 6];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 10, 10, Yes], [7, 11, 11, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes], [10, 2, 2, Yes], [11, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S032

S034 · implies

Before

ORIGINAL group pair(g,h)=[2, 7];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 10, 10, Yes], [6, 11, 11, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes], [10, 3, 3, Yes], [11, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S033

S035 · implies

Before

ORIGINAL group pair(g,h)=[2, 8];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 10, 10, Yes], [5, 11, 11, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes], [10, 4, 4, Yes], [11, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S034

S036 · implies

Before

ORIGINAL group pair(g,h)=[2, 9];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 10, 10, Yes], [4, 11, 11, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes], [10, 5, 5, Yes], [11, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S035

S037 · implies

Before

ORIGINAL group pair(g,h)=[2, 10];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 10, 10, Yes], [3, 11, 11, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes], [10, 6, 6, Yes], [11, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S036

S038 · implies

Before

ORIGINAL group pair(g,h)=[2, 11];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 10, 10, Yes], [2, 11, 11, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes], [10, 7, 7, Yes], [11, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S037

S039 · implies

Before

ORIGINAL group pair(g,h)=[3, 0];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 11, 11, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes], [10, 9, 9, Yes], [11, 10, 10, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S038

S040 · implies

Before

ORIGINAL group pair(g,h)=[3, 1];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes], [10, 10, 10, Yes], [11, 11, 11, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S039

S041 · implies

Before

ORIGINAL group pair(g,h)=[3, 2];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 10, 10, Yes], [10, 11, 11, Yes], [11, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S040

S042 · implies

Before

ORIGINAL group pair(g,h)=[3, 3];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 10, 10, Yes], [9, 11, 11, Yes], [10, 0, 0, Yes], [11, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S041

S043 · implies

Before

ORIGINAL group pair(g,h)=[3, 4];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 10, 10, Yes], [8, 11, 11, Yes], [9, 0, 0, Yes], [10, 1, 1, Yes], [11, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S042

S044 · implies

Before

ORIGINAL group pair(g,h)=[3, 5];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 10, 10, Yes], [7, 11, 11, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes], [10, 2, 2, Yes], [11, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S043

S045 · implies

Before

ORIGINAL group pair(g,h)=[3, 6];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 10, 10, Yes], [6, 11, 11, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes], [10, 3, 3, Yes], [11, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S044

S046 · implies

Before

ORIGINAL group pair(g,h)=[3, 7];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 10, 10, Yes], [5, 11, 11, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes], [10, 4, 4, Yes], [11, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S045

S047 · implies

Before

ORIGINAL group pair(g,h)=[3, 8];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 10, 10, Yes], [4, 11, 11, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes], [10, 5, 5, Yes], [11, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S046

S048 · implies

Before

ORIGINAL group pair(g,h)=[3, 9];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 10, 10, Yes], [3, 11, 11, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes], [10, 6, 6, Yes], [11, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S047

S049 · implies

Before

ORIGINAL group pair(g,h)=[3, 10];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 10, 10, Yes], [2, 11, 11, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes], [10, 7, 7, Yes], [11, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S048

S050 · implies

Before

ORIGINAL group pair(g,h)=[3, 11];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 10, 10, Yes], [1, 11, 11, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes], [10, 8, 8, Yes], [11, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S049

S051 · implies

Before

ORIGINAL group pair(g,h)=[4, 0];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes], [10, 10, 10, Yes], [11, 11, 11, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S050

S052 · implies

Before

ORIGINAL group pair(g,h)=[4, 1];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 10, 10, Yes], [10, 11, 11, Yes], [11, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S051

S053 · implies

Before

ORIGINAL group pair(g,h)=[4, 2];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 10, 10, Yes], [9, 11, 11, Yes], [10, 0, 0, Yes], [11, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S052

S054 · implies

Before

ORIGINAL group pair(g,h)=[4, 3];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 10, 10, Yes], [8, 11, 11, Yes], [9, 0, 0, Yes], [10, 1, 1, Yes], [11, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S053

S055 · implies

Before

ORIGINAL group pair(g,h)=[4, 4];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 10, 10, Yes], [7, 11, 11, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes], [10, 2, 2, Yes], [11, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S054

S056 · implies

Before

ORIGINAL group pair(g,h)=[4, 5];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 10, 10, Yes], [6, 11, 11, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes], [10, 3, 3, Yes], [11, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S055

S057 · implies

Before

ORIGINAL group pair(g,h)=[4, 6];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 10, 10, Yes], [5, 11, 11, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes], [10, 4, 4, Yes], [11, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S056

S058 · implies

Before

ORIGINAL group pair(g,h)=[4, 7];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 10, 10, Yes], [4, 11, 11, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes], [10, 5, 5, Yes], [11, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S057

S059 · implies

Before

ORIGINAL group pair(g,h)=[4, 8];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 10, 10, Yes], [3, 11, 11, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes], [10, 6, 6, Yes], [11, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S058

S060 · implies

Before

ORIGINAL group pair(g,h)=[4, 9];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 10, 10, Yes], [2, 11, 11, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes], [10, 7, 7, Yes], [11, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S059

S061 · implies

Before

ORIGINAL group pair(g,h)=[4, 10];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 10, 10, Yes], [1, 11, 11, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes], [10, 8, 8, Yes], [11, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S060

S062 · implies

Before

ORIGINAL group pair(g,h)=[4, 11];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 11, 11, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes], [10, 9, 9, Yes], [11, 10, 10, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S061

S063 · implies

Before

ORIGINAL group pair(g,h)=[5, 0];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 10, 10, Yes], [10, 11, 11, Yes], [11, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S062

S064 · implies

Before

ORIGINAL group pair(g,h)=[5, 1];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 10, 10, Yes], [9, 11, 11, Yes], [10, 0, 0, Yes], [11, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S063

S065 · implies

Before

ORIGINAL group pair(g,h)=[5, 2];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 10, 10, Yes], [8, 11, 11, Yes], [9, 0, 0, Yes], [10, 1, 1, Yes], [11, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S064

S066 · implies

Before

ORIGINAL group pair(g,h)=[5, 3];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 10, 10, Yes], [7, 11, 11, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes], [10, 2, 2, Yes], [11, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S065

S067 · implies

Before

ORIGINAL group pair(g,h)=[5, 4];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 10, 10, Yes], [6, 11, 11, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes], [10, 3, 3, Yes], [11, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S066

S068 · implies

Before

ORIGINAL group pair(g,h)=[5, 5];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 10, 10, Yes], [5, 11, 11, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes], [10, 4, 4, Yes], [11, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S067

S069 · implies

Before

ORIGINAL group pair(g,h)=[5, 6];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 10, 10, Yes], [4, 11, 11, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes], [10, 5, 5, Yes], [11, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S068

S070 · implies

Before

ORIGINAL group pair(g,h)=[5, 7];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 10, 10, Yes], [3, 11, 11, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes], [10, 6, 6, Yes], [11, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S069

S071 · implies

Before

ORIGINAL group pair(g,h)=[5, 8];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 10, 10, Yes], [2, 11, 11, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes], [10, 7, 7, Yes], [11, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S070

S072 · implies

Before

ORIGINAL group pair(g,h)=[5, 9];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 10, 10, Yes], [1, 11, 11, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes], [10, 8, 8, Yes], [11, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S071

S073 · implies

Before

ORIGINAL group pair(g,h)=[5, 10];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 11, 11, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes], [10, 9, 9, Yes], [11, 10, 10, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S072

S074 · implies

Before

ORIGINAL group pair(g,h)=[5, 11];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes], [10, 10, 10, Yes], [11, 11, 11, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S073

S075 · implies

Before

ORIGINAL group pair(g,h)=[6, 0];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 10, 10, Yes], [9, 11, 11, Yes], [10, 0, 0, Yes], [11, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S074

S076 · implies

Before

ORIGINAL group pair(g,h)=[6, 1];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 10, 10, Yes], [8, 11, 11, Yes], [9, 0, 0, Yes], [10, 1, 1, Yes], [11, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S075

S077 · implies

Before

ORIGINAL group pair(g,h)=[6, 2];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 10, 10, Yes], [7, 11, 11, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes], [10, 2, 2, Yes], [11, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S076

S078 · implies

Before

ORIGINAL group pair(g,h)=[6, 3];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 10, 10, Yes], [6, 11, 11, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes], [10, 3, 3, Yes], [11, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S077

S079 · implies

Before

ORIGINAL group pair(g,h)=[6, 4];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 10, 10, Yes], [5, 11, 11, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes], [10, 4, 4, Yes], [11, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S078

S080 · implies

Before

ORIGINAL group pair(g,h)=[6, 5];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 10, 10, Yes], [4, 11, 11, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes], [10, 5, 5, Yes], [11, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S079

S081 · implies

Before

ORIGINAL group pair(g,h)=[6, 6];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 10, 10, Yes], [3, 11, 11, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes], [10, 6, 6, Yes], [11, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S080

S082 · implies

Before

ORIGINAL group pair(g,h)=[6, 7];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 10, 10, Yes], [2, 11, 11, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes], [10, 7, 7, Yes], [11, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S081

S083 · implies

Before

ORIGINAL group pair(g,h)=[6, 8];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 10, 10, Yes], [1, 11, 11, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes], [10, 8, 8, Yes], [11, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S082

S084 · implies

Before

ORIGINAL group pair(g,h)=[6, 9];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 11, 11, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes], [10, 9, 9, Yes], [11, 10, 10, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S083

S085 · implies

Before

ORIGINAL group pair(g,h)=[6, 10];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes], [10, 10, 10, Yes], [11, 11, 11, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S084

S086 · implies

Before

ORIGINAL group pair(g,h)=[6, 11];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 10, 10, Yes], [10, 11, 11, Yes], [11, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S085

S087 · implies

Before

ORIGINAL group pair(g,h)=[7, 0];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 10, 10, Yes], [8, 11, 11, Yes], [9, 0, 0, Yes], [10, 1, 1, Yes], [11, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S086

S088 · implies

Before

ORIGINAL group pair(g,h)=[7, 1];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 10, 10, Yes], [7, 11, 11, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes], [10, 2, 2, Yes], [11, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S087

S089 · implies

Before

ORIGINAL group pair(g,h)=[7, 2];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 10, 10, Yes], [6, 11, 11, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes], [10, 3, 3, Yes], [11, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S088

S090 · implies

Before

ORIGINAL group pair(g,h)=[7, 3];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 10, 10, Yes], [5, 11, 11, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes], [10, 4, 4, Yes], [11, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S089

S091 · implies

Before

ORIGINAL group pair(g,h)=[7, 4];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 10, 10, Yes], [4, 11, 11, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes], [10, 5, 5, Yes], [11, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S090

S092 · implies

Before

ORIGINAL group pair(g,h)=[7, 5];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 10, 10, Yes], [3, 11, 11, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes], [10, 6, 6, Yes], [11, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S091

S093 · implies

Before

ORIGINAL group pair(g,h)=[7, 6];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 10, 10, Yes], [2, 11, 11, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes], [10, 7, 7, Yes], [11, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S092

S094 · implies

Before

ORIGINAL group pair(g,h)=[7, 7];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 10, 10, Yes], [1, 11, 11, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes], [10, 8, 8, Yes], [11, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S093

S095 · implies

Before

ORIGINAL group pair(g,h)=[7, 8];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 11, 11, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes], [10, 9, 9, Yes], [11, 10, 10, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S094

S096 · implies

Before

ORIGINAL group pair(g,h)=[7, 9];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes], [10, 10, 10, Yes], [11, 11, 11, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S095

S097 · implies

Before

ORIGINAL group pair(g,h)=[7, 10];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 10, 10, Yes], [10, 11, 11, Yes], [11, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S096

S098 · implies

Before

ORIGINAL group pair(g,h)=[7, 11];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 10, 10, Yes], [9, 11, 11, Yes], [10, 0, 0, Yes], [11, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S097

S099 · implies

Before

ORIGINAL group pair(g,h)=[8, 0];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 10, 10, Yes], [7, 11, 11, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes], [10, 2, 2, Yes], [11, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S098

S100 · implies

Before

ORIGINAL group pair(g,h)=[8, 1];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 10, 10, Yes], [6, 11, 11, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes], [10, 3, 3, Yes], [11, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S099

S101 · implies

Before

ORIGINAL group pair(g,h)=[8, 2];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 10, 10, Yes], [5, 11, 11, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes], [10, 4, 4, Yes], [11, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S100

S102 · implies

Before

ORIGINAL group pair(g,h)=[8, 3];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 10, 10, Yes], [4, 11, 11, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes], [10, 5, 5, Yes], [11, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S101

S103 · implies

Before

ORIGINAL group pair(g,h)=[8, 4];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 10, 10, Yes], [3, 11, 11, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes], [10, 6, 6, Yes], [11, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S102

S104 · implies

Before

ORIGINAL group pair(g,h)=[8, 5];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 10, 10, Yes], [2, 11, 11, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes], [10, 7, 7, Yes], [11, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S103

S105 · implies

Before

ORIGINAL group pair(g,h)=[8, 6];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 10, 10, Yes], [1, 11, 11, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes], [10, 8, 8, Yes], [11, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S104

S106 · implies

Before

ORIGINAL group pair(g,h)=[8, 7];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 11, 11, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes], [10, 9, 9, Yes], [11, 10, 10, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S105

S107 · implies

Before

ORIGINAL group pair(g,h)=[8, 8];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes], [10, 10, 10, Yes], [11, 11, 11, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S106

S108 · implies

Before

ORIGINAL group pair(g,h)=[8, 9];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 10, 10, Yes], [10, 11, 11, Yes], [11, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S107

S109 · implies

Before

ORIGINAL group pair(g,h)=[8, 10];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 10, 10, Yes], [9, 11, 11, Yes], [10, 0, 0, Yes], [11, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S108

S110 · implies

Before

ORIGINAL group pair(g,h)=[8, 11];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 10, 10, Yes], [8, 11, 11, Yes], [9, 0, 0, Yes], [10, 1, 1, Yes], [11, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S109

S111 · implies

Before

ORIGINAL group pair(g,h)=[9, 0];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 10, 10, Yes], [6, 11, 11, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes], [10, 3, 3, Yes], [11, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S110

S112 · implies

Before

ORIGINAL group pair(g,h)=[9, 1];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 10, 10, Yes], [5, 11, 11, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes], [10, 4, 4, Yes], [11, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S111

S113 · implies

Before

ORIGINAL group pair(g,h)=[9, 2];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 10, 10, Yes], [4, 11, 11, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes], [10, 5, 5, Yes], [11, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S112

S114 · implies

Before

ORIGINAL group pair(g,h)=[9, 3];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 10, 10, Yes], [3, 11, 11, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes], [10, 6, 6, Yes], [11, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S113

S115 · implies

Before

ORIGINAL group pair(g,h)=[9, 4];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 10, 10, Yes], [2, 11, 11, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes], [10, 7, 7, Yes], [11, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S114

S116 · implies

Before

ORIGINAL group pair(g,h)=[9, 5];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 10, 10, Yes], [1, 11, 11, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes], [10, 8, 8, Yes], [11, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S115

S117 · implies

Before

ORIGINAL group pair(g,h)=[9, 6];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 11, 11, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes], [10, 9, 9, Yes], [11, 10, 10, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S116

S118 · implies

Before

ORIGINAL group pair(g,h)=[9, 7];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes], [10, 10, 10, Yes], [11, 11, 11, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S117

S119 · implies

Before

ORIGINAL group pair(g,h)=[9, 8];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 10, 10, Yes], [10, 11, 11, Yes], [11, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S118

S120 · implies

Before

ORIGINAL group pair(g,h)=[9, 9];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 10, 10, Yes], [9, 11, 11, Yes], [10, 0, 0, Yes], [11, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S119

S121 · implies

Before

ORIGINAL group pair(g,h)=[9, 10];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 10, 10, Yes], [8, 11, 11, Yes], [9, 0, 0, Yes], [10, 1, 1, Yes], [11, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S120

S122 · implies

Before

ORIGINAL group pair(g,h)=[9, 11];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 10, 10, Yes], [7, 11, 11, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes], [10, 2, 2, Yes], [11, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S121

S123 · implies

Before

ORIGINAL group pair(g,h)=[10, 0];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 10, 10, Yes], [5, 11, 11, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes], [10, 4, 4, Yes], [11, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S122

S124 · implies

Before

ORIGINAL group pair(g,h)=[10, 1];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 10, 10, Yes], [4, 11, 11, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes], [10, 5, 5, Yes], [11, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S123

S125 · implies

Before

ORIGINAL group pair(g,h)=[10, 2];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 10, 10, Yes], [3, 11, 11, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes], [10, 6, 6, Yes], [11, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S124

S126 · implies

Before

ORIGINAL group pair(g,h)=[10, 3];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 10, 10, Yes], [2, 11, 11, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes], [10, 7, 7, Yes], [11, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S125

S127 · implies

Before

ORIGINAL group pair(g,h)=[10, 4];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 10, 10, Yes], [1, 11, 11, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes], [10, 8, 8, Yes], [11, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S126

S128 · implies

Before

ORIGINAL group pair(g,h)=[10, 5];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 11, 11, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes], [10, 9, 9, Yes], [11, 10, 10, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S127

S129 · implies

Before

ORIGINAL group pair(g,h)=[10, 6];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes], [10, 10, 10, Yes], [11, 11, 11, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S128

S130 · implies

Before

ORIGINAL group pair(g,h)=[10, 7];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 10, 10, Yes], [10, 11, 11, Yes], [11, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S129

S131 · implies

Before

ORIGINAL group pair(g,h)=[10, 8];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 10, 10, Yes], [9, 11, 11, Yes], [10, 0, 0, Yes], [11, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S130

S132 · implies

Before

ORIGINAL group pair(g,h)=[10, 9];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 10, 10, Yes], [8, 11, 11, Yes], [9, 0, 0, Yes], [10, 1, 1, Yes], [11, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S131

S133 · implies

Before

ORIGINAL group pair(g,h)=[10, 10];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 10, 10, Yes], [7, 11, 11, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes], [10, 2, 2, Yes], [11, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S132

S134 · implies

Before

ORIGINAL group pair(g,h)=[10, 11];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 10, 10, Yes], [6, 11, 11, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes], [10, 3, 3, Yes], [11, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S133

S135 · implies

Before

ORIGINAL group pair(g,h)=[11, 0];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 10, 10, Yes], [4, 11, 11, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes], [10, 5, 5, Yes], [11, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S134

S136 · implies

Before

ORIGINAL group pair(g,h)=[11, 1];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 10, 10, Yes], [3, 11, 11, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes], [10, 6, 6, Yes], [11, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S135

S137 · implies

Before

ORIGINAL group pair(g,h)=[11, 2];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 10, 10, Yes], [2, 11, 11, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes], [10, 7, 7, Yes], [11, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S136

S138 · implies

Before

ORIGINAL group pair(g,h)=[11, 3];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 10, 10, Yes], [1, 11, 11, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes], [10, 8, 8, Yes], [11, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S137

S139 · implies

Before

ORIGINAL group pair(g,h)=[11, 4];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 11, 11, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes], [10, 9, 9, Yes], [11, 10, 10, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S138

S140 · implies

Before

ORIGINAL group pair(g,h)=[11, 5];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes], [10, 10, 10, Yes], [11, 11, 11, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S139

S141 · implies

Before

ORIGINAL group pair(g,h)=[11, 6];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 10, 10, Yes], [10, 11, 11, Yes], [11, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S140

S142 · implies

Before

ORIGINAL group pair(g,h)=[11, 7];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 10, 10, Yes], [9, 11, 11, Yes], [10, 0, 0, Yes], [11, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S141

S143 · implies

Before

ORIGINAL group pair(g,h)=[11, 8];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 10, 10, Yes], [8, 11, 11, Yes], [9, 0, 0, Yes], [10, 1, 1, Yes], [11, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S142

S144 · implies

Before

ORIGINAL group pair(g,h)=[11, 9];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 10, 10, Yes], [7, 11, 11, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes], [10, 2, 2, Yes], [11, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S143

S145 · implies

Before

ORIGINAL group pair(g,h)=[11, 10];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 10, 10, Yes], [6, 11, 11, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes], [10, 3, 3, Yes], [11, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S144

S146 · implies

Before

ORIGINAL group pair(g,h)=[11, 11];check ALL k in Fin(12)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 10, 10, Yes], [5, 11, 11, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes], [10, 4, 4, Yes], [11, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S145

S147 · implies

Before

ORIGINAL group element g=0;DECLARED identity=2;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 10, 10, No], [1, 11, 11, No], [2, 0, 0, No], [3, 1, 1, No], [4, 2, 2, Yes], [5, 3, 3, No], [6, 4, 4, No], [7, 5, 5, No], [8, 6, 6, No], [9, 7, 7, No], [10, 8, 8, No], [11, 9, 9, No]]

After

first actual two-sided inverse witness=4;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S146

S148 · implies

Before

ORIGINAL group element g=1;DECLARED identity=2;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 11, 11, No], [1, 0, 0, No], [2, 1, 1, No], [3, 2, 2, Yes], [4, 3, 3, No], [5, 4, 4, No], [6, 5, 5, No], [7, 6, 6, No], [8, 7, 7, No], [9, 8, 8, No], [10, 9, 9, No], [11, 10, 10, No]]

After

first actual two-sided inverse witness=3;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S147

S149 · implies

Before

ORIGINAL group element g=2;DECLARED identity=2;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 0, 0, No], [1, 1, 1, No], [2, 2, 2, Yes], [3, 3, 3, No], [4, 4, 4, No], [5, 5, 5, No], [6, 6, 6, No], [7, 7, 7, No], [8, 8, 8, No], [9, 9, 9, No], [10, 10, 10, No], [11, 11, 11, No]]

After

first actual two-sided inverse witness=2;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S148

S150 · implies

Before

ORIGINAL group element g=3;DECLARED identity=2;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 1, 1, No], [1, 2, 2, Yes], [2, 3, 3, No], [3, 4, 4, No], [4, 5, 5, No], [5, 6, 6, No], [6, 7, 7, No], [7, 8, 8, No], [8, 9, 9, No], [9, 10, 10, No], [10, 11, 11, No], [11, 0, 0, No]]

After

first actual two-sided inverse witness=1;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S149

S151 · implies

Before

ORIGINAL group element g=4;DECLARED identity=2;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 2, 2, Yes], [1, 3, 3, No], [2, 4, 4, No], [3, 5, 5, No], [4, 6, 6, No], [5, 7, 7, No], [6, 8, 8, No], [7, 9, 9, No], [8, 10, 10, No], [9, 11, 11, No], [10, 0, 0, No], [11, 1, 1, No]]

After

first actual two-sided inverse witness=0;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S150

S152 · implies

Before

ORIGINAL group element g=5;DECLARED identity=2;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 3, 3, No], [1, 4, 4, No], [2, 5, 5, No], [3, 6, 6, No], [4, 7, 7, No], [5, 8, 8, No], [6, 9, 9, No], [7, 10, 10, No], [8, 11, 11, No], [9, 0, 0, No], [10, 1, 1, No], [11, 2, 2, Yes]]

After

first actual two-sided inverse witness=11;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S151

S153 · implies

Before

ORIGINAL group element g=6;DECLARED identity=2;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 4, 4, No], [1, 5, 5, No], [2, 6, 6, No], [3, 7, 7, No], [4, 8, 8, No], [5, 9, 9, No], [6, 10, 10, No], [7, 11, 11, No], [8, 0, 0, No], [9, 1, 1, No], [10, 2, 2, Yes], [11, 3, 3, No]]

After

first actual two-sided inverse witness=10;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S152

S154 · implies

Before

ORIGINAL group element g=7;DECLARED identity=2;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 5, 5, No], [1, 6, 6, No], [2, 7, 7, No], [3, 8, 8, No], [4, 9, 9, No], [5, 10, 10, No], [6, 11, 11, No], [7, 0, 0, No], [8, 1, 1, No], [9, 2, 2, Yes], [10, 3, 3, No], [11, 4, 4, No]]

After

first actual two-sided inverse witness=9;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S153

S155 · implies

Before

ORIGINAL group element g=8;DECLARED identity=2;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 6, 6, No], [1, 7, 7, No], [2, 8, 8, No], [3, 9, 9, No], [4, 10, 10, No], [5, 11, 11, No], [6, 0, 0, No], [7, 1, 1, No], [8, 2, 2, Yes], [9, 3, 3, No], [10, 4, 4, No], [11, 5, 5, No]]

After

first actual two-sided inverse witness=8;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S154

S156 · implies

Before

ORIGINAL group element g=9;DECLARED identity=2;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 7, 7, No], [1, 8, 8, No], [2, 9, 9, No], [3, 10, 10, No], [4, 11, 11, No], [5, 0, 0, No], [6, 1, 1, No], [7, 2, 2, Yes], [8, 3, 3, No], [9, 4, 4, No], [10, 5, 5, No], [11, 6, 6, No]]

After

first actual two-sided inverse witness=7;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S155

S157 · implies

Before

ORIGINAL group element g=10;DECLARED identity=2;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 8, 8, No], [1, 9, 9, No], [2, 10, 10, No], [3, 11, 11, No], [4, 0, 0, No], [5, 1, 1, No], [6, 2, 2, Yes], [7, 3, 3, No], [8, 4, 4, No], [9, 5, 5, No], [10, 6, 6, No], [11, 7, 7, No]]

After

first actual two-sided inverse witness=6;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S156

S158 · implies

Before

ORIGINAL group element g=11;DECLARED identity=2;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 9, 9, No], [1, 10, 10, No], [2, 11, 11, No], [3, 0, 0, No], [4, 1, 1, No], [5, 2, 2, Yes], [6, 3, 3, No], [7, 4, 4, No], [8, 5, 5, No], [9, 6, 6, No], [10, 7, 7, No], [11, 8, 8, No]]

After

first actual two-sided inverse witness=5;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S157

S159 · implies

Before

structurally closed COMPLETE group candidate;two-sided identity=Yes;ALL-triple associativity=Yes;ALL-element inverses=Yes

After

group_valid=Yes is the CONJUNCTION;False remains a reported candidate result,not a silent repair

Conditions: none

Group qualification is the conjunction of these complete obligations.A permutation-looking action table cannot repair a bad group table;do not replace the identity or modify the table.

Step identifiers and dependencies

Rule: groupaction_group_axiom_conjunction_candidate_may_fail · Uses: G001, S158

S160 · implies

Before

CURRENT ORIGINAL complete Cayley table=[[10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9], [11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10], [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0], [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1], [3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2], [4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3], [5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4], [6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5], [7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6], [8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7], [9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8]];actual identity=2;order=12

After

ALL group axioms qualified;actual inverse list=[4, 3, 2, 1, 0, 11, 10, 9, 8, 7, 6, 5];no point carrier or group-action assumption is used

Conditions: none

Certify closure,identity,associativity and two-sided inverses in the group table itself.Do not import an old8-element action-table limit or assume cyclicity/commutativity.The frozen pure helper receives only this question's table and trace.

Step identifiers and dependencies

Rule: group_CURRENT_complete_certified_Cayley_NOT_action_wrapper · Uses: G001, S159

S161 · implies

Before

Cauchy ORIGINAL element0:ORIGINAL element=0;positive exponent=1;previous power=2;right multiply ORIGINAL g via table

After

g^1=0;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S160

S162 · implies

Before

Cauchy ORIGINAL element0:ORIGINAL element=0;positive exponent=2;previous power=0;right multiply ORIGINAL g via table

After

g^2=10;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S161

S163 · implies

Before

Cauchy ORIGINAL element0:ORIGINAL element=0;positive exponent=3;previous power=10;right multiply ORIGINAL g via table

After

g^3=8;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S162

S164 · implies

Before

Cauchy ORIGINAL element0:ORIGINAL element=0;positive exponent=4;previous power=8;right multiply ORIGINAL g via table

After

g^4=6;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S163

S165 · implies

Before

Cauchy ORIGINAL element0:ORIGINAL element=0;positive exponent=5;previous power=6;right multiply ORIGINAL g via table

After

g^5=4;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S164

S166 · implies

Before

Cauchy ORIGINAL element0:ORIGINAL element=0;positive exponent=6;previous power=4;right multiply ORIGINAL g via table

After

g^6=2;identity=2;is_identity=Yes;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S165

S167 · implies

Before

Cauchy ORIGINAL element0:CURRENT certified group order=12,element=0;ALL powers through first return=[[1, 0], [2, 10], [3, 8], [4, 6], [5, 4], [6, 2]]

After

exact positive order=6;cyclic powers before repetition form a subgroup of this size;its equal-size left cosets partition G,so this order divides group order

Conditions: none

Among e,g,...,g^|G|,a repetition cancels to a positive return at most|G|.Powers before the minimal return are distinct and close under multiplication/inverse modulo that order.Their left cosets prove divisibility;one power equation alone does not.

Step identifiers and dependencies

Rule: cauchy_finite_order_exists_and_cyclic_subgroup_divisibility · Uses: G001, S166

S168 · implies

Before

Cauchy ORIGINAL element1:ORIGINAL element=1;positive exponent=1;previous power=2;right multiply ORIGINAL g via table

After

g^1=1;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S167

S169 · implies

Before

Cauchy ORIGINAL element1:ORIGINAL element=1;positive exponent=2;previous power=1;right multiply ORIGINAL g via table

After

g^2=0;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S168

S170 · implies

Before

Cauchy ORIGINAL element1:ORIGINAL element=1;positive exponent=3;previous power=0;right multiply ORIGINAL g via table

After

g^3=11;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S169

S171 · implies

Before

Cauchy ORIGINAL element1:ORIGINAL element=1;positive exponent=4;previous power=11;right multiply ORIGINAL g via table

After

g^4=10;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S170

S172 · implies

Before

Cauchy ORIGINAL element1:ORIGINAL element=1;positive exponent=5;previous power=10;right multiply ORIGINAL g via table

After

g^5=9;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S171

S173 · implies

Before

Cauchy ORIGINAL element1:ORIGINAL element=1;positive exponent=6;previous power=9;right multiply ORIGINAL g via table

After

g^6=8;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S172

S174 · implies

Before

Cauchy ORIGINAL element1:ORIGINAL element=1;positive exponent=7;previous power=8;right multiply ORIGINAL g via table

After

g^7=7;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S173

S175 · implies

Before

Cauchy ORIGINAL element1:ORIGINAL element=1;positive exponent=8;previous power=7;right multiply ORIGINAL g via table

After

g^8=6;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S174

S176 · implies

Before

Cauchy ORIGINAL element1:ORIGINAL element=1;positive exponent=9;previous power=6;right multiply ORIGINAL g via table

After

g^9=5;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S175

S177 · implies

Before

Cauchy ORIGINAL element1:ORIGINAL element=1;positive exponent=10;previous power=5;right multiply ORIGINAL g via table

After

g^10=4;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S176

S178 · implies

Before

Cauchy ORIGINAL element1:ORIGINAL element=1;positive exponent=11;previous power=4;right multiply ORIGINAL g via table

After

g^11=3;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S177

S179 · implies

Before

Cauchy ORIGINAL element1:ORIGINAL element=1;positive exponent=12;previous power=3;right multiply ORIGINAL g via table

After

g^12=2;identity=2;is_identity=Yes;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S178

S180 · implies

Before

Cauchy ORIGINAL element1:CURRENT certified group order=12,element=1;ALL powers through first return=[[1, 1], [2, 0], [3, 11], [4, 10], [5, 9], [6, 8], [7, 7], [8, 6], [9, 5], [10, 4], [11, 3], [12, 2]]

After

exact positive order=12;cyclic powers before repetition form a subgroup of this size;its equal-size left cosets partition G,so this order divides group order

Conditions: none

Among e,g,...,g^|G|,a repetition cancels to a positive return at most|G|.Powers before the minimal return are distinct and close under multiplication/inverse modulo that order.Their left cosets prove divisibility;one power equation alone does not.

Step identifiers and dependencies

Rule: cauchy_finite_order_exists_and_cyclic_subgroup_divisibility · Uses: G001, S179

S181 · implies

Before

Cauchy ORIGINAL element2:ORIGINAL element=2;positive exponent=1;previous power=2;right multiply ORIGINAL g via table

After

g^1=2;identity=2;is_identity=Yes;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S180

S182 · implies

Before

Cauchy ORIGINAL element2:CURRENT certified group order=12,element=2;ALL powers through first return=[[1, 2]]

After

exact positive order=1;cyclic powers before repetition form a subgroup of this size;its equal-size left cosets partition G,so this order divides group order

Conditions: none

Among e,g,...,g^|G|,a repetition cancels to a positive return at most|G|.Powers before the minimal return are distinct and close under multiplication/inverse modulo that order.Their left cosets prove divisibility;one power equation alone does not.

Step identifiers and dependencies

Rule: cauchy_finite_order_exists_and_cyclic_subgroup_divisibility · Uses: G001, S181

S183 · implies

Before

Cauchy ORIGINAL element3:ORIGINAL element=3;positive exponent=1;previous power=2;right multiply ORIGINAL g via table

After

g^1=3;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S182

S184 · implies

Before

Cauchy ORIGINAL element3:ORIGINAL element=3;positive exponent=2;previous power=3;right multiply ORIGINAL g via table

After

g^2=4;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S183

S185 · implies

Before

Cauchy ORIGINAL element3:ORIGINAL element=3;positive exponent=3;previous power=4;right multiply ORIGINAL g via table

After

g^3=5;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S184

S186 · implies

Before

Cauchy ORIGINAL element3:ORIGINAL element=3;positive exponent=4;previous power=5;right multiply ORIGINAL g via table

After

g^4=6;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S185

S187 · implies

Before

Cauchy ORIGINAL element3:ORIGINAL element=3;positive exponent=5;previous power=6;right multiply ORIGINAL g via table

After

g^5=7;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S186

S188 · implies

Before

Cauchy ORIGINAL element3:ORIGINAL element=3;positive exponent=6;previous power=7;right multiply ORIGINAL g via table

After

g^6=8;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S187

S189 · implies

Before

Cauchy ORIGINAL element3:ORIGINAL element=3;positive exponent=7;previous power=8;right multiply ORIGINAL g via table

After

g^7=9;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S188

S190 · implies

Before

Cauchy ORIGINAL element3:ORIGINAL element=3;positive exponent=8;previous power=9;right multiply ORIGINAL g via table

After

g^8=10;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S189

S191 · implies

Before

Cauchy ORIGINAL element3:ORIGINAL element=3;positive exponent=9;previous power=10;right multiply ORIGINAL g via table

After

g^9=11;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S190

S192 · implies

Before

Cauchy ORIGINAL element3:ORIGINAL element=3;positive exponent=10;previous power=11;right multiply ORIGINAL g via table

After

g^10=0;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S191

S193 · implies

Before

Cauchy ORIGINAL element3:ORIGINAL element=3;positive exponent=11;previous power=0;right multiply ORIGINAL g via table

After

g^11=1;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S192

S194 · implies

Before

Cauchy ORIGINAL element3:ORIGINAL element=3;positive exponent=12;previous power=1;right multiply ORIGINAL g via table

After

g^12=2;identity=2;is_identity=Yes;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S193

S195 · implies

Before

Cauchy ORIGINAL element3:CURRENT certified group order=12,element=3;ALL powers through first return=[[1, 3], [2, 4], [3, 5], [4, 6], [5, 7], [6, 8], [7, 9], [8, 10], [9, 11], [10, 0], [11, 1], [12, 2]]

After

exact positive order=12;cyclic powers before repetition form a subgroup of this size;its equal-size left cosets partition G,so this order divides group order

Conditions: none

Among e,g,...,g^|G|,a repetition cancels to a positive return at most|G|.Powers before the minimal return are distinct and close under multiplication/inverse modulo that order.Their left cosets prove divisibility;one power equation alone does not.

Step identifiers and dependencies

Rule: cauchy_finite_order_exists_and_cyclic_subgroup_divisibility · Uses: G001, S194

S196 · implies

Before

Cauchy ORIGINAL element4:ORIGINAL element=4;positive exponent=1;previous power=2;right multiply ORIGINAL g via table

After

g^1=4;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S195

S197 · implies

Before

Cauchy ORIGINAL element4:ORIGINAL element=4;positive exponent=2;previous power=4;right multiply ORIGINAL g via table

After

g^2=6;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S196

S198 · implies

Before

Cauchy ORIGINAL element4:ORIGINAL element=4;positive exponent=3;previous power=6;right multiply ORIGINAL g via table

After

g^3=8;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S197

S199 · implies

Before

Cauchy ORIGINAL element4:ORIGINAL element=4;positive exponent=4;previous power=8;right multiply ORIGINAL g via table

After

g^4=10;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S198

S200 · implies

Before

Cauchy ORIGINAL element4:ORIGINAL element=4;positive exponent=5;previous power=10;right multiply ORIGINAL g via table

After

g^5=0;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S199

S201 · implies

Before

Cauchy ORIGINAL element4:ORIGINAL element=4;positive exponent=6;previous power=0;right multiply ORIGINAL g via table

After

g^6=2;identity=2;is_identity=Yes;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S200

S202 · implies

Before

Cauchy ORIGINAL element4:CURRENT certified group order=12,element=4;ALL powers through first return=[[1, 4], [2, 6], [3, 8], [4, 10], [5, 0], [6, 2]]

After

exact positive order=6;cyclic powers before repetition form a subgroup of this size;its equal-size left cosets partition G,so this order divides group order

Conditions: none

Among e,g,...,g^|G|,a repetition cancels to a positive return at most|G|.Powers before the minimal return are distinct and close under multiplication/inverse modulo that order.Their left cosets prove divisibility;one power equation alone does not.

Step identifiers and dependencies

Rule: cauchy_finite_order_exists_and_cyclic_subgroup_divisibility · Uses: G001, S201

S203 · implies

Before

Cauchy ORIGINAL element5:ORIGINAL element=5;positive exponent=1;previous power=2;right multiply ORIGINAL g via table

After

g^1=5;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S202

S204 · implies

Before

Cauchy ORIGINAL element5:ORIGINAL element=5;positive exponent=2;previous power=5;right multiply ORIGINAL g via table

After

g^2=8;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S203

S205 · implies

Before

Cauchy ORIGINAL element5:ORIGINAL element=5;positive exponent=3;previous power=8;right multiply ORIGINAL g via table

After

g^3=11;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S204

S206 · implies

Before

Cauchy ORIGINAL element5:ORIGINAL element=5;positive exponent=4;previous power=11;right multiply ORIGINAL g via table

After

g^4=2;identity=2;is_identity=Yes;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S205

S207 · implies

Before

Cauchy ORIGINAL element5:CURRENT certified group order=12,element=5;ALL powers through first return=[[1, 5], [2, 8], [3, 11], [4, 2]]

After

exact positive order=4;cyclic powers before repetition form a subgroup of this size;its equal-size left cosets partition G,so this order divides group order

Conditions: none

Among e,g,...,g^|G|,a repetition cancels to a positive return at most|G|.Powers before the minimal return are distinct and close under multiplication/inverse modulo that order.Their left cosets prove divisibility;one power equation alone does not.

Step identifiers and dependencies

Rule: cauchy_finite_order_exists_and_cyclic_subgroup_divisibility · Uses: G001, S206

S208 · implies

Before

Cauchy ORIGINAL element6:ORIGINAL element=6;positive exponent=1;previous power=2;right multiply ORIGINAL g via table

After

g^1=6;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S207

S209 · implies

Before

Cauchy ORIGINAL element6:ORIGINAL element=6;positive exponent=2;previous power=6;right multiply ORIGINAL g via table

After

g^2=10;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S208

S210 · implies

Before

Cauchy ORIGINAL element6:ORIGINAL element=6;positive exponent=3;previous power=10;right multiply ORIGINAL g via table

After

g^3=2;identity=2;is_identity=Yes;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S209

S211 · implies

Before

Cauchy ORIGINAL element6:CURRENT certified group order=12,element=6;ALL powers through first return=[[1, 6], [2, 10], [3, 2]]

After

exact positive order=3;cyclic powers before repetition form a subgroup of this size;its equal-size left cosets partition G,so this order divides group order

Conditions: none

Among e,g,...,g^|G|,a repetition cancels to a positive return at most|G|.Powers before the minimal return are distinct and close under multiplication/inverse modulo that order.Their left cosets prove divisibility;one power equation alone does not.

Step identifiers and dependencies

Rule: cauchy_finite_order_exists_and_cyclic_subgroup_divisibility · Uses: G001, S210

S212 · implies

Before

Cauchy ORIGINAL element7:ORIGINAL element=7;positive exponent=1;previous power=2;right multiply ORIGINAL g via table

After

g^1=7;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S211

S213 · implies

Before

Cauchy ORIGINAL element7:ORIGINAL element=7;positive exponent=2;previous power=7;right multiply ORIGINAL g via table

After

g^2=0;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S212

S214 · implies

Before

Cauchy ORIGINAL element7:ORIGINAL element=7;positive exponent=3;previous power=0;right multiply ORIGINAL g via table

After

g^3=5;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S213

S215 · implies

Before

Cauchy ORIGINAL element7:ORIGINAL element=7;positive exponent=4;previous power=5;right multiply ORIGINAL g via table

After

g^4=10;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S214

S216 · implies

Before

Cauchy ORIGINAL element7:ORIGINAL element=7;positive exponent=5;previous power=10;right multiply ORIGINAL g via table

After

g^5=3;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S215

S217 · implies

Before

Cauchy ORIGINAL element7:ORIGINAL element=7;positive exponent=6;previous power=3;right multiply ORIGINAL g via table

After

g^6=8;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S216

S218 · implies

Before

Cauchy ORIGINAL element7:ORIGINAL element=7;positive exponent=7;previous power=8;right multiply ORIGINAL g via table

After

g^7=1;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S217

S219 · implies

Before

Cauchy ORIGINAL element7:ORIGINAL element=7;positive exponent=8;previous power=1;right multiply ORIGINAL g via table

After

g^8=6;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S218

S220 · implies

Before

Cauchy ORIGINAL element7:ORIGINAL element=7;positive exponent=9;previous power=6;right multiply ORIGINAL g via table

After

g^9=11;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S219

S221 · implies

Before

Cauchy ORIGINAL element7:ORIGINAL element=7;positive exponent=10;previous power=11;right multiply ORIGINAL g via table

After

g^10=4;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S220

S222 · implies

Before

Cauchy ORIGINAL element7:ORIGINAL element=7;positive exponent=11;previous power=4;right multiply ORIGINAL g via table

After

g^11=9;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S221

S223 · implies

Before

Cauchy ORIGINAL element7:ORIGINAL element=7;positive exponent=12;previous power=9;right multiply ORIGINAL g via table

After

g^12=2;identity=2;is_identity=Yes;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S222

S224 · implies

Before

Cauchy ORIGINAL element7:CURRENT certified group order=12,element=7;ALL powers through first return=[[1, 7], [2, 0], [3, 5], [4, 10], [5, 3], [6, 8], [7, 1], [8, 6], [9, 11], [10, 4], [11, 9], [12, 2]]

After

exact positive order=12;cyclic powers before repetition form a subgroup of this size;its equal-size left cosets partition G,so this order divides group order

Conditions: none

Among e,g,...,g^|G|,a repetition cancels to a positive return at most|G|.Powers before the minimal return are distinct and close under multiplication/inverse modulo that order.Their left cosets prove divisibility;one power equation alone does not.

Step identifiers and dependencies

Rule: cauchy_finite_order_exists_and_cyclic_subgroup_divisibility · Uses: G001, S223

S225 · implies

Before

Cauchy ORIGINAL element8:ORIGINAL element=8;positive exponent=1;previous power=2;right multiply ORIGINAL g via table

After

g^1=8;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S224

S226 · implies

Before

Cauchy ORIGINAL element8:ORIGINAL element=8;positive exponent=2;previous power=8;right multiply ORIGINAL g via table

After

g^2=2;identity=2;is_identity=Yes;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S225

S227 · implies

Before

Cauchy ORIGINAL element8:CURRENT certified group order=12,element=8;ALL powers through first return=[[1, 8], [2, 2]]

After

exact positive order=2;cyclic powers before repetition form a subgroup of this size;its equal-size left cosets partition G,so this order divides group order

Conditions: none

Among e,g,...,g^|G|,a repetition cancels to a positive return at most|G|.Powers before the minimal return are distinct and close under multiplication/inverse modulo that order.Their left cosets prove divisibility;one power equation alone does not.

Step identifiers and dependencies

Rule: cauchy_finite_order_exists_and_cyclic_subgroup_divisibility · Uses: G001, S226

S228 · implies

Before

Cauchy ORIGINAL element9:ORIGINAL element=9;positive exponent=1;previous power=2;right multiply ORIGINAL g via table

After

g^1=9;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S227

S229 · implies

Before

Cauchy ORIGINAL element9:ORIGINAL element=9;positive exponent=2;previous power=9;right multiply ORIGINAL g via table

After

g^2=4;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S228

S230 · implies

Before

Cauchy ORIGINAL element9:ORIGINAL element=9;positive exponent=3;previous power=4;right multiply ORIGINAL g via table

After

g^3=11;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S229

S231 · implies

Before

Cauchy ORIGINAL element9:ORIGINAL element=9;positive exponent=4;previous power=11;right multiply ORIGINAL g via table

After

g^4=6;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S230

S232 · implies

Before

Cauchy ORIGINAL element9:ORIGINAL element=9;positive exponent=5;previous power=6;right multiply ORIGINAL g via table

After

g^5=1;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S231

S233 · implies

Before

Cauchy ORIGINAL element9:ORIGINAL element=9;positive exponent=6;previous power=1;right multiply ORIGINAL g via table

After

g^6=8;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S232

S234 · implies

Before

Cauchy ORIGINAL element9:ORIGINAL element=9;positive exponent=7;previous power=8;right multiply ORIGINAL g via table

After

g^7=3;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S233

S235 · implies

Before

Cauchy ORIGINAL element9:ORIGINAL element=9;positive exponent=8;previous power=3;right multiply ORIGINAL g via table

After

g^8=10;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S234

S236 · implies

Before

Cauchy ORIGINAL element9:ORIGINAL element=9;positive exponent=9;previous power=10;right multiply ORIGINAL g via table

After

g^9=5;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S235

S237 · implies

Before

Cauchy ORIGINAL element9:ORIGINAL element=9;positive exponent=10;previous power=5;right multiply ORIGINAL g via table

After

g^10=0;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S236

S238 · implies

Before

Cauchy ORIGINAL element9:ORIGINAL element=9;positive exponent=11;previous power=0;right multiply ORIGINAL g via table

After

g^11=7;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S237

S239 · implies

Before

Cauchy ORIGINAL element9:ORIGINAL element=9;positive exponent=12;previous power=7;right multiply ORIGINAL g via table

After

g^12=2;identity=2;is_identity=Yes;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S238

S240 · implies

Before

Cauchy ORIGINAL element9:CURRENT certified group order=12,element=9;ALL powers through first return=[[1, 9], [2, 4], [3, 11], [4, 6], [5, 1], [6, 8], [7, 3], [8, 10], [9, 5], [10, 0], [11, 7], [12, 2]]

After

exact positive order=12;cyclic powers before repetition form a subgroup of this size;its equal-size left cosets partition G,so this order divides group order

Conditions: none

Among e,g,...,g^|G|,a repetition cancels to a positive return at most|G|.Powers before the minimal return are distinct and close under multiplication/inverse modulo that order.Their left cosets prove divisibility;one power equation alone does not.

Step identifiers and dependencies

Rule: cauchy_finite_order_exists_and_cyclic_subgroup_divisibility · Uses: G001, S239

S241 · implies

Before

Cauchy ORIGINAL element10:ORIGINAL element=10;positive exponent=1;previous power=2;right multiply ORIGINAL g via table

After

g^1=10;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S240

S242 · implies

Before

Cauchy ORIGINAL element10:ORIGINAL element=10;positive exponent=2;previous power=10;right multiply ORIGINAL g via table

After

g^2=6;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S241

S243 · implies

Before

Cauchy ORIGINAL element10:ORIGINAL element=10;positive exponent=3;previous power=6;right multiply ORIGINAL g via table

After

g^3=2;identity=2;is_identity=Yes;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S242

S244 · implies

Before

Cauchy ORIGINAL element10:CURRENT certified group order=12,element=10;ALL powers through first return=[[1, 10], [2, 6], [3, 2]]

After

exact positive order=3;cyclic powers before repetition form a subgroup of this size;its equal-size left cosets partition G,so this order divides group order

Conditions: none

Among e,g,...,g^|G|,a repetition cancels to a positive return at most|G|.Powers before the minimal return are distinct and close under multiplication/inverse modulo that order.Their left cosets prove divisibility;one power equation alone does not.

Step identifiers and dependencies

Rule: cauchy_finite_order_exists_and_cyclic_subgroup_divisibility · Uses: G001, S243

S245 · implies

Before

Cauchy ORIGINAL element11:ORIGINAL element=11;positive exponent=1;previous power=2;right multiply ORIGINAL g via table

After

g^1=11;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S244

S246 · implies

Before

Cauchy ORIGINAL element11:ORIGINAL element=11;positive exponent=2;previous power=11;right multiply ORIGINAL g via table

After

g^2=8;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S245

S247 · implies

Before

Cauchy ORIGINAL element11:ORIGINAL element=11;positive exponent=3;previous power=8;right multiply ORIGINAL g via table

After

g^3=5;identity=2;is_identity=No;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S246

S248 · implies

Before

Cauchy ORIGINAL element11:ORIGINAL element=11;positive exponent=4;previous power=5;right multiply ORIGINAL g via table

After

g^4=2;identity=2;is_identity=Yes;all earlier POSITIVE powers are nonidentity

Conditions: none

Start at e but test only positive exponents1,2,...The first identity return is the exact order.Do not use exponent0 or infer exact order merely from g^p=e.

Step identifiers and dependencies

Rule: cauchy_EVERY_positive_power_until_FIRST_identity_return · Uses: G001, S247

S249 · implies

Before

Cauchy ORIGINAL element11:CURRENT certified group order=12,element=11;ALL powers through first return=[[1, 11], [2, 8], [3, 5], [4, 2]]

After

exact positive order=4;cyclic powers before repetition form a subgroup of this size;its equal-size left cosets partition G,so this order divides group order

Conditions: none

Among e,g,...,g^|G|,a repetition cancels to a positive return at most|G|.Powers before the minimal return are distinct and close under multiplication/inverse modulo that order.Their left cosets prove divisibility;one power equation alone does not.

Step identifiers and dependencies

Rule: cauchy_finite_order_exists_and_cyclic_subgroup_divisibility · Uses: G001, S248

Reverse checks

  • S249 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S248 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S247 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S246 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S245 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S244 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S243 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S242 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S241 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S240 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S239 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S238 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S237 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S236 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S235 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S234 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S233 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S232 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S231 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S230 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S229 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S228 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S227 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S226 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S225 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S224 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S223 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S222 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S221 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S220 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S219 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S218 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S217 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S216 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S215 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S214 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S213 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S212 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S211 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S210 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S209 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S208 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S207 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S206 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S205 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S204 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S203 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S202 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S201 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S200 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S199 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S198 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S197 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S196 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S195 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S194 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S193 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S192 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S191 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S190 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S189 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S188 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S187 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S186 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S185 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S184 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S183 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S182 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S181 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S180 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S179 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S178 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S177 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S176 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S175 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S174 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S173 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S172 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S171 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S170 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S169 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S168 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S167 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S166 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S165 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S164 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S163 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S162 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S161 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S160 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S159 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S158 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S157 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S156 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S155 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S154 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S153 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S152 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S151 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S150 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S149 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S148 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S147 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S146 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S145 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S144 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S143 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S142 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S141 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S140 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S139 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S138 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S137 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S136 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S135 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S134 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S133 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S132 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S131 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S130 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S129 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S128 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S127 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S126 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S125 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S124 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S123 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S122 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S121 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S120 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S119 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S118 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S117 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S116 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S115 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S114 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S113 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S112 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S111 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S110 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S109 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S108 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S107 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S106 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S105 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S104 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S103 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S102 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S101 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S100 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S099 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S098 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S097 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S096 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S095 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S094 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S093 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S092 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S091 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S090 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S089 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S088 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S087 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S086 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S085 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S084 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S083 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S082 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S081 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S080 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S079 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S078 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S077 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S076 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S075 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S074 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S073 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S072 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S071 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S070 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S069 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S068 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S067 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S066 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S065 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S064 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S063 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S062 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S061 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S060 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S059 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S058 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S057 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S056 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S055 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S054 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S053 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S052 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S051 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S050 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S049 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S048 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S047 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S046 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S045 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S044 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S043 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S042 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S041 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S040 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S039 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S038 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S037 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S036 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S035 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S034 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S033 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S032 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S031 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S030 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S029 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S028 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S027 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S026 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S025 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S024 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S023 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S022 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S021 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S020 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S019 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S018 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S017 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S016 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S015 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S014 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S013 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S012 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S011 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S010 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S009 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S008 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S006 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S005 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.

Result

(12, [[0, 6], [1, 12], [2, 1], [3, 12], [4, 6], [5, 4], [6, 3], [7, 12], [8, 2], [9, 12], [10, 3], [11, 4]], Yes, complete_element_order_table_for_declared_finite_group)

The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.

This question review and source binding

Review date: 2026-10-26

Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.

Source hashes and review receipts
  • input commit: 0f7be61e2c22317a4075561dc822c87d881a50db
  • original question SHA-256: 9c3dcaa700f0aa358ce4ae7b4aebb95f5c2c6f3f5e690554fc999b0edea665d3
  • candidate record SHA-256: 8a07c5bfb517f74a1bf9303ad3d53509417b552ce7fb865676efcbe2aee4918f
  • semantic review receipt SHA-256: 357d7ad7a6726b2a757558d3b9586a408ade06526cc023da093719c292704438
  • question-first witness SHA-256: 99cefe17e98c7a74321801cf72df6d02fc95b6a6b78aa335accb7e11ed467b2a
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON