%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : GRP124-9.004 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n002.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May 29 16:53:13 EDT 2024

% Result   : Unsatisfiable 0.48s 0.67s
% Output   : Proof 0.54s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem    : GRP124-9.004 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.13/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.35  % Computer : n002.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sun May 26 18:03:54 EDT 2024
% 0.13/0.36  % CPUTime    : 
% 0.21/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.51  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.48/0.67  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.24MtBlyoFK/cvc5---1.0.5_5025.smt2
% 0.48/0.67  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.24MtBlyoFK/cvc5---1.0.5_5025.smt2
% 0.54/0.71  (assume a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product tptp.e_1 X Y) (tptp.product tptp.e_2 X Y) (tptp.product tptp.e_3 X Y) (tptp.product tptp.e_4 X Y))))
% 0.54/0.71  (assume a1 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X tptp.e_1 Y) (tptp.product X tptp.e_2 Y) (tptp.product X tptp.e_3 Y) (tptp.product X tptp.e_4 Y))))
% 0.54/0.71  (assume a2 (tptp.group_element tptp.e_1))
% 0.54/0.71  (assume a3 (tptp.group_element tptp.e_2))
% 0.54/0.71  (assume a4 (tptp.group_element tptp.e_3))
% 0.54/0.71  (assume a5 (tptp.group_element tptp.e_4))
% 0.54/0.71  (assume a6 (not (tptp.equalish tptp.e_1 tptp.e_2)))
% 0.54/0.71  (assume a7 (not (tptp.equalish tptp.e_1 tptp.e_3)))
% 0.54/0.71  (assume a8 (not (tptp.equalish tptp.e_1 tptp.e_4)))
% 0.54/0.71  (assume a9 (not (tptp.equalish tptp.e_2 tptp.e_1)))
% 0.54/0.71  (assume a10 (not (tptp.equalish tptp.e_2 tptp.e_3)))
% 0.54/0.71  (assume a11 (not (tptp.equalish tptp.e_2 tptp.e_4)))
% 0.54/0.71  (assume a12 (not (tptp.equalish tptp.e_3 tptp.e_1)))
% 0.54/0.71  (assume a13 (not (tptp.equalish tptp.e_3 tptp.e_2)))
% 0.54/0.71  (assume a14 (not (tptp.equalish tptp.e_3 tptp.e_4)))
% 0.54/0.71  (assume a15 (not (tptp.equalish tptp.e_4 tptp.e_1)))
% 0.54/0.71  (assume a16 (not (tptp.equalish tptp.e_4 tptp.e_2)))
% 0.54/0.71  (assume a17 (not (tptp.equalish tptp.e_4 tptp.e_3)))
% 0.54/0.71  (assume a18 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))))
% 0.54/0.71  (assume a19 (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X Y W)) (not (tptp.product1 X Y Z)) (tptp.equalish W Z))))
% 0.54/0.71  (assume a20 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (assume a21 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))))
% 0.54/0.71  (assume a22 (forall ((X $$unsorted)) (tptp.product1 X X X)))
% 0.54/0.71  (assume a23 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product2 X Y tptp.e_1) (tptp.product2 X Y tptp.e_2) (tptp.product2 X Y tptp.e_3) (tptp.product2 X Y tptp.e_4))))
% 0.54/0.71  (assume a24 (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))))
% 0.54/0.71  (assume a25 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X W Y)) (not (tptp.product2 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (assume a26 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 W Y X)) (not (tptp.product2 Z Y X)) (tptp.equalish W Z))))
% 0.54/0.71  (assume a27 (forall ((X $$unsorted)) (tptp.product2 X X X)))
% 0.54/0.71  (assume a28 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))))
% 0.54/0.71  (step t1 (cl (not (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t2 (cl (tptp.equalish tptp.e_3 tptp.e_4) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (not (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule reordering :premises (t1))
% 0.54/0.71  (step t3 (cl (not (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4))) (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t4 (cl (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4) (not (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)))) :rule reordering :premises (t3))
% 0.54/0.71  (step t5 (cl (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t6 (cl (tptp.equalish tptp.e_1 tptp.e_4) (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule reordering :premises (t5))
% 0.54/0.71  (step t7 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (forall ((X $$unsorted)) (tptp.product1 X X X))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t8)
% 0.54/0.71  (assume t8.a0 (forall ((X $$unsorted)) (tptp.product1 X X X)))
% 0.54/0.71  (step t8.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1))) :rule forall_inst :args ((:= X tptp.e_1)))
% 0.54/0.71  (step t8.t2 (cl (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) :rule or :premises (t8.t1))
% 0.54/0.71  (step t8.t3 (cl (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) :rule resolution :premises (t8.t2 t8.a0))
% 0.54/0.71  (step t8 (cl (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) :rule subproof :discharge (t8.a0))
% 0.54/0.71  (step t9 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) :rule resolution :premises (t7 t8))
% 0.54/0.71  (step t10 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1))) :rule implies_neg2)
% 0.54/0.71  (step t11 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1))) :rule resolution :premises (t9 t10))
% 0.54/0.71  (step t12 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1))) :rule contraction :premises (t11))
% 0.54/0.71  (step t13 (cl (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) :rule implies :premises (t12))
% 0.54/0.71  (step t14 (cl (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) :rule resolution :premises (t13 a22))
% 0.54/0.71  (step t15 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t16)
% 0.54/0.71  (assume t16.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t16.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_1) (:= W tptp.e_1) (:= Y tptp.e_1) (:= Z tptp.e_4)))
% 0.54/0.71  (step t16.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule or :premises (t16.t1))
% 0.54/0.71  (step t16.t3 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule resolution :premises (t16.t2 t16.a0))
% 0.54/0.71  (step t16 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule subproof :discharge (t16.a0))
% 0.54/0.71  (step t17 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule resolution :premises (t15 t16))
% 0.54/0.71  (step t18 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t19 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule resolution :premises (t17 t18))
% 0.54/0.71  (step t20 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule contraction :premises (t19))
% 0.54/0.71  (step t21 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule implies :premises (t20))
% 0.54/0.71  (step t22 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule resolution :premises (t21 a20))
% 0.54/0.71  (step t23 (cl (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1))) :rule resolution :premises (t6 a8 t14 t22))
% 0.54/0.71  (step t24 (cl (not (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2)) :rule or_pos)
% 0.54/0.71  (step t25 (cl (tptp.equalish tptp.e_1 tptp.e_2) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule reordering :premises (t24))
% 0.54/0.71  (step t26 (cl (not (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4))) (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t27 (cl (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4) (not (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)))) :rule reordering :premises (t26))
% 0.54/0.71  (step t28 (cl (not (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3))) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3)) :rule or_pos)
% 0.54/0.71  (step t29 (cl (tptp.equalish tptp.e_4 tptp.e_3) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (not (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3)))) :rule reordering :premises (t28))
% 0.54/0.71  (step t30 (cl (not (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4))) (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t31 (cl (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4) (not (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)))) :rule reordering :premises (t30))
% 0.54/0.71  (step t32 (cl (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)) :rule or_pos)
% 0.54/0.71  (step t33 (cl (tptp.equalish tptp.e_2 tptp.e_3) (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule reordering :premises (t32))
% 0.54/0.71  (step t34 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (forall ((X $$unsorted)) (tptp.product1 X X X))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t35)
% 0.54/0.71  (assume t35.a0 (forall ((X $$unsorted)) (tptp.product1 X X X)))
% 0.54/0.71  (step t35.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2))) :rule forall_inst :args ((:= X tptp.e_2)))
% 0.54/0.71  (step t35.t2 (cl (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) :rule or :premises (t35.t1))
% 0.54/0.71  (step t35.t3 (cl (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) :rule resolution :premises (t35.t2 t35.a0))
% 0.54/0.71  (step t35 (cl (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) :rule subproof :discharge (t35.a0))
% 0.54/0.71  (step t36 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) :rule resolution :premises (t34 t35))
% 0.54/0.71  (step t37 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2))) :rule implies_neg2)
% 0.54/0.71  (step t38 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2))) :rule resolution :premises (t36 t37))
% 0.54/0.71  (step t39 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2))) :rule contraction :premises (t38))
% 0.54/0.71  (step t40 (cl (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) :rule implies :premises (t39))
% 0.54/0.71  (step t41 (cl (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) :rule resolution :premises (t40 a22))
% 0.54/0.71  (step t42 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t43)
% 0.54/0.71  (assume t43.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t43.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_2) (:= W tptp.e_2) (:= Y tptp.e_2) (:= Z tptp.e_3)))
% 0.54/0.71  (step t43.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule or :premises (t43.t1))
% 0.54/0.71  (step t43.t3 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t43.t2 t43.a0))
% 0.54/0.71  (step t43 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule subproof :discharge (t43.a0))
% 0.54/0.71  (step t44 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t42 t43))
% 0.54/0.71  (step t45 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule implies_neg2)
% 0.54/0.71  (step t46 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule resolution :premises (t44 t45))
% 0.54/0.71  (step t47 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule contraction :premises (t46))
% 0.54/0.71  (step t48 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule implies :premises (t47))
% 0.54/0.71  (step t49 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t48 a20))
% 0.54/0.71  (step t50 (cl (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2))) :rule resolution :premises (t33 a10 t41 t49))
% 0.54/0.71  (step t51 (cl (not (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2)) :rule or_pos)
% 0.54/0.71  (step t52 (cl (tptp.equalish tptp.e_3 tptp.e_2) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule reordering :premises (t51))
% 0.54/0.71  (step t53 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (forall ((X $$unsorted)) (tptp.product1 X X X))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t54)
% 0.54/0.71  (assume t54.a0 (forall ((X $$unsorted)) (tptp.product1 X X X)))
% 0.54/0.71  (step t54.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3))) :rule forall_inst :args ((:= X tptp.e_3)))
% 0.54/0.71  (step t54.t2 (cl (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) :rule or :premises (t54.t1))
% 0.54/0.71  (step t54.t3 (cl (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) :rule resolution :premises (t54.t2 t54.a0))
% 0.54/0.71  (step t54 (cl (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) :rule subproof :discharge (t54.a0))
% 0.54/0.71  (step t55 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) :rule resolution :premises (t53 t54))
% 0.54/0.71  (step t56 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3))) :rule implies_neg2)
% 0.54/0.71  (step t57 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3))) :rule resolution :premises (t55 t56))
% 0.54/0.71  (step t58 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3))) :rule contraction :premises (t57))
% 0.54/0.71  (step t59 (cl (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) :rule implies :premises (t58))
% 0.54/0.71  (step t60 (cl (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) :rule resolution :premises (t59 a22))
% 0.54/0.71  (step t61 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t62)
% 0.54/0.71  (assume t62.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))))
% 0.54/0.71  (step t62.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule forall_inst :args ((:= W tptp.e_3) (:= Y tptp.e_3) (:= X tptp.e_3) (:= Z tptp.e_2)))
% 0.54/0.71  (step t62.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule or :premises (t62.t1))
% 0.54/0.71  (step t62.t3 (cl (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t62.t2 t62.a0))
% 0.54/0.71  (step t62 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule subproof :discharge (t62.a0))
% 0.54/0.71  (step t63 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t61 t62))
% 0.54/0.71  (step t64 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) (not (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule implies_neg2)
% 0.54/0.71  (step t65 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule resolution :premises (t63 t64))
% 0.54/0.71  (step t66 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule contraction :premises (t65))
% 0.54/0.71  (step t67 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule implies :premises (t66))
% 0.54/0.71  (step t68 (cl (or (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t67 a21))
% 0.54/0.71  (step t69 (cl (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3))) :rule resolution :premises (t52 a13 t60 t68))
% 0.54/0.71  (step t70 (cl (not (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3)) :rule or_pos)
% 0.54/0.71  (step t71 (cl (tptp.equalish tptp.e_1 tptp.e_3) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (not (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule reordering :premises (t70))
% 0.54/0.71  (step t72 (cl (not (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4))) (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t73 (cl (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4) (not (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)))) :rule reordering :premises (t72))
% 0.54/0.71  (step t74 (cl (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)) :rule or_pos)
% 0.54/0.71  (step t75 (cl (tptp.equalish tptp.e_1 tptp.e_2) (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule reordering :premises (t74))
% 0.54/0.71  (step t76 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t77)
% 0.54/0.71  (assume t77.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))))
% 0.54/0.71  (step t77.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule forall_inst :args ((:= W tptp.e_1) (:= Y tptp.e_1) (:= X tptp.e_1) (:= Z tptp.e_2)))
% 0.54/0.71  (step t77.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule or :premises (t77.t1))
% 0.54/0.71  (step t77.t3 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t77.t2 t77.a0))
% 0.54/0.71  (step t77 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule subproof :discharge (t77.a0))
% 0.54/0.71  (step t78 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t76 t77))
% 0.54/0.71  (step t79 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule implies_neg2)
% 0.54/0.71  (step t80 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule resolution :premises (t78 t79))
% 0.54/0.71  (step t81 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule contraction :premises (t80))
% 0.54/0.71  (step t82 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule implies :premises (t81))
% 0.54/0.71  (step t83 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t82 a21))
% 0.54/0.71  (step t84 (cl (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1))) :rule resolution :premises (t75 a6 t14 t83))
% 0.54/0.71  (step t85 (cl (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)) :rule or_pos)
% 0.54/0.71  (step t86 (cl (tptp.equalish tptp.e_2 tptp.e_1) (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule reordering :premises (t85))
% 0.54/0.71  (step t87 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t88)
% 0.54/0.71  (assume t88.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t88.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_2) (:= W tptp.e_2) (:= Y tptp.e_2) (:= Z tptp.e_1)))
% 0.54/0.71  (step t88.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule or :premises (t88.t1))
% 0.54/0.71  (step t88.t3 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t88.t2 t88.a0))
% 0.54/0.71  (step t88 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule subproof :discharge (t88.a0))
% 0.54/0.71  (step t89 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t87 t88))
% 0.54/0.71  (step t90 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule implies_neg2)
% 0.54/0.71  (step t91 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule resolution :premises (t89 t90))
% 0.54/0.71  (step t92 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule contraction :premises (t91))
% 0.54/0.71  (step t93 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule implies :premises (t92))
% 0.54/0.71  (step t94 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t93 a20))
% 0.54/0.71  (step t95 (cl (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2))) :rule resolution :premises (t86 a9 t41 t94))
% 0.54/0.71  (step t96 (cl (not (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2))) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) :rule or_pos)
% 0.54/0.71  (step t97 (cl (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (not (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)))) :rule reordering :premises (t96))
% 0.54/0.71  (step t98 (cl (not (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)) :rule or_pos)
% 0.54/0.71  (step t99 (cl (tptp.equalish tptp.e_1 tptp.e_2) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (not (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule reordering :premises (t98))
% 0.54/0.71  (step t100 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (forall ((X $$unsorted)) (tptp.product2 X X X))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t101)
% 0.54/0.71  (assume t101.a0 (forall ((X $$unsorted)) (tptp.product2 X X X)))
% 0.54/0.71  (step t101.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product2 X X X))) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1))) :rule forall_inst :args ((:= X tptp.e_1)))
% 0.54/0.71  (step t101.t2 (cl (not (forall ((X $$unsorted)) (tptp.product2 X X X))) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) :rule or :premises (t101.t1))
% 0.54/0.71  (step t101.t3 (cl (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) :rule resolution :premises (t101.t2 t101.a0))
% 0.54/0.71  (step t101 (cl (not (forall ((X $$unsorted)) (tptp.product2 X X X))) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) :rule subproof :discharge (t101.a0))
% 0.54/0.71  (step t102 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) :rule resolution :premises (t100 t101))
% 0.54/0.71  (step t103 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1))) :rule implies_neg2)
% 0.54/0.71  (step t104 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1))) :rule resolution :premises (t102 t103))
% 0.54/0.71  (step t105 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1))) :rule contraction :premises (t104))
% 0.54/0.71  (step t106 (cl (not (forall ((X $$unsorted)) (tptp.product2 X X X))) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) :rule implies :premises (t105))
% 0.54/0.71  (step t107 (cl (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) :rule resolution :premises (t106 a27))
% 0.54/0.71  (step t108 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t109)
% 0.54/0.71  (assume t109.a0 (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))))
% 0.54/0.71  (step t109.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_1) (:= Y tptp.e_1) (:= W tptp.e_1) (:= Z tptp.e_2)))
% 0.54/0.71  (step t109.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule or :premises (t109.t1))
% 0.54/0.71  (step t109.t3 (cl (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t109.t2 t109.a0))
% 0.54/0.71  (step t109 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule subproof :discharge (t109.a0))
% 0.54/0.71  (step t110 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t108 t109))
% 0.54/0.71  (step t111 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule implies_neg2)
% 0.54/0.71  (step t112 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule resolution :premises (t110 t111))
% 0.54/0.71  (step t113 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule contraction :premises (t112))
% 0.54/0.71  (step t114 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule implies :premises (t113))
% 0.54/0.71  (step t115 (cl (or (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t114 a24))
% 0.54/0.71  (step t116 (cl (not (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2))) :rule resolution :premises (t99 a6 t107 t115))
% 0.54/0.71  (step t117 (cl (not (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4))) (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t118 (cl (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4) (not (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)))) :rule reordering :premises (t117))
% 0.54/0.71  (step t119 (cl (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)) :rule or_pos)
% 0.54/0.71  (step t120 (cl (tptp.equalish tptp.e_2 tptp.e_3) (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule reordering :premises (t119))
% 0.54/0.71  (step t121 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t122)
% 0.54/0.71  (assume t122.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))))
% 0.54/0.71  (step t122.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule forall_inst :args ((:= W tptp.e_2) (:= Y tptp.e_2) (:= X tptp.e_2) (:= Z tptp.e_3)))
% 0.54/0.71  (step t122.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule or :premises (t122.t1))
% 0.54/0.71  (step t122.t3 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t122.t2 t122.a0))
% 0.54/0.71  (step t122 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule subproof :discharge (t122.a0))
% 0.54/0.71  (step t123 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t121 t122))
% 0.54/0.71  (step t124 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule implies_neg2)
% 0.54/0.71  (step t125 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule resolution :premises (t123 t124))
% 0.54/0.71  (step t126 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule contraction :premises (t125))
% 0.54/0.71  (step t127 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule implies :premises (t126))
% 0.54/0.71  (step t128 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t127 a21))
% 0.54/0.71  (step t129 (cl (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2))) :rule resolution :premises (t120 a10 t41 t128))
% 0.54/0.71  (step t130 (cl (not (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3)) :rule or_pos)
% 0.54/0.71  (step t131 (cl (tptp.equalish tptp.e_2 tptp.e_3) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule reordering :premises (t130))
% 0.54/0.71  (step t132 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t133)
% 0.54/0.71  (assume t133.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t133.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_3) (:= W tptp.e_2) (:= Y tptp.e_3) (:= Z tptp.e_3)))
% 0.54/0.71  (step t133.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule or :premises (t133.t1))
% 0.54/0.71  (step t133.t3 (cl (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t133.t2 t133.a0))
% 0.54/0.71  (step t133 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule subproof :discharge (t133.a0))
% 0.54/0.71  (step t134 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t132 t133))
% 0.54/0.71  (step t135 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule implies_neg2)
% 0.54/0.71  (step t136 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule resolution :premises (t134 t135))
% 0.54/0.71  (step t137 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule contraction :premises (t136))
% 0.54/0.71  (step t138 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule implies :premises (t137))
% 0.54/0.71  (step t139 (cl (or (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t138 a20))
% 0.54/0.71  (step t140 (cl (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3))) :rule resolution :premises (t131 a10 t60 t139))
% 0.54/0.71  (step t141 (cl (not (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1))) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1)) :rule or_pos)
% 0.54/0.71  (step t142 (cl (tptp.equalish tptp.e_4 tptp.e_1) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule reordering :premises (t141))
% 0.54/0.71  (step t143 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t144)
% 0.54/0.71  (assume t144.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t144.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_2) (:= W tptp.e_4) (:= Y tptp.e_4) (:= Z tptp.e_1)))
% 0.54/0.71  (step t144.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule or :premises (t144.t1))
% 0.54/0.71  (step t144.t3 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule resolution :premises (t144.t2 t144.a0))
% 0.54/0.71  (step t144 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule subproof :discharge (t144.a0))
% 0.54/0.71  (step t145 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule resolution :premises (t143 t144))
% 0.54/0.71  (step t146 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1))) (not (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule implies_neg2)
% 0.54/0.71  (step t147 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule resolution :premises (t145 t146))
% 0.54/0.71  (step t148 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule contraction :premises (t147))
% 0.54/0.71  (step t149 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule implies :premises (t148))
% 0.54/0.71  (step t150 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule resolution :premises (t149 a20))
% 0.54/0.71  (step t151 (cl (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4))) (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t152 (cl (tptp.equalish tptp.e_2 tptp.e_4) (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule reordering :premises (t151))
% 0.54/0.71  (step t153 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t154)
% 0.54/0.71  (assume t154.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t154.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_2) (:= W tptp.e_2) (:= Y tptp.e_2) (:= Z tptp.e_4)))
% 0.54/0.71  (step t154.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule or :premises (t154.t1))
% 0.54/0.71  (step t154.t3 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule resolution :premises (t154.t2 t154.a0))
% 0.54/0.71  (step t154 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule subproof :discharge (t154.a0))
% 0.54/0.71  (step t155 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule resolution :premises (t153 t154))
% 0.54/0.71  (step t156 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4))) (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t157 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule resolution :premises (t155 t156))
% 0.54/0.71  (step t158 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule contraction :premises (t157))
% 0.54/0.71  (step t159 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule implies :premises (t158))
% 0.54/0.71  (step t160 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule resolution :premises (t159 a20))
% 0.54/0.71  (step t161 (cl (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2))) :rule resolution :premises (t152 a11 t41 t160))
% 0.54/0.71  (step t162 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t163)
% 0.54/0.71  (assume t163.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))))
% 0.54/0.71  (step t163.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_4)))
% 0.54/0.71  (step t163.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4))) :rule or :premises (t163.t1))
% 0.54/0.71  (step t163.t3 (cl (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4))) :rule resolution :premises (t163.t2 t163.a0))
% 0.54/0.71  (step t163 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4))) :rule subproof :discharge (t163.a0))
% 0.54/0.71  (step t164 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4))) :rule resolution :premises (t162 t163))
% 0.54/0.71  (step t165 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4))) (not (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t166 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)))) :rule resolution :premises (t164 t165))
% 0.54/0.71  (step t167 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4)))) :rule contraction :premises (t166))
% 0.54/0.71  (step t168 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4))) :rule implies :premises (t167))
% 0.54/0.71  (step t169 (cl (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4))) :rule resolution :premises (t168 a18))
% 0.54/0.71  (step t170 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t171)
% 0.54/0.71  (assume t171.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))))
% 0.54/0.71  (step t171.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_1)))
% 0.54/0.71  (step t171.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4))) :rule or :premises (t171.t1))
% 0.54/0.71  (step t171.t3 (cl (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4))) :rule resolution :premises (t171.t2 t171.a0))
% 0.54/0.71  (step t171 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4))) :rule subproof :discharge (t171.a0))
% 0.54/0.71  (step t172 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4))) :rule resolution :premises (t170 t171))
% 0.54/0.71  (step t173 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4))) (not (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t174 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)))) :rule resolution :premises (t172 t173))
% 0.54/0.71  (step t175 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)))) :rule contraction :premises (t174))
% 0.54/0.71  (step t176 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4))) :rule implies :premises (t175))
% 0.54/0.71  (step t177 (cl (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4))) :rule resolution :premises (t176 a18))
% 0.54/0.71  (step t178 (cl (not (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) :rule or_pos)
% 0.54/0.71  (step t179 (cl (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2) (not (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)))) :rule reordering :premises (t178))
% 0.54/0.71  (step t180 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t181)
% 0.54/0.71  (assume t181.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))))
% 0.54/0.71  (step t181.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_4) (:= Z1 tptp.e_1) (:= Z2 tptp.e_4)))
% 0.54/0.71  (step t181.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) :rule or :premises (t181.t1))
% 0.54/0.71  (step t181.t3 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) :rule resolution :premises (t181.t2 t181.a0))
% 0.54/0.71  (step t181 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) :rule subproof :discharge (t181.a0))
% 0.54/0.71  (step t182 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) :rule resolution :premises (t180 t181))
% 0.54/0.71  (step t183 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) (not (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)))) :rule implies_neg2)
% 0.54/0.71  (step t184 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)))) :rule resolution :premises (t182 t183))
% 0.54/0.71  (step t185 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)))) :rule contraction :premises (t184))
% 0.54/0.71  (step t186 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) :rule implies :premises (t185))
% 0.54/0.71  (step t187 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) :rule resolution :premises (t186 a28))
% 0.54/0.71  (step t188 (cl (not (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t189 (cl (tptp.equalish tptp.e_2 tptp.e_4) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (not (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule reordering :premises (t188))
% 0.54/0.71  (step t190 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (forall ((X $$unsorted)) (tptp.product2 X X X))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t191)
% 0.54/0.71  (assume t191.a0 (forall ((X $$unsorted)) (tptp.product2 X X X)))
% 0.54/0.71  (step t191.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product2 X X X))) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4))) :rule forall_inst :args ((:= X tptp.e_4)))
% 0.54/0.71  (step t191.t2 (cl (not (forall ((X $$unsorted)) (tptp.product2 X X X))) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) :rule or :premises (t191.t1))
% 0.54/0.71  (step t191.t3 (cl (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) :rule resolution :premises (t191.t2 t191.a0))
% 0.54/0.71  (step t191 (cl (not (forall ((X $$unsorted)) (tptp.product2 X X X))) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) :rule subproof :discharge (t191.a0))
% 0.54/0.71  (step t192 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) :rule resolution :premises (t190 t191))
% 0.54/0.71  (step t193 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4))) :rule implies_neg2)
% 0.54/0.71  (step t194 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4))) :rule resolution :premises (t192 t193))
% 0.54/0.71  (step t195 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4))) :rule contraction :premises (t194))
% 0.54/0.71  (step t196 (cl (not (forall ((X $$unsorted)) (tptp.product2 X X X))) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) :rule implies :premises (t195))
% 0.54/0.71  (step t197 (cl (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) :rule resolution :premises (t196 a27))
% 0.54/0.71  (step t198 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t199)
% 0.54/0.71  (assume t199.a0 (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))))
% 0.54/0.71  (step t199.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_4) (:= Y tptp.e_4) (:= W tptp.e_2) (:= Z tptp.e_4)))
% 0.54/0.71  (step t199.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule or :premises (t199.t1))
% 0.54/0.71  (step t199.t3 (cl (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule resolution :premises (t199.t2 t199.a0))
% 0.54/0.71  (step t199 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule subproof :discharge (t199.a0))
% 0.54/0.71  (step t200 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule resolution :premises (t198 t199))
% 0.54/0.71  (step t201 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) (not (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t202 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule resolution :premises (t200 t201))
% 0.54/0.71  (step t203 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule contraction :premises (t202))
% 0.54/0.71  (step t204 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule implies :premises (t203))
% 0.54/0.71  (step t205 (cl (or (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule resolution :premises (t204 a24))
% 0.54/0.71  (step t206 (cl (not (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) :rule resolution :premises (t189 a11 t197 t205))
% 0.54/0.71  (step t207 (cl (not (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4))) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t208 (cl (tptp.equalish tptp.e_2 tptp.e_4) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (not (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule reordering :premises (t207))
% 0.54/0.71  (step t209 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4))) (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t210)
% 0.54/0.71  (assume t210.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))))
% 0.54/0.71  (step t210.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule forall_inst :args ((:= W tptp.e_2) (:= Y tptp.e_1) (:= X tptp.e_3) (:= Z tptp.e_4)))
% 0.54/0.71  (step t210.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule or :premises (t210.t1))
% 0.54/0.71  (step t210.t3 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule resolution :premises (t210.t2 t210.a0))
% 0.54/0.71  (step t210 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule subproof :discharge (t210.a0))
% 0.54/0.71  (step t211 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule resolution :premises (t209 t210))
% 0.54/0.71  (step t212 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4))) (not (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t213 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4))) (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule resolution :premises (t211 t212))
% 0.54/0.71  (step t214 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule contraction :premises (t213))
% 0.54/0.71  (step t215 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule implies :premises (t214))
% 0.54/0.71  (step t216 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule resolution :premises (t215 a21))
% 0.54/0.71  (step t217 (cl (not (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4))) (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t218 (cl (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4) (not (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)))) :rule reordering :premises (t217))
% 0.54/0.71  (step t219 (cl (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)) :rule or_pos)
% 0.54/0.71  (step t220 (cl (tptp.equalish tptp.e_1 tptp.e_2) (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule reordering :premises (t219))
% 0.54/0.71  (step t221 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t222)
% 0.54/0.71  (assume t222.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t222.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_1) (:= W tptp.e_1) (:= Y tptp.e_1) (:= Z tptp.e_2)))
% 0.54/0.71  (step t222.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule or :premises (t222.t1))
% 0.54/0.71  (step t222.t3 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t222.t2 t222.a0))
% 0.54/0.71  (step t222 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule subproof :discharge (t222.a0))
% 0.54/0.71  (step t223 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t221 t222))
% 0.54/0.71  (step t224 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule implies_neg2)
% 0.54/0.71  (step t225 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule resolution :premises (t223 t224))
% 0.54/0.71  (step t226 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule contraction :premises (t225))
% 0.54/0.71  (step t227 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule implies :premises (t226))
% 0.54/0.71  (step t228 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t227 a20))
% 0.54/0.71  (step t229 (cl (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1))) :rule resolution :premises (t220 a6 t14 t228))
% 0.54/0.71  (step t230 (cl (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)) :rule or_pos)
% 0.54/0.71  (step t231 (cl (tptp.equalish tptp.e_2 tptp.e_1) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule reordering :premises (t230))
% 0.54/0.71  (step t232 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t233)
% 0.54/0.71  (assume t233.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))))
% 0.54/0.71  (step t233.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule forall_inst :args ((:= W tptp.e_2) (:= Y tptp.e_2) (:= X tptp.e_2) (:= Z tptp.e_1)))
% 0.54/0.71  (step t233.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule or :premises (t233.t1))
% 0.54/0.71  (step t233.t3 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t233.t2 t233.a0))
% 0.54/0.71  (step t233 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule subproof :discharge (t233.a0))
% 0.54/0.71  (step t234 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t232 t233))
% 0.54/0.71  (step t235 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (not (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule implies_neg2)
% 0.54/0.71  (step t236 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule resolution :premises (t234 t235))
% 0.54/0.71  (step t237 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule contraction :premises (t236))
% 0.54/0.71  (step t238 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule implies :premises (t237))
% 0.54/0.71  (step t239 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t238 a21))
% 0.54/0.71  (step t240 (cl (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2))) :rule resolution :premises (t231 a9 t41 t239))
% 0.54/0.71  (step t241 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t242)
% 0.54/0.71  (assume t242.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))))
% 0.54/0.71  (step t242.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_1) (:= Y tptp.e_2)))
% 0.54/0.71  (step t242.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4))) :rule or :premises (t242.t1))
% 0.54/0.71  (step t242.t3 (cl (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4))) :rule resolution :premises (t242.t2 t242.a0))
% 0.54/0.71  (step t242 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4))) :rule subproof :discharge (t242.a0))
% 0.54/0.71  (step t243 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4))) :rule resolution :premises (t241 t242))
% 0.54/0.71  (step t244 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4))) (not (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t245 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)))) :rule resolution :premises (t243 t244))
% 0.54/0.71  (step t246 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)))) :rule contraction :premises (t245))
% 0.54/0.71  (step t247 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4))) :rule implies :premises (t246))
% 0.54/0.71  (step t248 (cl (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4))) :rule resolution :premises (t247 a18))
% 0.54/0.71  (step t249 (cl (not (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4))) (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t250 (cl (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4) (not (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)))) :rule reordering :premises (t249))
% 0.54/0.71  (step t251 (cl (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t252 (cl (tptp.equalish tptp.e_1 tptp.e_4) (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule reordering :premises (t251))
% 0.54/0.71  (step t253 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t254)
% 0.54/0.71  (assume t254.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))))
% 0.54/0.71  (step t254.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule forall_inst :args ((:= W tptp.e_1) (:= Y tptp.e_1) (:= X tptp.e_1) (:= Z tptp.e_4)))
% 0.54/0.71  (step t254.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule or :premises (t254.t1))
% 0.54/0.71  (step t254.t3 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule resolution :premises (t254.t2 t254.a0))
% 0.54/0.71  (step t254 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule subproof :discharge (t254.a0))
% 0.54/0.71  (step t255 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule resolution :premises (t253 t254))
% 0.54/0.71  (step t256 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t257 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule resolution :premises (t255 t256))
% 0.54/0.71  (step t258 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule contraction :premises (t257))
% 0.54/0.71  (step t259 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule implies :premises (t258))
% 0.54/0.71  (step t260 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule resolution :premises (t259 a21))
% 0.54/0.71  (step t261 (cl (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1))) :rule resolution :premises (t252 a8 t14 t260))
% 0.54/0.71  (step t262 (cl (not (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t263 (cl (tptp.equalish tptp.e_1 tptp.e_4) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (not (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule reordering :premises (t262))
% 0.54/0.71  (step t264 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (forall ((X $$unsorted)) (tptp.product1 X X X))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t265)
% 0.54/0.71  (assume t265.a0 (forall ((X $$unsorted)) (tptp.product1 X X X)))
% 0.54/0.71  (step t265.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4))) :rule forall_inst :args ((:= X tptp.e_4)))
% 0.54/0.71  (step t265.t2 (cl (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) :rule or :premises (t265.t1))
% 0.54/0.71  (step t265.t3 (cl (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) :rule resolution :premises (t265.t2 t265.a0))
% 0.54/0.71  (step t265 (cl (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) :rule subproof :discharge (t265.a0))
% 0.54/0.71  (step t266 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) :rule resolution :premises (t264 t265))
% 0.54/0.71  (step t267 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4))) :rule implies_neg2)
% 0.54/0.71  (step t268 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4))) :rule resolution :premises (t266 t267))
% 0.54/0.71  (step t269 (cl (=> (forall ((X $$unsorted)) (tptp.product1 X X X)) (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4))) :rule contraction :premises (t268))
% 0.54/0.71  (step t270 (cl (not (forall ((X $$unsorted)) (tptp.product1 X X X))) (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) :rule implies :premises (t269))
% 0.54/0.71  (step t271 (cl (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) :rule resolution :premises (t270 a22))
% 0.54/0.71  (step t272 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t273)
% 0.54/0.71  (assume t273.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t273.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_4) (:= W tptp.e_1) (:= Y tptp.e_4) (:= Z tptp.e_4)))
% 0.54/0.71  (step t273.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule or :premises (t273.t1))
% 0.54/0.71  (step t273.t3 (cl (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule resolution :premises (t273.t2 t273.a0))
% 0.54/0.71  (step t273 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule subproof :discharge (t273.a0))
% 0.54/0.71  (step t274 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule resolution :premises (t272 t273))
% 0.54/0.71  (step t275 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) (not (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t276 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule resolution :premises (t274 t275))
% 0.54/0.71  (step t277 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule contraction :premises (t276))
% 0.54/0.71  (step t278 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule implies :premises (t277))
% 0.54/0.71  (step t279 (cl (or (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule resolution :premises (t278 a20))
% 0.54/0.71  (step t280 (cl (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4))) :rule resolution :premises (t263 a8 t271 t279))
% 0.54/0.71  (step t281 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t282)
% 0.54/0.71  (assume t282.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))))
% 0.54/0.71  (step t282.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_4) (:= Y tptp.e_1)))
% 0.54/0.71  (step t282.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4))) :rule or :premises (t282.t1))
% 0.54/0.71  (step t282.t3 (cl (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4))) :rule resolution :premises (t282.t2 t282.a0))
% 0.54/0.71  (step t282 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4))) :rule subproof :discharge (t282.a0))
% 0.54/0.71  (step t283 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4))) (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4))) :rule resolution :premises (t281 t282))
% 0.54/0.71  (step t284 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4))) (not (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t285 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)))) :rule resolution :premises (t283 t284))
% 0.54/0.71  (step t286 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4)))) :rule contraction :premises (t285))
% 0.54/0.71  (step t287 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4))) :rule implies :premises (t286))
% 0.54/0.71  (step t288 (cl (or (not (tptp.group_element tptp.e_4)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_4))) :rule resolution :premises (t287 a18))
% 0.54/0.71  (step t289 (cl (not (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1))) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) :rule or_pos)
% 0.54/0.71  (step t290 (cl (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1) (not (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)))) :rule reordering :premises (t289))
% 0.54/0.71  (step t291 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t292)
% 0.54/0.71  (assume t292.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))))
% 0.54/0.71  (step t292.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_1) (:= Y tptp.e_2) (:= Z1 tptp.e_3) (:= Z2 tptp.e_2)))
% 0.54/0.71  (step t292.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1))) :rule or :premises (t292.t1))
% 0.54/0.71  (step t292.t3 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1))) :rule resolution :premises (t292.t2 t292.a0))
% 0.54/0.71  (step t292 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1))) :rule subproof :discharge (t292.a0))
% 0.54/0.71  (step t293 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1))) :rule resolution :premises (t291 t292))
% 0.54/0.71  (step t294 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1))) (not (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)))) :rule implies_neg2)
% 0.54/0.71  (step t295 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)))) :rule resolution :premises (t293 t294))
% 0.54/0.71  (step t296 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)))) :rule contraction :premises (t295))
% 0.54/0.71  (step t297 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1))) :rule implies :premises (t296))
% 0.54/0.71  (step t298 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1))) :rule resolution :premises (t297 a28))
% 0.54/0.71  (step t299 (cl (not (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)) :rule or_pos)
% 0.54/0.71  (step t300 (cl (tptp.equalish tptp.e_1 tptp.e_2) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule reordering :premises (t299))
% 0.54/0.71  (step t301 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (forall ((X $$unsorted)) (tptp.product2 X X X))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t302)
% 0.54/0.71  (assume t302.a0 (forall ((X $$unsorted)) (tptp.product2 X X X)))
% 0.54/0.71  (step t302.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product2 X X X))) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2))) :rule forall_inst :args ((:= X tptp.e_2)))
% 0.54/0.71  (step t302.t2 (cl (not (forall ((X $$unsorted)) (tptp.product2 X X X))) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) :rule or :premises (t302.t1))
% 0.54/0.71  (step t302.t3 (cl (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) :rule resolution :premises (t302.t2 t302.a0))
% 0.54/0.71  (step t302 (cl (not (forall ((X $$unsorted)) (tptp.product2 X X X))) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) :rule subproof :discharge (t302.a0))
% 0.54/0.71  (step t303 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) :rule resolution :premises (t301 t302))
% 0.54/0.71  (step t304 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2))) :rule implies_neg2)
% 0.54/0.71  (step t305 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2))) :rule resolution :premises (t303 t304))
% 0.54/0.71  (step t306 (cl (=> (forall ((X $$unsorted)) (tptp.product2 X X X)) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2))) :rule contraction :premises (t305))
% 0.54/0.71  (step t307 (cl (not (forall ((X $$unsorted)) (tptp.product2 X X X))) (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) :rule implies :premises (t306))
% 0.54/0.71  (step t308 (cl (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) :rule resolution :premises (t307 a27))
% 0.54/0.71  (step t309 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t310)
% 0.54/0.71  (assume t310.a0 (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))))
% 0.54/0.71  (step t310.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_2) (:= W tptp.e_1) (:= Z tptp.e_2)))
% 0.54/0.71  (step t310.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule or :premises (t310.t1))
% 0.54/0.71  (step t310.t3 (cl (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t310.t2 t310.a0))
% 0.54/0.71  (step t310 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule subproof :discharge (t310.a0))
% 0.54/0.71  (step t311 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t309 t310))
% 0.54/0.71  (step t312 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule implies_neg2)
% 0.54/0.71  (step t313 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule resolution :premises (t311 t312))
% 0.54/0.71  (step t314 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule contraction :premises (t313))
% 0.54/0.71  (step t315 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product2 X Y W)) (not (tptp.product2 X Y Z)) (tptp.equalish W Z)))) (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule implies :premises (t314))
% 0.54/0.71  (step t316 (cl (or (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t315 a24))
% 0.54/0.71  (step t317 (cl (not (tptp.product2 tptp.e_2 tptp.e_2 tptp.e_1))) :rule resolution :premises (t300 a6 t308 t316))
% 0.54/0.71  (step t318 (cl (not (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t319 (cl (tptp.equalish tptp.e_3 tptp.e_4) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (not (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule reordering :premises (t318))
% 0.54/0.71  (step t320 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t321)
% 0.54/0.71  (assume t321.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))))
% 0.54/0.71  (step t321.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule forall_inst :args ((:= W tptp.e_3) (:= Y tptp.e_1) (:= X tptp.e_2) (:= Z tptp.e_4)))
% 0.54/0.71  (step t321.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule or :premises (t321.t1))
% 0.54/0.71  (step t321.t3 (cl (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule resolution :premises (t321.t2 t321.a0))
% 0.54/0.71  (step t321 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule subproof :discharge (t321.a0))
% 0.54/0.71  (step t322 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule resolution :premises (t320 t321))
% 0.54/0.71  (step t323 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) (not (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t324 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule resolution :premises (t322 t323))
% 0.54/0.71  (step t325 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule contraction :premises (t324))
% 0.54/0.71  (step t326 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule implies :premises (t325))
% 0.54/0.71  (step t327 (cl (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_4 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule resolution :premises (t326 a21))
% 0.54/0.71  (step t328 (cl (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2))) :rule resolution :premises (t142 t150 a15 t27 t161 t169 a5 a3 t73 t95 t177 t84 a3 a2 t179 t187 t206 t208 t216 a11 t218 t229 t240 t248 a3 a2 t250 t261 t280 t288 a5 a2 t290 t298 t317 t319 t327 a14))
% 0.54/0.71  (step t329 (cl (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2))) :rule contraction :premises (t328))
% 0.54/0.71  (step t330 (cl (not (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4))) (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t331 (cl (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4) (not (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)))) :rule reordering :premises (t330))
% 0.54/0.71  (step t332 (cl (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)) :rule or_pos)
% 0.54/0.71  (step t333 (cl (tptp.equalish tptp.e_1 tptp.e_3) (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule reordering :premises (t332))
% 0.54/0.71  (step t334 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t335)
% 0.54/0.71  (assume t335.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))))
% 0.54/0.71  (step t335.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule forall_inst :args ((:= W tptp.e_1) (:= Y tptp.e_1) (:= X tptp.e_1) (:= Z tptp.e_3)))
% 0.54/0.71  (step t335.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule or :premises (t335.t1))
% 0.54/0.71  (step t335.t3 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t335.t2 t335.a0))
% 0.54/0.71  (step t335 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule subproof :discharge (t335.a0))
% 0.54/0.71  (step t336 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t334 t335))
% 0.54/0.71  (step t337 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule implies_neg2)
% 0.54/0.71  (step t338 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule resolution :premises (t336 t337))
% 0.54/0.71  (step t339 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule contraction :premises (t338))
% 0.54/0.71  (step t340 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule implies :premises (t339))
% 0.54/0.71  (step t341 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t340 a21))
% 0.54/0.71  (step t342 (cl (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1))) :rule resolution :premises (t333 a7 t14 t341))
% 0.54/0.71  (step t343 (cl (not (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)) :rule or_pos)
% 0.54/0.71  (step t344 (cl (tptp.equalish tptp.e_1 tptp.e_3) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule reordering :premises (t343))
% 0.54/0.71  (step t345 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t346)
% 0.54/0.71  (assume t346.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t346.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_3) (:= W tptp.e_1) (:= Y tptp.e_3) (:= Z tptp.e_3)))
% 0.54/0.71  (step t346.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule or :premises (t346.t1))
% 0.54/0.71  (step t346.t3 (cl (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t346.t2 t346.a0))
% 0.54/0.71  (step t346 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule subproof :discharge (t346.a0))
% 0.54/0.71  (step t347 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t345 t346))
% 0.54/0.71  (step t348 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule implies_neg2)
% 0.54/0.71  (step t349 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule resolution :premises (t347 t348))
% 0.54/0.71  (step t350 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule contraction :premises (t349))
% 0.54/0.71  (step t351 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule implies :premises (t350))
% 0.54/0.71  (step t352 (cl (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t351 a20))
% 0.54/0.71  (step t353 (cl (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3))) :rule resolution :premises (t344 a7 t60 t352))
% 0.54/0.71  (step t354 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t355)
% 0.54/0.71  (assume t355.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))))
% 0.54/0.71  (step t355.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_3) (:= Y tptp.e_1)))
% 0.54/0.71  (step t355.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4))) :rule or :premises (t355.t1))
% 0.54/0.71  (step t355.t3 (cl (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4))) :rule resolution :premises (t355.t2 t355.a0))
% 0.54/0.71  (step t355 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4))) :rule subproof :discharge (t355.a0))
% 0.54/0.71  (step t356 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4))) :rule resolution :premises (t354 t355))
% 0.54/0.71  (step t357 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4))) (not (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t358 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)))) :rule resolution :premises (t356 t357))
% 0.54/0.71  (step t359 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)))) :rule contraction :premises (t358))
% 0.54/0.71  (step t360 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4))) :rule implies :premises (t359))
% 0.54/0.71  (step t361 (cl (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4))) :rule resolution :premises (t360 a18))
% 0.54/0.71  (step t362 (cl (not (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)) :rule or_pos)
% 0.54/0.71  (step t363 (cl (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2) (not (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)))) :rule reordering :premises (t362))
% 0.54/0.71  (step t364 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t365)
% 0.54/0.71  (assume t365.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))))
% 0.54/0.71  (step t365.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_4) (:= Z1 tptp.e_3) (:= Z2 tptp.e_4)))
% 0.54/0.71  (step t365.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) :rule or :premises (t365.t1))
% 0.54/0.71  (step t365.t3 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) :rule resolution :premises (t365.t2 t365.a0))
% 0.54/0.71  (step t365 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) :rule subproof :discharge (t365.a0))
% 0.54/0.71  (step t366 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) :rule resolution :premises (t364 t365))
% 0.54/0.71  (step t367 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) (not (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)))) :rule implies_neg2)
% 0.54/0.71  (step t368 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)))) :rule resolution :premises (t366 t367))
% 0.54/0.71  (step t369 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2)))) :rule contraction :premises (t368))
% 0.54/0.71  (step t370 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) :rule implies :premises (t369))
% 0.54/0.71  (step t371 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.product2 tptp.e_4 tptp.e_4 tptp.e_2))) :rule resolution :premises (t370 a28))
% 0.54/0.71  (step t372 (cl (not (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2)) :rule or_pos)
% 0.54/0.71  (step t373 (cl (tptp.equalish tptp.e_1 tptp.e_2) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (not (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule reordering :premises (t372))
% 0.54/0.71  (step t374 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t375)
% 0.54/0.71  (assume t375.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t375.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_3) (:= W tptp.e_1) (:= Y tptp.e_4) (:= Z tptp.e_2)))
% 0.54/0.71  (step t375.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule or :premises (t375.t1))
% 0.54/0.71  (step t375.t3 (cl (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t375.t2 t375.a0))
% 0.54/0.71  (step t375 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule subproof :discharge (t375.a0))
% 0.54/0.71  (step t376 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t374 t375))
% 0.54/0.71  (step t377 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule implies_neg2)
% 0.54/0.71  (step t378 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule resolution :premises (t376 t377))
% 0.54/0.71  (step t379 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule contraction :premises (t378))
% 0.54/0.71  (step t380 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule implies :premises (t379))
% 0.54/0.71  (step t381 (cl (or (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t380 a20))
% 0.54/0.71  (step t382 (cl (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4))) :rule resolution :premises (t329 t331 t342 t353 t361 a4 a2 t363 t371 t206 t373 t381 a6))
% 0.54/0.71  (step t383 (cl (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4))) :rule contraction :premises (t382))
% 0.54/0.71  (step t384 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t385)
% 0.54/0.71  (assume t385.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))))
% 0.54/0.71  (step t385.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_3) (:= Y tptp.e_2)))
% 0.54/0.71  (step t385.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4))) :rule or :premises (t385.t1))
% 0.54/0.71  (step t385.t3 (cl (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4))) :rule resolution :premises (t385.t2 t385.a0))
% 0.54/0.71  (step t385 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4))) :rule subproof :discharge (t385.a0))
% 0.54/0.71  (step t386 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4))) :rule resolution :premises (t384 t385))
% 0.54/0.71  (step t387 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4))) (not (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t388 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)))) :rule resolution :premises (t386 t387))
% 0.54/0.71  (step t389 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4)))) :rule contraction :premises (t388))
% 0.54/0.71  (step t390 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4))) :rule implies :premises (t389))
% 0.54/0.71  (step t391 (cl (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_4))) :rule resolution :premises (t390 a18))
% 0.54/0.71  (step t392 (cl (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) :rule resolution :premises (t118 a3 a4 t129 t140 t383 t391))
% 0.54/0.71  (step t393 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t394)
% 0.54/0.71  (assume t394.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))))
% 0.54/0.71  (step t394.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_1) (:= Z1 tptp.e_3) (:= Z2 tptp.e_1)))
% 0.54/0.71  (step t394.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2))) :rule or :premises (t394.t1))
% 0.54/0.71  (step t394.t3 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2))) :rule resolution :premises (t394.t2 t394.a0))
% 0.54/0.71  (step t394 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2))) :rule subproof :discharge (t394.a0))
% 0.54/0.71  (step t395 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2))) :rule resolution :premises (t393 t394))
% 0.54/0.71  (step t396 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2))) (not (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)))) :rule implies_neg2)
% 0.54/0.71  (step t397 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)))) :rule resolution :premises (t395 t396))
% 0.54/0.71  (step t398 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2)))) :rule contraction :premises (t397))
% 0.54/0.71  (step t399 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product1 X Y Z1)) (not (tptp.product1 Z1 X Z2)) (tptp.product2 Z2 Y X)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2))) :rule implies :premises (t398))
% 0.54/0.71  (step t400 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.product2 tptp.e_1 tptp.e_1 tptp.e_2))) :rule resolution :premises (t399 a28))
% 0.54/0.71  (step t401 (cl (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_3))) :rule resolution :premises (t97 t116 t392 t400))
% 0.54/0.71  (step t402 (cl (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) :rule resolution :premises (t73 a2 a3 t84 t95 t401 t177))
% 0.54/0.71  (step t403 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t404)
% 0.54/0.71  (assume t404.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t404.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_2) (:= W tptp.e_1) (:= Y tptp.e_4) (:= Z tptp.e_3)))
% 0.54/0.71  (step t404.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule or :premises (t404.t1))
% 0.54/0.71  (step t404.t3 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t404.t2 t404.a0))
% 0.54/0.71  (step t404 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule subproof :discharge (t404.a0))
% 0.54/0.71  (step t405 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t403 t404))
% 0.54/0.71  (step t406 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule implies_neg2)
% 0.54/0.71  (step t407 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule resolution :premises (t405 t406))
% 0.54/0.71  (step t408 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule contraction :premises (t407))
% 0.54/0.71  (step t409 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule implies :premises (t408))
% 0.54/0.71  (step t410 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t409 a20))
% 0.54/0.71  (step t411 (cl (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4))) :rule resolution :premises (t71 a7 t402 t410))
% 0.54/0.71  (step t412 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t413)
% 0.54/0.71  (assume t413.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))))
% 0.54/0.71  (step t413.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_3)))
% 0.54/0.71  (step t413.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4))) :rule or :premises (t413.t1))
% 0.54/0.71  (step t413.t3 (cl (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4))) :rule resolution :premises (t413.t2 t413.a0))
% 0.54/0.71  (step t413 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4))) :rule subproof :discharge (t413.a0))
% 0.54/0.71  (step t414 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4))) :rule resolution :premises (t412 t413))
% 0.54/0.71  (step t415 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4))) (not (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t416 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)))) :rule resolution :premises (t414 t415))
% 0.54/0.71  (step t417 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4)))) :rule contraction :premises (t416))
% 0.54/0.71  (step t418 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4))) :rule implies :premises (t417))
% 0.54/0.71  (step t419 (cl (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_4))) :rule resolution :premises (t418 a18))
% 0.54/0.71  (step t420 (cl (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) :rule resolution :premises (t31 a3 a4 t50 t69 t411 t419))
% 0.54/0.71  (step t421 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t422)
% 0.54/0.71  (assume t422.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t422.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_2) (:= W tptp.e_4) (:= Y tptp.e_1) (:= Z tptp.e_3)))
% 0.54/0.71  (step t422.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3))) :rule or :premises (t422.t1))
% 0.54/0.71  (step t422.t3 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3))) :rule resolution :premises (t422.t2 t422.a0))
% 0.54/0.71  (step t422 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3))) :rule subproof :discharge (t422.a0))
% 0.54/0.71  (step t423 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3))) :rule resolution :premises (t421 t422))
% 0.54/0.71  (step t424 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3))) (not (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3)))) :rule implies_neg2)
% 0.54/0.71  (step t425 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3)))) :rule resolution :premises (t423 t424))
% 0.54/0.71  (step t426 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3)))) :rule contraction :premises (t425))
% 0.54/0.71  (step t427 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3))) :rule implies :premises (t426))
% 0.54/0.71  (step t428 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product1 tptp.e_2 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_3))) :rule resolution :premises (t427 a20))
% 0.54/0.71  (step t429 (cl (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_1))) :rule resolution :premises (t29 a17 t420 t428))
% 0.54/0.71  (step t430 (cl (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_4))) :rule resolution :premises (t142 a15 t402 t150))
% 0.54/0.71  (step t431 (cl (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) :rule resolution :premises (t27 a3 a5 t429 t161 t430 t169))
% 0.54/0.71  (step t432 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2))) (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t433)
% 0.54/0.71  (assume t433.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))))
% 0.54/0.71  (step t433.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule forall_inst :args ((:= W tptp.e_1) (:= Y tptp.e_4) (:= X tptp.e_3) (:= Z tptp.e_2)))
% 0.54/0.71  (step t433.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule or :premises (t433.t1))
% 0.54/0.71  (step t433.t3 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t433.t2 t433.a0))
% 0.54/0.71  (step t433 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule subproof :discharge (t433.a0))
% 0.54/0.71  (step t434 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t432 t433))
% 0.54/0.71  (step t435 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule implies_neg2)
% 0.54/0.71  (step t436 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2))) (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule resolution :premises (t434 t435))
% 0.54/0.71  (step t437 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule contraction :premises (t436))
% 0.54/0.71  (step t438 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule implies :premises (t437))
% 0.54/0.71  (step t439 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3)) (not (tptp.product1 tptp.e_2 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t438 a21))
% 0.54/0.71  (step t440 (cl (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3))) :rule resolution :premises (t25 a6 t431 t439))
% 0.54/0.71  (step t441 (cl (not (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t442 (cl (tptp.equalish tptp.e_1 tptp.e_4) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (not (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule reordering :premises (t441))
% 0.54/0.71  (step t443 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t444)
% 0.54/0.71  (assume t444.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))))
% 0.54/0.71  (step t444.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule forall_inst :args ((:= W tptp.e_1) (:= Y tptp.e_4) (:= X tptp.e_4) (:= Z tptp.e_4)))
% 0.54/0.71  (step t444.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule or :premises (t444.t1))
% 0.54/0.71  (step t444.t3 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule resolution :premises (t444.t2 t444.a0))
% 0.54/0.71  (step t444 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule subproof :discharge (t444.a0))
% 0.54/0.71  (step t445 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule resolution :premises (t443 t444))
% 0.54/0.71  (step t446 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) (not (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t447 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule resolution :premises (t445 t446))
% 0.54/0.71  (step t448 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4)))) :rule contraction :premises (t447))
% 0.54/0.71  (step t449 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule implies :premises (t448))
% 0.54/0.71  (step t450 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)) (not (tptp.product1 tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_4))) :rule resolution :premises (t449 a21))
% 0.54/0.71  (step t451 (cl (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4))) :rule resolution :premises (t442 a8 t271 t450))
% 0.54/0.71  (step t452 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t453)
% 0.54/0.71  (assume t453.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))))
% 0.54/0.71  (step t453.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_1) (:= Y tptp.e_4)))
% 0.54/0.71  (step t453.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4))) :rule or :premises (t453.t1))
% 0.54/0.71  (step t453.t3 (cl (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4))) :rule resolution :premises (t453.t2 t453.a0))
% 0.54/0.71  (step t453 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4))) :rule subproof :discharge (t453.a0))
% 0.54/0.71  (step t454 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4))) :rule resolution :premises (t452 t453))
% 0.54/0.71  (step t455 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4))) (not (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t456 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)))) :rule resolution :premises (t454 t455))
% 0.54/0.71  (step t457 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4)))) :rule contraction :premises (t456))
% 0.54/0.71  (step t458 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4))) :rule implies :premises (t457))
% 0.54/0.71  (step t459 (cl (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_4)) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_4))) :rule resolution :premises (t458 a18))
% 0.54/0.71  (step t460 (cl (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) :rule resolution :premises (t4 a2 a5 t23 t440 t451 t459))
% 0.54/0.71  (step t461 (cl (not (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4))) (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) :rule or_pos)
% 0.54/0.71  (step t462 (cl (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4) (not (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)))) :rule reordering :premises (t461))
% 0.54/0.71  (step t463 (cl (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)) :rule or_pos)
% 0.54/0.71  (step t464 (cl (tptp.equalish tptp.e_1 tptp.e_3) (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule reordering :premises (t463))
% 0.54/0.71  (step t465 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t466)
% 0.54/0.71  (assume t466.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t466.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_1) (:= W tptp.e_1) (:= Y tptp.e_1) (:= Z tptp.e_3)))
% 0.54/0.71  (step t466.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule or :premises (t466.t1))
% 0.54/0.71  (step t466.t3 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t466.t2 t466.a0))
% 0.54/0.71  (step t466 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule subproof :discharge (t466.a0))
% 0.54/0.71  (step t467 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t465 t466))
% 0.54/0.71  (step t468 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule implies_neg2)
% 0.54/0.71  (step t469 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule resolution :premises (t467 t468))
% 0.54/0.71  (step t470 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule contraction :premises (t469))
% 0.54/0.71  (step t471 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule implies :premises (t470))
% 0.54/0.71  (step t472 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t471 a20))
% 0.54/0.71  (step t473 (cl (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1))) :rule resolution :premises (t464 a7 t14 t472))
% 0.54/0.71  (step t474 (cl (not (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)) :rule or_pos)
% 0.54/0.71  (step t475 (cl (tptp.equalish tptp.e_1 tptp.e_3) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (not (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule reordering :premises (t474))
% 0.54/0.71  (step t476 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t477)
% 0.54/0.71  (assume t477.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))))
% 0.54/0.71  (step t477.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule forall_inst :args ((:= W tptp.e_1) (:= Y tptp.e_3) (:= X tptp.e_3) (:= Z tptp.e_3)))
% 0.54/0.71  (step t477.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule or :premises (t477.t1))
% 0.54/0.71  (step t477.t3 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t477.t2 t477.a0))
% 0.54/0.71  (step t477 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule subproof :discharge (t477.a0))
% 0.54/0.71  (step t478 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t476 t477))
% 0.54/0.71  (step t479 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule implies_neg2)
% 0.54/0.71  (step t480 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule resolution :premises (t478 t479))
% 0.54/0.71  (step t481 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule contraction :premises (t480))
% 0.54/0.71  (step t482 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule implies :premises (t481))
% 0.54/0.71  (step t483 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product1 tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t482 a21))
% 0.54/0.71  (step t484 (cl (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3))) :rule resolution :premises (t475 a7 t60 t483))
% 0.54/0.71  (step t485 (cl (not (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)) :rule or_pos)
% 0.54/0.71  (step t486 (cl (tptp.equalish tptp.e_2 tptp.e_3) (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (not (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule reordering :premises (t485))
% 0.54/0.71  (step t487 (cl (not (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)) :rule or_pos)
% 0.54/0.71  (step t488 (cl (tptp.equalish tptp.e_2 tptp.e_3) (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (not (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule reordering :premises (t487))
% 0.54/0.71  (step t489 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t490)
% 0.54/0.71  (assume t490.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))))
% 0.54/0.71  (step t490.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule forall_inst :args ((:= W tptp.e_2) (:= Y tptp.e_1) (:= X tptp.e_4) (:= Z tptp.e_3)))
% 0.54/0.71  (step t490.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule or :premises (t490.t1))
% 0.54/0.71  (step t490.t3 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t490.t2 t490.a0))
% 0.54/0.71  (step t490 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule subproof :discharge (t490.a0))
% 0.54/0.71  (step t491 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t489 t490))
% 0.54/0.71  (step t492 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule implies_neg2)
% 0.54/0.71  (step t493 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule resolution :premises (t491 t492))
% 0.54/0.71  (step t494 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule contraction :premises (t493))
% 0.54/0.71  (step t495 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 W Y X)) (not (tptp.product1 Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule implies :premises (t494))
% 0.54/0.71  (step t496 (cl (or (not (tptp.product1 tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t495 a21))
% 0.54/0.71  (step t497 (cl (not (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_4))) :rule resolution :premises (t488 a10 t402 t496))
% 0.54/0.71  (step t498 (cl (tptp.product1 tptp.e_3 tptp.e_1 tptp.e_2)) :rule resolution :premises (t331 a2 a4 t342 t353 t497 t361))
% 0.54/0.71  (step t499 (cl (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_3))) :rule resolution :premises (t290 t498 t317 t298))
% 0.54/0.71  (step t500 (cl (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) :rule resolution :premises (t218 a2 a3 t229 t240 t499 t248))
% 0.54/0.71  (step t501 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t502)
% 0.54/0.71  (assume t502.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t502.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_1) (:= W tptp.e_2) (:= Y tptp.e_4) (:= Z tptp.e_3)))
% 0.54/0.71  (step t502.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule or :premises (t502.t1))
% 0.54/0.71  (step t502.t3 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t502.t2 t502.a0))
% 0.54/0.71  (step t502 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule subproof :discharge (t502.a0))
% 0.54/0.71  (step t503 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t501 t502))
% 0.54/0.71  (step t504 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule implies_neg2)
% 0.54/0.71  (step t505 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule resolution :premises (t503 t504))
% 0.54/0.71  (step t506 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule contraction :premises (t505))
% 0.54/0.71  (step t507 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule implies :premises (t506))
% 0.54/0.71  (step t508 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t507 a20))
% 0.54/0.71  (step t509 (cl (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4))) :rule resolution :premises (t486 a10 t500 t508))
% 0.54/0.71  (step t510 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t511)
% 0.54/0.71  (assume t511.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))))
% 0.54/0.71  (step t511.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_1) (:= Y tptp.e_3)))
% 0.54/0.71  (step t511.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4))) :rule or :premises (t511.t1))
% 0.54/0.71  (step t511.t3 (cl (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4))) :rule resolution :premises (t511.t2 t511.a0))
% 0.54/0.71  (step t511 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4))) :rule subproof :discharge (t511.a0))
% 0.54/0.71  (step t512 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4))) :rule resolution :premises (t510 t511))
% 0.54/0.71  (step t513 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4))) (not (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t514 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)))) :rule resolution :premises (t512 t513))
% 0.54/0.71  (step t515 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4)))) :rule contraction :premises (t514))
% 0.54/0.71  (step t516 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product1 X Y tptp.e_1) (tptp.product1 X Y tptp.e_2) (tptp.product1 X Y tptp.e_3) (tptp.product1 X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4))) :rule implies :premises (t515))
% 0.54/0.71  (step t517 (cl (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_4))) :rule resolution :premises (t516 a18))
% 0.54/0.71  (step t518 (cl (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) :rule resolution :premises (t462 a2 a4 t473 t484 t509 t517))
% 0.54/0.71  (step t519 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.54/0.71  (anchor :step t520)
% 0.54/0.71  (assume t520.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))))
% 0.54/0.71  (step t520.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_1) (:= W tptp.e_3) (:= Y tptp.e_2) (:= Z tptp.e_4)))
% 0.54/0.71  (step t520.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule or :premises (t520.t1))
% 0.54/0.71  (step t520.t3 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule resolution :premises (t520.t2 t520.a0))
% 0.54/0.71  (step t520 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule subproof :discharge (t520.a0))
% 0.54/0.71  (step t521 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule resolution :premises (t519 t520))
% 0.54/0.71  (step t522 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) (not (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule implies_neg2)
% 0.54/0.71  (step t523 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule resolution :premises (t521 t522))
% 0.54/0.71  (step t524 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule contraction :premises (t523))
% 0.54/0.71  (step t525 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product1 X W Y)) (not (tptp.product1 X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule implies :premises (t524))
% 0.54/0.72  (step t526 (cl (or (not (tptp.product1 tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product1 tptp.e_1 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule resolution :premises (t525 a20))
% 0.54/0.72  (step t527 (cl) :rule resolution :premises (t2 t460 t518 t526 a14))
% 0.54/0.72  
% 0.54/0.72  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.24MtBlyoFK/cvc5---1.0.5_5025.smt2
% 0.54/0.72  % cvc5---1.0.5 exiting
% 0.54/0.72  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------