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