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