TSTP Solution File: GRP125-2.005 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GRP125-2.005 : TPTP v8.2.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 16:53:14 EDT 2024
% Result : Unsatisfiable 0.57s 0.81s
% Output : Proof 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GRP125-2.005 : TPTP v8.2.0. Released v1.2.0.
% 0.11/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 26 18:12:09 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.19/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.57/0.81 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.pvPASvECUn/cvc5---1.0.5_10542.smt2
% 0.57/0.81 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.pvPASvECUn/cvc5---1.0.5_10542.smt2
% 0.65/0.87 (assume a0 (tptp.next tptp.e_1 tptp.e_2))
% 0.65/0.87 (assume a1 (tptp.next tptp.e_2 tptp.e_3))
% 0.65/0.87 (assume a2 (tptp.next tptp.e_3 tptp.e_4))
% 0.65/0.87 (assume a3 (tptp.next tptp.e_4 tptp.e_5))
% 0.65/0.87 (assume a4 (tptp.greater tptp.e_2 tptp.e_1))
% 0.65/0.87 (assume a5 (tptp.greater tptp.e_3 tptp.e_1))
% 0.65/0.87 (assume a6 (tptp.greater tptp.e_4 tptp.e_1))
% 0.65/0.87 (assume a7 (tptp.greater tptp.e_5 tptp.e_1))
% 0.65/0.87 (assume a8 (tptp.greater tptp.e_3 tptp.e_2))
% 0.65/0.87 (assume a9 (tptp.greater tptp.e_4 tptp.e_2))
% 0.65/0.87 (assume a10 (tptp.greater tptp.e_5 tptp.e_2))
% 0.65/0.87 (assume a11 (tptp.greater tptp.e_4 tptp.e_3))
% 0.65/0.87 (assume a12 (tptp.greater tptp.e_5 tptp.e_3))
% 0.65/0.87 (assume a13 (tptp.greater tptp.e_5 tptp.e_4))
% 0.65/0.87 (assume a14 (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))))
% 0.65/0.87 (assume a15 (tptp.group_element tptp.e_1))
% 0.65/0.87 (assume a16 (tptp.group_element tptp.e_2))
% 0.65/0.87 (assume a17 (tptp.group_element tptp.e_3))
% 0.65/0.87 (assume a18 (tptp.group_element tptp.e_4))
% 0.65/0.87 (assume a19 (tptp.group_element tptp.e_5))
% 0.65/0.87 (assume a20 (not (tptp.equalish tptp.e_1 tptp.e_2)))
% 0.65/0.87 (assume a21 (not (tptp.equalish tptp.e_1 tptp.e_3)))
% 0.65/0.87 (assume a22 (not (tptp.equalish tptp.e_1 tptp.e_4)))
% 0.65/0.87 (assume a23 (not (tptp.equalish tptp.e_1 tptp.e_5)))
% 0.65/0.87 (assume a24 (not (tptp.equalish tptp.e_2 tptp.e_1)))
% 0.65/0.87 (assume a25 (not (tptp.equalish tptp.e_2 tptp.e_3)))
% 0.65/0.87 (assume a26 (not (tptp.equalish tptp.e_2 tptp.e_4)))
% 0.65/0.87 (assume a27 (not (tptp.equalish tptp.e_2 tptp.e_5)))
% 0.65/0.87 (assume a28 (not (tptp.equalish tptp.e_3 tptp.e_1)))
% 0.65/0.87 (assume a29 (not (tptp.equalish tptp.e_3 tptp.e_2)))
% 0.65/0.87 (assume a30 (not (tptp.equalish tptp.e_3 tptp.e_4)))
% 0.65/0.87 (assume a31 (not (tptp.equalish tptp.e_3 tptp.e_5)))
% 0.65/0.87 (assume a32 (not (tptp.equalish tptp.e_4 tptp.e_1)))
% 0.65/0.87 (assume a33 (not (tptp.equalish tptp.e_4 tptp.e_2)))
% 0.65/0.87 (assume a34 (not (tptp.equalish tptp.e_4 tptp.e_3)))
% 0.65/0.87 (assume a35 (not (tptp.equalish tptp.e_4 tptp.e_5)))
% 0.65/0.87 (assume a36 (not (tptp.equalish tptp.e_5 tptp.e_1)))
% 0.65/0.87 (assume a37 (not (tptp.equalish tptp.e_5 tptp.e_2)))
% 0.65/0.87 (assume a38 (not (tptp.equalish tptp.e_5 tptp.e_3)))
% 0.65/0.87 (assume a39 (not (tptp.equalish tptp.e_5 tptp.e_4)))
% 0.65/0.87 (assume a40 (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) (tptp.product X Y tptp.e_5))))
% 0.65/0.87 (assume a41 (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.65/0.87 (assume a42 (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.65/0.87 (assume a43 (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.65/0.87 (assume a44 (forall ((X $$unsorted)) (tptp.product X X X)))
% 0.65/0.87 (assume a45 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))))
% 0.65/0.87 (step t1 (cl (not (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5))) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t2 (cl (tptp.product tptp.e_4 tptp.e_4 tptp.e_5) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (not (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)))) :rule reordering :premises (t1))
% 0.65/0.87 (step t3 (cl (not (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5))) (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t4 (cl (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5) (not (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)))) :rule reordering :premises (t3))
% 0.65/0.87 (step t5 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5))) (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t6 (cl (tptp.equalish tptp.e_4 tptp.e_5) (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule reordering :premises (t5))
% 0.65/0.87 (step t7 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1))) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) :rule or_pos)
% 0.65/0.87 (step t8 (cl (tptp.product tptp.e_2 tptp.e_4 tptp.e_1) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)))) :rule reordering :premises (t7))
% 0.65/0.87 (step t9 (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t10 (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5) (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)))) :rule reordering :premises (t9))
% 0.65/0.87 (step t11 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 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_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)) :rule or_pos)
% 0.65/0.87 (step t12 (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_1 tptp.e_3 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_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule reordering :premises (t11))
% 0.65/0.87 (step t13 (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.65/0.87 (anchor :step t14)
% 0.65/0.87 (assume t14.a0 (forall ((X $$unsorted)) (tptp.product X X X)))
% 0.65/0.87 (step t14.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.65/0.87 (step t14.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 (t14.t1))
% 0.65/0.87 (step t14.t3 (cl (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) :rule resolution :premises (t14.t2 t14.a0))
% 0.65/0.87 (step t14 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) :rule subproof :discharge (t14.a0))
% 0.65/0.87 (step t15 (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 (t13 t14))
% 0.65/0.87 (step t16 (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.65/0.87 (step t17 (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 (t15 t16))
% 0.65/0.87 (step t18 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_1 tptp.e_1 tptp.e_1))) :rule contraction :premises (t17))
% 0.65/0.87 (step t19 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) :rule implies :premises (t18))
% 0.65/0.87 (step t20 (cl (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) :rule resolution :premises (t19 a44))
% 0.65/0.87 (step t21 (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_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (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.65/0.87 (anchor :step t22)
% 0.65/0.87 (assume t22.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.65/0.87 (step t22.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_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_1) (:= W tptp.e_1) (:= Y tptp.e_1) (:= Z tptp.e_3)))
% 0.65/0.87 (step t22.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_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule or :premises (t22.t1))
% 0.65/0.87 (step t22.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t22.t2 t22.a0))
% 0.65/0.87 (step t22 (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_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule subproof :discharge (t22.a0))
% 0.65/0.87 (step t23 (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_3 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_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t21 t22))
% 0.65/0.87 (step t24 (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_3 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_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule implies_neg2)
% 0.65/0.87 (step t25 (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_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) (=> (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_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule resolution :premises (t23 t24))
% 0.65/0.87 (step t26 (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_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3)))) :rule contraction :premises (t25))
% 0.65/0.87 (step t27 (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_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule implies :premises (t26))
% 0.65/0.87 (step t28 (cl (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_3))) :rule resolution :premises (t27 a42))
% 0.65/0.87 (step t29 (cl (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_1))) :rule resolution :premises (t12 a21 t20 t28))
% 0.65/0.87 (step t30 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3))) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) :rule or_pos)
% 0.65/0.87 (step t31 (cl (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3) (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)))) :rule reordering :premises (t30))
% 0.65/0.87 (step t32 (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t33 (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5) (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)))) :rule reordering :premises (t32))
% 0.65/0.87 (step t34 (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.65/0.87 (step t35 (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 (t34))
% 0.65/0.87 (step t36 (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.65/0.87 (anchor :step t37)
% 0.65/0.87 (assume t37.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.65/0.87 (step t37.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.65/0.87 (step t37.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 (t37.t1))
% 0.65/0.87 (step t37.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 (t37.t2 t37.a0))
% 0.65/0.87 (step t37 (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 (t37.a0))
% 0.65/0.87 (step t38 (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 (t36 t37))
% 0.65/0.87 (step t39 (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.65/0.87 (step t40 (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 (t38 t39))
% 0.65/0.87 (step t41 (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 (t40))
% 0.65/0.87 (step t42 (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 (t41))
% 0.65/0.87 (step t43 (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 (t42 a43))
% 0.65/0.87 (step t44 (cl (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_1))) :rule resolution :premises (t35 a21 t20 t43))
% 0.65/0.87 (step t45 (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t46 (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5) (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)))) :rule reordering :premises (t45))
% 0.65/0.87 (step t47 (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.65/0.87 (step t48 (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 (t47))
% 0.65/0.87 (step t49 (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.65/0.87 (anchor :step t50)
% 0.65/0.87 (assume t50.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.65/0.87 (step t50.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.65/0.87 (step t50.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 (t50.t1))
% 0.65/0.87 (step t50.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 (t50.t2 t50.a0))
% 0.65/0.87 (step t50 (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 (t50.a0))
% 0.65/0.87 (step t51 (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 (t49 t50))
% 0.65/0.87 (step t52 (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.65/0.87 (step t53 (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 (t51 t52))
% 0.65/0.87 (step t54 (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 (t53))
% 0.65/0.87 (step t55 (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 (t54))
% 0.65/0.87 (step t56 (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 (t55 a42))
% 0.65/0.87 (step t57 (cl (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_1))) :rule resolution :premises (t48 a20 t20 t56))
% 0.65/0.87 (step t58 (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.65/0.87 (step t59 (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 (t58))
% 0.65/0.87 (step t60 (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.65/0.87 (anchor :step t61)
% 0.65/0.87 (assume t61.a0 (forall ((X $$unsorted)) (tptp.product X X X)))
% 0.65/0.87 (step t61.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.65/0.87 (step t61.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 (t61.t1))
% 0.65/0.87 (step t61.t3 (cl (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) :rule resolution :premises (t61.t2 t61.a0))
% 0.65/0.87 (step t61 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) :rule subproof :discharge (t61.a0))
% 0.65/0.87 (step t62 (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 (t60 t61))
% 0.65/0.87 (step t63 (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.65/0.87 (step t64 (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 (t62 t63))
% 0.65/0.87 (step t65 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_2))) :rule contraction :premises (t64))
% 0.65/0.87 (step t66 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) :rule implies :premises (t65))
% 0.65/0.87 (step t67 (cl (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) :rule resolution :premises (t66 a44))
% 0.65/0.87 (step t68 (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.65/0.87 (anchor :step t69)
% 0.65/0.87 (assume t69.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.65/0.87 (step t69.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.65/0.87 (step t69.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 (t69.t1))
% 0.65/0.87 (step t69.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 (t69.t2 t69.a0))
% 0.65/0.87 (step t69 (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 (t69.a0))
% 0.65/0.87 (step t70 (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 (t68 t69))
% 0.65/0.87 (step t71 (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.65/0.87 (step t72 (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 (t70 t71))
% 0.65/0.87 (step t73 (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 (t72))
% 0.65/0.87 (step t74 (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 (t73))
% 0.65/0.87 (step t75 (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 (t74 a43))
% 0.65/0.87 (step t76 (cl (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_2))) :rule resolution :premises (t59 a24 t67 t75))
% 0.65/0.87 (step t77 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2))) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) :rule or_pos)
% 0.65/0.87 (step t78 (cl (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2) (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)))) :rule reordering :premises (t77))
% 0.65/0.87 (step t79 (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5))) (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t80 (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5) (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)))) :rule reordering :premises (t79))
% 0.65/0.87 (step t81 (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.65/0.87 (step t82 (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 (t81))
% 0.65/0.87 (step t83 (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.65/0.87 (anchor :step t84)
% 0.65/0.87 (assume t84.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.65/0.87 (step t84.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.65/0.87 (step t84.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 (t84.t1))
% 0.65/0.87 (step t84.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 (t84.t2 t84.a0))
% 0.65/0.87 (step t84 (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 (t84.a0))
% 0.65/0.87 (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_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 (t83 t84))
% 0.65/0.87 (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_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.65/0.87 (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_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 (t85 t86))
% 0.65/0.87 (step t88 (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 (t87))
% 0.65/0.87 (step t89 (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 (t88))
% 0.65/0.87 (step t90 (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 (t89 a43))
% 0.65/0.87 (step t91 (cl (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_1))) :rule resolution :premises (t82 a20 t20 t90))
% 0.65/0.87 (step t92 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 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_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)) :rule or_pos)
% 0.65/0.87 (step t93 (cl (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_2 tptp.e_1 tptp.e_2)) (not (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule reordering :premises (t92))
% 0.65/0.87 (step t94 (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_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t95)
% 0.65/0.87 (assume t95.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.65/0.87 (step t95.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_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_2) (:= W tptp.e_2) (:= Y tptp.e_2) (:= Z tptp.e_1)))
% 0.65/0.87 (step t95.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_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule or :premises (t95.t1))
% 0.65/0.87 (step t95.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t95.t2 t95.a0))
% 0.65/0.87 (step t95 (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_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule subproof :discharge (t95.a0))
% 0.65/0.87 (step t96 (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_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 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_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t94 t95))
% 0.65/0.87 (step t97 (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_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 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_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule implies_neg2)
% 0.65/0.87 (step t98 (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_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule resolution :premises (t96 t97))
% 0.65/0.87 (step t99 (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_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1)))) :rule contraction :premises (t98))
% 0.65/0.87 (step t100 (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_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule implies :premises (t99))
% 0.65/0.87 (step t101 (cl (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_1))) :rule resolution :premises (t100 a42))
% 0.65/0.87 (step t102 (cl (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_2))) :rule resolution :premises (t93 a24 t67 t101))
% 0.65/0.87 (step t103 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3)))) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3))) :rule or_pos)
% 0.65/0.87 (step t104 (cl (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3))))) :rule reordering :premises (t103))
% 0.65/0.87 (step t105 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3)))) (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t106)
% 0.65/0.87 (assume t106.a0 (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))))
% 0.65/0.87 (step t106.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3))))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_4) (:= X1 tptp.e_3)))
% 0.65/0.87 (step t106.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3)))) :rule or :premises (t106.t1))
% 0.65/0.87 (step t106.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3)))) :rule resolution :premises (t106.t2 t106.a0))
% 0.65/0.87 (step t106 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3)))) :rule subproof :discharge (t106.a0))
% 0.65/0.87 (step t107 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3)))) :rule resolution :premises (t105 t106))
% 0.65/0.87 (step t108 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3)))) (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3))))) :rule implies_neg2)
% 0.65/0.87 (step t109 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3)))) (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3))))) :rule resolution :premises (t107 t108))
% 0.65/0.87 (step t110 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3))))) :rule contraction :premises (t109))
% 0.65/0.87 (step t111 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3)))) :rule implies :premises (t110))
% 0.65/0.87 (step t112 (cl (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_4 tptp.e_3)))) :rule resolution :premises (t111 a14))
% 0.65/0.87 (step t113 (cl (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_4))) :rule resolution :premises (t104 a1 a11 t112))
% 0.65/0.87 (step t114 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3)))) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3))) :rule or_pos)
% 0.65/0.87 (step t115 (cl (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3))))) :rule reordering :premises (t114))
% 0.65/0.87 (step t116 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3)))) (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t117)
% 0.65/0.87 (assume t117.a0 (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))))
% 0.65/0.87 (step t117.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3))))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_5) (:= X1 tptp.e_3)))
% 0.65/0.87 (step t117.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3)))) :rule or :premises (t117.t1))
% 0.65/0.87 (step t117.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3)))) :rule resolution :premises (t117.t2 t117.a0))
% 0.65/0.87 (step t117 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3)))) :rule subproof :discharge (t117.a0))
% 0.65/0.87 (step t118 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3)))) :rule resolution :premises (t116 t117))
% 0.65/0.87 (step t119 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3)))) (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3))))) :rule implies_neg2)
% 0.65/0.87 (step t120 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3)))) (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3))))) :rule resolution :premises (t118 t119))
% 0.65/0.87 (step t121 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3))))) :rule contraction :premises (t120))
% 0.65/0.87 (step t122 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3)))) :rule implies :premises (t121))
% 0.65/0.87 (step t123 (cl (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_2 tptp.e_3)) (not (tptp.greater tptp.e_5 tptp.e_3)))) :rule resolution :premises (t122 a14))
% 0.65/0.87 (step t124 (cl (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_5))) :rule resolution :premises (t115 a1 a12 t123))
% 0.65/0.87 (step t125 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5))) (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) (tptp.product X Y tptp.e_5)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t126)
% 0.65/0.87 (assume t126.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) (tptp.product X Y tptp.e_5))))
% 0.65/0.87 (step t126.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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_1)))
% 0.65/0.87 (step t126.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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5))) :rule or :premises (t126.t1))
% 0.65/0.87 (step t126.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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5))) :rule resolution :premises (t126.t2 t126.a0))
% 0.65/0.87 (step t126 (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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5))) :rule subproof :discharge (t126.a0))
% 0.65/0.87 (step t127 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5))) (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5))) :rule resolution :premises (t125 t126))
% 0.65/0.87 (step t128 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5))) (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t129 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5))) (=> (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)))) :rule resolution :premises (t127 t128))
% 0.65/0.87 (step t130 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5)))) :rule contraction :premises (t129))
% 0.65/0.87 (step t131 (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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5))) :rule implies :premises (t130))
% 0.65/0.87 (step t132 (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) (tptp.product tptp.e_2 tptp.e_1 tptp.e_5))) :rule resolution :premises (t131 a40))
% 0.65/0.87 (step t133 (cl (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) :rule resolution :premises (t80 a15 a16 t91 t102 t113 t124 t132))
% 0.65/0.87 (step t134 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) (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_3 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2)) :rule or_pos)
% 0.65/0.87 (step t135 (cl (tptp.equalish tptp.e_3 tptp.e_2) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) (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_3 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule reordering :premises (t134))
% 0.65/0.87 (step t136 (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.65/0.87 (anchor :step t137)
% 0.65/0.87 (assume t137.a0 (forall ((X $$unsorted)) (tptp.product X X X)))
% 0.65/0.87 (step t137.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.65/0.87 (step t137.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 (t137.t1))
% 0.65/0.87 (step t137.t3 (cl (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) :rule resolution :premises (t137.t2 t137.a0))
% 0.65/0.87 (step t137 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) :rule subproof :discharge (t137.a0))
% 0.65/0.87 (step t138 (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 (t136 t137))
% 0.65/0.87 (step t139 (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.65/0.87 (step t140 (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 (t138 t139))
% 0.65/0.87 (step t141 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_3))) :rule contraction :premises (t140))
% 0.65/0.87 (step t142 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) :rule implies :premises (t141))
% 0.65/0.87 (step t143 (cl (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) :rule resolution :premises (t142 a44))
% 0.65/0.87 (step t144 (cl (=> (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))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) (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)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t145)
% 0.65/0.87 (assume t145.a0 (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.65/0.87 (step t145.t1 (cl (or (not (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)))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_3) (:= Y tptp.e_3) (:= W tptp.e_3) (:= Z tptp.e_2)))
% 0.65/0.87 (step t145.t2 (cl (not (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)))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule or :premises (t145.t1))
% 0.65/0.87 (step t145.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t145.t2 t145.a0))
% 0.65/0.87 (step t145 (cl (not (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)))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule subproof :discharge (t145.a0))
% 0.65/0.87 (step t146 (cl (=> (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))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) (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_3 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t144 t145))
% 0.65/0.87 (step t147 (cl (=> (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))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) (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_3 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule implies_neg2)
% 0.65/0.87 (step t148 (cl (=> (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))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) (=> (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))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule resolution :premises (t146 t147))
% 0.65/0.87 (step t149 (cl (=> (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))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2)))) :rule contraction :premises (t148))
% 0.65/0.87 (step t150 (cl (not (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)))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule implies :premises (t149))
% 0.65/0.87 (step t151 (cl (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)) (tptp.equalish tptp.e_3 tptp.e_2))) :rule resolution :premises (t150 a41))
% 0.65/0.87 (step t152 (cl (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_2))) :rule resolution :premises (t135 a29 t143 t151))
% 0.65/0.87 (step t153 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t154)
% 0.65/0.87 (assume t154.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))))
% 0.65/0.87 (step t154.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_1) (:= Z1 tptp.e_3) (:= Z2 tptp.e_3)))
% 0.65/0.87 (step t154.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2))) :rule or :premises (t154.t1))
% 0.65/0.87 (step t154.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2))) :rule resolution :premises (t154.t2 t154.a0))
% 0.65/0.87 (step t154 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2))) :rule subproof :discharge (t154.a0))
% 0.65/0.87 (step t155 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2))) :rule resolution :premises (t153 t154))
% 0.65/0.87 (step t156 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2))) (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)))) :rule implies_neg2)
% 0.65/0.87 (step t157 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)))) :rule resolution :premises (t155 t156))
% 0.65/0.87 (step t158 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2)))) :rule contraction :premises (t157))
% 0.65/0.87 (step t159 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2))) :rule implies :premises (t158))
% 0.65/0.87 (step t160 (cl (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_3 tptp.e_2))) :rule resolution :premises (t159 a45))
% 0.65/0.87 (step t161 (cl (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_3))) :rule resolution :premises (t78 t133 t152 t160))
% 0.65/0.87 (step t162 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5))) (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) (tptp.product X Y tptp.e_5)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t163)
% 0.65/0.87 (assume t163.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) (tptp.product X Y tptp.e_5))))
% 0.65/0.87 (step t163.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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_1) (:= Y tptp.e_2)))
% 0.65/0.87 (step t163.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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5))) :rule or :premises (t163.t1))
% 0.65/0.87 (step t163.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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5))) :rule resolution :premises (t163.t2 t163.a0))
% 0.65/0.87 (step t163 (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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5))) :rule subproof :discharge (t163.a0))
% 0.65/0.87 (step t164 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5))) :rule resolution :premises (t162 t163))
% 0.65/0.87 (step t165 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t166 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5))) (=> (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)))) :rule resolution :premises (t164 t165))
% 0.65/0.87 (step t167 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)))) :rule contraction :premises (t166))
% 0.65/0.87 (step t168 (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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5))) :rule implies :premises (t167))
% 0.65/0.87 (step t169 (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) (tptp.product tptp.e_1 tptp.e_2 tptp.e_5))) :rule resolution :premises (t168 a40))
% 0.65/0.87 (step t170 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2))) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) :rule or_pos)
% 0.65/0.87 (step t171 (cl (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)))) :rule reordering :premises (t170))
% 0.65/0.87 (step t172 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t173)
% 0.65/0.87 (assume t173.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))))
% 0.65/0.87 (step t173.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_1) (:= Z1 tptp.e_3) (:= Z2 tptp.e_5)))
% 0.65/0.87 (step t173.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2))) :rule or :premises (t173.t1))
% 0.65/0.87 (step t173.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2))) :rule resolution :premises (t173.t2 t173.a0))
% 0.65/0.87 (step t173 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2))) :rule subproof :discharge (t173.a0))
% 0.65/0.87 (step t174 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2))) :rule resolution :premises (t172 t173))
% 0.65/0.87 (step t175 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2))) (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)))) :rule implies_neg2)
% 0.65/0.87 (step t176 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)))) :rule resolution :premises (t174 t175))
% 0.65/0.87 (step t177 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)))) :rule contraction :premises (t176))
% 0.65/0.87 (step t178 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2))) :rule implies :premises (t177))
% 0.65/0.87 (step t179 (cl (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2))) :rule resolution :premises (t178 a45))
% 0.65/0.87 (step t180 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2))) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) :rule or_pos)
% 0.65/0.87 (step t181 (cl (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2) (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)))) :rule reordering :premises (t180))
% 0.65/0.87 (step t182 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t183)
% 0.65/0.87 (assume t183.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))))
% 0.65/0.87 (step t183.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_1) (:= Z1 tptp.e_3) (:= Z2 tptp.e_4)))
% 0.65/0.87 (step t183.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2))) :rule or :premises (t183.t1))
% 0.65/0.87 (step t183.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2))) :rule resolution :premises (t183.t2 t183.a0))
% 0.65/0.87 (step t183 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2))) :rule subproof :discharge (t183.a0))
% 0.65/0.87 (step t184 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2))) :rule resolution :premises (t182 t183))
% 0.65/0.87 (step t185 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2))) (not (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)))) :rule implies_neg2)
% 0.65/0.87 (step t186 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)))) :rule resolution :premises (t184 t185))
% 0.65/0.87 (step t187 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)))) :rule contraction :premises (t186))
% 0.65/0.87 (step t188 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2))) :rule implies :premises (t187))
% 0.65/0.87 (step t189 (cl (or (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (tptp.product tptp.e_3 tptp.e_4 tptp.e_2))) :rule resolution :premises (t188 a45))
% 0.65/0.87 (step t190 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1))) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1)) :rule or_pos)
% 0.65/0.87 (step t191 (cl (tptp.equalish tptp.e_5 tptp.e_1) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule reordering :premises (t190))
% 0.65/0.87 (step t192 (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 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.65/0.87 (anchor :step t193)
% 0.65/0.87 (assume t193.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.65/0.87 (step t193.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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_3) (:= W tptp.e_5) (:= Y tptp.e_2) (:= Z tptp.e_1)))
% 0.65/0.87 (step t193.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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule or :premises (t193.t1))
% 0.65/0.87 (step t193.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule resolution :premises (t193.t2 t193.a0))
% 0.65/0.87 (step t193 (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule subproof :discharge (t193.a0))
% 0.65/0.87 (step t194 (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1))) (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule resolution :premises (t192 t193))
% 0.65/0.87 (step t195 (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1))) (not (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule implies_neg2)
% 0.65/0.87 (step t196 (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule resolution :premises (t194 t195))
% 0.65/0.87 (step t197 (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule contraction :premises (t196))
% 0.65/0.87 (step t198 (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule implies :premises (t197))
% 0.65/0.87 (step t199 (cl (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule resolution :premises (t198 a42))
% 0.65/0.87 (step t200 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1))) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1)) :rule or_pos)
% 0.65/0.87 (step t201 (cl (tptp.equalish tptp.e_4 tptp.e_1) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (not (or (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule reordering :premises (t200))
% 0.65/0.87 (step t202 (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_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (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.65/0.87 (anchor :step t203)
% 0.65/0.87 (assume t203.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.65/0.87 (step t203.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_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_3) (:= W tptp.e_4) (:= Y tptp.e_2) (:= Z tptp.e_1)))
% 0.65/0.87 (step t203.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_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule or :premises (t203.t1))
% 0.65/0.87 (step t203.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule resolution :premises (t203.t2 t203.a0))
% 0.65/0.87 (step t203 (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_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule subproof :discharge (t203.a0))
% 0.65/0.87 (step t204 (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_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1))) (or (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule resolution :premises (t202 t203))
% 0.65/0.87 (step t205 (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_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1))) (not (or (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule implies_neg2)
% 0.65/0.87 (step t206 (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_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (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_3 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule resolution :premises (t204 t205))
% 0.65/0.87 (step t207 (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_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1)))) :rule contraction :premises (t206))
% 0.65/0.87 (step t208 (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_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule implies :premises (t207))
% 0.65/0.87 (step t209 (cl (or (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (tptp.equalish tptp.e_4 tptp.e_1))) :rule resolution :premises (t208 a42))
% 0.65/0.87 (step t210 (cl (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2))) :rule resolution :premises (t46 t57 t76 t161 t169 a16 a15 t171 t179 t133 t181 t189 t133 t191 t199 a36 t201 t209 a32))
% 0.65/0.87 (step t211 (cl (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_2))) :rule contraction :premises (t210))
% 0.65/0.87 (step t212 (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.65/0.87 (step t213 (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 (t212))
% 0.65/0.87 (step t214 (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.65/0.87 (anchor :step t215)
% 0.65/0.87 (assume t215.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.65/0.87 (step t215.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.65/0.87 (step t215.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 (t215.t1))
% 0.65/0.87 (step t215.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 (t215.t2 t215.a0))
% 0.65/0.87 (step t215 (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 (t215.a0))
% 0.65/0.87 (step t216 (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 (t214 t215))
% 0.65/0.87 (step t217 (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.65/0.87 (step t218 (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 (t216 t217))
% 0.65/0.87 (step t219 (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 (t218))
% 0.65/0.87 (step t220 (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 (t219))
% 0.65/0.87 (step t221 (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 (t220 a42))
% 0.65/0.87 (step t222 (cl (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_3))) :rule resolution :premises (t213 a28 t143 t221))
% 0.65/0.87 (step t223 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4)))) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4))) :rule or_pos)
% 0.65/0.87 (step t224 (cl (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4))))) :rule reordering :premises (t223))
% 0.65/0.87 (step t225 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4)))) (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t226)
% 0.65/0.87 (assume t226.a0 (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))))
% 0.65/0.87 (step t226.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4))))) :rule forall_inst :args ((:= X tptp.e_3) (:= Y tptp.e_5) (:= X1 tptp.e_4)))
% 0.65/0.87 (step t226.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4)))) :rule or :premises (t226.t1))
% 0.65/0.87 (step t226.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4)))) :rule resolution :premises (t226.t2 t226.a0))
% 0.65/0.87 (step t226 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4)))) :rule subproof :discharge (t226.a0))
% 0.65/0.87 (step t227 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4)))) :rule resolution :premises (t225 t226))
% 0.65/0.87 (step t228 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4)))) (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4))))) :rule implies_neg2)
% 0.65/0.87 (step t229 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4)))) (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4))))) :rule resolution :premises (t227 t228))
% 0.65/0.87 (step t230 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4))))) :rule contraction :premises (t229))
% 0.65/0.87 (step t231 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (X1 $$unsorted)) (or (not (tptp.product X tptp.e_1 Y)) (not (tptp.next X X1)) (not (tptp.greater Y X1))))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4)))) :rule implies :premises (t230))
% 0.65/0.87 (step t232 (cl (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)) (not (tptp.next tptp.e_3 tptp.e_4)) (not (tptp.greater tptp.e_5 tptp.e_4)))) :rule resolution :premises (t231 a14))
% 0.65/0.87 (step t233 (cl (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_5))) :rule resolution :premises (t224 a2 a13 t232))
% 0.65/0.87 (step t234 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5))) (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) (tptp.product X Y tptp.e_5)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t235)
% 0.65/0.87 (assume t235.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) (tptp.product X Y tptp.e_5))))
% 0.65/0.87 (step t235.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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_3) (:= Y tptp.e_1)))
% 0.65/0.87 (step t235.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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5))) :rule or :premises (t235.t1))
% 0.65/0.87 (step t235.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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5))) :rule resolution :premises (t235.t2 t235.a0))
% 0.65/0.87 (step t235 (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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5))) :rule subproof :discharge (t235.a0))
% 0.65/0.87 (step t236 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5))) :rule resolution :premises (t234 t235))
% 0.65/0.87 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5))) (=> (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)))) :rule resolution :premises (t236 t237))
% 0.65/0.87 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5)))) :rule contraction :premises (t238))
% 0.65/0.87 (step t240 (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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5))) :rule implies :premises (t239))
% 0.65/0.87 (step t241 (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) (tptp.product tptp.e_3 tptp.e_1 tptp.e_5))) :rule resolution :premises (t240 a40))
% 0.65/0.87 (step t242 (cl (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) :rule resolution :premises (t33 a15 a17 t44 t211 t222 t233 t241))
% 0.65/0.87 (step t243 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4))) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4)) :rule or_pos)
% 0.65/0.87 (step t244 (cl (tptp.equalish tptp.e_3 tptp.e_4) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 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_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule reordering :premises (t243))
% 0.65/0.87 (step t245 (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_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 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.65/0.87 (anchor :step t246)
% 0.65/0.87 (assume t246.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.65/0.87 (step t246.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_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule forall_inst :args ((:= W tptp.e_3) (:= Y tptp.e_3) (:= X tptp.e_3) (:= Z tptp.e_4)))
% 0.65/0.87 (step t246.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_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule or :premises (t246.t1))
% 0.65/0.87 (step t246.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule resolution :premises (t246.t2 t246.a0))
% 0.65/0.87 (step t246 (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_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule subproof :discharge (t246.a0))
% 0.65/0.87 (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_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4))) (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule resolution :premises (t245 t246))
% 0.65/0.87 (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_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4))) (not (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule implies_neg2)
% 0.65/0.87 (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_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 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_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule resolution :premises (t247 t248))
% 0.65/0.87 (step t250 (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_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule contraction :premises (t249))
% 0.65/0.87 (step t251 (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_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule implies :premises (t250))
% 0.65/0.87 (step t252 (cl (or (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule resolution :premises (t251 a43))
% 0.65/0.87 (step t253 (cl (not (tptp.product tptp.e_4 tptp.e_3 tptp.e_3))) :rule resolution :premises (t244 a30 t143 t252))
% 0.65/0.87 (step t254 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t255)
% 0.65/0.87 (assume t255.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))))
% 0.65/0.87 (step t255.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_3) (:= Y tptp.e_1) (:= Z1 tptp.e_4) (:= Z2 tptp.e_3)))
% 0.65/0.87 (step t255.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3))) :rule or :premises (t255.t1))
% 0.65/0.87 (step t255.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3))) :rule resolution :premises (t255.t2 t255.a0))
% 0.65/0.87 (step t255 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3))) :rule subproof :discharge (t255.a0))
% 0.65/0.87 (step t256 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3))) :rule resolution :premises (t254 t255))
% 0.65/0.87 (step t257 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3))) (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)))) :rule implies_neg2)
% 0.65/0.87 (step t258 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)))) :rule resolution :premises (t256 t257))
% 0.65/0.87 (step t259 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3)))) :rule contraction :premises (t258))
% 0.65/0.87 (step t260 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3))) :rule implies :premises (t259))
% 0.65/0.87 (step t261 (cl (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3)) (tptp.product tptp.e_4 tptp.e_3 tptp.e_3))) :rule resolution :premises (t260 a45))
% 0.65/0.87 (step t262 (cl (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_3))) :rule resolution :premises (t31 t242 t253 t261))
% 0.65/0.87 (step t263 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3))) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) :rule or_pos)
% 0.65/0.87 (step t264 (cl (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3) (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)))) :rule reordering :premises (t263))
% 0.65/0.87 (step t265 (cl (not (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3))) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3)) :rule or_pos)
% 0.65/0.87 (step t266 (cl (tptp.equalish tptp.e_4 tptp.e_3) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3)))) :rule reordering :premises (t265))
% 0.65/0.87 (step t267 (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.65/0.87 (anchor :step t268)
% 0.65/0.87 (assume t268.a0 (forall ((X $$unsorted)) (tptp.product X X X)))
% 0.65/0.87 (step t268.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.65/0.87 (step t268.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 (t268.t1))
% 0.65/0.87 (step t268.t3 (cl (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) :rule resolution :premises (t268.t2 t268.a0))
% 0.65/0.87 (step t268 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) :rule subproof :discharge (t268.a0))
% 0.65/0.87 (step t269 (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 (t267 t268))
% 0.65/0.87 (step t270 (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.65/0.87 (step t271 (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 (t269 t270))
% 0.65/0.87 (step t272 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_4))) :rule contraction :premises (t271))
% 0.65/0.87 (step t273 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) :rule implies :premises (t272))
% 0.65/0.87 (step t274 (cl (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) :rule resolution :premises (t273 a44))
% 0.65/0.87 (step t275 (cl (=> (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))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3))) (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)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t276)
% 0.65/0.87 (assume t276.a0 (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.65/0.87 (step t276.t1 (cl (or (not (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)))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_4) (:= Y tptp.e_4) (:= W tptp.e_4) (:= Z tptp.e_3)))
% 0.65/0.87 (step t276.t2 (cl (not (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)))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3))) :rule or :premises (t276.t1))
% 0.65/0.87 (step t276.t3 (cl (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3))) :rule resolution :premises (t276.t2 t276.a0))
% 0.65/0.87 (step t276 (cl (not (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)))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3))) :rule subproof :discharge (t276.a0))
% 0.65/0.87 (step t277 (cl (=> (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))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3))) :rule resolution :premises (t275 t276))
% 0.65/0.87 (step t278 (cl (=> (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))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3))) (not (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3)))) :rule implies_neg2)
% 0.65/0.87 (step t279 (cl (=> (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))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3))) (=> (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))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3)))) :rule resolution :premises (t277 t278))
% 0.65/0.87 (step t280 (cl (=> (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))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3)))) :rule contraction :premises (t279))
% 0.65/0.87 (step t281 (cl (not (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)))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3))) :rule implies :premises (t280))
% 0.65/0.87 (step t282 (cl (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_3))) :rule resolution :premises (t281 a41))
% 0.65/0.87 (step t283 (cl (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_3))) :rule resolution :premises (t266 a34 t274 t282))
% 0.65/0.87 (step t284 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t285)
% 0.65/0.87 (assume t285.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))))
% 0.65/0.87 (step t285.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_3) (:= Y tptp.e_1) (:= Z1 tptp.e_4) (:= Z2 tptp.e_4)))
% 0.65/0.87 (step t285.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3))) :rule or :premises (t285.t1))
% 0.65/0.87 (step t285.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3))) :rule resolution :premises (t285.t2 t285.a0))
% 0.65/0.87 (step t285 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3))) :rule subproof :discharge (t285.a0))
% 0.65/0.87 (step t286 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3))) :rule resolution :premises (t284 t285))
% 0.65/0.87 (step t287 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3))) (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)))) :rule implies_neg2)
% 0.65/0.87 (step t288 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)))) :rule resolution :premises (t286 t287))
% 0.65/0.87 (step t289 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3)))) :rule contraction :premises (t288))
% 0.65/0.87 (step t290 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3))) :rule implies :premises (t289))
% 0.65/0.87 (step t291 (cl (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_3))) :rule resolution :premises (t290 a45))
% 0.65/0.87 (step t292 (cl (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_4))) :rule resolution :premises (t264 t242 t283 t291))
% 0.65/0.87 (step t293 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1))) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) :rule or_pos)
% 0.65/0.87 (step t294 (cl (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1) (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)))) :rule reordering :premises (t293))
% 0.65/0.87 (step t295 (cl (not (or (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4))) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4)) :rule or_pos)
% 0.65/0.87 (step t296 (cl (tptp.equalish tptp.e_3 tptp.e_4) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (not (or (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule reordering :premises (t295))
% 0.65/0.87 (step t297 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1))) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) :rule or_pos)
% 0.65/0.87 (step t298 (cl (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1) (not (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)))) :rule reordering :premises (t297))
% 0.65/0.87 (step t299 (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t300 (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5) (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)))) :rule reordering :premises (t299))
% 0.65/0.87 (step t301 (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.65/0.87 (step t302 (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 (t301))
% 0.65/0.87 (step t303 (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.65/0.87 (anchor :step t304)
% 0.65/0.87 (assume t304.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.65/0.87 (step t304.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.65/0.87 (step t304.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 (t304.t1))
% 0.65/0.87 (step t304.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 (t304.t2 t304.a0))
% 0.65/0.87 (step t304 (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 (t304.a0))
% 0.65/0.87 (step t305 (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 (t303 t304))
% 0.65/0.87 (step t306 (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.65/0.87 (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_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 (t305 t306))
% 0.65/0.87 (step t308 (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 (t307))
% 0.65/0.87 (step t309 (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 (t308))
% 0.65/0.87 (step t310 (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 (t309 a43))
% 0.65/0.87 (step t311 (cl (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_2))) :rule resolution :premises (t302 a25 t67 t310))
% 0.65/0.87 (step t312 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3)) :rule or_pos)
% 0.65/0.87 (step t313 (cl (tptp.equalish tptp.e_2 tptp.e_3) (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_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule reordering :premises (t312))
% 0.65/0.87 (step t314 (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_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.product X W Y)) (not (tptp.product X Z Y)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t315)
% 0.65/0.87 (assume t315.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.65/0.87 (step t315.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_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_3) (:= W tptp.e_2) (:= Y tptp.e_3) (:= Z tptp.e_3)))
% 0.65/0.87 (step t315.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_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule or :premises (t315.t1))
% 0.65/0.87 (step t315.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t315.t2 t315.a0))
% 0.65/0.87 (step t315 (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_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule subproof :discharge (t315.a0))
% 0.65/0.87 (step t316 (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_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t314 t315))
% 0.65/0.87 (step t317 (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_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule implies_neg2)
% 0.65/0.87 (step t318 (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_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) (=> (forall ((X $$unsorted) (W $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.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_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule resolution :premises (t316 t317))
% 0.65/0.87 (step t319 (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_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule contraction :premises (t318))
% 0.65/0.87 (step t320 (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_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule implies :premises (t319))
% 0.65/0.87 (step t321 (cl (or (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t320 a42))
% 0.65/0.87 (step t322 (cl (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_3))) :rule resolution :premises (t313 a25 t143 t321))
% 0.65/0.87 (step t323 (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.65/0.87 (step t324 (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 (t323))
% 0.65/0.87 (step t325 (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.65/0.87 (anchor :step t326)
% 0.65/0.87 (assume t326.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.65/0.87 (step t326.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.65/0.87 (step t326.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 (t326.t1))
% 0.65/0.87 (step t326.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 (t326.t2 t326.a0))
% 0.65/0.87 (step t326 (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 (t326.a0))
% 0.65/0.87 (step t327 (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 (t325 t326))
% 0.65/0.87 (step t328 (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.65/0.87 (step t329 (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 (t327 t328))
% 0.65/0.87 (step t330 (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 (t329))
% 0.65/0.87 (step t331 (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 (t330))
% 0.65/0.87 (step t332 (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 (t331 a42))
% 0.65/0.87 (step t333 (cl (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_4))) :rule resolution :premises (t324 a24 t242 t332))
% 0.65/0.87 (step t334 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5))) (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) (tptp.product X Y tptp.e_5)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t335)
% 0.65/0.87 (assume t335.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) (tptp.product X Y tptp.e_5))))
% 0.65/0.87 (step t335.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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_3) (:= Y tptp.e_2)))
% 0.65/0.87 (step t335.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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5))) :rule or :premises (t335.t1))
% 0.65/0.87 (step t335.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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5))) :rule resolution :premises (t335.t2 t335.a0))
% 0.65/0.87 (step t335 (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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5))) :rule subproof :discharge (t335.a0))
% 0.65/0.87 (step t336 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5))) :rule resolution :premises (t334 t335))
% 0.65/0.87 (step t337 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t338 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5))) (=> (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)))) :rule resolution :premises (t336 t337))
% 0.65/0.87 (step t339 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)))) :rule contraction :premises (t338))
% 0.65/0.87 (step t340 (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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5))) :rule implies :premises (t339))
% 0.65/0.87 (step t341 (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) (tptp.product tptp.e_3 tptp.e_2 tptp.e_5))) :rule resolution :premises (t340 a40))
% 0.65/0.87 (step t342 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2))) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2)) :rule or_pos)
% 0.65/0.87 (step t343 (cl (tptp.equalish tptp.e_5 tptp.e_2) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_1)) (not (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule reordering :premises (t342))
% 0.65/0.87 (step t344 (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_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 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.65/0.87 (anchor :step t345)
% 0.65/0.87 (assume t345.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.65/0.87 (step t345.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_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_3) (:= W tptp.e_5) (:= Y tptp.e_1) (:= Z tptp.e_2)))
% 0.65/0.87 (step t345.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_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule or :premises (t345.t1))
% 0.65/0.87 (step t345.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t345.t2 t345.a0))
% 0.65/0.87 (step t345 (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_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule subproof :discharge (t345.a0))
% 0.65/0.87 (step t346 (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_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2))) (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t344 t345))
% 0.65/0.87 (step t347 (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_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2))) (not (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule implies_neg2)
% 0.65/0.87 (step t348 (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_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 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_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule resolution :premises (t346 t347))
% 0.65/0.87 (step t349 (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_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule contraction :premises (t348))
% 0.65/0.87 (step t350 (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_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule implies :premises (t349))
% 0.65/0.87 (step t351 (cl (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_1)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_1)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t350 a42))
% 0.65/0.87 (step t352 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2))) (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) :rule or_pos)
% 0.65/0.87 (step t353 (cl (tptp.product tptp.e_5 tptp.e_5 tptp.e_2) (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (not (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)))) :rule reordering :premises (t352))
% 0.65/0.87 (step t354 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t355)
% 0.65/0.87 (assume t355.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))))
% 0.65/0.87 (step t355.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_3) (:= Z1 tptp.e_5) (:= Z2 tptp.e_5)))
% 0.65/0.87 (step t355.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2))) :rule or :premises (t355.t1))
% 0.65/0.87 (step t355.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2))) :rule resolution :premises (t355.t2 t355.a0))
% 0.65/0.87 (step t355 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2))) :rule subproof :discharge (t355.a0))
% 0.65/0.87 (step t356 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2))) :rule resolution :premises (t354 t355))
% 0.65/0.87 (step t357 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2))) (not (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)))) :rule implies_neg2)
% 0.65/0.87 (step t358 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)))) :rule resolution :premises (t356 t357))
% 0.65/0.87 (step t359 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)))) :rule contraction :premises (t358))
% 0.65/0.87 (step t360 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2))) :rule implies :premises (t359))
% 0.65/0.87 (step t361 (cl (or (not (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_2 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_2))) :rule resolution :premises (t360 a45))
% 0.65/0.87 (step t362 (cl (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2)) :rule or_pos)
% 0.65/0.87 (step t363 (cl (tptp.equalish tptp.e_5 tptp.e_2) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule reordering :premises (t362))
% 0.65/0.87 (step t364 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (forall ((X $$unsorted)) (tptp.product X X X))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t365)
% 0.65/0.87 (assume t365.a0 (forall ((X $$unsorted)) (tptp.product X X X)))
% 0.65/0.87 (step t365.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_5 tptp.e_5 tptp.e_5))) :rule forall_inst :args ((:= X tptp.e_5)))
% 0.65/0.87 (step t365.t2 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) :rule or :premises (t365.t1))
% 0.65/0.87 (step t365.t3 (cl (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) :rule resolution :premises (t365.t2 t365.a0))
% 0.65/0.87 (step t365 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) :rule subproof :discharge (t365.a0))
% 0.65/0.87 (step t366 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) :rule resolution :premises (t364 t365))
% 0.65/0.87 (step t367 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5))) :rule implies_neg2)
% 0.65/0.87 (step t368 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_5))) :rule resolution :premises (t366 t367))
% 0.65/0.87 (step t369 (cl (=> (forall ((X $$unsorted)) (tptp.product X X X)) (tptp.product tptp.e_5 tptp.e_5 tptp.e_5))) :rule contraction :premises (t368))
% 0.65/0.87 (step t370 (cl (not (forall ((X $$unsorted)) (tptp.product X X X))) (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) :rule implies :premises (t369))
% 0.65/0.87 (step t371 (cl (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) :rule resolution :premises (t370 a44))
% 0.65/0.87 (step t372 (cl (=> (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))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) (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)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t373)
% 0.65/0.87 (assume t373.a0 (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.65/0.87 (step t373.t1 (cl (or (not (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)))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_5) (:= Y tptp.e_5) (:= W tptp.e_5) (:= Z tptp.e_2)))
% 0.65/0.87 (step t373.t2 (cl (not (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)))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule or :premises (t373.t1))
% 0.65/0.87 (step t373.t3 (cl (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t373.t2 t373.a0))
% 0.65/0.87 (step t373 (cl (not (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)))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule subproof :discharge (t373.a0))
% 0.65/0.87 (step t374 (cl (=> (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))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t372 t373))
% 0.65/0.87 (step t375 (cl (=> (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))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule implies_neg2)
% 0.65/0.87 (step t376 (cl (=> (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))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) (=> (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))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule resolution :premises (t374 t375))
% 0.65/0.87 (step t377 (cl (=> (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))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule contraction :premises (t376))
% 0.65/0.87 (step t378 (cl (not (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)))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule implies :premises (t377))
% 0.65/0.87 (step t379 (cl (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t378 a41))
% 0.65/0.87 (step t380 (cl (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_2))) :rule resolution :premises (t363 a37 t371 t379))
% 0.65/0.87 (step t381 (cl (not (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5))) (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t382 (cl (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5) (not (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)))) :rule reordering :premises (t381))
% 0.65/0.87 (step t383 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3))) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3)) :rule or_pos)
% 0.65/0.87 (step t384 (cl (tptp.equalish tptp.e_5 tptp.e_3) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_3)) (not (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule reordering :premises (t383))
% 0.65/0.87 (step t385 (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_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3))) (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.65/0.87 (anchor :step t386)
% 0.65/0.87 (assume t386.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.65/0.87 (step t386.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_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_3) (:= W tptp.e_5) (:= Y tptp.e_3) (:= Z tptp.e_3)))
% 0.65/0.87 (step t386.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_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule or :premises (t386.t1))
% 0.65/0.87 (step t386.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule resolution :premises (t386.t2 t386.a0))
% 0.65/0.87 (step t386 (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_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule subproof :discharge (t386.a0))
% 0.65/0.87 (step t387 (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_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3))) (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule resolution :premises (t385 t386))
% 0.65/0.87 (step t388 (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_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3))) (not (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule implies_neg2)
% 0.65/0.87 (step t389 (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_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3))) (=> (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_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule resolution :premises (t387 t388))
% 0.65/0.87 (step t390 (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_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule contraction :premises (t389))
% 0.65/0.87 (step t391 (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_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule implies :premises (t390))
% 0.65/0.87 (step t392 (cl (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_3 tptp.e_3 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule resolution :premises (t391 a42))
% 0.65/0.87 (step t393 (cl (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_3))) :rule resolution :premises (t384 a38 t143 t392))
% 0.65/0.87 (step t394 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5))) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t395 (cl (tptp.equalish tptp.e_1 tptp.e_5) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule reordering :premises (t394))
% 0.65/0.87 (step t396 (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_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5))) (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.65/0.87 (anchor :step t397)
% 0.65/0.87 (assume t397.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.65/0.87 (step t397.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_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_3) (:= W tptp.e_1) (:= Y tptp.e_4) (:= Z tptp.e_5)))
% 0.65/0.87 (step t397.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_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule or :premises (t397.t1))
% 0.65/0.87 (step t397.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule resolution :premises (t397.t2 t397.a0))
% 0.65/0.87 (step t397 (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_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule subproof :discharge (t397.a0))
% 0.65/0.87 (step t398 (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_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule resolution :premises (t396 t397))
% 0.65/0.87 (step t399 (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_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5))) (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t400 (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_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5))) (=> (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_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule resolution :premises (t398 t399))
% 0.65/0.87 (step t401 (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_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule contraction :premises (t400))
% 0.65/0.87 (step t402 (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_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule implies :premises (t401))
% 0.65/0.87 (step t403 (cl (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule resolution :premises (t402 a42))
% 0.65/0.87 (step t404 (cl (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_4))) :rule resolution :premises (t395 a23 t242 t403))
% 0.65/0.87 (step t405 (cl (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3))) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3)) :rule or_pos)
% 0.65/0.87 (step t406 (cl (tptp.equalish tptp.e_5 tptp.e_3) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule reordering :premises (t405))
% 0.65/0.87 (step t407 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 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.65/0.87 (anchor :step t408)
% 0.65/0.87 (assume t408.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.65/0.87 (step t408.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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule forall_inst :args ((:= W tptp.e_5) (:= Y tptp.e_5) (:= X tptp.e_5) (:= Z tptp.e_3)))
% 0.65/0.87 (step t408.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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule or :premises (t408.t1))
% 0.65/0.87 (step t408.t3 (cl (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule resolution :premises (t408.t2 t408.a0))
% 0.65/0.87 (step t408 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule subproof :discharge (t408.a0))
% 0.65/0.87 (step t409 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule resolution :premises (t407 t408))
% 0.65/0.87 (step t410 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3))) (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule implies_neg2)
% 0.65/0.87 (step t411 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule resolution :premises (t409 t410))
% 0.65/0.87 (step t412 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule contraction :premises (t411))
% 0.65/0.87 (step t413 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule implies :premises (t412))
% 0.65/0.87 (step t414 (cl (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule resolution :premises (t413 a43))
% 0.65/0.87 (step t415 (cl (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_5))) :rule resolution :premises (t406 a38 t371 t414))
% 0.65/0.87 (step t416 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5))) (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) (tptp.product X Y tptp.e_5)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t417)
% 0.65/0.87 (assume t417.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) (tptp.product X Y tptp.e_5))))
% 0.65/0.87 (step t417.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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_3) (:= Y tptp.e_5)))
% 0.65/0.87 (step t417.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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5))) :rule or :premises (t417.t1))
% 0.65/0.87 (step t417.t3 (cl (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5))) :rule resolution :premises (t417.t2 t417.a0))
% 0.65/0.87 (step t417 (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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5))) :rule subproof :discharge (t417.a0))
% 0.65/0.87 (step t418 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5))) :rule resolution :premises (t416 t417))
% 0.65/0.87 (step t419 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5))) (not (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t420 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5))) (=> (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)))) :rule resolution :premises (t418 t419))
% 0.65/0.87 (step t421 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5)))) :rule contraction :premises (t420))
% 0.65/0.87 (step t422 (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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5))) :rule implies :premises (t421))
% 0.65/0.87 (step t423 (cl (or (not (tptp.group_element tptp.e_3)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_3 tptp.e_5 tptp.e_1) (tptp.product tptp.e_3 tptp.e_5 tptp.e_2) (tptp.product tptp.e_3 tptp.e_5 tptp.e_3) (tptp.product tptp.e_3 tptp.e_5 tptp.e_4) (tptp.product tptp.e_3 tptp.e_5 tptp.e_5))) :rule resolution :premises (t422 a40))
% 0.65/0.87 (step t424 (cl (not (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5))) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t425 (cl (tptp.product tptp.e_2 tptp.e_3 tptp.e_5) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (not (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)))) :rule reordering :premises (t424))
% 0.65/0.87 (step t426 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t427)
% 0.65/0.87 (assume t427.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))))
% 0.65/0.87 (step t427.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_5) (:= Y tptp.e_1) (:= Z1 tptp.e_2) (:= Z2 tptp.e_3)))
% 0.65/0.87 (step t427.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5))) :rule or :premises (t427.t1))
% 0.65/0.87 (step t427.t3 (cl (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5))) :rule resolution :premises (t427.t2 t427.a0))
% 0.65/0.87 (step t427 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5))) :rule subproof :discharge (t427.a0))
% 0.65/0.87 (step t428 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5))) (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5))) :rule resolution :premises (t426 t427))
% 0.65/0.87 (step t429 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5))) (not (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t430 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)))) :rule resolution :premises (t428 t429))
% 0.65/0.87 (step t431 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5)))) :rule contraction :premises (t430))
% 0.65/0.87 (step t432 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5))) :rule implies :premises (t431))
% 0.65/0.87 (step t433 (cl (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_3)) (tptp.product tptp.e_2 tptp.e_3 tptp.e_5))) :rule resolution :premises (t432 a45))
% 0.65/0.87 (step t434 (cl (not (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5))) (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t435 (cl (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5) (not (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)))) :rule reordering :premises (t434))
% 0.65/0.87 (step t436 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t437 (cl (tptp.equalish tptp.e_1 tptp.e_5) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_5 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_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule reordering :premises (t436))
% 0.65/0.87 (step t438 (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_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) (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.65/0.87 (anchor :step t439)
% 0.65/0.87 (assume t439.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.65/0.87 (step t439.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_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule forall_inst :args ((:= W tptp.e_1) (:= Y tptp.e_1) (:= X tptp.e_1) (:= Z tptp.e_5)))
% 0.65/0.87 (step t439.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_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule or :premises (t439.t1))
% 0.65/0.87 (step t439.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule resolution :premises (t439.t2 t439.a0))
% 0.65/0.87 (step t439 (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_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule subproof :discharge (t439.a0))
% 0.65/0.87 (step t440 (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_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule resolution :premises (t438 t439))
% 0.65/0.87 (step t441 (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_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) (not (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t442 (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_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) (=> (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_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule resolution :premises (t440 t441))
% 0.65/0.87 (step t443 (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_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule contraction :premises (t442))
% 0.65/0.87 (step t444 (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_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule implies :premises (t443))
% 0.65/0.87 (step t445 (cl (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule resolution :premises (t444 a43))
% 0.65/0.87 (step t446 (cl (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_1))) :rule resolution :premises (t437 a23 t20 t445))
% 0.65/0.87 (step t447 (cl (not (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2))) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2)) :rule or_pos)
% 0.65/0.87 (step t448 (cl (tptp.equalish tptp.e_5 tptp.e_2) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_3)) (not (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule reordering :premises (t447))
% 0.65/0.87 (step t449 (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_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 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.65/0.87 (anchor :step t450)
% 0.65/0.87 (assume t450.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.65/0.87 (step t450.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_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule forall_inst :args ((:= W tptp.e_5) (:= Y tptp.e_1) (:= X tptp.e_3) (:= Z tptp.e_2)))
% 0.65/0.87 (step t450.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_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule or :premises (t450.t1))
% 0.65/0.87 (step t450.t3 (cl (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t450.t2 t450.a0))
% 0.65/0.87 (step t450 (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_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule subproof :discharge (t450.a0))
% 0.65/0.87 (step t451 (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_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2))) (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t449 t450))
% 0.65/0.87 (step t452 (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_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2))) (not (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule implies_neg2)
% 0.65/0.87 (step t453 (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_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 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_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule resolution :premises (t451 t452))
% 0.65/0.87 (step t454 (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_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule contraction :premises (t453))
% 0.65/0.87 (step t455 (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_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule implies :premises (t454))
% 0.65/0.87 (step t456 (cl (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t455 a43))
% 0.65/0.87 (step t457 (cl (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_3))) :rule resolution :premises (t448 a37 t133 t456))
% 0.65/0.87 (step t458 (cl (not (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3))) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3)) :rule or_pos)
% 0.65/0.87 (step t459 (cl (tptp.equalish tptp.e_5 tptp.e_3) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_4)) (not (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule reordering :premises (t458))
% 0.65/0.87 (step t460 (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_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 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.65/0.87 (anchor :step t461)
% 0.65/0.87 (assume t461.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.65/0.87 (step t461.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_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule forall_inst :args ((:= W tptp.e_5) (:= Y tptp.e_1) (:= X tptp.e_4) (:= Z tptp.e_3)))
% 0.65/0.87 (step t461.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_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule or :premises (t461.t1))
% 0.65/0.87 (step t461.t3 (cl (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule resolution :premises (t461.t2 t461.a0))
% 0.65/0.87 (step t461 (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_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule subproof :discharge (t461.a0))
% 0.65/0.87 (step t462 (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_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3))) (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule resolution :premises (t460 t461))
% 0.65/0.87 (step t463 (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_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3))) (not (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule implies_neg2)
% 0.65/0.87 (step t464 (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_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 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_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule resolution :premises (t462 t463))
% 0.65/0.87 (step t465 (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_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3)))) :rule contraction :premises (t464))
% 0.65/0.87 (step t466 (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_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule implies :premises (t465))
% 0.65/0.87 (step t467 (cl (or (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.equalish tptp.e_5 tptp.e_3))) :rule resolution :premises (t466 a43))
% 0.65/0.87 (step t468 (cl (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_4))) :rule resolution :premises (t459 a38 t242 t467))
% 0.65/0.87 (step t469 (cl (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1)) :rule or_pos)
% 0.65/0.87 (step t470 (cl (tptp.equalish tptp.e_5 tptp.e_1) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule reordering :premises (t469))
% 0.65/0.87 (step t471 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 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.65/0.87 (anchor :step t472)
% 0.65/0.87 (assume t472.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.65/0.87 (step t472.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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_5) (:= W tptp.e_5) (:= Y tptp.e_5) (:= Z tptp.e_1)))
% 0.65/0.87 (step t472.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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule or :premises (t472.t1))
% 0.65/0.87 (step t472.t3 (cl (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule resolution :premises (t472.t2 t472.a0))
% 0.65/0.87 (step t472 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule subproof :discharge (t472.a0))
% 0.65/0.87 (step t473 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule resolution :premises (t471 t472))
% 0.65/0.87 (step t474 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule implies_neg2)
% 0.65/0.87 (step t475 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule resolution :premises (t473 t474))
% 0.65/0.87 (step t476 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule contraction :premises (t475))
% 0.65/0.87 (step t477 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule implies :premises (t476))
% 0.65/0.87 (step t478 (cl (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule resolution :premises (t477 a42))
% 0.65/0.87 (step t479 (cl (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_5))) :rule resolution :premises (t470 a36 t371 t478))
% 0.65/0.87 (step t480 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5))) (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) (tptp.product X Y tptp.e_5)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t481)
% 0.65/0.87 (assume t481.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) (tptp.product X Y tptp.e_5))))
% 0.65/0.87 (step t481.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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_5) (:= Y tptp.e_1)))
% 0.65/0.87 (step t481.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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5))) :rule or :premises (t481.t1))
% 0.65/0.87 (step t481.t3 (cl (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5))) :rule resolution :premises (t481.t2 t481.a0))
% 0.65/0.87 (step t481 (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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5))) :rule subproof :discharge (t481.a0))
% 0.65/0.87 (step t482 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5))) :rule resolution :premises (t480 t481))
% 0.65/0.87 (step t483 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5))) (not (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t484 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5))) (=> (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)))) :rule resolution :premises (t482 t483))
% 0.65/0.87 (step t485 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5)))) :rule contraction :premises (t484))
% 0.65/0.87 (step t486 (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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5))) :rule implies :premises (t485))
% 0.65/0.87 (step t487 (cl (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_1)) (tptp.product tptp.e_5 tptp.e_1 tptp.e_1) (tptp.product tptp.e_5 tptp.e_1 tptp.e_2) (tptp.product tptp.e_5 tptp.e_1 tptp.e_3) (tptp.product tptp.e_5 tptp.e_1 tptp.e_4) (tptp.product tptp.e_5 tptp.e_1 tptp.e_5))) :rule resolution :premises (t486 a40))
% 0.65/0.87 (step t488 (cl (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) :rule resolution :premises (t435 a15 a19 t446 t457 t468 t479 t487))
% 0.65/0.87 (step t489 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4))) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4)) :rule or_pos)
% 0.65/0.87 (step t490 (cl (tptp.equalish tptp.e_5 tptp.e_4) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4)))) :rule reordering :premises (t489))
% 0.65/0.87 (step t491 (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4))) (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.65/0.87 (anchor :step t492)
% 0.65/0.87 (assume t492.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.65/0.87 (step t492.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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_3) (:= W tptp.e_5) (:= Y tptp.e_2) (:= Z tptp.e_4)))
% 0.65/0.87 (step t492.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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4))) :rule or :premises (t492.t1))
% 0.65/0.87 (step t492.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4))) :rule resolution :premises (t492.t2 t492.a0))
% 0.65/0.87 (step t492 (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4))) :rule subproof :discharge (t492.a0))
% 0.65/0.87 (step t493 (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4))) (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4))) :rule resolution :premises (t491 t492))
% 0.65/0.87 (step t494 (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4))) (not (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4)))) :rule implies_neg2)
% 0.65/0.87 (step t495 (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4))) (=> (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4)))) :rule resolution :premises (t493 t494))
% 0.65/0.87 (step t496 (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4)))) :rule contraction :premises (t495))
% 0.65/0.87 (step t497 (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_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4))) :rule implies :premises (t496))
% 0.65/0.87 (step t498 (cl (or (not (tptp.product tptp.e_3 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_4 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_4))) :rule resolution :premises (t497 a42))
% 0.65/0.87 (step t499 (cl (not (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5))) (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t500 (cl (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5) (not (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)))) :rule reordering :premises (t499))
% 0.65/0.87 (step t501 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t502 (cl (tptp.equalish tptp.e_1 tptp.e_5) (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_5 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_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule reordering :premises (t501))
% 0.65/0.87 (step t503 (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_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) (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.65/0.87 (anchor :step t504)
% 0.65/0.87 (assume t504.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.65/0.87 (step t504.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_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_1) (:= W tptp.e_1) (:= Y tptp.e_1) (:= Z tptp.e_5)))
% 0.65/0.87 (step t504.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_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule or :premises (t504.t1))
% 0.65/0.87 (step t504.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule resolution :premises (t504.t2 t504.a0))
% 0.65/0.87 (step t504 (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_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule subproof :discharge (t504.a0))
% 0.65/0.87 (step t505 (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_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule resolution :premises (t503 t504))
% 0.65/0.87 (step t506 (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_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) (not (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t507 (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_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) (=> (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_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule resolution :premises (t505 t506))
% 0.65/0.87 (step t508 (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_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5)))) :rule contraction :premises (t507))
% 0.65/0.87 (step t509 (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_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule implies :premises (t508))
% 0.65/0.87 (step t510 (cl (or (not (tptp.product tptp.e_1 tptp.e_1 tptp.e_1)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_1 tptp.e_5))) :rule resolution :premises (t509 a42))
% 0.65/0.87 (step t511 (cl (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_1))) :rule resolution :premises (t502 a23 t20 t510))
% 0.65/0.87 (step t512 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1))) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) :rule or_pos)
% 0.65/0.87 (step t513 (cl (tptp.product tptp.e_2 tptp.e_2 tptp.e_1) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (not (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)))) :rule reordering :premises (t512))
% 0.65/0.87 (step t514 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) (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_2 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)) :rule or_pos)
% 0.65/0.87 (step t515 (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_2 tptp.e_1)) (not (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule reordering :premises (t514))
% 0.65/0.87 (step t516 (cl (=> (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))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product X Y W)) (not (tptp.product X Y Z)) (tptp.equalish W Z)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t517)
% 0.65/0.87 (assume t517.a0 (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.65/0.87 (step t517.t1 (cl (or (not (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)))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) (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) (:= Y tptp.e_2) (:= W tptp.e_1) (:= Z tptp.e_2)))
% 0.65/0.87 (step t517.t2 (cl (not (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)))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule or :premises (t517.t1))
% 0.65/0.87 (step t517.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t517.t2 t517.a0))
% 0.65/0.87 (step t517 (cl (not (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)))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule subproof :discharge (t517.a0))
% 0.65/0.87 (step t518 (cl (=> (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))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) (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_2 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t516 t517))
% 0.65/0.87 (step t519 (cl (=> (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))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) (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_2 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule implies_neg2)
% 0.65/0.87 (step t520 (cl (=> (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))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) (=> (forall ((X $$unsorted) (Y $$unsorted) (W $$unsorted) (Z $$unsorted)) (or (not (tptp.product X Y W)) (not (tptp.product X Y Z)) (tptp.equalish W Z))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule resolution :premises (t518 t519))
% 0.65/0.87 (step t521 (cl (=> (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))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2)))) :rule contraction :premises (t520))
% 0.65/0.87 (step t522 (cl (not (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)))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule implies :premises (t521))
% 0.65/0.87 (step t523 (cl (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_1 tptp.e_2))) :rule resolution :premises (t522 a41))
% 0.65/0.87 (step t524 (cl (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_1))) :rule resolution :premises (t515 a20 t67 t523))
% 0.65/0.87 (step t525 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t526)
% 0.65/0.87 (assume t526.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))))
% 0.65/0.87 (step t526.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_1) (:= Y tptp.e_5) (:= Z1 tptp.e_2) (:= Z2 tptp.e_2)))
% 0.65/0.87 (step t526.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1))) :rule or :premises (t526.t1))
% 0.65/0.87 (step t526.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1))) :rule resolution :premises (t526.t2 t526.a0))
% 0.65/0.87 (step t526 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1))) :rule subproof :discharge (t526.a0))
% 0.65/0.87 (step t527 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1))) (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1))) :rule resolution :premises (t525 t526))
% 0.65/0.87 (step t528 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1))) (not (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)))) :rule implies_neg2)
% 0.65/0.87 (step t529 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)))) :rule resolution :premises (t527 t528))
% 0.65/0.87 (step t530 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1)))) :rule contraction :premises (t529))
% 0.65/0.87 (step t531 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1))) :rule implies :premises (t530))
% 0.65/0.87 (step t532 (cl (or (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_1 tptp.e_2)) (tptp.product tptp.e_2 tptp.e_2 tptp.e_1))) :rule resolution :premises (t531 a45))
% 0.65/0.87 (step t533 (cl (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_2))) :rule resolution :premises (t513 t524 t488 t532))
% 0.65/0.87 (step t534 (cl (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1)) :rule or_pos)
% 0.65/0.87 (step t535 (cl (tptp.equalish tptp.e_5 tptp.e_1) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule reordering :premises (t534))
% 0.65/0.87 (step t536 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 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.65/0.87 (anchor :step t537)
% 0.65/0.87 (assume t537.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.65/0.87 (step t537.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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule forall_inst :args ((:= W tptp.e_5) (:= Y tptp.e_5) (:= X tptp.e_5) (:= Z tptp.e_1)))
% 0.65/0.87 (step t537.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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule or :premises (t537.t1))
% 0.65/0.87 (step t537.t3 (cl (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule resolution :premises (t537.t2 t537.a0))
% 0.65/0.87 (step t537 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule subproof :discharge (t537.a0))
% 0.65/0.87 (step t538 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule resolution :premises (t536 t537))
% 0.65/0.87 (step t539 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule implies_neg2)
% 0.65/0.87 (step t540 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule resolution :premises (t538 t539))
% 0.65/0.87 (step t541 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule contraction :premises (t540))
% 0.65/0.87 (step t542 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule implies :premises (t541))
% 0.65/0.87 (step t543 (cl (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule resolution :premises (t542 a43))
% 0.65/0.87 (step t544 (cl (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_5))) :rule resolution :premises (t535 a36 t371 t543))
% 0.65/0.87 (step t545 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5))) (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) (tptp.product X Y tptp.e_5)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t546)
% 0.65/0.87 (assume t546.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) (tptp.product X Y tptp.e_5))))
% 0.65/0.87 (step t546.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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_1) (:= Y tptp.e_5)))
% 0.65/0.87 (step t546.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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5))) :rule or :premises (t546.t1))
% 0.65/0.87 (step t546.t3 (cl (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5))) :rule resolution :premises (t546.t2 t546.a0))
% 0.65/0.87 (step t546 (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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5))) :rule subproof :discharge (t546.a0))
% 0.65/0.87 (step t547 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5))) :rule resolution :premises (t545 t546))
% 0.65/0.87 (step t548 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5))) (not (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t549 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5))) (=> (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)))) :rule resolution :premises (t547 t548))
% 0.65/0.87 (step t550 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5)))) :rule contraction :premises (t549))
% 0.65/0.87 (step t551 (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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5))) :rule implies :premises (t550))
% 0.65/0.87 (step t552 (cl (or (not (tptp.group_element tptp.e_1)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_1 tptp.e_5 tptp.e_1) (tptp.product tptp.e_1 tptp.e_5 tptp.e_2) (tptp.product tptp.e_1 tptp.e_5 tptp.e_3) (tptp.product tptp.e_1 tptp.e_5 tptp.e_4) (tptp.product tptp.e_1 tptp.e_5 tptp.e_5))) :rule resolution :premises (t551 a40))
% 0.65/0.87 (step t553 (cl (not (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5))) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t554 (cl (tptp.equalish tptp.e_2 tptp.e_5) (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (not (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5)))) :rule reordering :premises (t553))
% 0.65/0.87 (step t555 (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_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5))) (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.65/0.87 (anchor :step t556)
% 0.65/0.87 (assume t556.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.65/0.87 (step t556.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_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_1) (:= W tptp.e_2) (:= Y tptp.e_4) (:= Z tptp.e_5)))
% 0.65/0.87 (step t556.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_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5))) :rule or :premises (t556.t1))
% 0.65/0.87 (step t556.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5))) :rule resolution :premises (t556.t2 t556.a0))
% 0.65/0.87 (step t556 (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_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5))) :rule subproof :discharge (t556.a0))
% 0.65/0.87 (step t557 (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_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5))) :rule resolution :premises (t555 t556))
% 0.65/0.87 (step t558 (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_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5))) (not (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t559 (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_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5))) (=> (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_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5)))) :rule resolution :premises (t557 t558))
% 0.65/0.87 (step t560 (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_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5)))) :rule contraction :premises (t559))
% 0.65/0.87 (step t561 (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_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5))) :rule implies :premises (t560))
% 0.65/0.87 (step t562 (cl (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_5 tptp.e_4)) (tptp.equalish tptp.e_2 tptp.e_5))) :rule resolution :premises (t561 a42))
% 0.65/0.87 (step t563 (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 (t300 t311 t322 t333 t341 a17 a16 t343 t351 a37 t353 t361 t380 t382 t393 t404 t415 t423 a19 a17 t425 t433 t488 t490 t498 a39 t500 t511 t533 t544 t552 a19 a15 t181 t189 t133 t554 t562 a27))
% 0.65/0.87 (step t564 (cl (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_4))) :rule contraction :premises (t563))
% 0.65/0.87 (step t565 (cl (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) :rule resolution :premises (t46 a15 a16 t57 t76 t161 t564 t169))
% 0.65/0.87 (step t566 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t567)
% 0.65/0.87 (assume t567.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))))
% 0.65/0.87 (step t567.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_1) (:= Y tptp.e_2) (:= Z1 tptp.e_5) (:= Z2 tptp.e_3)))
% 0.65/0.87 (step t567.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1))) :rule or :premises (t567.t1))
% 0.65/0.87 (step t567.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1))) :rule resolution :premises (t567.t2 t567.a0))
% 0.65/0.87 (step t567 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1))) :rule subproof :discharge (t567.a0))
% 0.65/0.87 (step t568 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1))) :rule resolution :premises (t566 t567))
% 0.65/0.87 (step t569 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1))) (not (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)))) :rule implies_neg2)
% 0.65/0.87 (step t570 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)))) :rule resolution :premises (t568 t569))
% 0.65/0.87 (step t571 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)))) :rule contraction :premises (t570))
% 0.65/0.87 (step t572 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1))) :rule implies :premises (t571))
% 0.65/0.87 (step t573 (cl (or (not (tptp.product tptp.e_1 tptp.e_2 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.product tptp.e_5 tptp.e_3 tptp.e_1))) :rule resolution :premises (t572 a45))
% 0.65/0.87 (step t574 (cl (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) :rule resolution :premises (t298 t565 t133 t573))
% 0.65/0.87 (step t575 (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_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4))) (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.65/0.87 (anchor :step t576)
% 0.65/0.87 (assume t576.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.65/0.87 (step t576.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_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule forall_inst :args ((:= X tptp.e_5) (:= W tptp.e_3) (:= Y tptp.e_1) (:= Z tptp.e_4)))
% 0.65/0.87 (step t576.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_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule or :premises (t576.t1))
% 0.65/0.87 (step t576.t3 (cl (or (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule resolution :premises (t576.t2 t576.a0))
% 0.65/0.87 (step t576 (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_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule subproof :discharge (t576.a0))
% 0.65/0.87 (step t577 (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_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4))) (or (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule resolution :premises (t575 t576))
% 0.65/0.87 (step t578 (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_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4))) (not (or (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule implies_neg2)
% 0.65/0.87 (step t579 (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_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4))) (=> (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_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule resolution :premises (t577 t578))
% 0.65/0.87 (step t580 (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_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4)))) :rule contraction :premises (t579))
% 0.65/0.87 (step t581 (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_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule implies :premises (t580))
% 0.65/0.87 (step t582 (cl (or (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)) (tptp.equalish tptp.e_3 tptp.e_4))) :rule resolution :premises (t581 a42))
% 0.65/0.87 (step t583 (cl (not (tptp.product tptp.e_5 tptp.e_4 tptp.e_1))) :rule resolution :premises (t296 a30 t574 t582))
% 0.65/0.87 (step t584 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t585)
% 0.65/0.87 (assume t585.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))))
% 0.65/0.87 (step t585.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_1) (:= Y tptp.e_3) (:= Z1 tptp.e_5) (:= Z2 tptp.e_4)))
% 0.65/0.87 (step t585.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1))) :rule or :premises (t585.t1))
% 0.65/0.87 (step t585.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1))) :rule resolution :premises (t585.t2 t585.a0))
% 0.65/0.87 (step t585 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1))) :rule subproof :discharge (t585.a0))
% 0.65/0.87 (step t586 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1))) :rule resolution :premises (t584 t585))
% 0.65/0.87 (step t587 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1))) (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)))) :rule implies_neg2)
% 0.65/0.87 (step t588 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)))) :rule resolution :premises (t586 t587))
% 0.65/0.87 (step t589 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1)))) :rule contraction :premises (t588))
% 0.65/0.87 (step t590 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1))) :rule implies :premises (t589))
% 0.65/0.87 (step t591 (cl (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_5 tptp.e_4 tptp.e_1))) :rule resolution :premises (t590 a45))
% 0.65/0.87 (step t592 (cl (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_5))) :rule resolution :premises (t294 t242 t583 t591))
% 0.65/0.87 (step t593 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5))) (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) (tptp.product X Y tptp.e_5)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t594)
% 0.65/0.87 (assume t594.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) (tptp.product X Y tptp.e_5))))
% 0.65/0.87 (step t594.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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_1) (:= Y tptp.e_3)))
% 0.65/0.87 (step t594.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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5))) :rule or :premises (t594.t1))
% 0.65/0.87 (step t594.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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5))) :rule resolution :premises (t594.t2 t594.a0))
% 0.65/0.87 (step t594 (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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5))) :rule subproof :discharge (t594.a0))
% 0.65/0.87 (step t595 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5))) :rule resolution :premises (t593 t594))
% 0.65/0.87 (step t596 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t597 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5))) (=> (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)))) :rule resolution :premises (t595 t596))
% 0.65/0.87 (step t598 (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) (tptp.product X Y tptp.e_5))) (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5)))) :rule contraction :premises (t597))
% 0.65/0.87 (step t599 (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) (tptp.product X Y tptp.e_5)))) (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5))) :rule implies :premises (t598))
% 0.65/0.87 (step t600 (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) (tptp.product tptp.e_1 tptp.e_3 tptp.e_5))) :rule resolution :premises (t599 a40))
% 0.65/0.87 (step t601 (cl (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) :rule resolution :premises (t10 a15 a17 t29 t262 t292 t592 t600))
% 0.65/0.87 (step t602 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t603)
% 0.65/0.87 (assume t603.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))))
% 0.65/0.87 (step t603.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_1) (:= Y tptp.e_3) (:= Z1 tptp.e_2) (:= Z2 tptp.e_4)))
% 0.65/0.87 (step t603.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1))) :rule or :premises (t603.t1))
% 0.65/0.87 (step t603.t3 (cl (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1))) :rule resolution :premises (t603.t2 t603.a0))
% 0.65/0.87 (step t603 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1))) :rule subproof :discharge (t603.a0))
% 0.65/0.87 (step t604 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1))) :rule resolution :premises (t602 t603))
% 0.65/0.87 (step t605 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1))) (not (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)))) :rule implies_neg2)
% 0.65/0.87 (step t606 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)))) :rule resolution :premises (t604 t605))
% 0.65/0.87 (step t607 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)))) :rule contraction :premises (t606))
% 0.65/0.87 (step t608 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1))) :rule implies :premises (t607))
% 0.65/0.87 (step t609 (cl (or (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (tptp.product tptp.e_2 tptp.e_4 tptp.e_1))) :rule resolution :premises (t608 a45))
% 0.65/0.87 (step t610 (cl (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) :rule resolution :premises (t8 t601 t242 t609))
% 0.65/0.87 (step t611 (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_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5))) (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.65/0.87 (anchor :step t612)
% 0.65/0.87 (assume t612.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.65/0.87 (step t612.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_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_2) (:= W tptp.e_4) (:= Y tptp.e_1) (:= Z tptp.e_5)))
% 0.65/0.87 (step t612.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_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule or :premises (t612.t1))
% 0.65/0.87 (step t612.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule resolution :premises (t612.t2 t612.a0))
% 0.65/0.87 (step t612 (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_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule subproof :discharge (t612.a0))
% 0.65/0.87 (step t613 (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_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5))) (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule resolution :premises (t611 t612))
% 0.65/0.87 (step t614 (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_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5))) (not (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t615 (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_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5))) (=> (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_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule resolution :premises (t613 t614))
% 0.65/0.87 (step t616 (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_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule contraction :premises (t615))
% 0.65/0.87 (step t617 (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_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule implies :premises (t616))
% 0.65/0.87 (step t618 (cl (or (not (tptp.product tptp.e_2 tptp.e_4 tptp.e_1)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule resolution :premises (t617 a42))
% 0.65/0.87 (step t619 (cl (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_1))) :rule resolution :premises (t6 a35 t610 t618))
% 0.65/0.87 (step t620 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2)) :rule or_pos)
% 0.65/0.87 (step t621 (cl (tptp.equalish tptp.e_5 tptp.e_2) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_2)) (not (or (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule reordering :premises (t620))
% 0.65/0.87 (step t622 (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_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 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.65/0.87 (anchor :step t623)
% 0.65/0.87 (assume t623.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.65/0.87 (step t623.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_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_2) (:= W tptp.e_5) (:= Y tptp.e_2) (:= Z tptp.e_2)))
% 0.65/0.87 (step t623.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_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule or :premises (t623.t1))
% 0.65/0.87 (step t623.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t623.t2 t623.a0))
% 0.65/0.87 (step t623 (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_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule subproof :discharge (t623.a0))
% 0.65/0.87 (step t624 (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_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) (or (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t622 t623))
% 0.65/0.87 (step t625 (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_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) (not (or (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule implies_neg2)
% 0.65/0.87 (step t626 (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_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 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_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule resolution :premises (t624 t625))
% 0.65/0.87 (step t627 (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_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule contraction :premises (t626))
% 0.65/0.87 (step t628 (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_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule implies :premises (t627))
% 0.65/0.87 (step t629 (cl (or (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_2)) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t628 a42))
% 0.65/0.87 (step t630 (cl (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_2))) :rule resolution :premises (t621 a37 t67 t629))
% 0.65/0.87 (step t631 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1))) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1)) :rule or_pos)
% 0.65/0.87 (step t632 (cl (tptp.equalish tptp.e_5 tptp.e_1) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_3)) (not (or (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule reordering :premises (t631))
% 0.65/0.87 (step t633 (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_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 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.65/0.87 (anchor :step t634)
% 0.65/0.87 (assume t634.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.65/0.87 (step t634.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_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule forall_inst :args ((:= X tptp.e_2) (:= W tptp.e_5) (:= Y tptp.e_3) (:= Z tptp.e_1)))
% 0.65/0.87 (step t634.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_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule or :premises (t634.t1))
% 0.65/0.87 (step t634.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule resolution :premises (t634.t2 t634.a0))
% 0.65/0.87 (step t634 (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_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule subproof :discharge (t634.a0))
% 0.65/0.87 (step t635 (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_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1))) (or (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule resolution :premises (t633 t634))
% 0.65/0.87 (step t636 (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_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1))) (not (or (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule implies_neg2)
% 0.65/0.87 (step t637 (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_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 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_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule resolution :premises (t635 t636))
% 0.65/0.87 (step t638 (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_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1)))) :rule contraction :premises (t637))
% 0.65/0.87 (step t639 (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_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule implies :premises (t638))
% 0.65/0.87 (step t640 (cl (or (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_3)) (not (tptp.product tptp.e_2 tptp.e_1 tptp.e_3)) (tptp.equalish tptp.e_5 tptp.e_1))) :rule resolution :premises (t639 a42))
% 0.65/0.87 (step t641 (cl (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_3))) :rule resolution :premises (t632 a36 t133 t640))
% 0.65/0.87 (step t642 (cl (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2)) :rule or_pos)
% 0.65/0.87 (step t643 (cl (tptp.equalish tptp.e_5 tptp.e_2) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule reordering :premises (t642))
% 0.65/0.87 (step t644 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 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.65/0.87 (anchor :step t645)
% 0.65/0.87 (assume t645.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.65/0.87 (step t645.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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule forall_inst :args ((:= W tptp.e_5) (:= Y tptp.e_5) (:= X tptp.e_5) (:= Z tptp.e_2)))
% 0.65/0.87 (step t645.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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule or :premises (t645.t1))
% 0.65/0.87 (step t645.t3 (cl (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t645.t2 t645.a0))
% 0.65/0.87 (step t645 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule subproof :discharge (t645.a0))
% 0.65/0.87 (step t646 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t644 t645))
% 0.65/0.87 (step t647 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule implies_neg2)
% 0.65/0.87 (step t648 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule resolution :premises (t646 t647))
% 0.65/0.87 (step t649 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule contraction :premises (t648))
% 0.65/0.87 (step t650 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule implies :premises (t649))
% 0.65/0.87 (step t651 (cl (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t650 a43))
% 0.65/0.87 (step t652 (cl (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_5))) :rule resolution :premises (t643 a37 t371 t651))
% 0.65/0.87 (step t653 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5))) (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) (tptp.product X Y tptp.e_5)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t654)
% 0.65/0.87 (assume t654.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) (tptp.product X Y tptp.e_5))))
% 0.65/0.87 (step t654.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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_2) (:= Y tptp.e_5)))
% 0.65/0.87 (step t654.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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5))) :rule or :premises (t654.t1))
% 0.65/0.87 (step t654.t3 (cl (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5))) :rule resolution :premises (t654.t2 t654.a0))
% 0.65/0.87 (step t654 (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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5))) :rule subproof :discharge (t654.a0))
% 0.65/0.87 (step t655 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5))) :rule resolution :premises (t653 t654))
% 0.65/0.87 (step t656 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5))) (not (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t657 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5))) (=> (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)))) :rule resolution :premises (t655 t656))
% 0.65/0.87 (step t658 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5)))) :rule contraction :premises (t657))
% 0.65/0.87 (step t659 (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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5))) :rule implies :premises (t658))
% 0.65/0.87 (step t660 (cl (or (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_2 tptp.e_5 tptp.e_1) (tptp.product tptp.e_2 tptp.e_5 tptp.e_2) (tptp.product tptp.e_2 tptp.e_5 tptp.e_3) (tptp.product tptp.e_2 tptp.e_5 tptp.e_4) (tptp.product tptp.e_2 tptp.e_5 tptp.e_5))) :rule resolution :premises (t659 a40))
% 0.65/0.87 (step t661 (cl (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) :rule resolution :premises (t4 a16 a19 t619 t630 t641 t652 t660))
% 0.65/0.87 (step t662 (cl (not (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5))) (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t663 (cl (not (tptp.group_element tptp.e_2)) (not (tptp.group_element tptp.e_5)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5) (not (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)))) :rule reordering :premises (t662))
% 0.65/0.87 (step t664 (cl (not (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3)) :rule or_pos)
% 0.65/0.87 (step t665 (cl (tptp.equalish tptp.e_2 tptp.e_3) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (not (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule reordering :premises (t664))
% 0.65/0.87 (step t666 (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_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3))) (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.65/0.87 (anchor :step t667)
% 0.65/0.87 (assume t667.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.65/0.87 (step t667.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_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_5) (:= W tptp.e_2) (:= Y tptp.e_1) (:= Z tptp.e_3)))
% 0.65/0.87 (step t667.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_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule or :premises (t667.t1))
% 0.65/0.87 (step t667.t3 (cl (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t667.t2 t667.a0))
% 0.65/0.87 (step t667 (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_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule subproof :discharge (t667.a0))
% 0.65/0.87 (step t668 (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_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3))) (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t666 t667))
% 0.65/0.87 (step t669 (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_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3))) (not (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule implies_neg2)
% 0.65/0.87 (step t670 (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_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3))) (=> (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_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule resolution :premises (t668 t669))
% 0.65/0.87 (step t671 (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_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3)))) :rule contraction :premises (t670))
% 0.65/0.87 (step t672 (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_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule implies :premises (t671))
% 0.65/0.87 (step t673 (cl (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_1)) (not (tptp.product tptp.e_5 tptp.e_3 tptp.e_1)) (tptp.equalish tptp.e_2 tptp.e_3))) :rule resolution :premises (t672 a42))
% 0.65/0.87 (step t674 (cl (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_1))) :rule resolution :premises (t665 a25 t574 t673))
% 0.65/0.87 (step t675 (cl (not (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5))) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t676 (cl (tptp.equalish tptp.e_2 tptp.e_5) (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_5 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_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5)))) :rule reordering :premises (t675))
% 0.65/0.87 (step t677 (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_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5))) (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.65/0.87 (anchor :step t678)
% 0.65/0.87 (assume t678.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.65/0.87 (step t678.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_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5)))) :rule forall_inst :args ((:= W tptp.e_2) (:= Y tptp.e_2) (:= X tptp.e_2) (:= Z tptp.e_5)))
% 0.65/0.87 (step t678.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_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5))) :rule or :premises (t678.t1))
% 0.65/0.87 (step t678.t3 (cl (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5))) :rule resolution :premises (t678.t2 t678.a0))
% 0.65/0.87 (step t678 (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_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5))) :rule subproof :discharge (t678.a0))
% 0.65/0.87 (step t679 (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_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5))) (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5))) :rule resolution :premises (t677 t678))
% 0.65/0.87 (step t680 (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_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5))) (not (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t681 (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_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5))) (=> (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_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5)))) :rule resolution :premises (t679 t680))
% 0.65/0.87 (step t682 (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_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5)))) :rule contraction :premises (t681))
% 0.65/0.87 (step t683 (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_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5))) :rule implies :premises (t682))
% 0.65/0.87 (step t684 (cl (or (not (tptp.product tptp.e_2 tptp.e_2 tptp.e_2)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_2)) (tptp.equalish tptp.e_2 tptp.e_5))) :rule resolution :premises (t683 a43))
% 0.65/0.87 (step t685 (cl (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_2))) :rule resolution :premises (t676 a27 t67 t684))
% 0.65/0.87 (step t686 (cl (not (or (not (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5))) (not (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t687 (cl (tptp.equalish tptp.e_4 tptp.e_5) (not (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (not (or (not (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule reordering :premises (t686))
% 0.65/0.87 (step t688 (cl (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3))) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)) :rule or_pos)
% 0.65/0.87 (step t689 (cl (tptp.product tptp.e_4 tptp.e_2 tptp.e_3) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)))) :rule reordering :premises (t688))
% 0.65/0.87 (step t690 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t691)
% 0.65/0.87 (assume t691.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))))
% 0.65/0.87 (step t691.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)))) :rule forall_inst :args ((:= X tptp.e_3) (:= Y tptp.e_1) (:= Z1 tptp.e_4) (:= Z2 tptp.e_2)))
% 0.65/0.87 (step t691.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3))) :rule or :premises (t691.t1))
% 0.65/0.87 (step t691.t3 (cl (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3))) :rule resolution :premises (t691.t2 t691.a0))
% 0.65/0.87 (step t691 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3))) :rule subproof :discharge (t691.a0))
% 0.65/0.87 (step t692 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3))) :rule resolution :premises (t690 t691))
% 0.65/0.87 (step t693 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3))) (not (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)))) :rule implies_neg2)
% 0.65/0.87 (step t694 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)))) :rule resolution :premises (t692 t693))
% 0.65/0.87 (step t695 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)))) :rule contraction :premises (t694))
% 0.65/0.87 (step t696 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3))) :rule implies :premises (t695))
% 0.65/0.87 (step t697 (cl (or (not (tptp.product tptp.e_3 tptp.e_1 tptp.e_4)) (not (tptp.product tptp.e_1 tptp.e_3 tptp.e_2)) (tptp.product tptp.e_4 tptp.e_2 tptp.e_3))) :rule resolution :premises (t696 a45))
% 0.65/0.87 (step t698 (cl (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)) :rule resolution :premises (t689 t601 t242 t697))
% 0.65/0.87 (step t699 (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_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5))) (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.65/0.87 (anchor :step t700)
% 0.65/0.87 (assume t700.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.65/0.87 (step t700.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_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule forall_inst :args ((:= W tptp.e_4) (:= Y tptp.e_2) (:= X tptp.e_3) (:= Z tptp.e_5)))
% 0.65/0.87 (step t700.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_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule or :premises (t700.t1))
% 0.65/0.87 (step t700.t3 (cl (or (not (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule resolution :premises (t700.t2 t700.a0))
% 0.65/0.87 (step t700 (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_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule subproof :discharge (t700.a0))
% 0.65/0.87 (step t701 (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_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5))) (or (not (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule resolution :premises (t699 t700))
% 0.65/0.87 (step t702 (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_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5))) (not (or (not (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t703 (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_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5))) (=> (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_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule resolution :premises (t701 t702))
% 0.65/0.87 (step t704 (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_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule contraction :premises (t703))
% 0.65/0.87 (step t705 (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_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule implies :premises (t704))
% 0.65/0.87 (step t706 (cl (or (not (tptp.product tptp.e_4 tptp.e_2 tptp.e_3)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule resolution :premises (t705 a43))
% 0.65/0.87 (step t707 (cl (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_3))) :rule resolution :premises (t687 a35 t698 t706))
% 0.65/0.87 (step t708 (cl (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2)) :rule or_pos)
% 0.65/0.87 (step t709 (cl (tptp.equalish tptp.e_5 tptp.e_2) (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule reordering :premises (t708))
% 0.65/0.87 (step t710 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 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.65/0.87 (anchor :step t711)
% 0.65/0.87 (assume t711.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.65/0.87 (step t711.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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule forall_inst :args ((:= X tptp.e_5) (:= W tptp.e_5) (:= Y tptp.e_5) (:= Z tptp.e_2)))
% 0.65/0.87 (step t711.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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule or :premises (t711.t1))
% 0.65/0.87 (step t711.t3 (cl (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t711.t2 t711.a0))
% 0.65/0.87 (step t711 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule subproof :discharge (t711.a0))
% 0.65/0.87 (step t712 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t710 t711))
% 0.65/0.87 (step t713 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) (not (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule implies_neg2)
% 0.65/0.87 (step t714 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule resolution :premises (t712 t713))
% 0.65/0.87 (step t715 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2)))) :rule contraction :premises (t714))
% 0.65/0.87 (step t716 (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_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule implies :premises (t715))
% 0.65/0.87 (step t717 (cl (or (not (tptp.product tptp.e_5 tptp.e_5 tptp.e_5)) (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)) (tptp.equalish tptp.e_5 tptp.e_2))) :rule resolution :premises (t716 a42))
% 0.65/0.87 (step t718 (cl (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_5))) :rule resolution :premises (t709 a37 t371 t717))
% 0.65/0.87 (step t719 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5))) (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) (tptp.product X Y tptp.e_5)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t720)
% 0.65/0.87 (assume t720.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) (tptp.product X Y tptp.e_5))))
% 0.65/0.87 (step t720.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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_5) (:= Y tptp.e_2)))
% 0.65/0.87 (step t720.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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5))) :rule or :premises (t720.t1))
% 0.65/0.87 (step t720.t3 (cl (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5))) :rule resolution :premises (t720.t2 t720.a0))
% 0.65/0.87 (step t720 (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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5))) :rule subproof :discharge (t720.a0))
% 0.65/0.87 (step t721 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5))) :rule resolution :premises (t719 t720))
% 0.65/0.87 (step t722 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5))) (not (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t723 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5))) (=> (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)))) :rule resolution :premises (t721 t722))
% 0.65/0.87 (step t724 (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) (tptp.product X Y tptp.e_5))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5)))) :rule contraction :premises (t723))
% 0.65/0.87 (step t725 (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) (tptp.product X Y tptp.e_5)))) (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5))) :rule implies :premises (t724))
% 0.65/0.87 (step t726 (cl (or (not (tptp.group_element tptp.e_5)) (not (tptp.group_element tptp.e_2)) (tptp.product tptp.e_5 tptp.e_2 tptp.e_1) (tptp.product tptp.e_5 tptp.e_2 tptp.e_2) (tptp.product tptp.e_5 tptp.e_2 tptp.e_3) (tptp.product tptp.e_5 tptp.e_2 tptp.e_4) (tptp.product tptp.e_5 tptp.e_2 tptp.e_5))) :rule resolution :premises (t725 a40))
% 0.65/0.87 (step t727 (cl (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) :rule resolution :premises (t663 a16 a19 t674 t685 t707 t718 t726))
% 0.65/0.87 (step t728 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5))) (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t729)
% 0.65/0.87 (assume t729.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))))
% 0.65/0.87 (step t729.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_5) (:= Y tptp.e_2) (:= Z1 tptp.e_4) (:= Z2 tptp.e_4)))
% 0.65/0.87 (step t729.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5))) :rule or :premises (t729.t1))
% 0.65/0.87 (step t729.t3 (cl (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5))) :rule resolution :premises (t729.t2 t729.a0))
% 0.65/0.87 (step t729 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5))) :rule subproof :discharge (t729.a0))
% 0.65/0.87 (step t730 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5))) (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5))) :rule resolution :premises (t728 t729))
% 0.65/0.87 (step t731 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5))) (not (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t732 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)))) :rule resolution :premises (t730 t731))
% 0.65/0.87 (step t733 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X))) (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)))) :rule contraction :premises (t732))
% 0.65/0.87 (step t734 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z1 $$unsorted) (Z2 $$unsorted)) (or (not (tptp.product X Y Z1)) (not (tptp.product Y X Z2)) (tptp.product Z1 Z2 X)))) (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5))) :rule implies :premises (t733))
% 0.65/0.87 (step t735 (cl (or (not (tptp.product tptp.e_5 tptp.e_2 tptp.e_4)) (not (tptp.product tptp.e_2 tptp.e_5 tptp.e_4)) (tptp.product tptp.e_4 tptp.e_4 tptp.e_5))) :rule resolution :premises (t734 a45))
% 0.65/0.87 (step t736 (cl (not (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5))) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5)) :rule or_pos)
% 0.65/0.87 (step t737 (cl (tptp.equalish tptp.e_4 tptp.e_5) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (not (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule reordering :premises (t736))
% 0.65/0.87 (step t738 (cl (=> (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))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5))) (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)))) :rule implies_neg1)
% 0.65/0.87 (anchor :step t739)
% 0.65/0.87 (assume t739.a0 (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.65/0.87 (step t739.t1 (cl (or (not (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)))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule forall_inst :args ((:= X tptp.e_4) (:= Y tptp.e_4) (:= W tptp.e_4) (:= Z tptp.e_5)))
% 0.65/0.87 (step t739.t2 (cl (not (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)))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule or :premises (t739.t1))
% 0.65/0.87 (step t739.t3 (cl (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule resolution :premises (t739.t2 t739.a0))
% 0.65/0.87 (step t739 (cl (not (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)))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule subproof :discharge (t739.a0))
% 0.65/0.87 (step t740 (cl (=> (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))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule resolution :premises (t738 t739))
% 0.65/0.87 (step t741 (cl (=> (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))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5))) (not (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule implies_neg2)
% 0.65/0.87 (step t742 (cl (=> (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))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5))) (=> (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))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule resolution :premises (t740 t741))
% 0.65/0.87 (step t743 (cl (=> (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))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5)))) :rule contraction :premises (t742))
% 0.65/0.87 (step t744 (cl (not (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)))) (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule implies :premises (t743))
% 0.65/0.87 (step t745 (cl (or (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_4)) (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5)) (tptp.equalish tptp.e_4 tptp.e_5))) :rule resolution :premises (t744 a41))
% 0.65/0.87 (step t746 (cl (not (tptp.product tptp.e_4 tptp.e_4 tptp.e_5))) :rule resolution :premises (t737 a35 t274 t745))
% 0.65/0.87 (step t747 (cl) :rule resolution :premises (t2 t661 t727 t735 t746))
% 0.65/0.87
% 0.65/0.87 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.pvPASvECUn/cvc5---1.0.5_10542.smt2
% 0.65/0.88 % cvc5---1.0.5 exiting
% 0.65/0.88 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------