TSTP Solution File: ARI576_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : ARI576_1 : TPTP v8.2.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n010.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:34:09 EDT 2024
% Result : Theorem 0.18s 0.47s
% Output : Proof 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI576_1 : TPTP v8.2.0. Released v5.1.0.
% 0.11/0.13 % Command : do_cvc5 %s %d
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 27 05:20:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 %----Proving TF0_ARI
% 0.18/0.47 --- Run --finite-model-find --decision=internal at 15...
% 0.18/0.47 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.Ze4IvnflU4/cvc5---1.0.5_4592.smt2
% 0.18/0.47 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.Ze4IvnflU4/cvc5---1.0.5_4592.smt2
% 0.18/0.47 (assume a0 (not (exists ((X Int)) (and (<= (* 2 X) 21) (<= 29 (* 3 X))))))
% 0.18/0.47 (assume a1 true)
% 0.18/0.47 (step t1 (cl (not (= (=> (forall ((X Int)) (or (>= X 11) (not (>= X 10)))) (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10)))) (not (forall ((X Int)) (or (>= X 11) (not (>= X 10))))))) (not (=> (forall ((X Int)) (or (>= X 11) (not (>= X 10)))) (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10))))) (not (forall ((X Int)) (or (>= X 11) (not (>= X 10)))))) :rule equiv_pos2)
% 0.18/0.47 (step t2 (cl (= (forall ((X Int)) (or (>= X 11) (not (>= X 10)))) (forall ((X Int)) (or (>= X 11) (not (>= X 10)))))) :rule refl)
% 0.18/0.47 (step t3 (cl (= (* (- 1) (- 10)) 10)) :rule all_simplify)
% 0.18/0.47 (step t4 (cl (= 11 11)) :rule refl)
% 0.18/0.47 (step t5 (cl (= (>= (* (- 1) (- 10)) 11) (>= 10 11))) :rule cong :premises (t3 t4))
% 0.18/0.47 (step t6 (cl (= (>= 10 11) false)) :rule all_simplify)
% 0.18/0.47 (step t7 (cl (= (>= (* (- 1) (- 10)) 11) false)) :rule trans :premises (t5 t6))
% 0.18/0.47 (step t8 (cl (= 10 10)) :rule refl)
% 0.18/0.47 (step t9 (cl (= (>= (* (- 1) (- 10)) 10) (>= 10 10))) :rule cong :premises (t3 t8))
% 0.18/0.47 (step t10 (cl (= (>= 10 10) true)) :rule all_simplify)
% 0.18/0.47 (step t11 (cl (= (>= (* (- 1) (- 10)) 10) true)) :rule trans :premises (t9 t10))
% 0.18/0.47 (step t12 (cl (= (not (>= (* (- 1) (- 10)) 10)) (not true))) :rule cong :premises (t11))
% 0.18/0.47 (step t13 (cl (= (not true) false)) :rule all_simplify)
% 0.18/0.47 (step t14 (cl (= (not (>= (* (- 1) (- 10)) 10)) false)) :rule trans :premises (t12 t13))
% 0.18/0.47 (step t15 (cl (= (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10))) (or false false))) :rule cong :premises (t7 t14))
% 0.18/0.47 (step t16 (cl (= (or false false) false)) :rule all_simplify)
% 0.18/0.47 (step t17 (cl (= (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10))) false)) :rule trans :premises (t15 t16))
% 0.18/0.47 (step t18 (cl (= (=> (forall ((X Int)) (or (>= X 11) (not (>= X 10)))) (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10)))) (=> (forall ((X Int)) (or (>= X 11) (not (>= X 10)))) false))) :rule cong :premises (t2 t17))
% 0.18/0.47 (step t19 (cl (= (=> (forall ((X Int)) (or (>= X 11) (not (>= X 10)))) false) (not (forall ((X Int)) (or (>= X 11) (not (>= X 10))))))) :rule all_simplify)
% 0.18/0.47 (step t20 (cl (= (=> (forall ((X Int)) (or (>= X 11) (not (>= X 10)))) (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10)))) (not (forall ((X Int)) (or (>= X 11) (not (>= X 10))))))) :rule trans :premises (t18 t19))
% 0.18/0.47 (step t21 (cl (=> (forall ((X Int)) (or (>= X 11) (not (>= X 10)))) (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10)))) (forall ((X Int)) (or (>= X 11) (not (>= X 10))))) :rule implies_neg1)
% 0.18/0.47 (anchor :step t22)
% 0.18/0.47 (assume t22.a0 (forall ((X Int)) (or (>= X 11) (not (>= X 10)))))
% 0.18/0.47 (step t22.t1 (cl (or (not (forall ((X Int)) (or (>= X 11) (not (>= X 10))))) (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10))))) :rule forall_inst :args ((:= X (* (- 1) (- 10)))))
% 0.18/0.47 (step t22.t2 (cl (not (forall ((X Int)) (or (>= X 11) (not (>= X 10))))) (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10)))) :rule or :premises (t22.t1))
% 0.18/0.47 (step t22.t3 (cl (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10)))) :rule resolution :premises (t22.t2 t22.a0))
% 0.18/0.47 (step t22 (cl (not (forall ((X Int)) (or (>= X 11) (not (>= X 10))))) (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10)))) :rule subproof :discharge (t22.a0))
% 0.18/0.47 (step t23 (cl (=> (forall ((X Int)) (or (>= X 11) (not (>= X 10)))) (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10)))) (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10)))) :rule resolution :premises (t21 t22))
% 0.18/0.47 (step t24 (cl (=> (forall ((X Int)) (or (>= X 11) (not (>= X 10)))) (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10)))) (not (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10))))) :rule implies_neg2)
% 0.18/0.47 (step t25 (cl (=> (forall ((X Int)) (or (>= X 11) (not (>= X 10)))) (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10)))) (=> (forall ((X Int)) (or (>= X 11) (not (>= X 10)))) (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10))))) :rule resolution :premises (t23 t24))
% 0.18/0.48 (step t26 (cl (=> (forall ((X Int)) (or (>= X 11) (not (>= X 10)))) (or (>= (* (- 1) (- 10)) 11) (not (>= (* (- 1) (- 10)) 10))))) :rule contraction :premises (t25))
% 0.18/0.48 (step t27 (cl (not (forall ((X Int)) (or (>= X 11) (not (>= X 10)))))) :rule resolution :premises (t1 t20 t26))
% 0.18/0.48 (step t28 (cl (not (= (not (exists ((X Int)) (and (<= (* 2 X) 21) (<= 29 (* 3 X))))) (forall ((X Int)) (or (>= X 11) (not (>= X 10)))))) (not (not (exists ((X Int)) (and (<= (* 2 X) 21) (<= 29 (* 3 X)))))) (forall ((X Int)) (or (>= X 11) (not (>= X 10))))) :rule equiv_pos2)
% 0.18/0.48 (anchor :step t29 :args ((X Int) (:= X X)))
% 0.18/0.48 (step t29.t1 (cl (= X X)) :rule refl)
% 0.18/0.48 (step t29.t2 (cl (= (<= (* 2 X) 21) (not (>= X 11)))) :rule all_simplify)
% 0.18/0.48 (step t29.t3 (cl (= (<= 29 (* 3 X)) (>= X 10))) :rule all_simplify)
% 0.18/0.48 (step t29.t4 (cl (= (and (<= (* 2 X) 21) (<= 29 (* 3 X))) (and (not (>= X 11)) (>= X 10)))) :rule cong :premises (t29.t2 t29.t3))
% 0.18/0.48 (step t29 (cl (= (exists ((X Int)) (and (<= (* 2 X) 21) (<= 29 (* 3 X)))) (exists ((X Int)) (and (not (>= X 11)) (>= X 10))))) :rule bind)
% 0.18/0.48 (step t30 (cl (= (exists ((X Int)) (and (not (>= X 11)) (>= X 10))) (not (forall ((X Int)) (not (and (not (>= X 11)) (>= X 10))))))) :rule all_simplify)
% 0.18/0.48 (step t31 (cl (= (forall ((X Int)) (not (and (not (>= X 11)) (>= X 10)))) (forall ((X Int)) (or (>= X 11) (not (>= X 10)))))) :rule all_simplify)
% 0.18/0.48 (step t32 (cl (= (not (forall ((X Int)) (not (and (not (>= X 11)) (>= X 10))))) (not (forall ((X Int)) (or (>= X 11) (not (>= X 10))))))) :rule cong :premises (t31))
% 0.18/0.48 (step t33 (cl (= (exists ((X Int)) (and (not (>= X 11)) (>= X 10))) (not (forall ((X Int)) (or (>= X 11) (not (>= X 10))))))) :rule trans :premises (t30 t32))
% 0.18/0.48 (step t34 (cl (= (exists ((X Int)) (and (<= (* 2 X) 21) (<= 29 (* 3 X)))) (not (forall ((X Int)) (or (>= X 11) (not (>= X 10))))))) :rule trans :premises (t29 t33))
% 0.18/0.48 (step t35 (cl (= (not (exists ((X Int)) (and (<= (* 2 X) 21) (<= 29 (* 3 X))))) (not (not (forall ((X Int)) (or (>= X 11) (not (>= X 10)))))))) :rule cong :premises (t34))
% 0.18/0.48 (step t36 (cl (= (not (not (forall ((X Int)) (or (>= X 11) (not (>= X 10)))))) (forall ((X Int)) (or (>= X 11) (not (>= X 10)))))) :rule all_simplify)
% 0.18/0.48 (step t37 (cl (= (not (exists ((X Int)) (and (<= (* 2 X) 21) (<= 29 (* 3 X))))) (forall ((X Int)) (or (>= X 11) (not (>= X 10)))))) :rule trans :premises (t35 t36))
% 0.18/0.48 (step t38 (cl (forall ((X Int)) (or (>= X 11) (not (>= X 10))))) :rule resolution :premises (t28 t37 a0))
% 0.18/0.48 (step t39 (cl) :rule resolution :premises (t27 t38))
% 0.18/0.48
% 0.18/0.48 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.Ze4IvnflU4/cvc5---1.0.5_4592.smt2
% 0.18/0.48 % cvc5---1.0.5 exiting
% 0.18/0.48 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------