TSTP Solution File: ARI702_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : ARI702_1 : TPTP v8.2.0. Released v6.3.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n005.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:32 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : ARI702_1 : TPTP v8.2.0. Released v6.3.0.
% 0.08/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n005.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:25:39 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 %----Proving TF0_ARI
% 0.21/0.50 --- Run --finite-model-find --decision=internal at 15...
% 0.21/0.50 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.HNAGljfnTy/cvc5---1.0.5_17267.smt2
% 0.21/0.50 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.HNAGljfnTy/cvc5---1.0.5_17267.smt2
% 0.21/0.50 (assume a0 (= (* (* 2 tptp.x) tptp.y) tptp.a))
% 0.21/0.50 (assume a1 (= (* (* 2 tptp.y) tptp.z) tptp.b))
% 0.21/0.50 (assume a2 (= (* tptp.a tptp.z) 2))
% 0.21/0.50 (assume a3 (not (= (* (* tptp.x tptp.y) tptp.z) 1)))
% 0.21/0.50 (assume a4 true)
% 0.21/0.50 (step t1 (cl (not (= (not (= (* tptp.x tptp.y tptp.z) 1)) false)) (not (not (= (* tptp.x tptp.y tptp.z) 1))) false) :rule equiv_pos2)
% 0.21/0.50 (step t2 (cl (not (= (= (* tptp.a tptp.z) 2) (= (* tptp.x tptp.y tptp.z) 1))) (not (= (* tptp.a tptp.z) 2)) (= (* tptp.x tptp.y tptp.z) 1)) :rule equiv_pos2)
% 0.21/0.50 (step t3 (cl (and (= tptp.b (* 2 (* tptp.y tptp.z))) (= tptp.a (* 2 (* tptp.x tptp.y)))) (not (= tptp.b (* 2 (* tptp.y tptp.z)))) (not (= tptp.a (* 2 (* tptp.x tptp.y))))) :rule and_neg)
% 0.21/0.50 (step t4 (cl (not (= (= (* (* 2 tptp.y) tptp.z) tptp.b) (= tptp.b (* 2 (* tptp.y tptp.z))))) (not (= (* (* 2 tptp.y) tptp.z) tptp.b)) (= tptp.b (* 2 (* tptp.y tptp.z)))) :rule equiv_pos2)
% 0.21/0.50 (step t5 (cl (= (* (* 2 tptp.y) tptp.z) (* 2 (* tptp.y tptp.z)))) :rule all_simplify)
% 0.21/0.50 (step t6 (cl (= tptp.b tptp.b)) :rule refl)
% 0.21/0.50 (step t7 (cl (= (= (* (* 2 tptp.y) tptp.z) tptp.b) (= (* 2 (* tptp.y tptp.z)) tptp.b))) :rule cong :premises (t5 t6))
% 0.21/0.50 (step t8 (cl (= (= (* 2 (* tptp.y tptp.z)) tptp.b) (= tptp.b (* 2 (* tptp.y tptp.z))))) :rule all_simplify)
% 0.21/0.50 (step t9 (cl (= (= (* (* 2 tptp.y) tptp.z) tptp.b) (= tptp.b (* 2 (* tptp.y tptp.z))))) :rule trans :premises (t7 t8))
% 0.21/0.50 (step t10 (cl (= tptp.b (* 2 (* tptp.y tptp.z)))) :rule resolution :premises (t4 t9 a1))
% 0.21/0.50 (step t11 (cl (not (= (= (* (* 2 tptp.x) tptp.y) tptp.a) (= tptp.a (* 2 (* tptp.x tptp.y))))) (not (= (* (* 2 tptp.x) tptp.y) tptp.a)) (= tptp.a (* 2 (* tptp.x tptp.y)))) :rule equiv_pos2)
% 0.21/0.50 (step t12 (cl (= (* (* 2 tptp.x) tptp.y) (* 2 (* tptp.x tptp.y)))) :rule all_simplify)
% 0.21/0.50 (step t13 (cl (= tptp.a tptp.a)) :rule refl)
% 0.21/0.50 (step t14 (cl (= (= (* (* 2 tptp.x) tptp.y) tptp.a) (= (* 2 (* tptp.x tptp.y)) tptp.a))) :rule cong :premises (t12 t13))
% 0.21/0.50 (step t15 (cl (= (= (* 2 (* tptp.x tptp.y)) tptp.a) (= tptp.a (* 2 (* tptp.x tptp.y))))) :rule all_simplify)
% 0.21/0.50 (step t16 (cl (= (= (* (* 2 tptp.x) tptp.y) tptp.a) (= tptp.a (* 2 (* tptp.x tptp.y))))) :rule trans :premises (t14 t15))
% 0.21/0.50 (step t17 (cl (= tptp.a (* 2 (* tptp.x tptp.y)))) :rule resolution :premises (t11 t16 a0))
% 0.21/0.50 (step t18 (cl (and (= tptp.b (* 2 (* tptp.y tptp.z))) (= tptp.a (* 2 (* tptp.x tptp.y))))) :rule resolution :premises (t3 t10 t17))
% 0.21/0.50 (step t19 (cl (= tptp.a (* 2 (* tptp.x tptp.y)))) :rule and :premises (t18))
% 0.21/0.50 (step t20 (cl (= tptp.z tptp.z)) :rule refl)
% 0.21/0.50 (step t21 (cl (= (* tptp.a tptp.z) (* (* 2 (* tptp.x tptp.y)) tptp.z))) :rule cong :premises (t19 t20))
% 0.21/0.50 (step t22 (cl (= 2 2)) :rule refl)
% 0.21/0.50 (step t23 (cl (= (= (* tptp.a tptp.z) 2) (= (* (* 2 (* tptp.x tptp.y)) tptp.z) 2))) :rule cong :premises (t21 t22))
% 0.21/0.50 (step t24 (cl (= (* (* 2 (* tptp.x tptp.y)) tptp.z) (* 2 (* tptp.x tptp.y tptp.z)))) :rule all_simplify)
% 0.21/0.50 (step t25 (cl (= 2 2)) :rule refl)
% 0.21/0.50 (step t26 (cl (= (= (* (* 2 (* tptp.x tptp.y)) tptp.z) 2) (= (* 2 (* tptp.x tptp.y tptp.z)) 2))) :rule cong :premises (t24 t25))
% 0.21/0.50 (step t27 (cl (= (= (* 2 (* tptp.x tptp.y tptp.z)) 2) (= (* tptp.x tptp.y tptp.z) 1))) :rule all_simplify)
% 0.21/0.50 (step t28 (cl (= (= (* (* 2 (* tptp.x tptp.y)) tptp.z) 2) (= (* tptp.x tptp.y tptp.z) 1))) :rule trans :premises (t26 t27))
% 0.21/0.50 (step t29 (cl (= (= (* tptp.a tptp.z) 2) (= (* tptp.x tptp.y tptp.z) 1))) :rule trans :premises (t23 t28))
% 0.21/0.50 (step t30 (cl (not (= (= (* tptp.a tptp.z) 2) (= (* tptp.a tptp.z) 2))) (not (= (* tptp.a tptp.z) 2)) (= (* tptp.a tptp.z) 2)) :rule equiv_pos2)
% 0.21/0.50 (step t31 (cl (= (* tptp.a tptp.z) (* tptp.a tptp.z))) :rule all_simplify)
% 0.21/0.50 (step t32 (cl (= (= (* tptp.a tptp.z) 2) (= (* tptp.a tptp.z) 2))) :rule cong :premises (t31 t25))
% 0.21/0.50 (step t33 (cl (= (* tptp.a tptp.z) 2)) :rule resolution :premises (t30 t32 a2))
% 0.21/0.50 (step t34 (cl (= (* tptp.x tptp.y tptp.z) 1)) :rule resolution :premises (t2 t29 t33))
% 0.21/0.50 (step t35 (cl (= 1 1)) :rule refl)
% 0.21/0.50 (step t36 (cl (= (= (* tptp.x tptp.y tptp.z) 1) (= 1 1))) :rule cong :premises (t34 t35))
% 0.21/0.51 (step t37 (cl (= (not (= (* tptp.x tptp.y tptp.z) 1)) (not (= 1 1)))) :rule cong :premises (t36))
% 0.21/0.51 (step t38 (cl (= (= 1 1) true)) :rule all_simplify)
% 0.21/0.51 (step t39 (cl (= (not (= 1 1)) (not true))) :rule cong :premises (t38))
% 0.21/0.51 (step t40 (cl (= (not true) false)) :rule all_simplify)
% 0.21/0.51 (step t41 (cl (= (not (= 1 1)) false)) :rule trans :premises (t39 t40))
% 0.21/0.51 (step t42 (cl (= (not (= (* tptp.x tptp.y tptp.z) 1)) false)) :rule trans :premises (t37 t41))
% 0.21/0.51 (step t43 (cl (not (= (not (= (* (* tptp.x tptp.y) tptp.z) 1)) (not (= (* tptp.x tptp.y tptp.z) 1)))) (not (not (= (* (* tptp.x tptp.y) tptp.z) 1))) (not (= (* tptp.x tptp.y tptp.z) 1))) :rule equiv_pos2)
% 0.21/0.51 (step t44 (cl (= (* tptp.x tptp.y) (* tptp.x tptp.y))) :rule all_simplify)
% 0.21/0.51 (step t45 (cl (= tptp.z tptp.z)) :rule refl)
% 0.21/0.51 (step t46 (cl (= (* (* tptp.x tptp.y) tptp.z) (* (* tptp.x tptp.y) tptp.z))) :rule cong :premises (t44 t45))
% 0.21/0.51 (step t47 (cl (= (* (* tptp.x tptp.y) tptp.z) (* tptp.x tptp.y tptp.z))) :rule all_simplify)
% 0.21/0.51 (step t48 (cl (= (* (* tptp.x tptp.y) tptp.z) (* tptp.x tptp.y tptp.z))) :rule trans :premises (t46 t47))
% 0.21/0.51 (step t49 (cl (= 1 1)) :rule refl)
% 0.21/0.51 (step t50 (cl (= (= (* (* tptp.x tptp.y) tptp.z) 1) (= (* tptp.x tptp.y tptp.z) 1))) :rule cong :premises (t48 t49))
% 0.21/0.51 (step t51 (cl (= (not (= (* (* tptp.x tptp.y) tptp.z) 1)) (not (= (* tptp.x tptp.y tptp.z) 1)))) :rule cong :premises (t50))
% 0.21/0.51 (step t52 (cl (not (= (* tptp.x tptp.y tptp.z) 1))) :rule resolution :premises (t43 t51 a3))
% 0.21/0.51 (step t53 (cl false) :rule resolution :premises (t1 t42 t52))
% 0.21/0.51 (step t54 (cl (not false)) :rule false)
% 0.21/0.51 (step t55 (cl) :rule resolution :premises (t53 t54))
% 0.21/0.51
% 0.21/0.51 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.HNAGljfnTy/cvc5---1.0.5_17267.smt2
% 0.21/0.51 % cvc5---1.0.5 exiting
% 0.21/0.51 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------