TSTP Solution File: NUM490+3 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : NUM490+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n028.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 : Thu Aug 31 10:44:26 EDT 2023

% Result   : Theorem 0.21s 0.55s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : NUM490+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14  % Command    : do_cvc5 %s %d
% 0.15/0.35  % Computer : n028.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Fri Aug 25 17:16:36 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.21/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.55  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.cS5WbeAfRI/cvc5---1.0.5_21500.p...
% 0.21/0.55  ------- get file name : TPTP file name is NUM490+3
% 0.21/0.55  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_21500.smt2...
% 0.21/0.55  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.55  % SZS status Theorem for NUM490+3
% 0.21/0.55  % SZS output start Proof for NUM490+3
% 0.21/0.55  (
% 0.21/0.55  (let ((_let_1 (tptp.sdtasdt0 tptp.xp tptp.xm))) (let ((_let_2 (tptp.sdtasdt0 tptp.xn tptp.xm))) (let ((_let_3 (tptp.sdtasdt0 tptp.xr tptp.xm))) (let ((_let_4 (tptp.sdtpldt0 _let_1 _let_3))) (let ((_let_5 (not (or (= _let_4 _let_2) (= _let_3 (tptp.sdtmndt0 _let_2 _let_1)))))) (let ((_let_6 (= _let_2 _let_4))) (let ((_let_7 (tptp.sdtpldt0 tptp.xp tptp.xr))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (NOT_OR_ELIM (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))) :args (0)) (ASSUME :args (_let_6)) :args (false false _let_6)) :args ((forall ((W0 $$unsorted)) (=> (tptp.aNaturalNumber0 W0) true)) (tptp.aNaturalNumber0 tptp.sz00) (and (tptp.aNaturalNumber0 tptp.sz10) (not (= tptp.sz10 tptp.sz00))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (tptp.aNaturalNumber0 (tptp.sdtpldt0 W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (tptp.aNaturalNumber0 (tptp.sdtasdt0 W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (= (tptp.sdtpldt0 W0 W1) (tptp.sdtpldt0 W1 W0)))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1) (tptp.aNaturalNumber0 W2)) (= (tptp.sdtpldt0 (tptp.sdtpldt0 W0 W1) W2) (tptp.sdtpldt0 W0 (tptp.sdtpldt0 W1 W2))))) (forall ((W0 $$unsorted)) (=> (tptp.aNaturalNumber0 W0) (and (= (tptp.sdtpldt0 W0 tptp.sz00) W0) (= W0 (tptp.sdtpldt0 tptp.sz00 W0))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (= (tptp.sdtasdt0 W0 W1) (tptp.sdtasdt0 W1 W0)))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1) (tptp.aNaturalNumber0 W2)) (= (tptp.sdtasdt0 (tptp.sdtasdt0 W0 W1) W2) (tptp.sdtasdt0 W0 (tptp.sdtasdt0 W1 W2))))) (forall ((W0 $$unsorted)) (=> (tptp.aNaturalNumber0 W0) (and (= (tptp.sdtasdt0 W0 tptp.sz10) W0) (= W0 (tptp.sdtasdt0 tptp.sz10 W0))))) (forall ((W0 $$unsorted)) (=> (tptp.aNaturalNumber0 W0) (and (= (tptp.sdtasdt0 W0 tptp.sz00) tptp.sz00) (= tptp.sz00 (tptp.sdtasdt0 tptp.sz00 W0))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (let ((_let_1 (tptp.sdtpldt0 W1 W2))) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1) (tptp.aNaturalNumber0 W2)) (and (= (tptp.sdtasdt0 W0 _let_1) (tptp.sdtpldt0 (tptp.sdtasdt0 W0 W1) (tptp.sdtasdt0 W0 W2))) (= (tptp.sdtasdt0 _let_1 W0) (tptp.sdtpldt0 (tptp.sdtasdt0 W1 W0) (tptp.sdtasdt0 W2 W0))))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1) (tptp.aNaturalNumber0 W2)) (=> (or (= (tptp.sdtpldt0 W0 W1) (tptp.sdtpldt0 W0 W2)) (= (tptp.sdtpldt0 W1 W0) (tptp.sdtpldt0 W2 W0))) (= W1 W2)))) (forall ((W0 $$unsorted)) (=> (tptp.aNaturalNumber0 W0) (=> (not (= W0 tptp.sz00)) (forall ((W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W1) (tptp.aNaturalNumber0 W2)) (=> (or (= (tptp.sdtasdt0 W0 W1) (tptp.sdtasdt0 W0 W2)) (= (tptp.sdtasdt0 W1 W0) (tptp.sdtasdt0 W2 W0))) (= W1 W2))))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (=> (= (tptp.sdtpldt0 W0 W1) tptp.sz00) (and (= W0 tptp.sz00) (= W1 tptp.sz00))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (=> (= (tptp.sdtasdt0 W0 W1) tptp.sz00) (or (= W0 tptp.sz00) (= W1 tptp.sz00))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (= (tptp.sdtlseqdt0 W0 W1) (exists ((W2 $$unsorted)) (and (tptp.aNaturalNumber0 W2) (= (tptp.sdtpldt0 W0 W2) W1)))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (=> (tptp.sdtlseqdt0 W0 W1) (forall ((W2 $$unsorted)) (= (= W2 (tptp.sdtmndt0 W1 W0)) (and (tptp.aNaturalNumber0 W2) (= (tptp.sdtpldt0 W0 W2) W1))))))) (forall ((W0 $$unsorted)) (=> (tptp.aNaturalNumber0 W0) (tptp.sdtlseqdt0 W0 W0))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (=> (and (tptp.sdtlseqdt0 W0 W1) (tptp.sdtlseqdt0 W1 W0)) (= W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1) (tptp.aNaturalNumber0 W2)) (=> (and (tptp.sdtlseqdt0 W0 W1) (tptp.sdtlseqdt0 W1 W2)) (tptp.sdtlseqdt0 W0 W2)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (or (tptp.sdtlseqdt0 W0 W1) (and (not (= W1 W0)) (tptp.sdtlseqdt0 W1 W0))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (=> (and (not (= W0 W1)) (tptp.sdtlseqdt0 W0 W1)) (forall ((W2 $$unsorted)) (let ((_let_1 (tptp.sdtpldt0 W1 W2))) (let ((_let_2 (tptp.sdtpldt0 W0 W2))) (let ((_let_3 (tptp.sdtpldt0 W2 W1))) (let ((_let_4 (tptp.sdtpldt0 W2 W0))) (=> (tptp.aNaturalNumber0 W2) (and (not (= _let_4 _let_3)) (tptp.sdtlseqdt0 _let_4 _let_3) (not (= _let_2 _let_1)) (tptp.sdtlseqdt0 _let_2 _let_1))))))))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (let ((_let_1 (tptp.sdtasdt0 W2 W0))) (let ((_let_2 (tptp.sdtasdt0 W1 W0))) (let ((_let_3 (tptp.sdtasdt0 W0 W2))) (let ((_let_4 (tptp.sdtasdt0 W0 W1))) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1) (tptp.aNaturalNumber0 W2)) (=> (and (not (= W0 tptp.sz00)) (not (= W1 W2)) (tptp.sdtlseqdt0 W1 W2)) (and (not (= _let_4 _let_3)) (tptp.sdtlseqdt0 _let_4 _let_3) (not (= _let_2 _let_1)) (tptp.sdtlseqdt0 _let_2 _let_1))))))))) (forall ((W0 $$unsorted)) (=> (tptp.aNaturalNumber0 W0) (or (= W0 tptp.sz00) (= W0 tptp.sz10) (and (not (= tptp.sz10 W0)) (tptp.sdtlseqdt0 tptp.sz10 W0))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (=> (not (= W0 tptp.sz00)) (tptp.sdtlseqdt0 W1 (tptp.sdtasdt0 W1 W0))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (=> (tptp.iLess0 W0 W1) true))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (=> (and (not (= W0 W1)) (tptp.sdtlseqdt0 W0 W1)) (tptp.iLess0 W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (= (tptp.doDivides0 W0 W1) (exists ((W2 $$unsorted)) (and (tptp.aNaturalNumber0 W2) (= W1 (tptp.sdtasdt0 W0 W2))))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (=> (and (not (= W0 tptp.sz00)) (tptp.doDivides0 W0 W1)) (forall ((W2 $$unsorted)) (= (= W2 (tptp.sdtsldt0 W1 W0)) (and (tptp.aNaturalNumber0 W2) (= W1 (tptp.sdtasdt0 W0 W2)))))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1) (tptp.aNaturalNumber0 W2)) (=> (and (tptp.doDivides0 W0 W1) (tptp.doDivides0 W1 W2)) (tptp.doDivides0 W0 W2)))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1) (tptp.aNaturalNumber0 W2)) (=> (and (tptp.doDivides0 W0 W1) (tptp.doDivides0 W0 W2)) (tptp.doDivides0 W0 (tptp.sdtpldt0 W1 W2))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1) (tptp.aNaturalNumber0 W2)) (=> (and (tptp.doDivides0 W0 W1) (tptp.doDivides0 W0 (tptp.sdtpldt0 W1 W2))) (tptp.doDivides0 W0 W2)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (=> (and (tptp.doDivides0 W0 W1) (not (= W1 tptp.sz00))) (tptp.sdtlseqdt0 W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1)) (=> (and (not (= W0 tptp.sz00)) (tptp.doDivides0 W0 W1)) (forall ((W2 $$unsorted)) (=> (tptp.aNaturalNumber0 W2) (= (tptp.sdtasdt0 W2 (tptp.sdtsldt0 W1 W0)) (tptp.sdtsldt0 (tptp.sdtasdt0 W2 W1) W0))))))) (forall ((W0 $$unsorted)) (=> (tptp.aNaturalNumber0 W0) (= (tptp.isPrime0 W0) (and (not (= W0 tptp.sz00)) (not (= W0 tptp.sz10)) (forall ((W1 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W1) (tptp.doDivides0 W1 W0)) (or (= W1 tptp.sz10) (= W1 W0)))))))) (forall ((W0 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (not (= W0 tptp.sz00)) (not (= W0 tptp.sz10))) (exists ((W1 $$unsorted)) (and (tptp.aNaturalNumber0 W1) (tptp.doDivides0 W1 W0) (tptp.isPrime0 W1))))) (and (tptp.aNaturalNumber0 tptp.xn) (tptp.aNaturalNumber0 tptp.xm) (tptp.aNaturalNumber0 tptp.xp)) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1) (tptp.aNaturalNumber0 W2)) (=> (and (or (and (not (= W2 tptp.sz00)) (not (= W2 tptp.sz10)) (forall ((W3 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W3) (exists ((W4 $$unsorted)) (and (tptp.aNaturalNumber0 W4) (= W2 (tptp.sdtasdt0 W3 W4)))) (tptp.doDivides0 W3 W2)) (or (= W3 tptp.sz10) (= W3 W2))))) (tptp.isPrime0 W2)) (or (exists ((W3 $$unsorted)) (and (tptp.aNaturalNumber0 W3) (= (tptp.sdtasdt0 W0 W1) (tptp.sdtasdt0 W2 W3)))) (tptp.doDivides0 W2 (tptp.sdtasdt0 W0 W1)))) (=> (tptp.iLess0 (tptp.sdtpldt0 (tptp.sdtpldt0 W0 W1) W2) (tptp.sdtpldt0 (tptp.sdtpldt0 tptp.xn tptp.xm) tptp.xp)) (or (and (exists ((W3 $$unsorted)) (and (tptp.aNaturalNumber0 W3) (= W0 (tptp.sdtasdt0 W2 W3)))) (tptp.doDivides0 W2 W0)) (and (exists ((W3 $$unsorted)) (and (tptp.aNaturalNumber0 W3) (= W1 (tptp.sdtasdt0 W2 W3)))) (tptp.doDivides0 W2 W1))))))) (and (not (= tptp.xp tptp.sz00)) (not (= tptp.xp tptp.sz10)) (forall ((W0 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (or (exists ((W1 $$unsorted)) (and (tptp.aNaturalNumber0 W1) (= tptp.xp (tptp.sdtasdt0 W0 W1)))) (tptp.doDivides0 W0 tptp.xp))) (or (= W0 tptp.sz10) (= W0 tptp.xp)))) (tptp.isPrime0 tptp.xp) (exists ((W0 $$unsorted)) (and (tptp.aNaturalNumber0 W0) (= (tptp.sdtasdt0 tptp.xn tptp.xm) (tptp.sdtasdt0 tptp.xp W0)))) (tptp.doDivides0 tptp.xp _let_2)) (and (exists ((W0 $$unsorted)) (and (tptp.aNaturalNumber0 W0) (= (tptp.sdtpldt0 tptp.xp W0) tptp.xn))) (tptp.sdtlseqdt0 tptp.xp tptp.xn)) (and (tptp.aNaturalNumber0 tptp.xr) (= _let_7 tptp.xn) (= tptp.xr (tptp.sdtmndt0 tptp.xn tptp.xp))) (and (not (= tptp.xr tptp.xn)) (exists ((W0 $$unsorted)) (and (tptp.aNaturalNumber0 W0) (= (tptp.sdtpldt0 tptp.xr W0) tptp.xn))) (tptp.sdtlseqdt0 tptp.xr tptp.xn)) (= tptp.xn _let_7) _let_6 _let_5 true))))))))))
% 0.21/0.56  )
% 0.21/0.56  % SZS output end Proof for NUM490+3
% 0.21/0.56  % cvc5---1.0.5 exiting
% 0.21/0.56  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------