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