TSTP Solution File: ARI175_1 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : ARI175_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n021.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:18 EDT 2024

% Result   : Theorem 0.17s 0.46s
% Output   : Proof 0.17s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem    : ARI175_1 : TPTP v8.2.0. Released v5.0.0.
% 0.09/0.11  % Command    : do_cvc5 %s %d
% 0.10/0.31  % Computer : n021.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 300
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Mon May 27 05:16:24 EDT 2024
% 0.16/0.32  % CPUTime    : 
% 0.17/0.44  %----Proving TF0_ARI
% 0.17/0.46  --- Run --finite-model-find --decision=internal at 15...
% 0.17/0.46  % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.wmbHwvweCg/cvc5---1.0.5_30582.smt2
% 0.17/0.46  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.wmbHwvweCg/cvc5---1.0.5_30582.smt2
% 0.17/0.46  (assume a0 (not (exists ((U Int) (V Int)) (= (+ (* 3 U) (* 5 V)) 23))))
% 0.17/0.46  (assume a1 true)
% 0.17/0.46  (step t1 (cl (not (= (=> (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))) (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1))))) (not (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V)))))))) (not (=> (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))) (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1)))))) (not (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))))) :rule equiv_pos2)
% 0.17/0.46  (step t2 (cl (= (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))) (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))))) :rule refl)
% 0.17/0.46  (step t3 (cl (= 3 3)) :rule refl)
% 0.17/0.46  (step t4 (cl (= (* (- 1) (- 6)) 6)) :rule all_simplify)
% 0.17/0.46  (step t5 (cl (= (* 3 (* (- 1) (- 6))) (* 3 6))) :rule cong :premises (t3 t4))
% 0.17/0.46  (step t6 (cl (= (* 3 6) 18)) :rule all_simplify)
% 0.17/0.46  (step t7 (cl (= (* 3 (* (- 1) (- 6))) 18)) :rule trans :premises (t5 t6))
% 0.17/0.46  (step t8 (cl (= 23 23)) :rule refl)
% 0.17/0.46  (step t9 (cl (= (* (- 5) 1) (- 5))) :rule all_simplify)
% 0.17/0.46  (step t10 (cl (= (+ 23 (* (- 5) 1)) (+ 23 (- 5)))) :rule cong :premises (t8 t9))
% 0.17/0.46  (step t11 (cl (= (+ 23 (- 5)) 18)) :rule all_simplify)
% 0.17/0.46  (step t12 (cl (= (+ 23 (* (- 5) 1)) 18)) :rule trans :premises (t10 t11))
% 0.17/0.46  (step t13 (cl (= (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1))) (= 18 18))) :rule cong :premises (t7 t12))
% 0.17/0.46  (step t14 (cl (= (= 18 18) true)) :rule all_simplify)
% 0.17/0.46  (step t15 (cl (= (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1))) true)) :rule trans :premises (t13 t14))
% 0.17/0.46  (step t16 (cl (= (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1)))) (not true))) :rule cong :premises (t15))
% 0.17/0.46  (step t17 (cl (= (not true) false)) :rule all_simplify)
% 0.17/0.46  (step t18 (cl (= (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1)))) false)) :rule trans :premises (t16 t17))
% 0.17/0.46  (step t19 (cl (= (=> (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))) (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1))))) (=> (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))) false))) :rule cong :premises (t2 t18))
% 0.17/0.46  (step t20 (cl (= (=> (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))) false) (not (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V)))))))) :rule all_simplify)
% 0.17/0.46  (step t21 (cl (= (=> (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))) (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1))))) (not (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V)))))))) :rule trans :premises (t19 t20))
% 0.17/0.46  (step t22 (cl (=> (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))) (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1))))) (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V)))))) :rule implies_neg1)
% 0.17/0.46  (anchor :step t23)
% 0.17/0.46  (assume t23.a0 (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))))
% 0.17/0.46  (step t23.t1 (cl (or (not (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V)))))) (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1)))))) :rule forall_inst :args ((:= U (* (- 1) (- 6))) (:= V 1)))
% 0.17/0.46  (step t23.t2 (cl (not (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V)))))) (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1))))) :rule or :premises (t23.t1))
% 0.17/0.46  (step t23.t3 (cl (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1))))) :rule resolution :premises (t23.t2 t23.a0))
% 0.17/0.46  (step t23 (cl (not (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V)))))) (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1))))) :rule subproof :discharge (t23.a0))
% 0.17/0.46  (step t24 (cl (=> (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))) (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1))))) (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1))))) :rule resolution :premises (t22 t23))
% 0.17/0.46  (step t25 (cl (=> (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))) (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1))))) (not (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1)))))) :rule implies_neg2)
% 0.17/0.46  (step t26 (cl (=> (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))) (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1))))) (=> (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))) (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1)))))) :rule resolution :premises (t24 t25))
% 0.17/0.46  (step t27 (cl (=> (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))) (not (= (* 3 (* (- 1) (- 6))) (+ 23 (* (- 5) 1)))))) :rule contraction :premises (t26))
% 0.17/0.46  (step t28 (cl (not (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))))) :rule resolution :premises (t1 t21 t27))
% 0.17/0.46  (step t29 (cl (not (= (not (exists ((U Int) (V Int)) (= (+ (* 3 U) (* 5 V)) 23))) (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))))) (not (not (exists ((U Int) (V Int)) (= (+ (* 3 U) (* 5 V)) 23)))) (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V)))))) :rule equiv_pos2)
% 0.17/0.46  (anchor :step t30 :args ((U Int) (:= U U) (V Int) (:= V V)))
% 0.17/0.46  (step t30.t1 (cl (= U U)) :rule refl)
% 0.17/0.46  (step t30.t2 (cl (= V V)) :rule refl)
% 0.17/0.46  (step t30.t3 (cl (= (= (+ (* 3 U) (* 5 V)) 23) (= (* 3 U) (+ 23 (* (- 5) V))))) :rule all_simplify)
% 0.17/0.46  (step t30 (cl (= (exists ((U Int) (V Int)) (= (+ (* 3 U) (* 5 V)) 23)) (exists ((U Int) (V Int)) (= (* 3 U) (+ 23 (* (- 5) V)))))) :rule bind)
% 0.17/0.46  (step t31 (cl (= (exists ((U Int) (V Int)) (= (* 3 U) (+ 23 (* (- 5) V)))) (not (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V)))))))) :rule all_simplify)
% 0.17/0.46  (step t32 (cl (= (exists ((U Int) (V Int)) (= (+ (* 3 U) (* 5 V)) 23)) (not (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V)))))))) :rule trans :premises (t30 t31))
% 0.17/0.46  (step t33 (cl (= (not (exists ((U Int) (V Int)) (= (+ (* 3 U) (* 5 V)) 23))) (not (not (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))))))) :rule cong :premises (t32))
% 0.17/0.46  (step t34 (cl (= (not (not (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))))) (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))))) :rule all_simplify)
% 0.17/0.46  (step t35 (cl (= (not (exists ((U Int) (V Int)) (= (+ (* 3 U) (* 5 V)) 23))) (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V))))))) :rule trans :premises (t33 t34))
% 0.17/0.46  (step t36 (cl (forall ((U Int) (V Int)) (not (= (* 3 U) (+ 23 (* (- 5) V)))))) :rule resolution :premises (t29 t35 a0))
% 0.17/0.46  (step t37 (cl) :rule resolution :premises (t28 t36))
% 0.17/0.46  
% 0.17/0.46  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.wmbHwvweCg/cvc5---1.0.5_30582.smt2
% 0.17/0.46  % cvc5---1.0.5 exiting
% 0.17/0.46  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------