TSTP Solution File: HEN007-6 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : HEN007-6 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 17:09:33 EDT 2024
% Result : Unsatisfiable 63.29s 63.54s
% Output : Proof 63.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : HEN007-6 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.14 % Command : do_cvc5 %s %d
% 0.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 27 17:07:39 EDT 2024
% 0.14/0.36 % 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.28/10.53 --- Run --no-e-matching --full-saturate-quant at 5...
% 15.32/15.55 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 5...
% 20.35/20.58 --- Run --finite-model-find --uf-ss=no-minimal at 5...
% 25.70/25.93 --- Run --multi-trigger-when-single --full-saturate-quant at 5...
% 30.70/30.98 --- Run --trigger-sel=max --full-saturate-quant at 5...
% 35.70/36.00 --- Run --multi-trigger-when-single --multi-trigger-priority --full-saturate-quant at 5...
% 40.71/41.02 --- Run --multi-trigger-cache --full-saturate-quant at 5...
% 45.89/46.21 --- Run --prenex-quant=none --full-saturate-quant at 5...
% 50.91/51.23 --- Run --enum-inst-interleave --decision=internal --full-saturate-quant at 5...
% 55.94/56.25 --- Run --relevant-triggers --full-saturate-quant at 5...
% 60.98/61.28 --- Run --finite-model-find --e-matching --sort-inference --uf-ss-fair at 5...
% 63.29/63.54 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.rq7W104w85/cvc5---1.0.5_22505.smt2
% 63.29/63.54 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.rq7W104w85/cvc5---1.0.5_22505.smt2
% 63.29/63.55 (assume a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_equal X Y)) (tptp.quotient X Y tptp.zero))))
% 63.29/63.55 (assume a1 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.quotient X Y tptp.zero)) (tptp.less_equal X Y))))
% 63.29/63.55 (assume a2 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.quotient X Y Z)) (tptp.less_equal Z X))))
% 63.29/63.55 (assume a3 (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted) (V5 $$unsorted)) (or (not (tptp.quotient X Y V1)) (not (tptp.quotient Y Z V2)) (not (tptp.quotient X Z V3)) (not (tptp.quotient V3 V2 V4)) (not (tptp.quotient V1 Z V5)) (tptp.less_equal V4 V5))))
% 63.29/63.55 (assume a4 (forall ((X $$unsorted)) (tptp.less_equal tptp.zero X)))
% 63.29/63.55 (assume a5 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_equal X Y)) (not (tptp.less_equal Y X)) (= X Y))))
% 63.29/63.55 (assume a6 (forall ((X $$unsorted)) (tptp.less_equal X tptp.identity)))
% 63.29/63.55 (assume a7 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.quotient X Y (tptp.divide X Y))))
% 63.29/63.55 (assume a8 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted)) (or (not (tptp.quotient X Y Z)) (not (tptp.quotient X Y W)) (= Z W))))
% 63.29/63.55 (assume a9 (forall ((X $$unsorted)) (tptp.quotient X tptp.identity tptp.zero)))
% 63.29/63.55 (assume a10 (forall ((X $$unsorted)) (tptp.quotient tptp.zero X tptp.zero)))
% 63.29/63.55 (assume a11 (forall ((X $$unsorted)) (tptp.quotient X X tptp.zero)))
% 63.29/63.55 (assume a12 (forall ((X $$unsorted)) (tptp.quotient X tptp.zero X)))
% 63.29/63.55 (assume a13 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_equal X Y)) (not (tptp.less_equal Y Z)) (tptp.less_equal X Z))))
% 63.29/63.55 (assume a14 (tptp.less_equal tptp.x tptp.y))
% 63.29/63.55 (assume a15 (tptp.quotient tptp.z tptp.y tptp.zQy))
% 63.29/63.55 (assume a16 (tptp.quotient tptp.z tptp.x tptp.zQx))
% 63.29/63.55 (assume a17 (not (tptp.less_equal tptp.zQy tptp.zQx)))
% 63.29/63.55 (step t1 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted) (V5 $$unsorted)) (or (not (tptp.quotient X Y V1)) (not (tptp.quotient Y Z V2)) (not (tptp.quotient X Z V3)) (not (tptp.quotient V3 V2 V4)) (not (tptp.quotient V1 Z V5)) (tptp.less_equal V4 V5))) (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y)))) (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted) (V5 $$unsorted)) (or (not (tptp.quotient X Y V1)) (not (tptp.quotient Y Z V2)) (not (tptp.quotient X Z V3)) (not (tptp.quotient V3 V2 V4)) (not (tptp.quotient V1 Z V5)) (tptp.less_equal V4 V5)))) :rule implies_neg1)
% 63.29/63.55 (anchor :step t2)
% 63.29/63.55 (assume t2.a0 (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted) (V5 $$unsorted)) (or (not (tptp.quotient X Y V1)) (not (tptp.quotient Y Z V2)) (not (tptp.quotient X Z V3)) (not (tptp.quotient V3 V2 V4)) (not (tptp.quotient V1 Z V5)) (tptp.less_equal V4 V5))))
% 63.29/63.55 (step t2.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted) (V5 $$unsorted)) (or (not (tptp.quotient X Y V1)) (not (tptp.quotient Y Z V2)) (not (tptp.quotient X Z V3)) (not (tptp.quotient V3 V2 V4)) (not (tptp.quotient V1 Z V5)) (tptp.less_equal V4 V5)))) (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))))) :rule forall_inst :args ((:= X tptp.z) (:= Y tptp.x) (:= V1 tptp.zQx) (:= Z tptp.y) (:= V2 tptp.zero) (:= V3 tptp.zQy) (:= V4 tptp.zQy) (:= V5 (tptp.divide tptp.zQx tptp.y))))
% 63.29/63.55 (step t2.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted) (V5 $$unsorted)) (or (not (tptp.quotient X Y V1)) (not (tptp.quotient Y Z V2)) (not (tptp.quotient X Z V3)) (not (tptp.quotient V3 V2 V4)) (not (tptp.quotient V1 Z V5)) (tptp.less_equal V4 V5)))) (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y)))) :rule or :premises (t2.t1))
% 63.29/63.55 (step t2.t3 (cl (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y)))) :rule resolution :premises (t2.t2 t2.a0))
% 63.29/63.55 (step t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted) (V5 $$unsorted)) (or (not (tptp.quotient X Y V1)) (not (tptp.quotient Y Z V2)) (not (tptp.quotient X Z V3)) (not (tptp.quotient V3 V2 V4)) (not (tptp.quotient V1 Z V5)) (tptp.less_equal V4 V5)))) (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y)))) :rule subproof :discharge (t2.a0))
% 63.29/63.55 (step t3 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted) (V5 $$unsorted)) (or (not (tptp.quotient X Y V1)) (not (tptp.quotient Y Z V2)) (not (tptp.quotient X Z V3)) (not (tptp.quotient V3 V2 V4)) (not (tptp.quotient V1 Z V5)) (tptp.less_equal V4 V5))) (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y)))) (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y)))) :rule resolution :premises (t1 t2))
% 63.29/63.55 (step t4 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted) (V5 $$unsorted)) (or (not (tptp.quotient X Y V1)) (not (tptp.quotient Y Z V2)) (not (tptp.quotient X Z V3)) (not (tptp.quotient V3 V2 V4)) (not (tptp.quotient V1 Z V5)) (tptp.less_equal V4 V5))) (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y)))) (not (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))))) :rule implies_neg2)
% 63.29/63.55 (step t5 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted) (V5 $$unsorted)) (or (not (tptp.quotient X Y V1)) (not (tptp.quotient Y Z V2)) (not (tptp.quotient X Z V3)) (not (tptp.quotient V3 V2 V4)) (not (tptp.quotient V1 Z V5)) (tptp.less_equal V4 V5))) (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y)))) (=> (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted) (V5 $$unsorted)) (or (not (tptp.quotient X Y V1)) (not (tptp.quotient Y Z V2)) (not (tptp.quotient X Z V3)) (not (tptp.quotient V3 V2 V4)) (not (tptp.quotient V1 Z V5)) (tptp.less_equal V4 V5))) (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))))) :rule resolution :premises (t3 t4))
% 63.29/63.55 (step t6 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted) (V5 $$unsorted)) (or (not (tptp.quotient X Y V1)) (not (tptp.quotient Y Z V2)) (not (tptp.quotient X Z V3)) (not (tptp.quotient V3 V2 V4)) (not (tptp.quotient V1 Z V5)) (tptp.less_equal V4 V5))) (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))))) :rule contraction :premises (t5))
% 63.29/63.55 (step t7 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (V1 $$unsorted) (Z $$unsorted) (V2 $$unsorted) (V3 $$unsorted) (V4 $$unsorted) (V5 $$unsorted)) (or (not (tptp.quotient X Y V1)) (not (tptp.quotient Y Z V2)) (not (tptp.quotient X Z V3)) (not (tptp.quotient V3 V2 V4)) (not (tptp.quotient V1 Z V5)) (tptp.less_equal V4 V5)))) (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y)))) :rule implies :premises (t6))
% 63.29/63.55 (step t8 (cl (not (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y)))) (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) :rule or_pos)
% 63.29/63.55 (step t9 (cl (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y)) (not (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))))) :rule reordering :premises (t8))
% 63.29/63.55 (step t10 (cl (not (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero))) (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero)) :rule or_pos)
% 63.29/63.55 (step t11 (cl (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero) (not (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero)))) :rule reordering :premises (t10))
% 63.29/63.55 (step t12 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_equal X Y)) (tptp.quotient X Y tptp.zero))) (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_equal X Y)) (tptp.quotient X Y tptp.zero)))) :rule implies_neg1)
% 63.29/63.55 (anchor :step t13)
% 63.29/63.55 (assume t13.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_equal X Y)) (tptp.quotient X Y tptp.zero))))
% 63.29/63.55 (step t13.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_equal X Y)) (tptp.quotient X Y tptp.zero)))) (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero)))) :rule forall_inst :args ((:= X tptp.x) (:= Y tptp.y)))
% 63.29/63.55 (step t13.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_equal X Y)) (tptp.quotient X Y tptp.zero)))) (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero))) :rule or :premises (t13.t1))
% 63.29/63.55 (step t13.t3 (cl (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero))) :rule resolution :premises (t13.t2 t13.a0))
% 63.29/63.55 (step t13 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_equal X Y)) (tptp.quotient X Y tptp.zero)))) (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero))) :rule subproof :discharge (t13.a0))
% 63.29/63.55 (step t14 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_equal X Y)) (tptp.quotient X Y tptp.zero))) (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero))) (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero))) :rule resolution :premises (t12 t13))
% 63.29/63.55 (step t15 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_equal X Y)) (tptp.quotient X Y tptp.zero))) (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero))) (not (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero)))) :rule implies_neg2)
% 63.29/63.55 (step t16 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_equal X Y)) (tptp.quotient X Y tptp.zero))) (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_equal X Y)) (tptp.quotient X Y tptp.zero))) (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero)))) :rule resolution :premises (t14 t15))
% 63.29/63.55 (step t17 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_equal X Y)) (tptp.quotient X Y tptp.zero))) (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero)))) :rule contraction :premises (t16))
% 63.29/63.55 (step t18 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.less_equal X Y)) (tptp.quotient X Y tptp.zero)))) (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero))) :rule implies :premises (t17))
% 63.29/63.55 (step t19 (cl (or (not (tptp.less_equal tptp.x tptp.y)) (tptp.quotient tptp.x tptp.y tptp.zero))) :rule resolution :premises (t18 a0))
% 63.29/63.55 (step t20 (cl (tptp.quotient tptp.x tptp.y tptp.zero)) :rule resolution :premises (t11 a14 t19))
% 63.29/63.55 (step t21 (cl (=> (forall ((X $$unsorted)) (tptp.quotient X tptp.zero X)) (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (forall ((X $$unsorted)) (tptp.quotient X tptp.zero X))) :rule implies_neg1)
% 63.29/63.55 (anchor :step t22)
% 63.29/63.55 (assume t22.a0 (forall ((X $$unsorted)) (tptp.quotient X tptp.zero X)))
% 63.29/63.55 (step t22.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.quotient X tptp.zero X))) (tptp.quotient tptp.zQy tptp.zero tptp.zQy))) :rule forall_inst :args ((:= X tptp.zQy)))
% 63.29/63.55 (step t22.t2 (cl (not (forall ((X $$unsorted)) (tptp.quotient X tptp.zero X))) (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) :rule or :premises (t22.t1))
% 63.29/63.55 (step t22.t3 (cl (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) :rule resolution :premises (t22.t2 t22.a0))
% 63.29/63.55 (step t22 (cl (not (forall ((X $$unsorted)) (tptp.quotient X tptp.zero X))) (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) :rule subproof :discharge (t22.a0))
% 63.29/63.55 (step t23 (cl (=> (forall ((X $$unsorted)) (tptp.quotient X tptp.zero X)) (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) :rule resolution :premises (t21 t22))
% 63.29/63.55 (step t24 (cl (=> (forall ((X $$unsorted)) (tptp.quotient X tptp.zero X)) (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy))) :rule implies_neg2)
% 63.29/63.55 (step t25 (cl (=> (forall ((X $$unsorted)) (tptp.quotient X tptp.zero X)) (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (=> (forall ((X $$unsorted)) (tptp.quotient X tptp.zero X)) (tptp.quotient tptp.zQy tptp.zero tptp.zQy))) :rule resolution :premises (t23 t24))
% 63.29/63.55 (step t26 (cl (=> (forall ((X $$unsorted)) (tptp.quotient X tptp.zero X)) (tptp.quotient tptp.zQy tptp.zero tptp.zQy))) :rule contraction :premises (t25))
% 63.29/63.55 (step t27 (cl (not (forall ((X $$unsorted)) (tptp.quotient X tptp.zero X))) (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) :rule implies :premises (t26))
% 63.29/63.55 (step t28 (cl (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) :rule resolution :premises (t27 a12))
% 63.29/63.55 (step t29 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.quotient X Y (tptp.divide X Y))) (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (forall ((X $$unsorted) (Y $$unsorted)) (tptp.quotient X Y (tptp.divide X Y)))) :rule implies_neg1)
% 63.29/63.55 (anchor :step t30)
% 63.29/63.55 (assume t30.a0 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.quotient X Y (tptp.divide X Y))))
% 63.29/63.55 (step t30.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.quotient X Y (tptp.divide X Y)))) (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y)))) :rule forall_inst :args ((:= X tptp.zQx) (:= Y tptp.y)))
% 63.29/63.55 (step t30.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.quotient X Y (tptp.divide X Y)))) (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) :rule or :premises (t30.t1))
% 63.29/63.55 (step t30.t3 (cl (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) :rule resolution :premises (t30.t2 t30.a0))
% 63.29/63.55 (step t30 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.quotient X Y (tptp.divide X Y)))) (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) :rule subproof :discharge (t30.a0))
% 63.29/63.55 (step t31 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.quotient X Y (tptp.divide X Y))) (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) :rule resolution :premises (t29 t30))
% 63.29/63.55 (step t32 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.quotient X Y (tptp.divide X Y))) (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y)))) :rule implies_neg2)
% 63.29/63.55 (step t33 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.quotient X Y (tptp.divide X Y))) (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.quotient X Y (tptp.divide X Y))) (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y)))) :rule resolution :premises (t31 t32))
% 63.29/63.55 (step t34 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (tptp.quotient X Y (tptp.divide X Y))) (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y)))) :rule contraction :premises (t33))
% 63.29/63.55 (step t35 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (tptp.quotient X Y (tptp.divide X Y)))) (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) :rule implies :premises (t34))
% 63.29/63.55 (step t36 (cl (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) :rule resolution :premises (t35 a7))
% 63.29/63.55 (step t37 (cl (not (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx))) (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx)) :rule or_pos)
% 63.29/63.55 (step t38 (cl (tptp.less_equal tptp.zQy tptp.zQx) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx)))) :rule reordering :premises (t37))
% 63.29/63.55 (step t39 (cl (not (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx))) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) :rule or_pos)
% 63.29/63.55 (step t40 (cl (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx) (not (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)))) :rule reordering :premises (t39))
% 63.29/63.55 (step t41 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.quotient X Y Z)) (tptp.less_equal Z X))) (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.quotient X Y Z)) (tptp.less_equal Z X)))) :rule implies_neg1)
% 63.29/63.55 (anchor :step t42)
% 63.29/63.55 (assume t42.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.quotient X Y Z)) (tptp.less_equal Z X))))
% 63.29/63.55 (step t42.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.quotient X Y Z)) (tptp.less_equal Z X)))) (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)))) :rule forall_inst :args ((:= X tptp.zQx) (:= Y tptp.y) (:= Z (tptp.divide tptp.zQx tptp.y))))
% 63.29/63.55 (step t42.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.quotient X Y Z)) (tptp.less_equal Z X)))) (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx))) :rule or :premises (t42.t1))
% 63.29/63.55 (step t42.t3 (cl (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx))) :rule resolution :premises (t42.t2 t42.a0))
% 63.29/63.55 (step t42 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.quotient X Y Z)) (tptp.less_equal Z X)))) (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx))) :rule subproof :discharge (t42.a0))
% 63.29/63.55 (step t43 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.quotient X Y Z)) (tptp.less_equal Z X))) (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx))) (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx))) :rule resolution :premises (t41 t42))
% 63.29/63.55 (step t44 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.quotient X Y Z)) (tptp.less_equal Z X))) (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx))) (not (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)))) :rule implies_neg2)
% 63.29/63.55 (step t45 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.quotient X Y Z)) (tptp.less_equal Z X))) (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.quotient X Y Z)) (tptp.less_equal Z X))) (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)))) :rule resolution :premises (t43 t44))
% 63.29/63.55 (step t46 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.quotient X Y Z)) (tptp.less_equal Z X))) (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)))) :rule contraction :premises (t45))
% 63.29/63.55 (step t47 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.quotient X Y Z)) (tptp.less_equal Z X)))) (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx))) :rule implies :premises (t46))
% 63.29/63.55 (step t48 (cl (or (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx))) :rule resolution :premises (t47 a2))
% 63.29/63.55 (step t49 (cl (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) :rule resolution :premises (t40 t36 t48))
% 63.29/63.55 (step t50 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_equal X Y)) (not (tptp.less_equal Y Z)) (tptp.less_equal X Z))) (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_equal X Y)) (not (tptp.less_equal Y Z)) (tptp.less_equal X Z)))) :rule implies_neg1)
% 63.29/63.55 (anchor :step t51)
% 63.29/63.55 (assume t51.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_equal X Y)) (not (tptp.less_equal Y Z)) (tptp.less_equal X Z))))
% 63.29/63.55 (step t51.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_equal X Y)) (not (tptp.less_equal Y Z)) (tptp.less_equal X Z)))) (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx)))) :rule forall_inst :args ((:= X tptp.zQy) (:= Y (tptp.divide tptp.zQx tptp.y)) (:= Z tptp.zQx)))
% 63.29/63.55 (step t51.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_equal X Y)) (not (tptp.less_equal Y Z)) (tptp.less_equal X Z)))) (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx))) :rule or :premises (t51.t1))
% 63.29/63.55 (step t51.t3 (cl (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx))) :rule resolution :premises (t51.t2 t51.a0))
% 63.29/63.55 (step t51 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_equal X Y)) (not (tptp.less_equal Y Z)) (tptp.less_equal X Z)))) (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx))) :rule subproof :discharge (t51.a0))
% 63.29/63.55 (step t52 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_equal X Y)) (not (tptp.less_equal Y Z)) (tptp.less_equal X Z))) (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx))) (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx))) :rule resolution :premises (t50 t51))
% 63.29/63.55 (step t53 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_equal X Y)) (not (tptp.less_equal Y Z)) (tptp.less_equal X Z))) (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx))) (not (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx)))) :rule implies_neg2)
% 63.29/63.55 (step t54 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_equal X Y)) (not (tptp.less_equal Y Z)) (tptp.less_equal X Z))) (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_equal X Y)) (not (tptp.less_equal Y Z)) (tptp.less_equal X Z))) (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx)))) :rule resolution :premises (t52 t53))
% 63.29/63.55 (step t55 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_equal X Y)) (not (tptp.less_equal Y Z)) (tptp.less_equal X Z))) (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx)))) :rule contraction :premises (t54))
% 63.29/63.55 (step t56 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.less_equal X Y)) (not (tptp.less_equal Y Z)) (tptp.less_equal X Z)))) (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx))) :rule implies :premises (t55))
% 63.29/63.55 (step t57 (cl (or (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))) (not (tptp.less_equal (tptp.divide tptp.zQx tptp.y) tptp.zQx)) (tptp.less_equal tptp.zQy tptp.zQx))) :rule resolution :premises (t56 a13))
% 63.29/63.55 (step t58 (cl (not (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y)))) :rule resolution :premises (t38 a17 t49 t57))
% 63.29/63.55 (step t59 (cl (not (or (not (tptp.quotient tptp.z tptp.x tptp.zQx)) (not (tptp.quotient tptp.x tptp.y tptp.zero)) (not (tptp.quotient tptp.z tptp.y tptp.zQy)) (not (tptp.quotient tptp.zQy tptp.zero tptp.zQy)) (not (tptp.quotient tptp.zQx tptp.y (tptp.divide tptp.zQx tptp.y))) (tptp.less_equal tptp.zQy (tptp.divide tptp.zQx tptp.y))))) :rule resolution :premises (t9 a15 a16 t20 t28 t36 t58))
% 63.29/63.55 (step t60 (cl) :rule resolution :premises (t7 t59 a3))
% 63.29/63.55
% 63.30/63.55 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.rq7W104w85/cvc5---1.0.5_22505.smt2
% 63.30/63.55 % cvc5---1.0.5 exiting
% 63.30/63.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------