TSTP Solution File: NUM489+1 by cvc5---1.0.5

View Problem - Process Solution

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

% Computer : n006.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:25 EDT 2023

% Result   : Theorem 5.31s 5.61s
% Output   : Proof 5.31s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : NUM489+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14  % Command    : do_cvc5 %s %d
% 0.15/0.35  % Computer : n006.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 16:21:52 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 0.21/0.49  %----Proving TF0_NAR, FOF, or CNF
% 5.31/5.61  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.GPyBTBwNQ2/cvc5---1.0.5_20186.p...
% 5.31/5.61  ------- get file name : TPTP file name is NUM489+1
% 5.31/5.61  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_20186.smt2...
% 5.31/5.61  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 5.31/5.61  % SZS status Theorem for NUM489+1
% 5.31/5.61  % SZS output start Proof for NUM489+1
% 5.31/5.61  (
% 5.31/5.61  (let ((_let_1 (= tptp.xn (tptp.sdtpldt0 tptp.xp tptp.xr)))) (let ((_let_2 (not _let_1))) (let ((_let_3 (= tptp.xr (tptp.sdtmndt0 tptp.xn tptp.xp)))) (let ((_let_4 (tptp.sdtlseqdt0 tptp.xp tptp.xn))) (let ((_let_5 (tptp.aNaturalNumber0 tptp.xp))) (let ((_let_6 (tptp.aNaturalNumber0 tptp.xn))) (let ((_let_7 (and _let_6 (tptp.aNaturalNumber0 tptp.xm) _let_5))) (let ((_let_8 (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))))))))) (let ((_let_9 (and (tptp.aNaturalNumber0 tptp.xr) _let_1))) (let ((_let_10 (= _let_3 _let_9))) (let ((_let_11 (not _let_4))) (let ((_let_12 (not _let_6))) (let ((_let_13 (not _let_5))) (let ((_let_14 (or _let_13 _let_12 _let_11 _let_10))) (let ((_let_15 (ASSUME :args (_let_7)))) (let ((_let_16 (forall ((W0 $$unsorted) (W1 $$unsorted) (BOUND_VARIABLE_1401 $$unsorted)) (or (not (tptp.aNaturalNumber0 W0)) (not (tptp.aNaturalNumber0 W1)) (not (tptp.sdtlseqdt0 W0 W1)) (= (and (tptp.aNaturalNumber0 BOUND_VARIABLE_1401) (= W1 (tptp.sdtpldt0 W0 BOUND_VARIABLE_1401))) (= (tptp.sdtmndt0 W1 W0) BOUND_VARIABLE_1401)))))) (let ((_let_17 (EQ_RESOLVE (ASSUME :args (_let_8)) (MACRO_SR_EQ_INTRO :args (_let_8 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_18 (not _let_10))) (let ((_let_19 (not _let_9))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_14)) :args ((or _let_12 _let_13 _let_11 _let_10 (not _let_14)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_10)) :args ((or (not _let_3) _let_9 _let_18))) (ASSUME :args (_let_3)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_9 1)) :args ((or _let_1 _let_19))) (ASSUME :args (_let_2)) :args (_let_19 true _let_1)) :args (_let_18 false _let_3 true _let_9)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_17 :args (tptp.xp tptp.xn tptp.xr QUANTIFIERS_INST_E_MATCHING ((tptp.sdtpldt0 W0 BOUND_VARIABLE_1401) (not (= (tptp.sdtlseqdt0 W0 W1) false))))) :args (_let_16)))) _let_17 :args (_let_14 false _let_16)) (ASSUME :args (_let_4)) (AND_ELIM _let_15 :args (2)) (AND_ELIM _let_15 :args (0)) :args (false true _let_10 false _let_14 false _let_4 false _let_5 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)))))) _let_8 (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))))) _let_7 (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aNaturalNumber0 W0) (tptp.aNaturalNumber0 W1) (tptp.aNaturalNumber0 W2)) (=> (and (tptp.isPrime0 W2) (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 (tptp.doDivides0 W2 W0) (tptp.doDivides0 W2 W1)))))) (and (tptp.isPrime0 tptp.xp) (tptp.doDivides0 tptp.xp (tptp.sdtasdt0 tptp.xn tptp.xm))) _let_4 _let_3 (and (not (= tptp.xr tptp.xn)) (tptp.sdtlseqdt0 tptp.xr tptp.xn)) _let_2 true))))))))))))))))))))))
% 5.31/5.63  )
% 5.31/5.63  % SZS output end Proof for NUM489+1
% 5.31/5.63  % cvc5---1.0.5 exiting
% 5.31/5.64  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------