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

% Computer : n012.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 17:09:33 EDT 2024

% Result   : Unsatisfiable 21.22s 21.48s
% Output   : Proof 21.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : HEN007-5 : TPTP v8.2.0. Released v1.0.0.
% 0.11/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n012.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 27 17:07:09 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.51  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 10.33/10.58  --- Run --no-e-matching --full-saturate-quant at 5...
% 15.39/15.60  --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.40/20.63  --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 21.22/21.48  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.kDWW1adgB5/cvc5---1.0.5_19114.smt2
% 21.22/21.48  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.kDWW1adgB5/cvc5---1.0.5_19114.smt2
% 21.22/21.49  (assume a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) tptp.zero)))
% 21.22/21.49  (assume a1 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) tptp.zero)))
% 21.22/21.49  (assume a2 (forall ((X $$unsorted)) (= (tptp.divide tptp.zero X) tptp.zero)))
% 21.22/21.49  (assume a3 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) tptp.zero)) (not (= (tptp.divide Y X) tptp.zero)) (= X Y))))
% 21.22/21.49  (assume a4 (forall ((X $$unsorted)) (= (tptp.divide X tptp.identity) tptp.zero)))
% 21.22/21.49  (assume a5 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) tptp.zero)) (not (= (tptp.divide Y Z) tptp.zero)) (= (tptp.divide X Z) tptp.zero))))
% 21.22/21.49  (assume a6 (= (tptp.divide tptp.a tptp.b) tptp.zero))
% 21.22/21.49  (assume a7 (not (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) tptp.zero)))
% 21.22/21.49  (step t1 (cl (not (= (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))))) (not (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a))))) :rule equiv_pos2)
% 21.22/21.49  (step t2 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))))) :rule refl)
% 21.22/21.49  (step t3 (cl (= (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a))))) :rule all_simplify)
% 21.22/21.49  (step t4 (cl (= (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))))) :rule cong :premises (t2 t3))
% 21.22/21.49  (step t5 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b)))) :rule implies_neg1)
% 21.22/21.49  (anchor :step t6)
% 21.22/21.49  (assume t6.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))))
% 21.22/21.49  (step t6.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) :rule forall_inst :args ((:= X (tptp.divide tptp.c tptp.a)) (:= Y tptp.b)))
% 21.22/21.49  (step t6.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) :rule or :premises (t6.t1))
% 21.22/21.49  (step t6.t3 (cl (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) :rule resolution :premises (t6.t2 t6.a0))
% 21.22/21.49  (step t6 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) :rule subproof :discharge (t6.a0))
% 21.22/21.49  (step t7 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) :rule resolution :premises (t5 t6))
% 21.22/21.49  (step t8 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) :rule implies_neg2)
% 21.22/21.49  (step t9 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) :rule resolution :premises (t7 t8))
% 21.22/21.49  (step t10 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) :rule contraction :premises (t9))
% 21.22/21.49  (step t11 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a))))) :rule resolution :premises (t1 t4 t10))
% 21.22/21.49  (step t12 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))) :rule implies :premises (t11))
% 21.22/21.49  (step t13 (cl (not (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) :rule or_pos)
% 21.22/21.49  (step t14 (cl (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))) (not (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) :rule reordering :premises (t13))
% 21.22/21.49  (step t15 (cl (not (= (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))))) (not (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b)))) (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b))))) :rule equiv_pos2)
% 21.22/21.49  (step t16 (cl (= (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))))) :rule refl)
% 21.22/21.49  (step t17 (cl (= (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b))))) :rule all_simplify)
% 21.22/21.49  (step t18 (cl (= (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))))) :rule cong :premises (t16 t17))
% 21.22/21.49  (step t19 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b)))) :rule implies_neg1)
% 21.22/21.49  (anchor :step t20)
% 21.22/21.49  (assume t20.a0 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))))
% 21.22/21.49  (step t20.t1 (cl (or (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule forall_inst :args ((:= X tptp.c) (:= Z tptp.b) (:= Y tptp.a)))
% 21.22/21.49  (step t20.t2 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) :rule or :premises (t20.t1))
% 21.22/21.49  (step t20.t3 (cl (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) :rule resolution :premises (t20.t2 t20.a0))
% 21.22/21.49  (step t20 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) :rule subproof :discharge (t20.a0))
% 21.22/21.49  (step t21 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) :rule resolution :premises (t19 t20))
% 21.22/21.49  (step t22 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule implies_neg2)
% 21.22/21.49  (step t23 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule resolution :premises (t21 t22))
% 21.22/21.49  (step t24 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule contraction :premises (t23))
% 21.22/21.49  (step t25 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b))))) :rule resolution :premises (t15 t18 t24))
% 21.22/21.49  (step t26 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))) :rule implies :premises (t25))
% 21.22/21.49  (step t27 (cl (not (= (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) tptp.zero)) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))))) (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) tptp.zero))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b)))) :rule equiv_pos2)
% 21.22/21.49  (anchor :step t28 :args ((X $$unsorted) (:= X X) (Z $$unsorted) (:= Z Z) (Y $$unsorted) (:= Y Y)))
% 21.22/21.49  (step t28.t1 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t28.t2 (cl (= Z Z)) :rule refl)
% 21.22/21.49  (step t28.t3 (cl (= Y Y)) :rule refl)
% 21.22/21.49  (step t28.t4 (cl (= (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) tptp.zero) (= tptp.zero (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z))))) :rule all_simplify)
% 21.22/21.49  (step t28 (cl (= (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) tptp.zero)) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= tptp.zero (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)))))) :rule bind)
% 21.22/21.49  (anchor :step t29 :args ((X $$unsorted) (:= X X) (Z $$unsorted) (:= Z Z) (Y $$unsorted) (:= Y Y)))
% 21.22/21.49  (step t29.t1 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t29.t2 (cl (= Z Z)) :rule refl)
% 21.22/21.49  (step t29.t3 (cl (= Y Y)) :rule refl)
% 21.22/21.49  (step t29.t4 (cl (= tptp.zero (tptp.divide tptp.a tptp.b))) :rule symm :premises (a6))
% 21.22/21.49  (step t29.t5 (cl (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)))) :rule refl)
% 21.22/21.49  (step t29.t6 (cl (= (= tptp.zero (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z))))) :rule cong :premises (t29.t4 t29.t5))
% 21.22/21.49  (step t29 (cl (= (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= tptp.zero (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)))))) :rule bind)
% 21.22/21.49  (anchor :step t30 :args ((X $$unsorted) (:= X X) (Z $$unsorted) (:= Z Z) (Y $$unsorted) (:= Y Y)))
% 21.22/21.49  (step t30.t1 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t30.t2 (cl (= Z Z)) :rule refl)
% 21.22/21.49  (step t30.t3 (cl (= Y Y)) :rule refl)
% 21.22/21.49  (step t30.t4 (cl (= (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z))) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b)))) :rule all_simplify)
% 21.22/21.49  (step t30 (cl (= (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))))) :rule bind)
% 21.22/21.49  (step t31 (cl (= (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= tptp.zero (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))))) :rule trans :premises (t29 t30))
% 21.22/21.49  (step t32 (cl (= (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) tptp.zero)) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))))) :rule trans :premises (t28 t31))
% 21.22/21.49  (step t33 (cl (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b)))) :rule resolution :premises (t27 t32 a1))
% 21.22/21.49  (step t34 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))) :rule resolution :premises (t26 t33))
% 21.22/21.49  (step t35 (cl (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) :rule and_neg)
% 21.22/21.49  (step t36 (cl (=> (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) :rule implies_neg1)
% 21.22/21.49  (anchor :step t37)
% 21.22/21.49  (assume t37.a0 (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))))
% 21.22/21.49  (assume t37.a1 (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))
% 21.22/21.49  (assume t37.a2 (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))
% 21.22/21.49  (step t37.t1 (cl (=> (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) :rule implies_neg1)
% 21.22/21.49  (anchor :step t37.t2)
% 21.22/21.49  (assume t37.t2.a0 (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))))
% 21.22/21.49  (assume t37.t2.a1 (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))
% 21.22/21.49  (assume t37.t2.a2 (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))
% 21.22/21.49  (step t37.t2.t1 (cl (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) :rule symm :premises (t37.t2.a2))
% 21.22/21.49  (step t37.t2.t2 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) :rule symm :premises (t37.t2.t1))
% 21.22/21.49  (step t37.t2.t3 (cl (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))) :rule refl)
% 21.22/21.49  (step t37.t2.t4 (cl (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) :rule symm :premises (t37.t2.a0))
% 21.22/21.49  (step t37.t2.t5 (cl (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) :rule cong :premises (t37.t2.t3 t37.t2.t4))
% 21.22/21.49  (step t37.t2.t6 (cl (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) :rule symm :premises (t37.t2.a1))
% 21.22/21.49  (step t37.t2.t7 (cl (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule cong :premises (t37.t2.t5 t37.t2.t6))
% 21.22/21.49  (step t37.t2.t8 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule trans :premises (t37.t2.t2 t37.t2.t7))
% 21.22/21.49  (step t37.t2 (cl (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule subproof :discharge (t37.t2.a0 t37.t2.a1 t37.t2.a2))
% 21.22/21.49  (step t37.t3 (cl (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) :rule and_pos)
% 21.22/21.49  (step t37.t4 (cl (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) :rule and_pos)
% 21.22/21.49  (step t37.t5 (cl (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) :rule and_pos)
% 21.22/21.49  (step t37.t6 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))))) :rule resolution :premises (t37.t2 t37.t3 t37.t4 t37.t5))
% 21.22/21.49  (step t37.t7 (cl (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule reordering :premises (t37.t6))
% 21.22/21.49  (step t37.t8 (cl (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule contraction :premises (t37.t7))
% 21.22/21.49  (step t37.t9 (cl (=> (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule resolution :premises (t37.t1 t37.t8))
% 21.22/21.49  (step t37.t10 (cl (=> (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))))) :rule implies_neg2)
% 21.22/21.49  (step t37.t11 (cl (=> (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (=> (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))))) :rule resolution :premises (t37.t9 t37.t10))
% 21.22/21.49  (step t37.t12 (cl (=> (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))))) :rule contraction :premises (t37.t11))
% 21.22/21.49  (step t37.t13 (cl (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule implies :premises (t37.t12))
% 21.22/21.49  (step t37.t14 (cl (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) :rule and_neg)
% 21.22/21.49  (step t37.t15 (cl (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) :rule resolution :premises (t37.t14 t37.a0 t37.a2 t37.a1))
% 21.22/21.49  (step t37.t16 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule resolution :premises (t37.t13 t37.t15))
% 21.22/21.49  (step t37 (cl (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule subproof :discharge (t37.a0 t37.a1 t37.a2))
% 21.22/21.49  (step t38 (cl (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) :rule and_pos)
% 21.22/21.49  (step t39 (cl (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) :rule and_pos)
% 21.22/21.49  (step t40 (cl (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) :rule and_pos)
% 21.22/21.49  (step t41 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) :rule resolution :premises (t37 t38 t39 t40))
% 21.22/21.49  (step t42 (cl (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule reordering :premises (t41))
% 21.22/21.49  (step t43 (cl (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule contraction :premises (t42))
% 21.22/21.49  (step t44 (cl (=> (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule resolution :premises (t36 t43))
% 21.22/21.49  (step t45 (cl (=> (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))))) :rule implies_neg2)
% 21.22/21.49  (step t46 (cl (=> (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (=> (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))))) :rule resolution :premises (t44 t45))
% 21.22/21.49  (step t47 (cl (=> (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))))) :rule contraction :premises (t46))
% 21.22/21.49  (step t48 (cl (not (and (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule implies :premises (t47))
% 21.22/21.49  (step t49 (cl (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) :rule resolution :premises (t35 t48))
% 21.22/21.49  (step t50 (cl (not (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) :rule or_pos)
% 21.22/21.49  (step t51 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (not (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) :rule reordering :premises (t50))
% 21.22/21.49  (step t52 (cl (not (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))) :rule or_pos)
% 21.22/21.49  (step t53 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (not (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))))) :rule reordering :premises (t52))
% 21.22/21.49  (step t54 (cl (not (= (not (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) tptp.zero)) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))))) (not (not (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) tptp.zero))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) :rule equiv_pos2)
% 21.22/21.49  (step t55 (cl (= (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) tptp.zero) (= tptp.zero (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) :rule all_simplify)
% 21.22/21.49  (step t56 (cl (= (not (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) tptp.zero)) (not (= tptp.zero (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))))) :rule cong :premises (t55))
% 21.22/21.49  (step t57 (cl (= tptp.zero (tptp.divide tptp.a tptp.b))) :rule symm :premises (a6))
% 21.22/21.49  (step t58 (cl (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))) :rule refl)
% 21.22/21.49  (step t59 (cl (= (= tptp.zero (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) :rule cong :premises (t57 t58))
% 21.22/21.49  (step t60 (cl (= (not (= tptp.zero (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))))) :rule cong :premises (t59))
% 21.22/21.49  (step t61 (cl (= (not (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) tptp.zero)) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))))) :rule trans :premises (t56 t60))
% 21.22/21.49  (step t62 (cl (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) :rule resolution :premises (t54 t61 a7))
% 21.22/21.49  (step t63 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) :rule implies_neg1)
% 21.22/21.49  (anchor :step t64)
% 21.22/21.49  (assume t64.a0 (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))))
% 21.22/21.49  (step t64.t1 (cl (or (not (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))))) :rule forall_inst :args ((:= X (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))))
% 21.22/21.49  (step t64.t2 (cl (not (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) :rule or :premises (t64.t1))
% 21.22/21.49  (step t64.t3 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) :rule resolution :premises (t64.t2 t64.a0))
% 21.22/21.49  (step t64 (cl (not (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) :rule subproof :discharge (t64.a0))
% 21.22/21.49  (step t65 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) :rule resolution :premises (t63 t64))
% 21.22/21.49  (step t66 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))))) :rule implies_neg2)
% 21.22/21.49  (step t67 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))))) :rule resolution :premises (t65 t66))
% 21.22/21.49  (step t68 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))))) :rule contraction :premises (t67))
% 21.22/21.49  (step t69 (cl (not (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) :rule implies :premises (t68))
% 21.22/21.49  (step t70 (cl (not (= (forall ((X $$unsorted)) (= (tptp.divide tptp.zero X) tptp.zero)) (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))))) (not (forall ((X $$unsorted)) (= (tptp.divide tptp.zero X) tptp.zero))) (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) :rule equiv_pos2)
% 21.22/21.49  (anchor :step t71 :args ((X $$unsorted) (:= X X)))
% 21.22/21.49  (step t71.t1 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t71.t2 (cl (= (= (tptp.divide tptp.zero X) tptp.zero) (= tptp.zero (tptp.divide tptp.zero X)))) :rule all_simplify)
% 21.22/21.49  (step t71 (cl (= (forall ((X $$unsorted)) (= (tptp.divide tptp.zero X) tptp.zero)) (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X))))) :rule bind)
% 21.22/21.49  (anchor :step t72 :args ((X $$unsorted) (:= X X)))
% 21.22/21.49  (step t72.t1 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t72.t2 (cl (= tptp.zero (tptp.divide tptp.a tptp.b))) :rule symm :premises (a6))
% 21.22/21.49  (step t72.t3 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t72.t4 (cl (= (tptp.divide tptp.zero X) (tptp.divide (tptp.divide tptp.a tptp.b) X))) :rule cong :premises (t72.t2 t72.t3))
% 21.22/21.49  (step t72.t5 (cl (= (= tptp.zero (tptp.divide tptp.zero X)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) :rule cong :premises (t72.t2 t72.t4))
% 21.22/21.49  (step t72 (cl (= (forall ((X $$unsorted)) (= tptp.zero (tptp.divide tptp.zero X))) (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))))) :rule bind)
% 21.22/21.49  (step t73 (cl (= (forall ((X $$unsorted)) (= (tptp.divide tptp.zero X) tptp.zero)) (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))))) :rule trans :premises (t71 t72))
% 21.22/21.49  (step t74 (cl (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) :rule resolution :premises (t70 t73 a2))
% 21.22/21.49  (step t75 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) :rule resolution :premises (t69 t74))
% 21.22/21.49  (step t76 (cl (not (= (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))))) (not (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))))) :rule equiv_pos2)
% 21.22/21.49  (step t77 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))))) :rule refl)
% 21.22/21.49  (step t78 (cl (= (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule all_simplify)
% 21.22/21.49  (step t79 (cl (= (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) :rule cong :premises (t78))
% 21.22/21.49  (step t80 (cl (= (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))))) :rule all_simplify)
% 21.22/21.49  (step t81 (cl (= (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))))) :rule cong :premises (t80))
% 21.22/21.49  (step t82 (cl (= (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) :rule all_simplify)
% 21.22/21.49  (step t83 (cl (= (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))))) :rule cong :premises (t79 t81 t82))
% 21.22/21.49  (step t84 (cl (= (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))))) :rule cong :premises (t77 t83))
% 21.22/21.49  (step t85 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y)))) :rule implies_neg1)
% 21.22/21.49  (anchor :step t86)
% 21.22/21.49  (assume t86.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))))
% 21.22/21.49  (step t86.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y)))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule forall_inst :args ((:= X (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (:= Y (tptp.divide tptp.a tptp.b))))
% 21.22/21.49  (step t86.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y)))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) :rule or :premises (t86.t1))
% 21.22/21.49  (step t86.t3 (cl (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) :rule resolution :premises (t86.t2 t86.a0))
% 21.22/21.49  (step t86 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y)))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) :rule subproof :discharge (t86.a0))
% 21.22/21.49  (step t87 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) :rule resolution :premises (t85 t86))
% 21.22/21.49  (step t88 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (not (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule implies_neg2)
% 21.22/21.49  (step t89 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule resolution :premises (t87 t88))
% 21.22/21.49  (step t90 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule contraction :premises (t89))
% 21.22/21.49  (step t91 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)))))) :rule resolution :premises (t76 t84 t90))
% 21.22/21.49  (step t92 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y)))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) :rule implies :premises (t91))
% 21.22/21.49  (step t93 (cl (not (= (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) tptp.zero)) (not (= (tptp.divide Y X) tptp.zero)) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))))) (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) tptp.zero)) (not (= (tptp.divide Y X) tptp.zero)) (= X Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y)))) :rule equiv_pos2)
% 21.22/21.49  (anchor :step t94 :args ((X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y)))
% 21.22/21.49  (step t94.t1 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t94.t2 (cl (= Y Y)) :rule refl)
% 21.22/21.49  (step t94.t3 (cl (= (= (tptp.divide X Y) tptp.zero) (= tptp.zero (tptp.divide X Y)))) :rule all_simplify)
% 21.22/21.49  (step t94.t4 (cl (= (not (= (tptp.divide X Y) tptp.zero)) (not (= tptp.zero (tptp.divide X Y))))) :rule cong :premises (t94.t3))
% 21.22/21.49  (step t94.t5 (cl (= (= (tptp.divide Y X) tptp.zero) (= tptp.zero (tptp.divide Y X)))) :rule all_simplify)
% 21.22/21.49  (step t94.t6 (cl (= (not (= (tptp.divide Y X) tptp.zero)) (not (= tptp.zero (tptp.divide Y X))))) :rule cong :premises (t94.t5))
% 21.22/21.49  (step t94.t7 (cl (= (= X Y) (= X Y))) :rule refl)
% 21.22/21.49  (step t94.t8 (cl (= (or (not (= (tptp.divide X Y) tptp.zero)) (not (= (tptp.divide Y X) tptp.zero)) (= X Y)) (or (not (= tptp.zero (tptp.divide X Y))) (not (= tptp.zero (tptp.divide Y X))) (= X Y)))) :rule cong :premises (t94.t4 t94.t6 t94.t7))
% 21.22/21.49  (step t94 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) tptp.zero)) (not (= (tptp.divide Y X) tptp.zero)) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= tptp.zero (tptp.divide X Y))) (not (= tptp.zero (tptp.divide Y X))) (= X Y))))) :rule bind)
% 21.22/21.49  (anchor :step t95 :args ((X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y)))
% 21.22/21.49  (step t95.t1 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t95.t2 (cl (= Y Y)) :rule refl)
% 21.22/21.49  (step t95.t3 (cl (= tptp.zero (tptp.divide tptp.a tptp.b))) :rule symm :premises (a6))
% 21.22/21.49  (step t95.t4 (cl (= (tptp.divide X Y) (tptp.divide X Y))) :rule refl)
% 21.22/21.49  (step t95.t5 (cl (= (= tptp.zero (tptp.divide X Y)) (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y)))) :rule cong :premises (t95.t3 t95.t4))
% 21.22/21.49  (step t95.t6 (cl (= (not (= tptp.zero (tptp.divide X Y))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y))))) :rule cong :premises (t95.t5))
% 21.22/21.49  (step t95.t7 (cl (= (tptp.divide Y X) (tptp.divide Y X))) :rule refl)
% 21.22/21.49  (step t95.t8 (cl (= (= tptp.zero (tptp.divide Y X)) (= (tptp.divide tptp.a tptp.b) (tptp.divide Y X)))) :rule cong :premises (t95.t3 t95.t7))
% 21.22/21.49  (step t95.t9 (cl (= (not (= tptp.zero (tptp.divide Y X))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide Y X))))) :rule cong :premises (t95.t8))
% 21.22/21.49  (step t95.t10 (cl (= (= X Y) (= X Y))) :rule refl)
% 21.22/21.49  (step t95.t11 (cl (= (or (not (= tptp.zero (tptp.divide X Y))) (not (= tptp.zero (tptp.divide Y X))) (= X Y)) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide Y X))) (= X Y)))) :rule cong :premises (t95.t6 t95.t9 t95.t10))
% 21.22/21.49  (step t95 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= tptp.zero (tptp.divide X Y))) (not (= tptp.zero (tptp.divide Y X))) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide Y X))) (= X Y))))) :rule bind)
% 21.22/21.49  (anchor :step t96 :args ((X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y)))
% 21.22/21.49  (step t96.t1 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t96.t2 (cl (= Y Y)) :rule refl)
% 21.22/21.49  (step t96.t3 (cl (= (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y)) (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b)))) :rule all_simplify)
% 21.22/21.49  (step t96.t4 (cl (= (not (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y))) (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))))) :rule cong :premises (t96.t3))
% 21.22/21.49  (step t96.t5 (cl (= (= (tptp.divide tptp.a tptp.b) (tptp.divide Y X)) (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b)))) :rule all_simplify)
% 21.22/21.49  (step t96.t6 (cl (= (not (= (tptp.divide tptp.a tptp.b) (tptp.divide Y X))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))))) :rule cong :premises (t96.t5))
% 21.22/21.49  (step t96.t7 (cl (= (= X Y) (= X Y))) :rule refl)
% 21.22/21.49  (step t96.t8 (cl (= (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide Y X))) (= X Y)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y)))) :rule cong :premises (t96.t4 t96.t6 t96.t7))
% 21.22/21.49  (step t96 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide Y X))) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))))) :rule bind)
% 21.22/21.49  (step t97 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= tptp.zero (tptp.divide X Y))) (not (= tptp.zero (tptp.divide Y X))) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))))) :rule trans :premises (t95 t96))
% 21.22/21.49  (step t98 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) tptp.zero)) (not (= (tptp.divide Y X) tptp.zero)) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))))) :rule trans :premises (t94 t97))
% 21.22/21.49  (step t99 (cl (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y)))) :rule resolution :premises (t93 t98 a3))
% 21.22/21.49  (step t100 (cl (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a))))) :rule resolution :premises (t92 t99))
% 21.22/21.49  (step t101 (cl (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule resolution :premises (t53 t62 t75 t100))
% 21.22/21.49  (step t102 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) :rule implies_neg1)
% 21.22/21.49  (anchor :step t103)
% 21.22/21.49  (assume t103.a0 (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))))
% 21.22/21.49  (step t103.t1 (cl (or (not (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) :rule forall_inst :args ((:= X (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))
% 21.22/21.49  (step t103.t2 (cl (not (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule or :premises (t103.t1))
% 21.22/21.49  (step t103.t3 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule resolution :premises (t103.t2 t103.a0))
% 21.22/21.49  (step t103 (cl (not (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule subproof :discharge (t103.a0))
% 21.22/21.49  (step t104 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule resolution :premises (t102 t103))
% 21.22/21.49  (step t105 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) :rule implies_neg2)
% 21.22/21.49  (step t106 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) :rule resolution :premises (t104 t105))
% 21.22/21.49  (step t107 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) :rule contraction :premises (t106))
% 21.22/21.49  (step t108 (cl (not (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule implies :premises (t107))
% 21.22/21.49  (step t109 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule resolution :premises (t108 t74))
% 21.22/21.49  (step t110 (cl (not (= (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))))) (not (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) :rule equiv_pos2)
% 21.22/21.49  (step t111 (cl (= (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) :rule all_simplify)
% 21.22/21.49  (step t112 (cl (= (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))))) :rule cong :premises (t111))
% 21.22/21.49  (step t113 (cl (= (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))))) :rule all_simplify)
% 21.22/21.49  (step t114 (cl (= (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))))) :rule cong :premises (t113))
% 21.22/21.49  (step t115 (cl (= (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule refl)
% 21.22/21.49  (step t116 (cl (= (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) :rule cong :premises (t112 t114 t115))
% 21.22/21.49  (step t117 (cl (= (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))))) :rule cong :premises (t77 t116))
% 21.22/21.49  (step t118 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y)))) :rule implies_neg1)
% 21.22/21.49  (anchor :step t119)
% 21.22/21.49  (assume t119.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))))
% 21.22/21.49  (step t119.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y)))) (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) :rule forall_inst :args ((:= X (tptp.divide tptp.a tptp.b)) (:= Y (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))
% 21.22/21.49  (step t119.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y)))) (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule or :premises (t119.t1))
% 21.22/21.49  (step t119.t3 (cl (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule resolution :premises (t119.t2 t119.a0))
% 21.22/21.49  (step t119 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y)))) (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule subproof :discharge (t119.a0))
% 21.22/21.49  (step t120 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule resolution :premises (t118 t119))
% 21.22/21.49  (step t121 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (not (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) :rule implies_neg2)
% 21.22/21.49  (step t122 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) :rule resolution :premises (t120 t121))
% 21.22/21.49  (step t123 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) :rule contraction :premises (t122))
% 21.22/21.49  (step t124 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))))) :rule resolution :premises (t110 t117 t123))
% 21.22/21.49  (step t125 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y X) (tptp.divide tptp.a tptp.b))) (= X Y)))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule implies :premises (t124))
% 21.22/21.49  (step t126 (cl (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule resolution :premises (t125 t99))
% 21.22/21.49  (step t127 (cl (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.a tptp.b))))) :rule resolution :premises (t51 t101 t109 t126))
% 21.22/21.49  (step t128 (cl (not (= (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))))) (not (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b)))) (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) :rule equiv_pos2)
% 21.22/21.49  (step t129 (cl (= (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) :rule all_simplify)
% 21.22/21.49  (step t130 (cl (= (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))))) :rule cong :premises (t16 t129))
% 21.22/21.49  (step t131 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b)))) :rule implies_neg1)
% 21.22/21.49  (anchor :step t132)
% 21.22/21.49  (assume t132.a0 (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))))
% 21.22/21.49  (step t132.t1 (cl (or (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b)))) :rule forall_inst :args ((:= X (tptp.divide tptp.c tptp.b)) (:= Z (tptp.divide tptp.c tptp.a)) (:= Y (tptp.divide tptp.a tptp.b))))
% 21.22/21.49  (step t132.t2 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) :rule or :premises (t132.t1))
% 21.22/21.49  (step t132.t3 (cl (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) :rule resolution :premises (t132.t2 t132.a0))
% 21.22/21.49  (step t132 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) :rule subproof :discharge (t132.a0))
% 21.22/21.49  (step t133 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) :rule resolution :premises (t131 t132))
% 21.22/21.49  (step t134 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b)))) :rule implies_neg2)
% 21.22/21.49  (step t135 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b))) (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b)))) :rule resolution :premises (t133 t134))
% 21.22/21.49  (step t136 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))) (tptp.divide tptp.a tptp.b)))) :rule contraction :premises (t135))
% 21.22/21.49  (step t137 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) :rule resolution :premises (t128 t130 t136))
% 21.22/21.49  (step t138 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide (tptp.divide X Z) (tptp.divide Y Z)) (tptp.divide (tptp.divide X Y) Z)) (tptp.divide tptp.a tptp.b)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) :rule implies :premises (t137))
% 21.22/21.49  (step t139 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) :rule resolution :premises (t138 t33))
% 21.22/21.49  (step t140 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) :rule implies_neg1)
% 21.22/21.49  (anchor :step t141)
% 21.22/21.49  (assume t141.a0 (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))))
% 21.22/21.49  (step t141.t1 (cl (or (not (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))))) :rule forall_inst :args ((:= X (tptp.divide tptp.c tptp.a))))
% 21.22/21.49  (step t141.t2 (cl (not (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) :rule or :premises (t141.t1))
% 21.22/21.49  (step t141.t3 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) :rule resolution :premises (t141.t2 t141.a0))
% 21.22/21.49  (step t141 (cl (not (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) :rule subproof :discharge (t141.a0))
% 21.22/21.49  (step t142 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) :rule resolution :premises (t140 t141))
% 21.22/21.49  (step t143 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))))) :rule implies_neg2)
% 21.22/21.49  (step t144 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))))) :rule resolution :premises (t142 t143))
% 21.22/21.49  (step t145 (cl (=> (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a))))) :rule contraction :premises (t144))
% 21.22/21.49  (step t146 (cl (not (forall ((X $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) X)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) :rule implies :premises (t145))
% 21.22/21.49  (step t147 (cl (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide tptp.a tptp.b) (tptp.divide tptp.c tptp.a)))) :rule resolution :premises (t146 t74))
% 21.22/21.49  (step t148 (cl (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) :rule resolution :premises (t49 t127 t139 t147))
% 21.22/21.49  (step t149 (cl (not (= (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))))) (not (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) :rule equiv_pos2)
% 21.22/21.49  (step t150 (cl (= (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))))) :rule refl)
% 21.22/21.49  (step t151 (cl (= (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))))) :rule cong :premises (t17))
% 21.22/21.49  (step t152 (cl (= (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))))) :rule cong :premises (t3))
% 21.22/21.49  (step t153 (cl (= (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) :rule all_simplify)
% 21.22/21.49  (step t154 (cl (= (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) :rule cong :premises (t151 t152 t153))
% 21.22/21.49  (step t155 (cl (= (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))))) :rule cong :premises (t150 t154))
% 21.22/21.49  (step t156 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b))))) :rule implies_neg1)
% 21.22/21.49  (anchor :step t157)
% 21.22/21.49  (assume t157.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))))
% 21.22/21.49  (step t157.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b))))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule forall_inst :args ((:= X (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b))) (:= Y (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (:= Z (tptp.divide tptp.c tptp.a))))
% 21.22/21.49  (step t157.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b))))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) :rule or :premises (t157.t1))
% 21.22/21.49  (step t157.t3 (cl (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) :rule resolution :premises (t157.t2 t157.a0))
% 21.22/21.49  (step t157 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b))))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) :rule subproof :discharge (t157.a0))
% 21.22/21.49  (step t158 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) :rule resolution :premises (t156 t157))
% 21.22/21.49  (step t159 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (not (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule implies_neg2)
% 21.22/21.49  (step t160 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b)))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule resolution :premises (t158 t159))
% 21.22/21.49  (step t161 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))) (= (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)) (tptp.divide tptp.a tptp.b))))) :rule contraction :premises (t160))
% 21.22/21.49  (step t162 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a)))))) :rule resolution :premises (t149 t155 t161))
% 21.22/21.49  (step t163 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b))))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) :rule implies :premises (t162))
% 21.22/21.49  (step t164 (cl (not (= (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) tptp.zero)) (not (= (tptp.divide Y Z) tptp.zero)) (= (tptp.divide X Z) tptp.zero))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))))) (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) tptp.zero)) (not (= (tptp.divide Y Z) tptp.zero)) (= (tptp.divide X Z) tptp.zero)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b))))) :rule equiv_pos2)
% 21.22/21.49  (anchor :step t165 :args ((X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y) (Z $$unsorted) (:= Z Z)))
% 21.22/21.49  (step t165.t1 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t165.t2 (cl (= Y Y)) :rule refl)
% 21.22/21.49  (step t165.t3 (cl (= Z Z)) :rule refl)
% 21.22/21.49  (step t165.t4 (cl (= (= (tptp.divide X Y) tptp.zero) (= tptp.zero (tptp.divide X Y)))) :rule all_simplify)
% 21.22/21.49  (step t165.t5 (cl (= (not (= (tptp.divide X Y) tptp.zero)) (not (= tptp.zero (tptp.divide X Y))))) :rule cong :premises (t165.t4))
% 21.22/21.49  (step t165.t6 (cl (= (= (tptp.divide Y Z) tptp.zero) (= tptp.zero (tptp.divide Y Z)))) :rule all_simplify)
% 21.22/21.49  (step t165.t7 (cl (= (not (= (tptp.divide Y Z) tptp.zero)) (not (= tptp.zero (tptp.divide Y Z))))) :rule cong :premises (t165.t6))
% 21.22/21.49  (step t165.t8 (cl (= (= (tptp.divide X Z) tptp.zero) (= tptp.zero (tptp.divide X Z)))) :rule all_simplify)
% 21.22/21.49  (step t165.t9 (cl (= (or (not (= (tptp.divide X Y) tptp.zero)) (not (= (tptp.divide Y Z) tptp.zero)) (= (tptp.divide X Z) tptp.zero)) (or (not (= tptp.zero (tptp.divide X Y))) (not (= tptp.zero (tptp.divide Y Z))) (= tptp.zero (tptp.divide X Z))))) :rule cong :premises (t165.t5 t165.t7 t165.t8))
% 21.22/21.49  (step t165 (cl (= (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) tptp.zero)) (not (= (tptp.divide Y Z) tptp.zero)) (= (tptp.divide X Z) tptp.zero))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= tptp.zero (tptp.divide X Y))) (not (= tptp.zero (tptp.divide Y Z))) (= tptp.zero (tptp.divide X Z)))))) :rule bind)
% 21.22/21.49  (anchor :step t166 :args ((X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y) (Z $$unsorted) (:= Z Z)))
% 21.22/21.49  (step t166.t1 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t166.t2 (cl (= Y Y)) :rule refl)
% 21.22/21.49  (step t166.t3 (cl (= Z Z)) :rule refl)
% 21.22/21.49  (step t166.t4 (cl (= tptp.zero (tptp.divide tptp.a tptp.b))) :rule symm :premises (a6))
% 21.22/21.49  (step t166.t5 (cl (= (tptp.divide X Y) (tptp.divide X Y))) :rule refl)
% 21.22/21.49  (step t166.t6 (cl (= (= tptp.zero (tptp.divide X Y)) (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y)))) :rule cong :premises (t166.t4 t166.t5))
% 21.22/21.49  (step t166.t7 (cl (= (not (= tptp.zero (tptp.divide X Y))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y))))) :rule cong :premises (t166.t6))
% 21.22/21.49  (step t166.t8 (cl (= (tptp.divide Y Z) (tptp.divide Y Z))) :rule refl)
% 21.22/21.49  (step t166.t9 (cl (= (= tptp.zero (tptp.divide Y Z)) (= (tptp.divide tptp.a tptp.b) (tptp.divide Y Z)))) :rule cong :premises (t166.t4 t166.t8))
% 21.22/21.49  (step t166.t10 (cl (= (not (= tptp.zero (tptp.divide Y Z))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide Y Z))))) :rule cong :premises (t166.t9))
% 21.22/21.49  (step t166.t11 (cl (= (tptp.divide X Z) (tptp.divide X Z))) :rule refl)
% 21.22/21.49  (step t166.t12 (cl (= (= tptp.zero (tptp.divide X Z)) (= (tptp.divide tptp.a tptp.b) (tptp.divide X Z)))) :rule cong :premises (t166.t4 t166.t11))
% 21.22/21.49  (step t166.t13 (cl (= (or (not (= tptp.zero (tptp.divide X Y))) (not (= tptp.zero (tptp.divide Y Z))) (= tptp.zero (tptp.divide X Z))) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide Y Z))) (= (tptp.divide tptp.a tptp.b) (tptp.divide X Z))))) :rule cong :premises (t166.t7 t166.t10 t166.t12))
% 21.22/21.49  (step t166 (cl (= (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= tptp.zero (tptp.divide X Y))) (not (= tptp.zero (tptp.divide Y Z))) (= tptp.zero (tptp.divide X Z)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide Y Z))) (= (tptp.divide tptp.a tptp.b) (tptp.divide X Z)))))) :rule bind)
% 21.22/21.49  (anchor :step t167 :args ((X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y) (Z $$unsorted) (:= Z Z)))
% 21.22/21.49  (step t167.t1 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t167.t2 (cl (= Y Y)) :rule refl)
% 21.22/21.49  (step t167.t3 (cl (= Z Z)) :rule refl)
% 21.22/21.49  (step t167.t4 (cl (= (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y)) (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b)))) :rule all_simplify)
% 21.22/21.49  (step t167.t5 (cl (= (not (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y))) (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))))) :rule cong :premises (t167.t4))
% 21.22/21.49  (step t167.t6 (cl (= (= (tptp.divide tptp.a tptp.b) (tptp.divide Y Z)) (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b)))) :rule all_simplify)
% 21.22/21.49  (step t167.t7 (cl (= (not (= (tptp.divide tptp.a tptp.b) (tptp.divide Y Z))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))))) :rule cong :premises (t167.t6))
% 21.22/21.49  (step t167.t8 (cl (= (= (tptp.divide tptp.a tptp.b) (tptp.divide X Z)) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))) :rule all_simplify)
% 21.22/21.49  (step t167.t9 (cl (= (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide Y Z))) (= (tptp.divide tptp.a tptp.b) (tptp.divide X Z))) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b))))) :rule cong :premises (t167.t5 t167.t7 t167.t8))
% 21.22/21.49  (step t167 (cl (= (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide X Y))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide Y Z))) (= (tptp.divide tptp.a tptp.b) (tptp.divide X Z)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))))) :rule bind)
% 21.22/21.49  (step t168 (cl (= (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= tptp.zero (tptp.divide X Y))) (not (= tptp.zero (tptp.divide Y Z))) (= tptp.zero (tptp.divide X Z)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))))) :rule trans :premises (t166 t167))
% 21.22/21.49  (step t169 (cl (= (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) tptp.zero)) (not (= (tptp.divide Y Z) tptp.zero)) (= (tptp.divide X Z) tptp.zero))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b)))))) :rule trans :premises (t165 t168))
% 21.22/21.49  (step t170 (cl (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (= (tptp.divide X Y) (tptp.divide tptp.a tptp.b))) (not (= (tptp.divide Y Z) (tptp.divide tptp.a tptp.b))) (= (tptp.divide X Z) (tptp.divide tptp.a tptp.b))))) :rule resolution :premises (t164 t169 a5))
% 21.22/21.49  (step t171 (cl (or (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b)))) (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a)))) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.b) (tptp.divide tptp.a tptp.b)) (tptp.divide tptp.c tptp.a))))) :rule resolution :premises (t163 t170))
% 21.22/21.49  (step t172 (cl (not (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide (tptp.divide tptp.c tptp.a) tptp.b) (tptp.divide tptp.c tptp.a))))) :rule resolution :premises (t14 t34 t148 t171))
% 21.22/21.49  (step t173 (cl (not (= (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) tptp.zero)) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))))) (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) tptp.zero))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b)))) :rule equiv_pos2)
% 21.22/21.49  (anchor :step t174 :args ((X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y)))
% 21.22/21.49  (step t174.t1 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t174.t2 (cl (= Y Y)) :rule refl)
% 21.22/21.49  (step t174.t3 (cl (= (= (tptp.divide (tptp.divide X Y) X) tptp.zero) (= tptp.zero (tptp.divide (tptp.divide X Y) X)))) :rule all_simplify)
% 21.22/21.49  (step t174 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) tptp.zero)) (forall ((X $$unsorted) (Y $$unsorted)) (= tptp.zero (tptp.divide (tptp.divide X Y) X))))) :rule bind)
% 21.22/21.49  (anchor :step t175 :args ((X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y)))
% 21.22/21.49  (step t175.t1 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t175.t2 (cl (= Y Y)) :rule refl)
% 21.22/21.49  (step t175.t3 (cl (= tptp.zero (tptp.divide tptp.a tptp.b))) :rule symm :premises (a6))
% 21.22/21.49  (step t175.t4 (cl (= (tptp.divide (tptp.divide X Y) X) (tptp.divide (tptp.divide X Y) X))) :rule refl)
% 21.22/21.49  (step t175.t5 (cl (= (= tptp.zero (tptp.divide (tptp.divide X Y) X)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide X Y) X)))) :rule cong :premises (t175.t3 t175.t4))
% 21.22/21.49  (step t175 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (= tptp.zero (tptp.divide (tptp.divide X Y) X))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide X Y) X))))) :rule bind)
% 21.22/21.49  (anchor :step t176 :args ((X $$unsorted) (:= X X) (Y $$unsorted) (:= Y Y)))
% 21.22/21.49  (step t176.t1 (cl (= X X)) :rule refl)
% 21.22/21.49  (step t176.t2 (cl (= Y Y)) :rule refl)
% 21.22/21.49  (step t176.t3 (cl (= (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide X Y) X)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b)))) :rule all_simplify)
% 21.22/21.49  (step t176 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide tptp.a tptp.b) (tptp.divide (tptp.divide X Y) X))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))))) :rule bind)
% 21.22/21.49  (step t177 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (= tptp.zero (tptp.divide (tptp.divide X Y) X))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))))) :rule trans :premises (t175 t176))
% 21.22/21.49  (step t178 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) tptp.zero)) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b))))) :rule trans :premises (t174 t177))
% 21.22/21.49  (step t179 (cl (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.divide (tptp.divide X Y) X) (tptp.divide tptp.a tptp.b)))) :rule resolution :premises (t173 t178 a0))
% 21.22/21.49  (step t180 (cl) :rule resolution :premises (t12 t172 t179))
% 21.22/21.49  
% 21.22/21.49  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.kDWW1adgB5/cvc5---1.0.5_19114.smt2
% 21.22/21.49  % cvc5---1.0.5 exiting
% 21.22/21.50  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------