TSTP Solution File: ARI590_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : ARI590_1 : TPTP v8.2.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n028.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:12 EDT 2024
% Result : Theorem 0.20s 0.52s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : ARI590_1 : TPTP v8.2.0. Released v5.1.0.
% 0.03/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n028.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 05:36:24 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_ARI
% 0.20/0.52 --- Run --finite-model-find --decision=internal at 15...
% 0.20/0.52 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.oGGlSOESCx/cvc5---1.0.5_8439.smt2
% 0.20/0.52 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.oGGlSOESCx/cvc5---1.0.5_8439.smt2
% 0.20/0.52 (assume a0 (not (forall ((Y Int)) (exists ((X Int)) (and (< 0 X) (not (= Y X)))))))
% 0.20/0.52 (assume a1 true)
% 0.20/0.52 (step t1 (cl (not (= (not (forall ((Y Int)) (exists ((X Int)) (and (< 0 X) (not (= Y X)))))) false)) (not (not (forall ((Y Int)) (exists ((X Int)) (and (< 0 X) (not (= Y X))))))) false) :rule equiv_pos2)
% 0.20/0.52 (anchor :step t2 :args ((Y Int) (:= Y Y)))
% 0.20/0.52 (step t2.t1 (cl (= Y Y)) :rule refl)
% 0.20/0.52 (anchor :step t2.t2 :args ((X Int) (:= X X)))
% 0.20/0.52 (step t2.t2.t1 (cl (= X X)) :rule refl)
% 0.20/0.52 (step t2.t2.t2 (cl (= (< 0 X) (not (>= 0 X)))) :rule all_simplify)
% 0.20/0.52 (step t2.t2.t3 (cl (= (>= 0 X) (not (>= X 1)))) :rule all_simplify)
% 0.20/0.52 (step t2.t2.t4 (cl (= (not (>= 0 X)) (not (not (>= X 1))))) :rule cong :premises (t2.t2.t3))
% 0.20/0.52 (step t2.t2.t5 (cl (= (not (not (>= X 1))) (>= X 1))) :rule all_simplify)
% 0.20/0.52 (step t2.t2.t6 (cl (= (not (>= 0 X)) (>= X 1))) :rule trans :premises (t2.t2.t4 t2.t2.t5))
% 0.20/0.52 (step t2.t2.t7 (cl (= (< 0 X) (>= X 1))) :rule trans :premises (t2.t2.t2 t2.t2.t6))
% 0.20/0.52 (step t2.t2.t8 (cl (= (not (= Y X)) (not (= Y X)))) :rule refl)
% 0.20/0.52 (step t2.t2.t9 (cl (= (and (< 0 X) (not (= Y X))) (and (>= X 1) (not (= Y X))))) :rule cong :premises (t2.t2.t7 t2.t2.t8))
% 0.20/0.52 (step t2.t2 (cl (= (exists ((X Int)) (and (< 0 X) (not (= Y X)))) (exists ((X Int)) (and (>= X 1) (not (= Y X)))))) :rule bind)
% 0.20/0.52 (step t2.t3 (cl (= (exists ((X Int)) (and (>= X 1) (not (= Y X)))) (not (forall ((X Int)) (not (and (>= X 1) (not (= Y X)))))))) :rule all_simplify)
% 0.20/0.52 (step t2.t4 (cl (= (forall ((X Int)) (not (and (>= X 1) (not (= Y X))))) (forall ((X Int)) (or (not (>= X 1)) (= Y X))))) :rule all_simplify)
% 0.20/0.52 (step t2.t5 (cl (= (forall ((X Int)) (or (not (>= X 1)) (= Y X))) (or (not true) false))) :rule all_simplify)
% 0.20/0.52 (step t2.t6 (cl (= (or (not true) false) (not true))) :rule all_simplify)
% 0.20/0.52 (step t2.t7 (cl (= (not true) false)) :rule all_simplify)
% 0.20/0.52 (step t2.t8 (cl (= (or (not true) false) false)) :rule trans :premises (t2.t6 t2.t7))
% 0.20/0.52 (step t2.t9 (cl (= (forall ((X Int)) (or (not (>= X 1)) (= Y X))) false)) :rule trans :premises (t2.t5 t2.t8))
% 0.20/0.52 (step t2.t10 (cl (= (forall ((X Int)) (not (and (>= X 1) (not (= Y X))))) false)) :rule trans :premises (t2.t4 t2.t9))
% 0.20/0.52 (step t2.t11 (cl (= (not (forall ((X Int)) (not (and (>= X 1) (not (= Y X)))))) (not false))) :rule cong :premises (t2.t10))
% 0.20/0.52 (step t2.t12 (cl (= (not false) true)) :rule all_simplify)
% 0.20/0.52 (step t2.t13 (cl (= (not (forall ((X Int)) (not (and (>= X 1) (not (= Y X)))))) true)) :rule trans :premises (t2.t11 t2.t12))
% 0.20/0.52 (step t2.t14 (cl (= (exists ((X Int)) (and (>= X 1) (not (= Y X)))) true)) :rule trans :premises (t2.t3 t2.t13))
% 0.20/0.52 (step t2.t15 (cl (= (exists ((X Int)) (and (< 0 X) (not (= Y X)))) true)) :rule trans :premises (t2.t2 t2.t14))
% 0.20/0.52 (step t2 (cl (= (forall ((Y Int)) (exists ((X Int)) (and (< 0 X) (not (= Y X))))) (forall ((Y Int)) true))) :rule bind)
% 0.20/0.52 (step t3 (cl (= (forall ((Y Int)) true) true)) :rule all_simplify)
% 0.20/0.52 (step t4 (cl (= (forall ((Y Int)) (exists ((X Int)) (and (< 0 X) (not (= Y X))))) true)) :rule trans :premises (t2 t3))
% 0.20/0.52 (step t5 (cl (= (not (forall ((Y Int)) (exists ((X Int)) (and (< 0 X) (not (= Y X)))))) (not true))) :rule cong :premises (t4))
% 0.20/0.52 (step t6 (cl (= (not true) false)) :rule all_simplify)
% 0.20/0.52 (step t7 (cl (= (not (forall ((Y Int)) (exists ((X Int)) (and (< 0 X) (not (= Y X)))))) false)) :rule trans :premises (t5 t6))
% 0.20/0.52 (step t8 (cl false) :rule resolution :premises (t1 t7 a0))
% 0.20/0.52 (step t9 (cl (not false)) :rule false)
% 0.20/0.52 (step t10 (cl) :rule resolution :premises (t8 t9))
% 0.20/0.52
% 0.20/0.52 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.oGGlSOESCx/cvc5---1.0.5_8439.smt2
% 0.20/0.52 % cvc5---1.0.5 exiting
% 0.20/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------