TSTP Solution File: ARI166_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : ARI166_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n008.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:33:17 EDT 2024
% Result : Theorem 0.20s 0.53s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : ARI166_1 : TPTP v8.2.0. Released v5.0.0.
% 0.03/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 27 05:29:24 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.20/0.51 %----Proving TF0_ARI
% 0.20/0.53 --- Run --finite-model-find --decision=internal at 15...
% 0.20/0.53 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.LklnYn9GBB/cvc5---1.0.5_20986.smt2
% 0.20/0.53 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.LklnYn9GBB/cvc5---1.0.5_20986.smt2
% 0.20/0.53 (assume a0 (not (forall ((X Int)) (=> (= (+ 2 3) X) (< 4 X)))))
% 0.20/0.53 (assume a1 true)
% 0.20/0.53 (step t1 (cl (not (= (not (forall ((X Int)) (=> (= (+ 2 3) X) (< 4 X)))) false)) (not (not (forall ((X Int)) (=> (= (+ 2 3) X) (< 4 X))))) false) :rule equiv_pos2)
% 0.20/0.53 (anchor :step t2 :args ((X Int) (:= X X)))
% 0.20/0.53 (step t2.t1 (cl (= X X)) :rule refl)
% 0.20/0.53 (step t2.t2 (cl (= (+ 2 3) 5)) :rule all_simplify)
% 0.20/0.53 (step t2.t3 (cl (= X X)) :rule refl)
% 0.20/0.53 (step t2.t4 (cl (= (= (+ 2 3) X) (= 5 X))) :rule cong :premises (t2.t2 t2.t3))
% 0.20/0.53 (step t2.t5 (cl (= (= 5 X) (= X 5))) :rule all_simplify)
% 0.20/0.53 (step t2.t6 (cl (= (= (+ 2 3) X) (= X 5))) :rule trans :premises (t2.t4 t2.t5))
% 0.20/0.53 (step t2.t7 (cl (= (< 4 X) (not (>= 4 X)))) :rule all_simplify)
% 0.20/0.53 (step t2.t8 (cl (= (>= 4 X) (not (>= X 5)))) :rule all_simplify)
% 0.20/0.53 (step t2.t9 (cl (= (not (>= 4 X)) (not (not (>= X 5))))) :rule cong :premises (t2.t8))
% 0.20/0.53 (step t2.t10 (cl (= (not (not (>= X 5))) (>= X 5))) :rule all_simplify)
% 0.20/0.53 (step t2.t11 (cl (= (not (>= 4 X)) (>= X 5))) :rule trans :premises (t2.t9 t2.t10))
% 0.20/0.53 (step t2.t12 (cl (= (< 4 X) (>= X 5))) :rule trans :premises (t2.t7 t2.t11))
% 0.20/0.53 (step t2.t13 (cl (= (=> (= (+ 2 3) X) (< 4 X)) (=> (= X 5) (>= X 5)))) :rule cong :premises (t2.t6 t2.t12))
% 0.20/0.53 (step t2 (cl (= (forall ((X Int)) (=> (= (+ 2 3) X) (< 4 X))) (forall ((X Int)) (=> (= X 5) (>= X 5))))) :rule bind)
% 0.20/0.53 (step t3 (cl (= (forall ((X Int)) (=> (= X 5) (>= X 5))) (forall ((X Int)) (or (not (= X 5)) (>= X 5))))) :rule all_simplify)
% 0.20/0.53 (step t4 (cl (= (forall ((X Int)) (or (not (= X 5)) (>= X 5))) (or (not (= 5 5)) (>= 5 5)))) :rule all_simplify)
% 0.20/0.53 (step t5 (cl (= (= 5 5) true)) :rule all_simplify)
% 0.20/0.53 (step t6 (cl (= (not (= 5 5)) (not true))) :rule cong :premises (t5))
% 0.20/0.53 (step t7 (cl (= (not true) false)) :rule all_simplify)
% 0.20/0.53 (step t8 (cl (= (not (= 5 5)) false)) :rule trans :premises (t6 t7))
% 0.20/0.53 (step t9 (cl (= (>= 5 5) true)) :rule all_simplify)
% 0.20/0.53 (step t10 (cl (= (or (not (= 5 5)) (>= 5 5)) (or false true))) :rule cong :premises (t8 t9))
% 0.20/0.53 (step t11 (cl (= (or false true) true)) :rule all_simplify)
% 0.20/0.53 (step t12 (cl (= (or (not (= 5 5)) (>= 5 5)) true)) :rule trans :premises (t10 t11))
% 0.20/0.53 (step t13 (cl (= (forall ((X Int)) (or (not (= X 5)) (>= X 5))) true)) :rule trans :premises (t4 t12))
% 0.20/0.53 (step t14 (cl (= (forall ((X Int)) (=> (= X 5) (>= X 5))) true)) :rule trans :premises (t3 t13))
% 0.20/0.53 (step t15 (cl (= (forall ((X Int)) (=> (= (+ 2 3) X) (< 4 X))) true)) :rule trans :premises (t2 t14))
% 0.20/0.53 (step t16 (cl (= (not (forall ((X Int)) (=> (= (+ 2 3) X) (< 4 X)))) (not true))) :rule cong :premises (t15))
% 0.20/0.53 (step t17 (cl (= (not (forall ((X Int)) (=> (= (+ 2 3) X) (< 4 X)))) false)) :rule trans :premises (t16 t7))
% 0.20/0.53 (step t18 (cl false) :rule resolution :premises (t1 t17 a0))
% 0.20/0.53 (step t19 (cl (not false)) :rule false)
% 0.20/0.53 (step t20 (cl) :rule resolution :premises (t18 t19))
% 0.20/0.53
% 0.20/0.53 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.LklnYn9GBB/cvc5---1.0.5_20986.smt2
% 0.20/0.53 % cvc5---1.0.5 exiting
% 0.20/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------