TSTP Solution File: DAT001_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : DAT001_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 16:42:49 EDT 2024
% Result : Theorem 0.20s 0.55s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : DAT001_1 : TPTP v8.2.0. Released v5.0.0.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 27 17:30:54 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.50 %----Proving TF0_ARI
% 0.20/0.55 --- Run --finite-model-find --decision=internal at 15...
% 0.20/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.20/0.55 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.zEzRLSIqZZ/cvc5---1.0.5_5314.smt2
% 0.20/0.55 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.zEzRLSIqZZ/cvc5---1.0.5_5314.smt2
% 0.20/0.55 (assume a0 (tptp.sorted tptp.nil))
% 0.20/0.55 (assume a1 (forall ((X Int)) (tptp.sorted (tptp.mycons X tptp.nil))))
% 0.20/0.55 (assume a2 (forall ((X Int) (Y Int) (R tptp.list)) (=> (and (< X Y) (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))))
% 0.20/0.55 (assume a3 (not (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))))
% 0.20/0.55 (assume a4 true)
% 0.20/0.55 (step t1 (cl (not (or (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule or_pos)
% 0.20/0.55 (step t2 (cl (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (not (or (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule reordering :premises (t1))
% 0.20/0.55 (step t3 (cl (not (or (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) :rule or_pos)
% 0.20/0.55 (step t4 (cl (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (not (or (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule reordering :premises (t3))
% 0.20/0.55 (step t5 (cl (not (or (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) :rule or_pos)
% 0.20/0.55 (step t6 (cl (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))) (not (or (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule reordering :premises (t5))
% 0.20/0.55 (step t7 (cl (=> (forall ((X Int)) (tptp.sorted (tptp.mycons X tptp.nil))) (tptp.sorted (tptp.mycons 100 tptp.nil))) (forall ((X Int)) (tptp.sorted (tptp.mycons X tptp.nil)))) :rule implies_neg1)
% 0.20/0.55 (anchor :step t8)
% 0.20/0.55 (assume t8.a0 (forall ((X Int)) (tptp.sorted (tptp.mycons X tptp.nil))))
% 0.20/0.55 (step t8.t1 (cl (or (not (forall ((X Int)) (tptp.sorted (tptp.mycons X tptp.nil)))) (tptp.sorted (tptp.mycons 100 tptp.nil)))) :rule forall_inst :args ((:= X 100)))
% 0.20/0.55 (step t8.t2 (cl (not (forall ((X Int)) (tptp.sorted (tptp.mycons X tptp.nil)))) (tptp.sorted (tptp.mycons 100 tptp.nil))) :rule or :premises (t8.t1))
% 0.20/0.55 (step t8.t3 (cl (tptp.sorted (tptp.mycons 100 tptp.nil))) :rule resolution :premises (t8.t2 t8.a0))
% 0.20/0.55 (step t8 (cl (not (forall ((X Int)) (tptp.sorted (tptp.mycons X tptp.nil)))) (tptp.sorted (tptp.mycons 100 tptp.nil))) :rule subproof :discharge (t8.a0))
% 0.20/0.55 (step t9 (cl (=> (forall ((X Int)) (tptp.sorted (tptp.mycons X tptp.nil))) (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 100 tptp.nil))) :rule resolution :premises (t7 t8))
% 0.20/0.55 (step t10 (cl (=> (forall ((X Int)) (tptp.sorted (tptp.mycons X tptp.nil))) (tptp.sorted (tptp.mycons 100 tptp.nil))) (not (tptp.sorted (tptp.mycons 100 tptp.nil)))) :rule implies_neg2)
% 0.20/0.55 (step t11 (cl (=> (forall ((X Int)) (tptp.sorted (tptp.mycons X tptp.nil))) (tptp.sorted (tptp.mycons 100 tptp.nil))) (=> (forall ((X Int)) (tptp.sorted (tptp.mycons X tptp.nil))) (tptp.sorted (tptp.mycons 100 tptp.nil)))) :rule resolution :premises (t9 t10))
% 0.20/0.55 (step t12 (cl (=> (forall ((X Int)) (tptp.sorted (tptp.mycons X tptp.nil))) (tptp.sorted (tptp.mycons 100 tptp.nil)))) :rule contraction :premises (t11))
% 0.20/0.55 (step t13 (cl (not (forall ((X Int)) (tptp.sorted (tptp.mycons X tptp.nil)))) (tptp.sorted (tptp.mycons 100 tptp.nil))) :rule implies :premises (t12))
% 0.20/0.55 (step t14 (cl (tptp.sorted (tptp.mycons 100 tptp.nil))) :rule resolution :premises (t13 a1))
% 0.20/0.55 (step t15 (cl (not (= (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) (not (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule equiv_pos2)
% 0.20/0.55 (step t16 (cl (= (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))))) :rule refl)
% 0.20/0.55 (step t17 (cl (= 7 7)) :rule refl)
% 0.20/0.55 (step t18 (cl (= (* (- 1) 100) (- 100))) :rule all_simplify)
% 0.20/0.55 (step t19 (cl (= (+ 7 (* (- 1) 100)) (+ 7 (- 100)))) :rule cong :premises (t17 t18))
% 0.20/0.55 (step t20 (cl (= (+ 7 (- 100)) (- 93))) :rule all_simplify)
% 0.20/0.55 (step t21 (cl (= (+ 7 (* (- 1) 100)) (- 93))) :rule trans :premises (t19 t20))
% 0.20/0.55 (step t22 (cl (= 0 0)) :rule refl)
% 0.20/0.55 (step t23 (cl (= (>= (+ 7 (* (- 1) 100)) 0) (>= (- 93) 0))) :rule cong :premises (t21 t22))
% 0.20/0.55 (step t24 (cl (= (>= (- 93) 0) false)) :rule all_simplify)
% 0.20/0.55 (step t25 (cl (= (>= (+ 7 (* (- 1) 100)) 0) false)) :rule trans :premises (t23 t24))
% 0.20/0.55 (step t26 (cl (= (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (not (tptp.sorted (tptp.mycons 100 tptp.nil))))) :rule refl)
% 0.20/0.55 (step t27 (cl (= (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) :rule refl)
% 0.20/0.55 (step t28 (cl (= (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (or false (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule cong :premises (t25 t26 t27))
% 0.20/0.55 (step t29 (cl (= (or false (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (or (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule all_simplify)
% 0.20/0.55 (step t30 (cl (= (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (or (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule trans :premises (t28 t29))
% 0.20/0.55 (step t31 (cl (= (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule cong :premises (t16 t30))
% 0.20/0.55 (step t32 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) :rule implies_neg1)
% 0.20/0.55 (anchor :step t33)
% 0.20/0.55 (assume t33.a0 (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))))
% 0.20/0.55 (step t33.t1 (cl (or (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule forall_inst :args ((:= X 7) (:= Y 100) (:= R tptp.nil)))
% 0.20/0.55 (step t33.t2 (cl (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) :rule or :premises (t33.t1))
% 0.20/0.55 (step t33.t3 (cl (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) :rule resolution :premises (t33.t2 t33.a0))
% 0.20/0.55 (step t33 (cl (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) :rule subproof :discharge (t33.a0))
% 0.20/0.55 (step t34 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) :rule resolution :premises (t32 t33))
% 0.20/0.55 (step t35 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (not (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule implies_neg2)
% 0.20/0.55 (step t36 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule resolution :premises (t34 t35))
% 0.20/0.55 (step t37 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 7 (* (- 1) 100)) 0) (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule contraction :premises (t36))
% 0.20/0.55 (step t38 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule resolution :premises (t15 t31 t37))
% 0.20/0.55 (step t39 (cl (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) :rule implies :premises (t38))
% 0.20/0.55 (step t40 (cl (not (= (forall ((X Int) (Y Int) (R tptp.list)) (=> (and (< X Y) (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))))) (not (forall ((X Int) (Y Int) (R tptp.list)) (=> (and (< X Y) (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) :rule equiv_pos2)
% 0.20/0.55 (anchor :step t41 :args ((X Int) (:= X X) (Y Int) (:= Y Y) (R tptp.list) (:= R R)))
% 0.20/0.55 (step t41.t1 (cl (= X X)) :rule refl)
% 0.20/0.55 (step t41.t2 (cl (= Y Y)) :rule refl)
% 0.20/0.55 (step t41.t3 (cl (= R R)) :rule refl)
% 0.20/0.55 (step t41.t4 (cl (= (< X Y) (not (>= X Y)))) :rule all_simplify)
% 0.20/0.55 (step t41.t5 (cl (= (>= X Y) (>= (+ X (* (- 1) Y)) 0))) :rule all_simplify)
% 0.20/0.55 (step t41.t6 (cl (= (not (>= X Y)) (not (>= (+ X (* (- 1) Y)) 0)))) :rule cong :premises (t41.t5))
% 0.20/0.55 (step t41.t7 (cl (= (< X Y) (not (>= (+ X (* (- 1) Y)) 0)))) :rule trans :premises (t41.t4 t41.t6))
% 0.20/0.55 (step t41.t8 (cl (= (tptp.sorted (tptp.mycons Y R)) (tptp.sorted (tptp.mycons Y R)))) :rule refl)
% 0.20/0.55 (step t41.t9 (cl (= (and (< X Y) (tptp.sorted (tptp.mycons Y R))) (and (not (>= (+ X (* (- 1) Y)) 0)) (tptp.sorted (tptp.mycons Y R))))) :rule cong :premises (t41.t7 t41.t8))
% 0.20/0.55 (step t41.t10 (cl (= (tptp.sorted (tptp.mycons X (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) :rule refl)
% 0.20/0.55 (step t41.t11 (cl (= (=> (and (< X Y) (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))) (=> (and (not (>= (+ X (* (- 1) Y)) 0)) (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) :rule cong :premises (t41.t9 t41.t10))
% 0.20/0.55 (step t41 (cl (= (forall ((X Int) (Y Int) (R tptp.list)) (=> (and (< X Y) (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (forall ((X Int) (Y Int) (R tptp.list)) (=> (and (not (>= (+ X (* (- 1) Y)) 0)) (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))))) :rule bind)
% 0.20/0.55 (step t42 (cl (= (forall ((X Int) (Y Int) (R tptp.list)) (=> (and (not (>= (+ X (* (- 1) Y)) 0)) (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))))) :rule all_simplify)
% 0.20/0.55 (step t43 (cl (= (forall ((X Int) (Y Int) (R tptp.list)) (=> (and (< X Y) (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))))) :rule trans :premises (t41 t42))
% 0.20/0.55 (step t44 (cl (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) :rule resolution :premises (t40 t43 a2))
% 0.20/0.55 (step t45 (cl (or (not (tptp.sorted (tptp.mycons 100 tptp.nil))) (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) :rule resolution :premises (t39 t44))
% 0.20/0.55 (step t46 (cl (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) :rule resolution :premises (t6 t14 t45))
% 0.20/0.55 (step t47 (cl (not (= (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) (not (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule equiv_pos2)
% 0.20/0.55 (step t48 (cl (= 4 4)) :rule refl)
% 0.20/0.55 (step t49 (cl (= (* (- 1) 7) (- 7))) :rule all_simplify)
% 0.20/0.55 (step t50 (cl (= (+ 4 (* (- 1) 7)) (+ 4 (- 7)))) :rule cong :premises (t48 t49))
% 0.20/0.55 (step t51 (cl (= (+ 4 (- 7)) (- 3))) :rule all_simplify)
% 0.20/0.55 (step t52 (cl (= (+ 4 (* (- 1) 7)) (- 3))) :rule trans :premises (t50 t51))
% 0.20/0.55 (step t53 (cl (= (>= (+ 4 (* (- 1) 7)) 0) (>= (- 3) 0))) :rule cong :premises (t52 t22))
% 0.20/0.55 (step t54 (cl (= (>= (- 3) 0) false)) :rule all_simplify)
% 0.20/0.55 (step t55 (cl (= (>= (+ 4 (* (- 1) 7)) 0) false)) :rule trans :premises (t53 t54))
% 0.20/0.55 (step t56 (cl (= (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule refl)
% 0.20/0.55 (step t57 (cl (= (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule refl)
% 0.20/0.55 (step t58 (cl (= (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (or false (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule cong :premises (t55 t56 t57))
% 0.20/0.55 (step t59 (cl (= (or false (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (or (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule all_simplify)
% 0.20/0.55 (step t60 (cl (= (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (or (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule trans :premises (t58 t59))
% 0.20/0.55 (step t61 (cl (= (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule cong :premises (t16 t60))
% 0.20/0.55 (step t62 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) :rule implies_neg1)
% 0.20/0.55 (anchor :step t63)
% 0.20/0.55 (assume t63.a0 (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))))
% 0.20/0.55 (step t63.t1 (cl (or (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule forall_inst :args ((:= X 4) (:= Y 7) (:= R (tptp.mycons 100 tptp.nil))))
% 0.20/0.55 (step t63.t2 (cl (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule or :premises (t63.t1))
% 0.20/0.55 (step t63.t3 (cl (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule resolution :premises (t63.t2 t63.a0))
% 0.20/0.55 (step t63 (cl (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule subproof :discharge (t63.a0))
% 0.20/0.55 (step t64 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule resolution :premises (t62 t63))
% 0.20/0.55 (step t65 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (not (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule implies_neg2)
% 0.20/0.55 (step t66 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule resolution :premises (t64 t65))
% 0.20/0.55 (step t67 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 4 (* (- 1) 7)) 0) (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule contraction :premises (t66))
% 0.20/0.55 (step t68 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule resolution :premises (t47 t61 t67))
% 0.20/0.55 (step t69 (cl (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule implies :premises (t68))
% 0.20/0.55 (step t70 (cl (or (not (tptp.sorted (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))) (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) :rule resolution :premises (t69 t44))
% 0.20/0.55 (step t71 (cl (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) :rule resolution :premises (t4 t46 t70))
% 0.20/0.55 (step t72 (cl (not (or (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule or_pos)
% 0.20/0.55 (step t73 (cl (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (not (or (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))))) :rule reordering :premises (t72))
% 0.20/0.55 (step t74 (cl (not (= (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))))) (not (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))))) :rule equiv_pos2)
% 0.20/0.55 (step t75 (cl (= 1 1)) :rule refl)
% 0.20/0.55 (step t76 (cl (= (* (- 1) 2) (- 2))) :rule all_simplify)
% 0.20/0.55 (step t77 (cl (= (+ 1 (* (- 1) 2)) (+ 1 (- 2)))) :rule cong :premises (t75 t76))
% 0.20/0.55 (step t78 (cl (= (+ 1 (- 2)) (- 1))) :rule all_simplify)
% 0.20/0.55 (step t79 (cl (= (+ 1 (* (- 1) 2)) (- 1))) :rule trans :premises (t77 t78))
% 0.20/0.55 (step t80 (cl (= (>= (+ 1 (* (- 1) 2)) 0) (>= (- 1) 0))) :rule cong :premises (t79 t22))
% 0.20/0.55 (step t81 (cl (= (>= (- 1) 0) false)) :rule all_simplify)
% 0.20/0.55 (step t82 (cl (= (>= (+ 1 (* (- 1) 2)) 0) false)) :rule trans :premises (t80 t81))
% 0.20/0.55 (step t83 (cl (= (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule refl)
% 0.20/0.55 (step t84 (cl (= (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule refl)
% 0.20/0.55 (step t85 (cl (= (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) (or false (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))))) :rule cong :premises (t82 t83 t84))
% 0.20/0.55 (step t86 (cl (= (or false (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) (or (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))))) :rule all_simplify)
% 0.20/0.55 (step t87 (cl (= (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) (or (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))))) :rule trans :premises (t85 t86))
% 0.20/0.55 (step t88 (cl (= (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))))) :rule cong :premises (t16 t87))
% 0.20/0.55 (step t89 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) :rule implies_neg1)
% 0.20/0.55 (anchor :step t90)
% 0.20/0.55 (assume t90.a0 (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))))
% 0.20/0.55 (step t90.t1 (cl (or (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))))) :rule forall_inst :args ((:= X 1) (:= Y 2) (:= R (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))
% 0.20/0.55 (step t90.t2 (cl (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule or :premises (t90.t1))
% 0.20/0.55 (step t90.t3 (cl (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule resolution :premises (t90.t2 t90.a0))
% 0.20/0.55 (step t90 (cl (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule subproof :discharge (t90.a0))
% 0.20/0.55 (step t91 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule resolution :premises (t89 t90))
% 0.20/0.55 (step t92 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) (not (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))))) :rule implies_neg2)
% 0.20/0.55 (step t93 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))))) :rule resolution :premises (t91 t92))
% 0.20/0.55 (step t94 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 1 (* (- 1) 2)) 0) (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))))) :rule contraction :premises (t93))
% 0.20/0.55 (step t95 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))))) :rule resolution :premises (t74 t88 t94))
% 0.20/0.55 (step t96 (cl (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule implies :premises (t95))
% 0.20/0.55 (step t97 (cl (or (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (tptp.sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule resolution :premises (t96 t44))
% 0.20/0.55 (step t98 (cl (not (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule resolution :premises (t73 a3 t97))
% 0.20/0.55 (step t99 (cl (not (= (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))))) (not (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule equiv_pos2)
% 0.20/0.55 (step t100 (cl (= 2 2)) :rule refl)
% 0.20/0.55 (step t101 (cl (= (* (- 1) 4) (- 4))) :rule all_simplify)
% 0.20/0.55 (step t102 (cl (= (+ 2 (* (- 1) 4)) (+ 2 (- 4)))) :rule cong :premises (t100 t101))
% 0.20/0.55 (step t103 (cl (= (+ 2 (- 4)) (- 2))) :rule all_simplify)
% 0.20/0.55 (step t104 (cl (= (+ 2 (* (- 1) 4)) (- 2))) :rule trans :premises (t102 t103))
% 0.20/0.55 (step t105 (cl (= (>= (+ 2 (* (- 1) 4)) 0) (>= (- 2) 0))) :rule cong :premises (t104 t22))
% 0.20/0.55 (step t106 (cl (= (>= (- 2) 0) false)) :rule all_simplify)
% 0.20/0.55 (step t107 (cl (= (>= (+ 2 (* (- 1) 4)) 0) false)) :rule trans :premises (t105 t106))
% 0.20/0.55 (step t108 (cl (= (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule refl)
% 0.20/0.55 (step t109 (cl (= (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule refl)
% 0.20/0.55 (step t110 (cl (= (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (or false (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule cong :premises (t107 t108 t109))
% 0.20/0.55 (step t111 (cl (= (or false (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (or (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule all_simplify)
% 0.20/0.55 (step t112 (cl (= (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))) (or (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule trans :premises (t110 t111))
% 0.20/0.55 (step t113 (cl (= (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))))) :rule cong :premises (t16 t112))
% 0.20/0.55 (step t114 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) :rule implies_neg1)
% 0.20/0.55 (anchor :step t115)
% 0.20/0.55 (assume t115.a0 (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))))
% 0.20/0.55 (step t115.t1 (cl (or (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule forall_inst :args ((:= X 2) (:= Y 4) (:= R (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))
% 0.20/0.55 (step t115.t2 (cl (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule or :premises (t115.t1))
% 0.20/0.55 (step t115.t3 (cl (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule resolution :premises (t115.t2 t115.a0))
% 0.20/0.55 (step t115 (cl (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule subproof :discharge (t115.a0))
% 0.20/0.55 (step t116 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule resolution :premises (t114 t115))
% 0.20/0.55 (step t117 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) (not (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule implies_neg2)
% 0.20/0.56 (step t118 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule resolution :premises (t116 t117))
% 0.20/0.56 (step t119 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (>= (+ 2 (* (- 1) 4)) 0) (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule contraction :premises (t118))
% 0.20/0.56 (step t120 (cl (=> (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R))))) (or (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil)))))))) :rule resolution :premises (t99 t113 t119))
% 0.20/0.56 (step t121 (cl (not (forall ((X Int) (Y Int) (R tptp.list)) (or (>= (+ X (* (- 1) Y)) 0) (not (tptp.sorted (tptp.mycons Y R))) (tptp.sorted (tptp.mycons X (tptp.mycons Y R)))))) (or (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule implies :premises (t120))
% 0.20/0.56 (step t122 (cl (or (not (tptp.sorted (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))) (tptp.sorted (tptp.mycons 2 (tptp.mycons 4 (tptp.mycons 7 (tptp.mycons 100 tptp.nil))))))) :rule resolution :premises (t121 t44))
% 0.20/0.56 (step t123 (cl) :rule resolution :premises (t2 t71 t98 t122))
% 0.20/0.56
% 0.20/0.56 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.zEzRLSIqZZ/cvc5---1.0.5_5314.smt2
% 0.20/0.56 % cvc5---1.0.5 exiting
% 0.20/0.56 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------