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

% Computer : n024.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:50:17 EDT 2024

% Result   : Unsatisfiable 44.70s 44.95s
% Output   : Proof 44.70s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : GRP012-3 : TPTP v8.2.0. Released v1.0.0.
% 0.12/0.14  % Command    : do_cvc5 %s %d
% 0.15/0.35  % Computer : n024.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Sun May 26 19:33:39 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.22/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.35/10.54  --- Run --no-e-matching --full-saturate-quant at 5...
% 15.31/15.56  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.31/20.58  --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.49/25.69  --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 30.51/30.71  --- Run --trigger-sel=max --full-saturate-quant at 5...
% 35.52/35.74  --- Run --multi-trigger-when-single --multi-trigger-priority --full-saturate-quant at 5...
% 40.52/40.77  --- Run --multi-trigger-cache --full-saturate-quant at 5...
% 44.70/44.95  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.dUSIroWvky/cvc5---1.0.5_29240.smt2
% 44.70/44.95  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.dUSIroWvky/cvc5---1.0.5_29240.smt2
% 44.70/44.96  (assume a0 (forall ((X $$unsorted)) (tptp.product tptp.identity X X)))
% 44.70/44.96  (assume a1 (forall ((X $$unsorted)) (tptp.product X tptp.identity X)))
% 44.70/44.96  (assume a2 (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity)))
% 44.70/44.96  (assume a3 (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)))
% 44.70/44.96  (assume a4 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))))
% 44.70/44.96  (assume a5 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))))
% 44.70/44.96  (assume a6 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W))))
% 44.70/44.96  (assume a7 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))))
% 44.70/44.96  (assume a8 (not (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))))
% 44.70/44.96  (step t1 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))) (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W)))) :rule implies_neg1)
% 44.70/44.96  (anchor :step t2)
% 44.70/44.96  (assume t2.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))))
% 44.70/44.96  (step t2.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W)))) (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))))) :rule forall_inst :args ((:= X (tptp.inverse tptp.b)) (:= Y (tptp.inverse tptp.a)) (:= Z (tptp.inverse (tptp.multiply tptp.a tptp.b))) (:= W (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))))
% 44.70/44.96  (step t2.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W)))) (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))))) :rule or :premises (t2.t1))
% 44.70/44.96  (step t2.t3 (cl (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))))) :rule resolution :premises (t2.t2 t2.a0))
% 44.70/44.96  (step t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W)))) (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))))) :rule subproof :discharge (t2.a0))
% 44.70/44.96  (step t3 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))) (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))))) (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))))) :rule resolution :premises (t1 t2))
% 44.70/44.96  (step t4 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))) (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))))) (not (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))))) :rule implies_neg2)
% 44.70/44.96  (step t5 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))) (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))) (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))))) :rule resolution :premises (t3 t4))
% 44.70/44.96  (step t6 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W))) (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))))) :rule contraction :premises (t5))
% 44.70/44.96  (step t7 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y Z)) (not (tptp.product X Y W)) (= Z W)))) (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))))) :rule implies :premises (t6))
% 44.70/44.96  (step t8 (cl (not (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) :rule or_pos)
% 44.70/44.96  (step t9 (cl (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))))) :rule reordering :premises (t8))
% 44.70/44.96  (step t10 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) :rule implies_neg1)
% 44.70/44.96  (anchor :step t11)
% 44.70/44.96  (assume t11.a0 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))))
% 44.70/44.96  (step t11.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))))) :rule forall_inst :args ((:= X (tptp.inverse tptp.b)) (:= Y (tptp.inverse tptp.a))))
% 44.70/44.96  (step t11.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) :rule or :premises (t11.t1))
% 44.70/44.96  (step t11.t3 (cl (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) :rule resolution :premises (t11.t2 t11.a0))
% 44.70/44.96  (step t11 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) :rule subproof :discharge (t11.a0))
% 44.70/44.96  (step t12 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) :rule resolution :premises (t10 t11))
% 44.70/44.96  (step t13 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))))) :rule implies_neg2)
% 44.70/44.96  (step t14 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))))) :rule resolution :premises (t12 t13))
% 44.70/44.96  (step t15 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))))) :rule contraction :premises (t14))
% 44.70/44.96  (step t16 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) :rule implies :premises (t15))
% 44.70/44.96  (step t17 (cl (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) :rule resolution :premises (t16 a4))
% 44.70/44.96  (step t18 (cl (not (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) :rule or_pos)
% 44.70/44.96  (step t19 (cl (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b))) (not (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))))) :rule reordering :premises (t18))
% 44.70/44.96  (step t20 (cl (=> (forall ((X $$unsorted)) (tptp.product tptp.identity X X)) (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (forall ((X $$unsorted)) (tptp.product tptp.identity X X))) :rule implies_neg1)
% 44.70/44.96  (anchor :step t21)
% 44.70/44.96  (assume t21.a0 (forall ((X $$unsorted)) (tptp.product tptp.identity X X)))
% 44.70/44.96  (step t21.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product tptp.identity X X))) (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b)))) :rule forall_inst :args ((:= X (tptp.inverse tptp.b))))
% 44.70/44.96  (step t21.t2 (cl (not (forall ((X $$unsorted)) (tptp.product tptp.identity X X))) (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) :rule or :premises (t21.t1))
% 44.70/44.96  (step t21.t3 (cl (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) :rule resolution :premises (t21.t2 t21.a0))
% 44.70/44.96  (step t21 (cl (not (forall ((X $$unsorted)) (tptp.product tptp.identity X X))) (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) :rule subproof :discharge (t21.a0))
% 44.70/44.96  (step t22 (cl (=> (forall ((X $$unsorted)) (tptp.product tptp.identity X X)) (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) :rule resolution :premises (t20 t21))
% 44.70/44.96  (step t23 (cl (=> (forall ((X $$unsorted)) (tptp.product tptp.identity X X)) (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b)))) :rule implies_neg2)
% 44.70/44.96  (step t24 (cl (=> (forall ((X $$unsorted)) (tptp.product tptp.identity X X)) (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (=> (forall ((X $$unsorted)) (tptp.product tptp.identity X X)) (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b)))) :rule resolution :premises (t22 t23))
% 44.70/44.96  (step t25 (cl (=> (forall ((X $$unsorted)) (tptp.product tptp.identity X X)) (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b)))) :rule contraction :premises (t24))
% 44.70/44.96  (step t26 (cl (not (forall ((X $$unsorted)) (tptp.product tptp.identity X X))) (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) :rule implies :premises (t25))
% 44.70/44.96  (step t27 (cl (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) :rule resolution :premises (t26 a0))
% 44.70/44.96  (step t28 (cl (not (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) :rule or_pos)
% 44.70/44.96  (step t29 (cl (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b))) (not (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))))) :rule reordering :premises (t28))
% 44.70/44.96  (step t30 (cl (=> (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity)) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity))) :rule implies_neg1)
% 44.70/44.96  (anchor :step t31)
% 44.70/44.96  (assume t31.a0 (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity)))
% 44.70/44.96  (step t31.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity))) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity))) :rule forall_inst :args ((:= X (tptp.multiply tptp.a tptp.b))))
% 44.70/44.96  (step t31.t2 (cl (not (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity))) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) :rule or :premises (t31.t1))
% 44.70/44.96  (step t31.t3 (cl (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) :rule resolution :premises (t31.t2 t31.a0))
% 44.70/44.96  (step t31 (cl (not (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity))) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) :rule subproof :discharge (t31.a0))
% 44.70/44.96  (step t32 (cl (=> (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity)) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) :rule resolution :premises (t30 t31))
% 44.70/44.96  (step t33 (cl (=> (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity)) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity))) :rule implies_neg2)
% 44.70/44.96  (step t34 (cl (=> (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity)) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (=> (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity)) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity))) :rule resolution :premises (t32 t33))
% 44.70/44.96  (step t35 (cl (=> (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity)) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity))) :rule contraction :premises (t34))
% 44.70/44.96  (step t36 (cl (not (forall ((X $$unsorted)) (tptp.product (tptp.inverse X) X tptp.identity))) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) :rule implies :premises (t35))
% 44.70/44.96  (step t37 (cl (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) :rule resolution :premises (t36 a2))
% 44.70/44.96  (step t38 (cl (not (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity))) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) :rule or_pos)
% 44.70/44.96  (step t39 (cl (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity) (not (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)))) :rule reordering :premises (t38))
% 44.70/44.96  (step t40 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) :rule implies_neg1)
% 44.70/44.96  (anchor :step t41)
% 44.70/44.96  (assume t41.a0 (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)))
% 44.70/44.96  (step t41.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity))) :rule forall_inst :args ((:= X tptp.a)))
% 44.70/44.96  (step t41.t2 (cl (not (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) :rule or :premises (t41.t1))
% 44.70/44.96  (step t41.t3 (cl (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) :rule resolution :premises (t41.t2 t41.a0))
% 44.70/44.96  (step t41 (cl (not (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) :rule subproof :discharge (t41.a0))
% 44.70/44.96  (step t42 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) :rule resolution :premises (t40 t41))
% 44.70/44.96  (step t43 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity))) :rule implies_neg2)
% 44.70/44.96  (step t44 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity))) :rule resolution :premises (t42 t43))
% 44.70/44.96  (step t45 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity))) :rule contraction :premises (t44))
% 44.70/44.96  (step t46 (cl (not (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) :rule implies :premises (t45))
% 44.70/44.96  (step t47 (cl (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) :rule resolution :premises (t46 a3))
% 44.70/44.96  (step t48 (cl (not (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a))) (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) :rule or_pos)
% 44.70/44.96  (step t49 (cl (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a) (not (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)))) :rule reordering :premises (t48))
% 44.70/44.96  (step t50 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) :rule implies_neg1)
% 44.70/44.96  (anchor :step t51)
% 44.70/44.96  (assume t51.a0 (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)))
% 44.70/44.96  (step t51.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity))) :rule forall_inst :args ((:= X tptp.b)))
% 44.70/44.96  (step t51.t2 (cl (not (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) :rule or :premises (t51.t1))
% 44.70/44.96  (step t51.t3 (cl (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) :rule resolution :premises (t51.t2 t51.a0))
% 44.70/44.96  (step t51 (cl (not (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) :rule subproof :discharge (t51.a0))
% 44.70/44.96  (step t52 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) :rule resolution :premises (t50 t51))
% 44.70/44.96  (step t53 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity))) :rule implies_neg2)
% 44.70/44.96  (step t54 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity))) :rule resolution :premises (t52 t53))
% 44.70/44.96  (step t55 (cl (=> (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity)) (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity))) :rule contraction :premises (t54))
% 44.70/44.96  (step t56 (cl (not (forall ((X $$unsorted)) (tptp.product X (tptp.inverse X) tptp.identity))) (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) :rule implies :premises (t55))
% 44.70/44.96  (step t57 (cl (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) :rule resolution :premises (t56 a3))
% 44.70/44.96  (step t58 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) :rule implies_neg1)
% 44.70/44.96  (anchor :step t59)
% 44.70/44.96  (assume t59.a0 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))))
% 44.70/44.96  (step t59.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b)))) :rule forall_inst :args ((:= X tptp.a) (:= Y tptp.b)))
% 44.70/44.96  (step t59.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) :rule or :premises (t59.t1))
% 44.70/44.96  (step t59.t3 (cl (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) :rule resolution :premises (t59.t2 t59.a0))
% 44.70/44.96  (step t59 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) :rule subproof :discharge (t59.a0))
% 44.70/44.96  (step t60 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) :rule resolution :premises (t58 t59))
% 44.70/44.96  (step t61 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b)))) :rule implies_neg2)
% 44.70/44.96  (step t62 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b)))) :rule resolution :premises (t60 t61))
% 44.70/44.96  (step t63 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y))) (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b)))) :rule contraction :premises (t62))
% 44.70/44.96  (step t64 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.product X Y (tptp.multiply X Y)))) (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) :rule implies :premises (t63))
% 44.70/44.96  (step t65 (cl (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) :rule resolution :premises (t64 a4))
% 44.70/44.96  (step t66 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product tptp.a tptp.identity tptp.a)) (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) :rule implies_neg1)
% 44.70/44.96  (anchor :step t67)
% 44.70/44.96  (assume t67.a0 (forall ((X $$unsorted)) (tptp.product X tptp.identity X)))
% 44.70/44.96  (step t67.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) (tptp.product tptp.a tptp.identity tptp.a))) :rule forall_inst :args ((:= X tptp.a)))
% 44.70/44.96  (step t67.t2 (cl (not (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) (tptp.product tptp.a tptp.identity tptp.a)) :rule or :premises (t67.t1))
% 44.70/44.96  (step t67.t3 (cl (tptp.product tptp.a tptp.identity tptp.a)) :rule resolution :premises (t67.t2 t67.a0))
% 44.70/44.96  (step t67 (cl (not (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) (tptp.product tptp.a tptp.identity tptp.a)) :rule subproof :discharge (t67.a0))
% 44.70/44.96  (step t68 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product tptp.a tptp.identity tptp.a)) :rule resolution :premises (t66 t67))
% 44.70/44.96  (step t69 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product tptp.a tptp.identity tptp.a)) (not (tptp.product tptp.a tptp.identity tptp.a))) :rule implies_neg2)
% 44.70/44.96  (step t70 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product tptp.a tptp.identity tptp.a)) (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product tptp.a tptp.identity tptp.a))) :rule resolution :premises (t68 t69))
% 44.70/44.96  (step t71 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product tptp.a tptp.identity tptp.a))) :rule contraction :premises (t70))
% 44.70/44.96  (step t72 (cl (not (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) (tptp.product tptp.a tptp.identity tptp.a)) :rule implies :premises (t71))
% 44.70/44.96  (step t73 (cl (tptp.product tptp.a tptp.identity tptp.a)) :rule resolution :premises (t72 a1))
% 44.70/44.96  (step t74 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) :rule implies_neg1)
% 44.70/44.96  (anchor :step t75)
% 44.70/44.96  (assume t75.a0 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))))
% 44.70/44.96  (step t75.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)))) :rule forall_inst :args ((:= X tptp.a) (:= Y tptp.b) (:= U (tptp.multiply tptp.a tptp.b)) (:= Z (tptp.inverse tptp.b)) (:= V tptp.identity) (:= W tptp.a)))
% 44.70/44.96  (step t75.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a))) :rule or :premises (t75.t1))
% 44.70/44.96  (step t75.t3 (cl (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a))) :rule resolution :premises (t75.t2 t75.a0))
% 44.70/44.96  (step t75 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a))) :rule subproof :discharge (t75.a0))
% 44.70/44.96  (step t76 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a))) (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a))) :rule resolution :premises (t74 t75))
% 44.70/44.96  (step t77 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a))) (not (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)))) :rule implies_neg2)
% 44.70/44.96  (step t78 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a))) (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)))) :rule resolution :premises (t76 t77))
% 44.70/44.96  (step t79 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)))) :rule contraction :premises (t78))
% 44.70/44.96  (step t80 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a))) :rule implies :premises (t79))
% 44.70/44.96  (step t81 (cl (or (not (tptp.product tptp.a tptp.b (tptp.multiply tptp.a tptp.b))) (not (tptp.product tptp.b (tptp.inverse tptp.b) tptp.identity)) (not (tptp.product tptp.a tptp.identity tptp.a)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a))) :rule resolution :premises (t80 a7))
% 44.70/44.96  (step t82 (cl (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) :rule resolution :premises (t49 t57 t65 t73 t81))
% 44.70/44.96  (step t83 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W))) (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W)))) :rule implies_neg1)
% 44.70/44.96  (anchor :step t84)
% 44.70/44.96  (assume t84.a0 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W))))
% 44.70/44.96  (step t84.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W)))) (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)))) :rule forall_inst :args ((:= X (tptp.multiply tptp.a tptp.b)) (:= Y (tptp.inverse tptp.b)) (:= U tptp.a) (:= Z (tptp.inverse tptp.a)) (:= V (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))) (:= W tptp.identity)))
% 44.70/44.96  (step t84.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W)))) (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity))) :rule or :premises (t84.t1))
% 44.70/44.96  (step t84.t3 (cl (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity))) :rule resolution :premises (t84.t2 t84.a0))
% 44.70/44.96  (step t84 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W)))) (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity))) :rule subproof :discharge (t84.a0))
% 44.70/44.96  (step t85 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W))) (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity))) (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity))) :rule resolution :premises (t83 t84))
% 44.70/44.96  (step t86 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W))) (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity))) (not (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)))) :rule implies_neg2)
% 44.70/44.96  (step t87 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W))) (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity))) (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W))) (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)))) :rule resolution :premises (t85 t86))
% 44.70/44.96  (step t88 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W))) (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)))) :rule contraction :premises (t87))
% 44.70/44.96  (step t89 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product U Z W)) (tptp.product X V W)))) (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity))) :rule implies :premises (t88))
% 44.70/44.96  (step t90 (cl (or (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.inverse tptp.b) tptp.a)) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.a (tptp.inverse tptp.a) tptp.identity)) (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity))) :rule resolution :premises (t89 a6))
% 44.70/44.96  (step t91 (cl (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) :rule resolution :premises (t39 t47 t17 t82 t90))
% 44.70/44.96  (step t92 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) :rule implies_neg1)
% 44.70/44.96  (anchor :step t93)
% 44.70/44.96  (assume t93.a0 (forall ((X $$unsorted)) (tptp.product X tptp.identity X)))
% 44.70/44.96  (step t93.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule forall_inst :args ((:= X (tptp.inverse (tptp.multiply tptp.a tptp.b)))))
% 44.70/44.96  (step t93.t2 (cl (not (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) :rule or :premises (t93.t1))
% 44.70/44.96  (step t93.t3 (cl (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) :rule resolution :premises (t93.t2 t93.a0))
% 44.70/44.96  (step t93 (cl (not (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) :rule subproof :discharge (t93.a0))
% 44.70/44.96  (step t94 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) :rule resolution :premises (t92 t93))
% 44.70/44.96  (step t95 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule implies_neg2)
% 44.70/44.96  (step t96 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule resolution :premises (t94 t95))
% 44.70/44.96  (step t97 (cl (=> (forall ((X $$unsorted)) (tptp.product X tptp.identity X)) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule contraction :premises (t96))
% 44.70/44.96  (step t98 (cl (not (forall ((X $$unsorted)) (tptp.product X tptp.identity X))) (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) :rule implies :premises (t97))
% 44.70/44.96  (step t99 (cl (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) :rule resolution :premises (t98 a1))
% 44.70/44.96  (step t100 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) :rule implies_neg1)
% 44.70/44.96  (anchor :step t101)
% 44.70/44.96  (assume t101.a0 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))))
% 44.70/44.96  (step t101.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))))) :rule forall_inst :args ((:= X (tptp.inverse (tptp.multiply tptp.a tptp.b))) (:= Y (tptp.multiply tptp.a tptp.b)) (:= U tptp.identity) (:= Z (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))) (:= V tptp.identity) (:= W (tptp.inverse (tptp.multiply tptp.a tptp.b)))))
% 44.70/44.96  (step t101.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule or :premises (t101.t1))
% 44.70/44.96  (step t101.t3 (cl (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule resolution :premises (t101.t2 t101.a0))
% 44.70/44.96  (step t101 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule subproof :discharge (t101.a0))
% 44.70/44.96  (step t102 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule resolution :premises (t100 t101))
% 44.70/44.96  (step t103 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) (not (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))))) :rule implies_neg2)
% 44.70/44.96  (step t104 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))))) :rule resolution :premises (t102 t103))
% 44.70/44.96  (step t105 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))))) :rule contraction :premises (t104))
% 44.70/44.96  (step t106 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule implies :premises (t105))
% 44.70/44.96  (step t107 (cl (or (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply tptp.a tptp.b) tptp.identity)) (not (tptp.product (tptp.multiply tptp.a tptp.b) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) tptp.identity)) (not (tptp.product (tptp.inverse (tptp.multiply tptp.a tptp.b)) tptp.identity (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule resolution :premises (t106 a7))
% 44.70/44.96  (step t108 (cl (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) :rule resolution :premises (t29 t37 t91 t99 t107))
% 44.70/44.96  (step t109 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) :rule implies_neg1)
% 44.70/44.96  (anchor :step t110)
% 44.70/44.96  (assume t110.a0 (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))))
% 44.70/44.96  (step t110.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))))) :rule forall_inst :args ((:= X tptp.identity) (:= Y (tptp.inverse tptp.b)) (:= U (tptp.inverse tptp.b)) (:= Z (tptp.inverse tptp.a)) (:= V (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a))) (:= W (tptp.inverse (tptp.multiply tptp.a tptp.b)))))
% 44.70/44.96  (step t110.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule or :premises (t110.t1))
% 44.70/44.96  (step t110.t3 (cl (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule resolution :premises (t110.t2 t110.a0))
% 44.70/44.96  (step t110 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule subproof :discharge (t110.a0))
% 44.70/44.96  (step t111 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule resolution :premises (t109 t110))
% 44.70/44.96  (step t112 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) (not (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))))) :rule implies_neg2)
% 44.70/44.96  (step t113 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))))) :rule resolution :premises (t111 t112))
% 44.70/44.96  (step t114 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W))) (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))))) :rule contraction :premises (t113))
% 44.70/44.96  (step t115 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (U $$unsorted) (Z $$unsorted) (V $$unsorted) (W $$unsorted)) (or (not (tptp.product X Y U)) (not (tptp.product Y Z V)) (not (tptp.product X V W)) (tptp.product U Z W)))) (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule implies :premises (t114))
% 44.70/44.96  (step t116 (cl (or (not (tptp.product tptp.identity (tptp.inverse tptp.b) (tptp.inverse tptp.b))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (not (tptp.product tptp.identity (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b))))) :rule resolution :premises (t115 a7))
% 44.70/44.96  (step t117 (cl (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) :rule resolution :premises (t19 t17 t27 t108 t116))
% 44.70/44.96  (step t118 (cl (not (or (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.inverse (tptp.multiply tptp.a tptp.b)))) (not (tptp.product (tptp.inverse tptp.b) (tptp.inverse tptp.a) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))) (= (tptp.inverse (tptp.multiply tptp.a tptp.b)) (tptp.multiply (tptp.inverse tptp.b) (tptp.inverse tptp.a)))))) :rule resolution :premises (t9 a8 t17 t117))
% 44.70/44.96  (step t119 (cl) :rule resolution :premises (t7 t118 a5))
% 44.70/44.96  
% 44.70/44.96  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.dUSIroWvky/cvc5---1.0.5_29240.smt2
% 44.70/44.97  % cvc5---1.0.5 exiting
% 44.70/44.97  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------