%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : GRP127-1.004 : TPTP v8.2.0. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n018.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:16 EDT 2024

% Result   : Unsatisfiable 0.39s 0.60s
% Output   : Proof 0.39s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : GRP127-1.004 : TPTP v8.2.0. Released v1.2.0.
% 0.07/0.14  % Command    : do_cvc5 %s %d
% 0.15/0.34  % Computer : n018.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Sun May 26 17:24:24 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.21/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.39/0.60  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.uazT4mMmBS/cvc5---1.0.5_1852.smt2
% 0.39/0.60  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.uazT4mMmBS/cvc5---1.0.5_1852.smt2
% 0.39/0.62  (assume a0 (tptp.group_element tptp.e_1))
% 0.39/0.62  (assume a1 (tptp.group_element tptp.e_2))
% 0.39/0.62  (assume a2 (tptp.group_element tptp.e_3))
% 0.39/0.62  (assume a3 (tptp.group_element tptp.e_4))
% 0.39/0.62  (assume a4 (not (tptp.equalish tptp.e_1 tptp.e_2)))
% 0.39/0.62  (assume a5 (not (tptp.equalish tptp.e_1 tptp.e_3)))
% 0.39/0.62  (assume a6 (not (tptp.equalish tptp.e_1 tptp.e_4)))
% 0.39/0.62  (assume a7 (not (tptp.equalish tptp.e_2 tptp.e_1)))
% 0.39/0.62  (assume a8 (not (tptp.equalish tptp.e_2 tptp.e_3)))
% 0.39/0.62  (assume a9 (not (tptp.equalish tptp.e_2 tptp.e_4)))
% 0.39/0.62  (assume a10 (not (tptp.equalish tptp.e_3 tptp.e_1)))
% 0.39/0.62  (assume a11 (not (tptp.equalish tptp.e_3 tptp.e_2)))
% 0.39/0.62  (assume a12 (not (tptp.equalish tptp.e_3 tptp.e_4)))
% 0.39/0.62  (assume a13 (not (tptp.equalish tptp.e_4 tptp.e_1)))
% 0.39/0.62  (assume a14 (not (tptp.equalish tptp.e_4 tptp.e_2)))
% 0.39/0.62  (assume a15 (not (tptp.equalish tptp.e_4 tptp.e_3)))
% 0.39/0.62  (assume a16 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))))
% 0.39/0.62  (assume a17 (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product X Y W)) (not (tptp.product X Y Z)) (tptp.equalish W Z))))
% 0.39/0.62  (assume a18 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))))
% 0.39/0.62  (assume a19 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))))
% 0.39/0.62  (assume a20 (forall ((X $$unsorted)) (tptp.product X X X)))
% 0.39/0.62  (assume a21 (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))))
% 0.39/0.62  (step t1 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t2)
% 0.39/0.62  (assume t2.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))))
% 0.39/0.62  (step t2.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_2) (:= W tptp.e_4) (:= Y tptp.e_3) (:= Z tptp.e_1)))
% 0.39/0.62  (step t2.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule or :premises (t2.t1))
% 0.39/0.62  (step t2.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule resolution :premises (t2.t2 t2.a0))
% 0.39/0.62  (step t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule subproof :discharge (t2.a0))
% 0.39/0.62  (step t3 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule resolution :premises (t1 t2))
% 0.39/0.62  (step t4 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1))) (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule implies_neg2)
% 0.39/0.62  (step t5 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule resolution :premises (t3 t4))
% 0.39/0.62  (step t6 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule contraction :premises (t5))
% 0.39/0.62  (step t7 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule implies :premises (t6))
% 0.39/0.62  (step t8 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1))) (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1)) :rule or_pos)
% 0.39/0.62  (step t9 (cl (tptp.equalish tptp.e_4 tptp.e_1) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule reordering :premises (t8))
% 0.39/0.62  (step t10 (cl (not (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product tptp.e_2 tptp.e_1 tptp.e_4))) (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) :rule or_pos)
% 0.39/0.62  (step t11 (cl (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product 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.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)))) :rule reordering :premises (t10))
% 0.39/0.62  (step t12 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)) :rule or_pos)
% 0.39/0.62  (step t13 (cl (tptp.equalish tptp.e_1 tptp.e_2) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (not (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule reordering :premises (t12))
% 0.39/0.62  (step t14 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (forall ((X $$unsorted)) (tptp.product X X X))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t15)
% 0.39/0.62  (assume t15.a0 (forall ((X $$unsorted)) (tptp.product X X X)))
% 0.39/0.62  (step t15.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_1 tptp.e_1 tptp.e_1))) :rule forall_inst :args ((:= X tptp.e_1)))
% 0.39/0.62  (step t15.t2 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) :rule or :premises (t15.t1))
% 0.39/0.62  (step t15.t3 (cl (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) :rule resolution :premises (t15.t2 t15.a0))
% 0.39/0.62  (step t15 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) :rule subproof :discharge (t15.a0))
% 0.39/0.62  (step t16 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) :rule resolution :premises (t14 t15))
% 0.39/0.62  (step t17 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1))) :rule implies_neg2)
% 0.39/0.62  (step t18 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_1 tptp.e_1 tptp.e_1))) :rule resolution :premises (t16 t17))
% 0.39/0.62  (step t19 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_1 tptp.e_1 tptp.e_1))) :rule contraction :premises (t18))
% 0.39/0.62  (step t20 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) :rule implies :premises (t19))
% 0.39/0.62  (step t21 (cl (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) :rule resolution :premises (t20 a20))
% 0.39/0.62  (step t22 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product 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.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t23)
% 0.39/0.62  (assume t23.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))))
% 0.39/0.62  (step t23.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product 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.39/0.62  (step t23.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule or :premises (t23.t1))
% 0.39/0.62  (step t23.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t23.t2 t23.a0))
% 0.39/0.62  (step t23 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule subproof :discharge (t23.a0))
% 0.39/0.62  (step t24 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t22 t23))
% 0.39/0.62  (step t25 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule implies_neg2)
% 0.39/0.62  (step t26 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product 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.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule resolution :premises (t24 t25))
% 0.39/0.62  (step t27 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule contraction :premises (t26))
% 0.39/0.62  (step t28 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule implies :premises (t27))
% 0.39/0.62  (step t29 (cl (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t28 a19))
% 0.39/0.62  (step t30 (cl (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1))) :rule resolution :premises (t13 a4 t21 t29))
% 0.39/0.62  (step t31 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)) :rule or_pos)
% 0.39/0.62  (step t32 (cl (tptp.equalish tptp.e_1 tptp.e_2) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule reordering :premises (t31))
% 0.39/0.62  (step t33 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (forall ((X $$unsorted)) (tptp.product X X X))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t34)
% 0.39/0.62  (assume t34.a0 (forall ((X $$unsorted)) (tptp.product X X X)))
% 0.39/0.62  (step t34.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_2 tptp.e_2 tptp.e_2))) :rule forall_inst :args ((:= X tptp.e_2)))
% 0.39/0.62  (step t34.t2 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) :rule or :premises (t34.t1))
% 0.39/0.62  (step t34.t3 (cl (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) :rule resolution :premises (t34.t2 t34.a0))
% 0.39/0.62  (step t34 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) :rule subproof :discharge (t34.a0))
% 0.39/0.62  (step t35 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) :rule resolution :premises (t33 t34))
% 0.39/0.62  (step t36 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2))) :rule implies_neg2)
% 0.39/0.62  (step t37 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_2))) :rule resolution :premises (t35 t36))
% 0.39/0.62  (step t38 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_2))) :rule contraction :premises (t37))
% 0.39/0.62  (step t39 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) :rule implies :premises (t38))
% 0.39/0.62  (step t40 (cl (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) :rule resolution :premises (t39 a20))
% 0.39/0.62  (step t41 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t42)
% 0.39/0.62  (assume t42.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))))
% 0.39/0.62  (step t42.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product 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) (:= W tptp.e_1) (:= Y tptp.e_2) (:= Z tptp.e_2)))
% 0.39/0.62  (step t42.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule or :premises (t42.t1))
% 0.39/0.62  (step t42.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t42.t2 t42.a0))
% 0.39/0.62  (step t42 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule subproof :discharge (t42.a0))
% 0.39/0.62  (step t43 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t41 t42))
% 0.39/0.62  (step t44 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule implies_neg2)
% 0.39/0.62  (step t45 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule resolution :premises (t43 t44))
% 0.39/0.62  (step t46 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule contraction :premises (t45))
% 0.39/0.62  (step t47 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule implies :premises (t46))
% 0.39/0.62  (step t48 (cl (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t47 a18))
% 0.39/0.62  (step t49 (cl (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2))) :rule resolution :premises (t32 a4 t40 t48))
% 0.39/0.62  (step t50 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)) :rule or_pos)
% 0.39/0.62  (step t51 (cl (tptp.equalish tptp.e_2 tptp.e_3) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule reordering :premises (t50))
% 0.39/0.62  (step t52 (cl (not (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product tptp.e_3 tptp.e_1 tptp.e_4))) (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) :rule or_pos)
% 0.39/0.62  (step t53 (cl (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product 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.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)))) :rule reordering :premises (t52))
% 0.39/0.62  (step t54 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)) :rule or_pos)
% 0.39/0.62  (step t55 (cl (tptp.equalish tptp.e_1 tptp.e_3) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (not (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule reordering :premises (t54))
% 0.39/0.62  (step t56 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product 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.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t57)
% 0.39/0.62  (assume t57.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))))
% 0.39/0.62  (step t57.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product 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.39/0.62  (step t57.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule or :premises (t57.t1))
% 0.39/0.62  (step t57.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t57.t2 t57.a0))
% 0.39/0.62  (step t57 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule subproof :discharge (t57.a0))
% 0.39/0.62  (step t58 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t56 t57))
% 0.39/0.62  (step t59 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule implies_neg2)
% 0.39/0.62  (step t60 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product 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.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule resolution :premises (t58 t59))
% 0.39/0.62  (step t61 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule contraction :premises (t60))
% 0.39/0.62  (step t62 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule implies :premises (t61))
% 0.39/0.62  (step t63 (cl (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t62 a19))
% 0.39/0.62  (step t64 (cl (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1))) :rule resolution :premises (t55 a5 t21 t63))
% 0.39/0.62  (step t65 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2))) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) :rule or_pos)
% 0.39/0.62  (step t66 (cl (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (not (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)))) :rule reordering :premises (t65))
% 0.39/0.62  (step t67 (cl (not (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product tptp.e_1 tptp.e_2 tptp.e_4))) (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) :rule or_pos)
% 0.39/0.62  (step t68 (cl (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product 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.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)))) :rule reordering :premises (t67))
% 0.39/0.62  (step t69 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)) :rule or_pos)
% 0.39/0.62  (step t70 (cl (tptp.equalish tptp.e_1 tptp.e_2) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (not (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule reordering :premises (t69))
% 0.39/0.62  (step t71 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product 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.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t72)
% 0.39/0.62  (assume t72.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))))
% 0.39/0.62  (step t72.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product 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.39/0.62  (step t72.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule or :premises (t72.t1))
% 0.39/0.62  (step t72.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t72.t2 t72.a0))
% 0.39/0.62  (step t72 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule subproof :discharge (t72.a0))
% 0.39/0.62  (step t73 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t71 t72))
% 0.39/0.62  (step t74 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) (not (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule implies_neg2)
% 0.39/0.62  (step t75 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product 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.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule resolution :premises (t73 t74))
% 0.39/0.62  (step t76 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule contraction :premises (t75))
% 0.39/0.62  (step t77 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule implies :premises (t76))
% 0.39/0.62  (step t78 (cl (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t77 a18))
% 0.39/0.62  (step t79 (cl (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1))) :rule resolution :premises (t70 a4 t21 t78))
% 0.39/0.62  (step t80 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)) :rule or_pos)
% 0.39/0.62  (step t81 (cl (tptp.equalish tptp.e_2 tptp.e_1) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule reordering :premises (t80))
% 0.39/0.62  (step t82 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product 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.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t83)
% 0.39/0.62  (assume t83.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))))
% 0.39/0.62  (step t83.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product 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.39/0.62  (step t83.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule or :premises (t83.t1))
% 0.39/0.62  (step t83.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t83.t2 t83.a0))
% 0.39/0.62  (step t83 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule subproof :discharge (t83.a0))
% 0.39/0.62  (step t84 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t82 t83))
% 0.39/0.62  (step t85 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (not (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule implies_neg2)
% 0.39/0.62  (step t86 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product 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.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule resolution :premises (t84 t85))
% 0.39/0.62  (step t87 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule contraction :premises (t86))
% 0.39/0.62  (step t88 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule implies :premises (t87))
% 0.39/0.62  (step t89 (cl (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t88 a19))
% 0.39/0.62  (step t90 (cl (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2))) :rule resolution :premises (t81 a7 t40 t89))
% 0.39/0.62  (step t91 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2))) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) :rule or_pos)
% 0.39/0.62  (step t92 (cl (tptp.product tptp.e_2 tptp.e_3 tptp.e_2) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)))) :rule reordering :premises (t91))
% 0.39/0.62  (step t93 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2))) (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t94)
% 0.39/0.62  (assume t94.a0 (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))))
% 0.39/0.62  (step t94.t1 (cl (or (not (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)))) :rule forall_inst :args ((:= Y tptp.e_3) (:= X tptp.e_2) (:= Z1 tptp.e_1) (:= Z2 tptp.e_2)))
% 0.39/0.62  (step t94.t2 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2))) :rule or :premises (t94.t1))
% 0.39/0.62  (step t94.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2))) :rule resolution :premises (t94.t2 t94.a0))
% 0.39/0.62  (step t94 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2))) :rule subproof :discharge (t94.a0))
% 0.39/0.62  (step t95 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2))) :rule resolution :premises (t93 t94))
% 0.39/0.62  (step t96 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2))) (not (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)))) :rule implies_neg2)
% 0.39/0.62  (step t97 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2))) (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)))) :rule resolution :premises (t95 t96))
% 0.39/0.62  (step t98 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)))) :rule contraction :premises (t97))
% 0.39/0.62  (step t99 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2))) :rule implies :premises (t98))
% 0.39/0.62  (step t100 (cl (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_2))) :rule resolution :premises (t99 a21))
% 0.39/0.62  (step t101 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2)) :rule or_pos)
% 0.39/0.62  (step t102 (cl (tptp.equalish tptp.e_3 tptp.e_2) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule reordering :premises (t101))
% 0.39/0.62  (step t103 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t104)
% 0.39/0.62  (assume t104.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))))
% 0.39/0.62  (step t104.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_2) (:= W tptp.e_3) (:= Y tptp.e_2) (:= Z tptp.e_2)))
% 0.39/0.62  (step t104.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule or :premises (t104.t1))
% 0.39/0.62  (step t104.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t104.t2 t104.a0))
% 0.39/0.62  (step t104 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule subproof :discharge (t104.a0))
% 0.39/0.62  (step t105 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t103 t104))
% 0.39/0.62  (step t106 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) (not (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule implies_neg2)
% 0.39/0.62  (step t107 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule resolution :premises (t105 t106))
% 0.39/0.62  (step t108 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule contraction :premises (t107))
% 0.39/0.62  (step t109 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule implies :premises (t108))
% 0.39/0.62  (step t110 (cl (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t109 a18))
% 0.39/0.62  (step t111 (cl (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_2))) :rule resolution :premises (t102 a11 t40 t110))
% 0.39/0.62  (step t112 (cl (not (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product tptp.e_1 tptp.e_3 tptp.e_4))) (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) :rule or_pos)
% 0.39/0.62  (step t113 (cl (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product 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.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)))) :rule reordering :premises (t112))
% 0.39/0.62  (step t114 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1))) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1)) :rule or_pos)
% 0.39/0.62  (step t115 (cl (tptp.equalish tptp.e_3 tptp.e_1) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1)))) :rule reordering :premises (t114))
% 0.39/0.62  (step t116 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t117)
% 0.39/0.62  (assume t117.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))))
% 0.39/0.62  (step t117.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_1) (:= W tptp.e_3) (:= Y tptp.e_1) (:= Z tptp.e_1)))
% 0.39/0.62  (step t117.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1))) :rule or :premises (t117.t1))
% 0.39/0.62  (step t117.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1))) :rule resolution :premises (t117.t2 t117.a0))
% 0.39/0.62  (step t117 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1))) :rule subproof :discharge (t117.a0))
% 0.39/0.62  (step t118 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1))) :rule resolution :premises (t116 t117))
% 0.39/0.62  (step t119 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1))) (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1)))) :rule implies_neg2)
% 0.39/0.62  (step t120 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1)))) :rule resolution :premises (t118 t119))
% 0.39/0.62  (step t121 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1)))) :rule contraction :premises (t120))
% 0.39/0.62  (step t122 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1))) :rule implies :premises (t121))
% 0.39/0.62  (step t123 (cl (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_1))) :rule resolution :premises (t122 a18))
% 0.39/0.62  (step t124 (cl (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1))) :rule resolution :premises (t115 a10 t21 t123))
% 0.39/0.62  (step t125 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)) :rule or_pos)
% 0.39/0.62  (step t126 (cl (tptp.equalish tptp.e_1 tptp.e_3) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule reordering :premises (t125))
% 0.39/0.62  (step t127 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (forall ((X $$unsorted)) (tptp.product X X X))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t128)
% 0.39/0.62  (assume t128.a0 (forall ((X $$unsorted)) (tptp.product X X X)))
% 0.39/0.62  (step t128.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_3 tptp.e_3 tptp.e_3))) :rule forall_inst :args ((:= X tptp.e_3)))
% 0.39/0.62  (step t128.t2 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) :rule or :premises (t128.t1))
% 0.39/0.62  (step t128.t3 (cl (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) :rule resolution :premises (t128.t2 t128.a0))
% 0.39/0.62  (step t128 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) :rule subproof :discharge (t128.a0))
% 0.39/0.62  (step t129 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) :rule resolution :premises (t127 t128))
% 0.39/0.62  (step t130 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3))) :rule implies_neg2)
% 0.39/0.62  (step t131 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_3))) :rule resolution :premises (t129 t130))
% 0.39/0.62  (step t132 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_3))) :rule contraction :premises (t131))
% 0.39/0.62  (step t133 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) :rule implies :premises (t132))
% 0.39/0.62  (step t134 (cl (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) :rule resolution :premises (t133 a20))
% 0.39/0.62  (step t135 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product 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.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t136)
% 0.39/0.62  (assume t136.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))))
% 0.39/0.62  (step t136.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product 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.39/0.62  (step t136.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule or :premises (t136.t1))
% 0.39/0.62  (step t136.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t136.t2 t136.a0))
% 0.39/0.62  (step t136 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule subproof :discharge (t136.a0))
% 0.39/0.62  (step t137 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t135 t136))
% 0.39/0.62  (step t138 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule implies_neg2)
% 0.39/0.62  (step t139 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product 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.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule resolution :premises (t137 t138))
% 0.39/0.62  (step t140 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule contraction :premises (t139))
% 0.39/0.62  (step t141 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule implies :premises (t140))
% 0.39/0.62  (step t142 (cl (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t141 a19))
% 0.39/0.62  (step t143 (cl (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3))) :rule resolution :premises (t126 a5 t134 t142))
% 0.39/0.62  (step t144 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product 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.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t145)
% 0.39/0.62  (assume t145.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))))
% 0.39/0.62  (step t145.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_1) (:= Y tptp.e_3)))
% 0.39/0.62  (step t145.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product tptp.e_1 tptp.e_3 tptp.e_4))) :rule or :premises (t145.t1))
% 0.39/0.62  (step t145.t3 (cl (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product tptp.e_1 tptp.e_3 tptp.e_4))) :rule resolution :premises (t145.t2 t145.a0))
% 0.39/0.62  (step t145 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product tptp.e_1 tptp.e_3 tptp.e_4))) :rule subproof :discharge (t145.a0))
% 0.39/0.62  (step t146 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product 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.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product tptp.e_1 tptp.e_3 tptp.e_4))) :rule resolution :premises (t144 t145))
% 0.39/0.62  (step t147 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product 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.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)))) :rule implies_neg2)
% 0.39/0.62  (step t148 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product 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.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)))) :rule resolution :premises (t146 t147))
% 0.39/0.62  (step t149 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)))) :rule contraction :premises (t148))
% 0.39/0.62  (step t150 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product tptp.e_1 tptp.e_3 tptp.e_4))) :rule implies :premises (t149))
% 0.39/0.62  (step t151 (cl (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_1 tptp.e_3 tptp.e_1) (tptp.product tptp.e_1 tptp.e_3 tptp.e_2) (tptp.product tptp.e_1 tptp.e_3 tptp.e_3) (tptp.product tptp.e_1 tptp.e_3 tptp.e_4))) :rule resolution :premises (t150 a16))
% 0.39/0.62  (step t152 (cl (not (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) :rule or_pos)
% 0.39/0.62  (step t153 (cl (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product 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.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)))) :rule reordering :premises (t152))
% 0.39/0.62  (step t154 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)) :rule or_pos)
% 0.39/0.62  (step t155 (cl (tptp.equalish tptp.e_2 tptp.e_3) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (not (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule reordering :premises (t154))
% 0.39/0.62  (step t156 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product 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.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t157)
% 0.39/0.62  (assume t157.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))))
% 0.39/0.62  (step t157.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product 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.39/0.62  (step t157.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule or :premises (t157.t1))
% 0.39/0.62  (step t157.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t157.t2 t157.a0))
% 0.39/0.62  (step t157 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule subproof :discharge (t157.a0))
% 0.39/0.62  (step t158 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t156 t157))
% 0.39/0.62  (step t159 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule implies_neg2)
% 0.39/0.62  (step t160 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product 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.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule resolution :premises (t158 t159))
% 0.39/0.62  (step t161 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule contraction :premises (t160))
% 0.39/0.62  (step t162 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule implies :premises (t161))
% 0.39/0.62  (step t163 (cl (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t162 a19))
% 0.39/0.62  (step t164 (cl (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2))) :rule resolution :premises (t155 a8 t40 t163))
% 0.39/0.62  (step t165 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2)) :rule or_pos)
% 0.39/0.62  (step t166 (cl (tptp.equalish tptp.e_3 tptp.e_2) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule reordering :premises (t165))
% 0.39/0.62  (step t167 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t168)
% 0.39/0.62  (assume t168.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))))
% 0.39/0.62  (step t168.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_3) (:= W tptp.e_3) (:= Y tptp.e_3) (:= Z tptp.e_2)))
% 0.39/0.62  (step t168.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule or :premises (t168.t1))
% 0.39/0.62  (step t168.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t168.t2 t168.a0))
% 0.39/0.62  (step t168 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule subproof :discharge (t168.a0))
% 0.39/0.62  (step t169 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t167 t168))
% 0.39/0.62  (step t170 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) (not (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule implies_neg2)
% 0.39/0.62  (step t171 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule resolution :premises (t169 t170))
% 0.39/0.62  (step t172 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule contraction :premises (t171))
% 0.39/0.62  (step t173 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule implies :premises (t172))
% 0.39/0.62  (step t174 (cl (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t173 a18))
% 0.39/0.62  (step t175 (cl (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3))) :rule resolution :premises (t166 a11 t134 t174))
% 0.39/0.62  (step t176 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product 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.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t177)
% 0.39/0.62  (assume t177.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))))
% 0.39/0.62  (step t177.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_3) (:= Y tptp.e_2)))
% 0.39/0.62  (step t177.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) :rule or :premises (t177.t1))
% 0.39/0.62  (step t177.t3 (cl (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) :rule resolution :premises (t177.t2 t177.a0))
% 0.39/0.62  (step t177 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) :rule subproof :discharge (t177.a0))
% 0.39/0.62  (step t178 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product 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.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) :rule resolution :premises (t176 t177))
% 0.39/0.62  (step t179 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product 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.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)))) :rule implies_neg2)
% 0.39/0.62  (step t180 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product 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.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)))) :rule resolution :premises (t178 t179))
% 0.39/0.62  (step t181 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)))) :rule contraction :premises (t180))
% 0.39/0.62  (step t182 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) :rule implies :premises (t181))
% 0.39/0.62  (step t183 (cl (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_1) (tptp.product tptp.e_3 tptp.e_2 tptp.e_2) (tptp.product tptp.e_3 tptp.e_2 tptp.e_3) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) :rule resolution :premises (t182 a16))
% 0.39/0.62  (step t184 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2))) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2)) :rule or_pos)
% 0.39/0.62  (step t185 (cl (tptp.equalish tptp.e_3 tptp.e_2) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule reordering :premises (t184))
% 0.39/0.62  (step t186 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t187)
% 0.39/0.62  (assume t187.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))))
% 0.39/0.62  (step t187.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_1) (:= W tptp.e_3) (:= Y tptp.e_4) (:= Z tptp.e_2)))
% 0.39/0.62  (step t187.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule or :premises (t187.t1))
% 0.39/0.62  (step t187.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t187.t2 t187.a0))
% 0.39/0.62  (step t187 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule subproof :discharge (t187.a0))
% 0.39/0.62  (step t188 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t186 t187))
% 0.39/0.62  (step t189 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2))) (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule implies_neg2)
% 0.39/0.62  (step t190 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule resolution :premises (t188 t189))
% 0.39/0.62  (step t191 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule contraction :premises (t190))
% 0.39/0.62  (step t192 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule implies :premises (t191))
% 0.39/0.62  (step t193 (cl (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t192 a18))
% 0.39/0.62  (step t194 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3)) :rule or_pos)
% 0.39/0.62  (step t195 (cl (tptp.equalish tptp.e_1 tptp.e_3) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule reordering :premises (t194))
% 0.39/0.62  (step t196 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t197)
% 0.39/0.62  (assume t197.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))))
% 0.39/0.62  (step t197.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule forall_inst :args ((:= W tptp.e_1) (:= Y tptp.e_2) (:= X tptp.e_4) (:= Z tptp.e_3)))
% 0.39/0.62  (step t197.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule or :premises (t197.t1))
% 0.39/0.62  (step t197.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t197.t2 t197.a0))
% 0.39/0.62  (step t197 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule subproof :discharge (t197.a0))
% 0.39/0.62  (step t198 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t196 t197))
% 0.39/0.62  (step t199 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) (not (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule implies_neg2)
% 0.39/0.62  (step t200 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule resolution :premises (t198 t199))
% 0.39/0.62  (step t201 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule contraction :premises (t200))
% 0.39/0.62  (step t202 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule implies :premises (t201))
% 0.39/0.62  (step t203 (cl (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t202 a19))
% 0.39/0.62  (step t204 (cl (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4))) :rule resolution :premises (t92 t100 t111 t113 t124 t143 t151 a2 a0 t153 t164 t175 t183 a2 a1 t185 t193 a11 t195 t203 a5))
% 0.39/0.62  (step t205 (cl (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4))) :rule contraction :premises (t204))
% 0.39/0.62  (step t206 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product 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.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t207)
% 0.39/0.62  (assume t207.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))))
% 0.39/0.62  (step t207.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_1) (:= Y tptp.e_2)))
% 0.39/0.62  (step t207.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product tptp.e_1 tptp.e_2 tptp.e_4))) :rule or :premises (t207.t1))
% 0.39/0.62  (step t207.t3 (cl (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product tptp.e_1 tptp.e_2 tptp.e_4))) :rule resolution :premises (t207.t2 t207.a0))
% 0.39/0.62  (step t207 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product tptp.e_1 tptp.e_2 tptp.e_4))) :rule subproof :discharge (t207.a0))
% 0.39/0.62  (step t208 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product 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.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product tptp.e_1 tptp.e_2 tptp.e_4))) :rule resolution :premises (t206 t207))
% 0.39/0.62  (step t209 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product 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.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)))) :rule implies_neg2)
% 0.39/0.62  (step t210 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product 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.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)))) :rule resolution :premises (t208 t209))
% 0.39/0.62  (step t211 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)))) :rule contraction :premises (t210))
% 0.39/0.62  (step t212 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product tptp.e_1 tptp.e_2 tptp.e_4))) :rule implies :premises (t211))
% 0.39/0.62  (step t213 (cl (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_1 tptp.e_2 tptp.e_1) (tptp.product tptp.e_1 tptp.e_2 tptp.e_2) (tptp.product tptp.e_1 tptp.e_2 tptp.e_3) (tptp.product tptp.e_1 tptp.e_2 tptp.e_4))) :rule resolution :premises (t212 a16))
% 0.39/0.62  (step t214 (cl (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) :rule resolution :premises (t68 a0 a1 t79 t90 t205 t213))
% 0.39/0.62  (step t215 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2))) (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t216)
% 0.39/0.62  (assume t216.a0 (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))))
% 0.39/0.62  (step t216.t1 (cl (or (not (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)))) :rule forall_inst :args ((:= Y tptp.e_1) (:= X tptp.e_2) (:= Z1 tptp.e_3) (:= Z2 tptp.e_2)))
% 0.39/0.62  (step t216.t2 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2))) :rule or :premises (t216.t1))
% 0.39/0.62  (step t216.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2))) :rule resolution :premises (t216.t2 t216.a0))
% 0.39/0.62  (step t216 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2))) :rule subproof :discharge (t216.a0))
% 0.39/0.62  (step t217 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2))) :rule resolution :premises (t215 t216))
% 0.39/0.62  (step t218 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2))) (not (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)))) :rule implies_neg2)
% 0.39/0.62  (step t219 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2))) (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)))) :rule resolution :premises (t217 t218))
% 0.39/0.62  (step t220 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)))) :rule contraction :premises (t219))
% 0.39/0.62  (step t221 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2))) :rule implies :premises (t220))
% 0.39/0.62  (step t222 (cl (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2))) :rule resolution :premises (t221 a21))
% 0.39/0.62  (step t223 (cl (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2))) :rule resolution :premises (t66 t214 t49 t222))
% 0.39/0.62  (step t224 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1))) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1)) :rule or_pos)
% 0.39/0.62  (step t225 (cl (tptp.equalish tptp.e_3 tptp.e_1) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1)))) :rule reordering :premises (t224))
% 0.39/0.62  (step t226 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t227)
% 0.39/0.62  (assume t227.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))))
% 0.39/0.62  (step t227.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_3) (:= W tptp.e_3) (:= Y tptp.e_3) (:= Z tptp.e_1)))
% 0.39/0.62  (step t227.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1))) :rule or :premises (t227.t1))
% 0.39/0.62  (step t227.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1))) :rule resolution :premises (t227.t2 t227.a0))
% 0.39/0.62  (step t227 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1))) :rule subproof :discharge (t227.a0))
% 0.39/0.62  (step t228 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1))) :rule resolution :premises (t226 t227))
% 0.39/0.62  (step t229 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1))) (not (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1)))) :rule implies_neg2)
% 0.39/0.62  (step t230 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1)))) :rule resolution :premises (t228 t229))
% 0.39/0.62  (step t231 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1)))) :rule contraction :premises (t230))
% 0.39/0.62  (step t232 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1))) :rule implies :premises (t231))
% 0.39/0.62  (step t233 (cl (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_1))) :rule resolution :premises (t232 a18))
% 0.39/0.62  (step t234 (cl (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3))) :rule resolution :premises (t225 a10 t134 t233))
% 0.39/0.62  (step t235 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product 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.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t236)
% 0.39/0.62  (assume t236.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))))
% 0.39/0.62  (step t236.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_3) (:= Y tptp.e_1)))
% 0.39/0.62  (step t236.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product tptp.e_3 tptp.e_1 tptp.e_4))) :rule or :premises (t236.t1))
% 0.39/0.62  (step t236.t3 (cl (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product tptp.e_3 tptp.e_1 tptp.e_4))) :rule resolution :premises (t236.t2 t236.a0))
% 0.39/0.62  (step t236 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product tptp.e_3 tptp.e_1 tptp.e_4))) :rule subproof :discharge (t236.a0))
% 0.39/0.62  (step t237 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product 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.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product tptp.e_3 tptp.e_1 tptp.e_4))) :rule resolution :premises (t235 t236))
% 0.39/0.62  (step t238 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product 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.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)))) :rule implies_neg2)
% 0.39/0.62  (step t239 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product 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.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)))) :rule resolution :premises (t237 t238))
% 0.39/0.62  (step t240 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)))) :rule contraction :premises (t239))
% 0.39/0.62  (step t241 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product tptp.e_3 tptp.e_1 tptp.e_4))) :rule implies :premises (t240))
% 0.39/0.62  (step t242 (cl (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_3 tptp.e_1 tptp.e_1) (tptp.product tptp.e_3 tptp.e_1 tptp.e_2) (tptp.product tptp.e_3 tptp.e_1 tptp.e_3) (tptp.product tptp.e_3 tptp.e_1 tptp.e_4))) :rule resolution :premises (t241 a16))
% 0.39/0.62  (step t243 (cl (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) :rule resolution :premises (t53 a0 a2 t64 t223 t234 t242))
% 0.39/0.62  (step t244 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product 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.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t245)
% 0.39/0.62  (assume t245.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))))
% 0.39/0.62  (step t245.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product 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.39/0.62  (step t245.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule or :premises (t245.t1))
% 0.39/0.62  (step t245.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t245.t2 t245.a0))
% 0.39/0.62  (step t245 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule subproof :discharge (t245.a0))
% 0.39/0.62  (step t246 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t244 t245))
% 0.39/0.62  (step t247 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule implies_neg2)
% 0.39/0.62  (step t248 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product 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.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule resolution :premises (t246 t247))
% 0.39/0.62  (step t249 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule contraction :premises (t248))
% 0.39/0.62  (step t250 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule implies :premises (t249))
% 0.39/0.62  (step t251 (cl (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t250 a19))
% 0.39/0.62  (step t252 (cl (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4))) :rule resolution :premises (t51 a8 t243 t251))
% 0.39/0.62  (step t253 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product 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.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t254)
% 0.39/0.62  (assume t254.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))))
% 0.39/0.62  (step t254.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_1)))
% 0.39/0.62  (step t254.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product tptp.e_2 tptp.e_1 tptp.e_4))) :rule or :premises (t254.t1))
% 0.39/0.62  (step t254.t3 (cl (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product tptp.e_2 tptp.e_1 tptp.e_4))) :rule resolution :premises (t254.t2 t254.a0))
% 0.39/0.62  (step t254 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product tptp.e_2 tptp.e_1 tptp.e_4))) :rule subproof :discharge (t254.a0))
% 0.39/0.62  (step t255 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product 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.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product tptp.e_2 tptp.e_1 tptp.e_4))) :rule resolution :premises (t253 t254))
% 0.39/0.62  (step t256 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product 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.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)))) :rule implies_neg2)
% 0.39/0.62  (step t257 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product 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.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)))) :rule resolution :premises (t255 t256))
% 0.39/0.62  (step t258 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)))) :rule contraction :premises (t257))
% 0.39/0.62  (step t259 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product tptp.e_2 tptp.e_1 tptp.e_4))) :rule implies :premises (t258))
% 0.39/0.62  (step t260 (cl (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_2 tptp.e_1 tptp.e_1) (tptp.product tptp.e_2 tptp.e_1 tptp.e_2) (tptp.product tptp.e_2 tptp.e_1 tptp.e_3) (tptp.product tptp.e_2 tptp.e_1 tptp.e_4))) :rule resolution :premises (t259 a16))
% 0.39/0.62  (step t261 (cl (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) :rule resolution :premises (t11 a0 a1 t30 t49 t252 t260))
% 0.39/0.62  (step t262 (cl (not (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product tptp.e_2 tptp.e_4 tptp.e_4))) (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) :rule or_pos)
% 0.39/0.62  (step t263 (cl (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product 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.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)))) :rule reordering :premises (t262))
% 0.39/0.62  (step t264 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) :rule or_pos)
% 0.39/0.62  (step t265 (cl (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4) (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)))) :rule reordering :premises (t264))
% 0.39/0.62  (step t266 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1))) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1)) :rule or_pos)
% 0.39/0.62  (step t267 (cl (tptp.equalish tptp.e_2 tptp.e_1) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule reordering :premises (t266))
% 0.39/0.62  (step t268 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.62  (anchor :step t269)
% 0.39/0.62  (assume t269.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))))
% 0.39/0.62  (step t269.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_3) (:= W tptp.e_2) (:= Y tptp.e_4) (:= Z tptp.e_1)))
% 0.39/0.62  (step t269.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule or :premises (t269.t1))
% 0.39/0.63  (step t269.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t269.t2 t269.a0))
% 0.39/0.63  (step t269 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule subproof :discharge (t269.a0))
% 0.39/0.63  (step t270 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t268 t269))
% 0.39/0.63  (step t271 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1))) (not (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule implies_neg2)
% 0.39/0.63  (step t272 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule resolution :premises (t270 t271))
% 0.39/0.63  (step t273 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule contraction :premises (t272))
% 0.39/0.63  (step t274 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule implies :premises (t273))
% 0.39/0.63  (step t275 (cl (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t274 a18))
% 0.39/0.63  (step t276 (cl (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) :rule resolution :premises (t267 a7 t243 t275))
% 0.39/0.63  (step t277 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) :rule implies_neg1)
% 0.39/0.63  (anchor :step t278)
% 0.39/0.63  (assume t278.a0 (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))))
% 0.39/0.63  (step t278.t1 (cl (or (not (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)))) :rule forall_inst :args ((:= Y tptp.e_2) (:= X tptp.e_4) (:= Z1 tptp.e_1) (:= Z2 tptp.e_3)))
% 0.39/0.63  (step t278.t2 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) :rule or :premises (t278.t1))
% 0.39/0.63  (step t278.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) :rule resolution :premises (t278.t2 t278.a0))
% 0.39/0.63  (step t278 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) :rule subproof :discharge (t278.a0))
% 0.39/0.63  (step t279 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) :rule resolution :premises (t277 t278))
% 0.39/0.63  (step t280 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)))) :rule implies_neg2)
% 0.39/0.63  (step t281 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)))) :rule resolution :premises (t279 t280))
% 0.39/0.63  (step t282 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4)))) :rule contraction :premises (t281))
% 0.39/0.63  (step t283 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product Y X Z1)) (not (tptp.product Z1 Y Z2)) (tptp.product Z2 Y X)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) :rule implies :premises (t282))
% 0.39/0.63  (step t284 (cl (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) :rule resolution :premises (t283 a21))
% 0.39/0.63  (step t285 (cl (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1))) :rule resolution :premises (t265 t214 t276 t284))
% 0.39/0.63  (step t286 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2))) (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2)) :rule or_pos)
% 0.39/0.63  (step t287 (cl (tptp.equalish tptp.e_4 tptp.e_2) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2)))) :rule reordering :premises (t286))
% 0.39/0.63  (step t288 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.63  (anchor :step t289)
% 0.39/0.63  (assume t289.a0 (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))))
% 0.39/0.63  (step t289.t1 (cl (or (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_2) (:= W tptp.e_4) (:= Y tptp.e_2) (:= Z tptp.e_2)))
% 0.39/0.63  (step t289.t2 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2))) :rule or :premises (t289.t1))
% 0.39/0.63  (step t289.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2))) :rule resolution :premises (t289.t2 t289.a0))
% 0.39/0.63  (step t289 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2))) :rule subproof :discharge (t289.a0))
% 0.39/0.63  (step t290 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2))) :rule resolution :premises (t288 t289))
% 0.39/0.63  (step t291 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2))) (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2)))) :rule implies_neg2)
% 0.39/0.63  (step t292 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2)))) :rule resolution :premises (t290 t291))
% 0.39/0.63  (step t293 (cl (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2)))) :rule contraction :premises (t292))
% 0.39/0.63  (step t294 (cl (not (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2))) :rule implies :premises (t293))
% 0.39/0.63  (step t295 (cl (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_2))) :rule resolution :premises (t294 a18))
% 0.39/0.63  (step t296 (cl (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_2))) :rule resolution :premises (t287 a14 t40 t295))
% 0.39/0.63  (step t297 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4)) :rule or_pos)
% 0.39/0.63  (step t298 (cl (tptp.equalish tptp.e_2 tptp.e_4) (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule reordering :premises (t297))
% 0.39/0.63  (step t299 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (forall ((X $$unsorted)) (tptp.product X X X))) :rule implies_neg1)
% 0.39/0.63  (anchor :step t300)
% 0.39/0.63  (assume t300.a0 (forall ((X $$unsorted)) (tptp.product X X X)))
% 0.39/0.63  (step t300.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_4 tptp.e_4 tptp.e_4))) :rule forall_inst :args ((:= X tptp.e_4)))
% 0.39/0.63  (step t300.t2 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) :rule or :premises (t300.t1))
% 0.39/0.63  (step t300.t3 (cl (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) :rule resolution :premises (t300.t2 t300.a0))
% 0.39/0.63  (step t300 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) :rule subproof :discharge (t300.a0))
% 0.39/0.63  (step t301 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) :rule resolution :premises (t299 t300))
% 0.39/0.63  (step t302 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4))) :rule implies_neg2)
% 0.39/0.63  (step t303 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_4))) :rule resolution :premises (t301 t302))
% 0.39/0.63  (step t304 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_4))) :rule contraction :premises (t303))
% 0.39/0.63  (step t305 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) :rule implies :premises (t304))
% 0.39/0.63  (step t306 (cl (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) :rule resolution :premises (t305 a20))
% 0.39/0.63  (step t307 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.39/0.63  (anchor :step t308)
% 0.39/0.63  (assume t308.a0 (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))))
% 0.39/0.63  (step t308.t1 (cl (or (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule forall_inst :args ((:= W tptp.e_2) (:= Y tptp.e_4) (:= X tptp.e_4) (:= Z tptp.e_4)))
% 0.39/0.63  (step t308.t2 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule or :premises (t308.t1))
% 0.39/0.63  (step t308.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule resolution :premises (t308.t2 t308.a0))
% 0.39/0.63  (step t308 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule subproof :discharge (t308.a0))
% 0.39/0.63  (step t309 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule resolution :premises (t307 t308))
% 0.39/0.63  (step t310 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule implies_neg2)
% 0.39/0.63  (step t311 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule resolution :premises (t309 t310))
% 0.39/0.63  (step t312 (cl (=> (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4)))) :rule contraction :premises (t311))
% 0.39/0.63  (step t313 (cl (not (forall ((W $$unsorted) (Y $$unsorted) (X $$unsorted) (Z $$unsorted)) (or (not (tptp.product W Y X)) (not (tptp.product Z Y X)) (tptp.equalish W Z)))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule implies :premises (t312))
% 0.39/0.63  (step t314 (cl (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_4))) :rule resolution :premises (t313 a19))
% 0.39/0.63  (step t315 (cl (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_4))) :rule resolution :premises (t298 a9 t306 t314))
% 0.39/0.63  (step t316 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product 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.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) :rule implies_neg1)
% 0.39/0.63  (anchor :step t317)
% 0.39/0.63  (assume t317.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))))
% 0.39/0.63  (step t317.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_4)))
% 0.39/0.63  (step t317.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product tptp.e_2 tptp.e_4 tptp.e_4))) :rule or :premises (t317.t1))
% 0.39/0.63  (step t317.t3 (cl (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product tptp.e_2 tptp.e_4 tptp.e_4))) :rule resolution :premises (t317.t2 t317.a0))
% 0.39/0.63  (step t317 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product tptp.e_2 tptp.e_4 tptp.e_4))) :rule subproof :discharge (t317.a0))
% 0.39/0.63  (step t318 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product 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.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product tptp.e_2 tptp.e_4 tptp.e_4))) :rule resolution :premises (t316 t317))
% 0.39/0.63  (step t319 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product 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.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)))) :rule implies_neg2)
% 0.39/0.63  (step t320 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product 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.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)))) :rule resolution :premises (t318 t319))
% 0.39/0.63  (step t321 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product tptp.e_2 tptp.e_4 tptp.e_4)))) :rule contraction :premises (t320))
% 0.39/0.63  (step t322 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.group_element X)) (not (tptp.group_element Y)) (tptp.product X Y tptp.e_1) (tptp.product X Y tptp.e_2) (tptp.product X Y tptp.e_3) (tptp.product X Y tptp.e_4)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product tptp.e_2 tptp.e_4 tptp.e_4))) :rule implies :premises (t321))
% 0.39/0.63  (step t323 (cl (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (tptp.product tptp.e_2 tptp.e_4 tptp.e_2) (tptp.product tptp.e_2 tptp.e_4 tptp.e_3) (tptp.product tptp.e_2 tptp.e_4 tptp.e_4))) :rule resolution :premises (t322 a16))
% 0.39/0.63  (step t324 (cl (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) :rule resolution :premises (t263 a1 a3 t285 t296 t315 t323))
% 0.39/0.63  (step t325 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule resolution :premises (t9 a13 t261 t324))
% 0.39/0.63  (step t326 (cl) :rule resolution :premises (t7 t325 a18))
% 0.39/0.63  
% 0.39/0.63  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.uazT4mMmBS/cvc5---1.0.5_1852.smt2
% 0.39/0.63  % cvc5---1.0.5 exiting
% 0.49/0.63  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------