TSTP Solution File: ARI189_1 by cvc5---1.0.5

View Problem - Process Solution

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

% Computer : n003.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:20 EDT 2024

% Result   : Theorem 30.33s 30.94s
% Output   : Proof 30.33s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : ARI189_1 : TPTP v8.2.0. Released v5.0.0.
% 0.03/0.12  % Command    : do_cvc5 %s %d
% 0.11/0.33  % Computer : n003.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Mon May 27 05:40:08 EDT 2024
% 0.11/0.33  % CPUTime    : 
% 0.17/0.45  %----Proving TF0_ARI
% 30.33/30.94  --- Run --finite-model-find --decision=internal at 15...
% 30.33/30.94  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 30.33/30.94  --- Run --no-e-matching --full-saturate-quant at 15...
% 30.33/30.94  --- Run --cegqi-all --purify-triggers --full-saturate-quant at 15...
% 30.33/30.94  % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.A3JWZMEdbf/cvc5---1.0.5_24936.smt2
% 30.33/30.94  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.A3JWZMEdbf/cvc5---1.0.5_24936.smt2
% 30.33/30.94  (assume a0 (not (=> (forall ((U Int)) (tptp.p (* 2 U))) (tptp.p 10))))
% 30.33/30.94  (assume a1 true)
% 30.33/30.94  (step t1 (cl (not (= (=> (forall ((U Int)) (tptp.p (* 2 U))) (tptp.p (* 2 5))) (=> (forall ((U Int)) (tptp.p (* 2 U))) (tptp.p 10)))) (not (=> (forall ((U Int)) (tptp.p (* 2 U))) (tptp.p (* 2 5)))) (=> (forall ((U Int)) (tptp.p (* 2 U))) (tptp.p 10))) :rule equiv_pos2)
% 30.33/30.94  (step t2 (cl (= (forall ((U Int)) (tptp.p (* 2 U))) (forall ((U Int)) (tptp.p (* 2 U))))) :rule refl)
% 30.33/30.94  (step t3 (cl (= (* 2 5) 10)) :rule all_simplify)
% 30.33/30.94  (step t4 (cl (= (tptp.p (* 2 5)) (tptp.p 10))) :rule cong :premises (t3))
% 30.33/30.94  (step t5 (cl (= (=> (forall ((U Int)) (tptp.p (* 2 U))) (tptp.p (* 2 5))) (=> (forall ((U Int)) (tptp.p (* 2 U))) (tptp.p 10)))) :rule cong :premises (t2 t4))
% 30.33/30.94  (step t6 (cl (=> (forall ((U Int)) (tptp.p (* 2 U))) (tptp.p (* 2 5))) (forall ((U Int)) (tptp.p (* 2 U)))) :rule implies_neg1)
% 30.33/30.94  (anchor :step t7)
% 30.33/30.94  (assume t7.a0 (forall ((U Int)) (tptp.p (* 2 U))))
% 30.33/30.94  (step t7.t1 (cl (or (not (forall ((U Int)) (tptp.p (* 2 U)))) (tptp.p (* 2 5)))) :rule forall_inst :args ((:= U 5)))
% 30.33/30.94  (step t7.t2 (cl (not (forall ((U Int)) (tptp.p (* 2 U)))) (tptp.p (* 2 5))) :rule or :premises (t7.t1))
% 30.33/30.94  (step t7.t3 (cl (tptp.p (* 2 5))) :rule resolution :premises (t7.t2 t7.a0))
% 30.33/30.94  (step t7 (cl (not (forall ((U Int)) (tptp.p (* 2 U)))) (tptp.p (* 2 5))) :rule subproof :discharge (t7.a0))
% 30.33/30.94  (step t8 (cl (=> (forall ((U Int)) (tptp.p (* 2 U))) (tptp.p (* 2 5))) (tptp.p (* 2 5))) :rule resolution :premises (t6 t7))
% 30.33/30.94  (step t9 (cl (=> (forall ((U Int)) (tptp.p (* 2 U))) (tptp.p (* 2 5))) (not (tptp.p (* 2 5)))) :rule implies_neg2)
% 30.33/30.94  (step t10 (cl (=> (forall ((U Int)) (tptp.p (* 2 U))) (tptp.p (* 2 5))) (=> (forall ((U Int)) (tptp.p (* 2 U))) (tptp.p (* 2 5)))) :rule resolution :premises (t8 t9))
% 30.33/30.94  (step t11 (cl (=> (forall ((U Int)) (tptp.p (* 2 U))) (tptp.p (* 2 5)))) :rule contraction :premises (t10))
% 30.33/30.94  (step t12 (cl (=> (forall ((U Int)) (tptp.p (* 2 U))) (tptp.p 10))) :rule resolution :premises (t1 t5 t11))
% 30.33/30.94  (step t13 (cl (not (forall ((U Int)) (tptp.p (* 2 U)))) (tptp.p 10)) :rule implies :premises (t12))
% 30.33/30.94  (step t14 (cl (tptp.p 10) (not (forall ((U Int)) (tptp.p (* 2 U))))) :rule reordering :premises (t13))
% 30.33/30.94  (step t15 (cl (not (tptp.p 10))) :rule not_implies2 :premises (a0))
% 30.33/30.94  (step t16 (cl (forall ((U Int)) (tptp.p (* 2 U)))) :rule not_implies1 :premises (a0))
% 30.33/30.94  (step t17 (cl) :rule resolution :premises (t14 t15 t16))
% 30.33/30.94  
% 30.33/30.94  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.A3JWZMEdbf/cvc5---1.0.5_24936.smt2
% 30.33/30.94  % cvc5---1.0.5 exiting
% 30.33/30.94  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------