TSTP Solution File: NUM504+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM504+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:07:27 EDT 2023
% Result : ContradictoryAxioms 0.21s 0.66s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 36 ( 16 unt; 0 def)
% Number of atoms : 139 ( 48 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 168 ( 65 ~; 71 |; 23 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn; 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mLEAsym,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.4v9kam3fDU/E---3.1_15869.p',mLEAsym) ).
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != sz00
& doDivides0(X1,X2) )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.4v9kam3fDU/E---3.1_15869.p',mDefQuot) ).
fof(m__2414,hypothesis,
( sdtasdt0(xn,xm) != sdtasdt0(xp,xm)
& sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))
& sdtasdt0(xp,xm) != sdtasdt0(xp,xk)
& sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk)) ),
file('/export/starexec/sandbox/tmp/tmp.4v9kam3fDU/E---3.1_15869.p',m__2414) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.4v9kam3fDU/E---3.1_15869.p',mSortsB_02) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/tmp/tmp.4v9kam3fDU/E---3.1_15869.p',m__1837) ).
fof(m__1860,hypothesis,
( isPrime0(xp)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/tmp/tmp.4v9kam3fDU/E---3.1_15869.p',m__1860) ).
fof(m__2306,hypothesis,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
file('/export/starexec/sandbox/tmp/tmp.4v9kam3fDU/E---3.1_15869.p',m__2306) ).
fof(mDefPrime,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( X1 != sz00
& X1 != sz10
& ! [X2] :
( ( aNaturalNumber0(X2)
& doDivides0(X2,X1) )
=> ( X2 = sz10
| X2 = X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.4v9kam3fDU/E---3.1_15869.p',mDefPrime) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/tmp/tmp.4v9kam3fDU/E---3.1_15869.p',mSortsC) ).
fof(c_0_9,plain,
! [X42,X43] :
( ~ aNaturalNumber0(X42)
| ~ aNaturalNumber0(X43)
| ~ sdtlseqdt0(X42,X43)
| ~ sdtlseqdt0(X43,X42)
| X42 = X43 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLEAsym])]) ).
fof(c_0_10,plain,
! [X64,X65,X66] :
( ( aNaturalNumber0(X66)
| X66 != sdtsldt0(X65,X64)
| X64 = sz00
| ~ doDivides0(X64,X65)
| ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X65) )
& ( X65 = sdtasdt0(X64,X66)
| X66 != sdtsldt0(X65,X64)
| X64 = sz00
| ~ doDivides0(X64,X65)
| ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X65) )
& ( ~ aNaturalNumber0(X66)
| X65 != sdtasdt0(X64,X66)
| X66 = sdtsldt0(X65,X64)
| X64 = sz00
| ~ doDivides0(X64,X65)
| ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X65) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefQuot])])])]) ).
cnf(c_0_11,plain,
( X1 = X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,hypothesis,
sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
inference(split_conjunct,[status(thm)],[m__2414]) ).
cnf(c_0_13,hypothesis,
sdtasdt0(xn,xm) != sdtasdt0(xp,xm),
inference(split_conjunct,[status(thm)],[m__2414]) ).
fof(c_0_14,plain,
! [X6,X7] :
( ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X7)
| aNaturalNumber0(sdtasdt0(X6,X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
cnf(c_0_15,plain,
( X1 = sdtasdt0(X2,X3)
| X2 = sz00
| X3 != sdtsldt0(X1,X2)
| ~ doDivides0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,hypothesis,
( ~ sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xn,xm))
| ~ aNaturalNumber0(sdtasdt0(xn,xm))
| ~ aNaturalNumber0(sdtasdt0(xp,xm)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_17,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_19,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_20,plain,
( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
| X1 = sz00
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_21,hypothesis,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[m__1860]) ).
cnf(c_0_22,hypothesis,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
inference(split_conjunct,[status(thm)],[m__2306]) ).
cnf(c_0_23,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_24,hypothesis,
( ~ sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xn,xm))
| ~ aNaturalNumber0(sdtasdt0(xp,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_25,hypothesis,
( sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
| xp = sz00
| ~ aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
fof(c_0_26,plain,
! [X81,X82] :
( ( X81 != sz00
| ~ isPrime0(X81)
| ~ aNaturalNumber0(X81) )
& ( X81 != sz10
| ~ isPrime0(X81)
| ~ aNaturalNumber0(X81) )
& ( ~ aNaturalNumber0(X82)
| ~ doDivides0(X82,X81)
| X82 = sz10
| X82 = X81
| ~ isPrime0(X81)
| ~ aNaturalNumber0(X81) )
& ( aNaturalNumber0(esk3_1(X81))
| X81 = sz00
| X81 = sz10
| isPrime0(X81)
| ~ aNaturalNumber0(X81) )
& ( doDivides0(esk3_1(X81),X81)
| X81 = sz00
| X81 = sz10
| isPrime0(X81)
| ~ aNaturalNumber0(X81) )
& ( esk3_1(X81) != sz10
| X81 = sz00
| X81 = sz10
| isPrime0(X81)
| ~ aNaturalNumber0(X81) )
& ( esk3_1(X81) != X81
| X81 = sz00
| X81 = sz10
| isPrime0(X81)
| ~ aNaturalNumber0(X81) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefPrime])])])])]) ).
cnf(c_0_27,hypothesis,
~ sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xn,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_17]),c_0_18]),c_0_23])]) ).
cnf(c_0_28,hypothesis,
( sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
| xp = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_29,hypothesis,
sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk)),
inference(split_conjunct,[status(thm)],[m__2414]) ).
cnf(c_0_30,plain,
( X1 != sz00
| ~ isPrime0(X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_32,hypothesis,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[m__1860]) ).
cnf(c_0_33,hypothesis,
xp = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_34,plain,
~ isPrime0(sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_30]),c_0_31])]) ).
cnf(c_0_35,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM504+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n002.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 14:32:59 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.4v9kam3fDU/E---3.1_15869.p
% 0.21/0.66 # Version: 3.1pre001
% 0.21/0.66 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.66 # Starting sh5l with 300s (1) cores
% 0.21/0.66 # sh5l with pid 16018 completed with status 8
% 0.21/0.66 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 16015 completed with status 0
% 0.21/0.66 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.66 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.66 # No SInE strategy applied
% 0.21/0.66 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.66 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.66 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.21/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.66 # Starting G-E--_208_C18_F1_AE_CS_SP_PS_S3S with 136s (1) cores
% 0.21/0.66 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.21/0.66 # Starting G----_Z1014__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 0.21/0.66 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 16025 completed with status 0
% 0.21/0.66 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.66 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.66 # No SInE strategy applied
% 0.21/0.66 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.21/0.66 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.66 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 811s (1) cores
% 0.21/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.66 # Preprocessing time : 0.002 s
% 0.21/0.66 # Presaturation interreduction done
% 0.21/0.66
% 0.21/0.66 # Proof found!
% 0.21/0.66 # SZS status ContradictoryAxioms
% 0.21/0.66 # SZS output start CNFRefutation
% See solution above
% 0.21/0.66 # Parsed axioms : 52
% 0.21/0.66 # Removed by relevancy pruning/SinE : 0
% 0.21/0.66 # Initial clauses : 98
% 0.21/0.66 # Removed in clause preprocessing : 4
% 0.21/0.66 # Initial clauses in saturation : 94
% 0.21/0.66 # Processed clauses : 1753
% 0.21/0.66 # ...of these trivial : 42
% 0.21/0.66 # ...subsumed : 885
% 0.21/0.66 # ...remaining for further processing : 826
% 0.21/0.66 # Other redundant clauses eliminated : 93
% 0.21/0.66 # Clauses deleted for lack of memory : 0
% 0.21/0.66 # Backward-subsumed : 34
% 0.21/0.66 # Backward-rewritten : 362
% 0.21/0.66 # Generated clauses : 6317
% 0.21/0.66 # ...of the previous two non-redundant : 4916
% 0.21/0.66 # ...aggressively subsumed : 0
% 0.21/0.66 # Contextual simplify-reflections : 139
% 0.21/0.66 # Paramodulations : 6213
% 0.21/0.66 # Factorizations : 5
% 0.21/0.66 # NegExts : 0
% 0.21/0.66 # Equation resolutions : 99
% 0.21/0.66 # Total rewrite steps : 8181
% 0.21/0.66 # Propositional unsat checks : 0
% 0.21/0.66 # Propositional check models : 0
% 0.21/0.66 # Propositional check unsatisfiable : 0
% 0.21/0.66 # Propositional clauses : 0
% 0.21/0.66 # Propositional clauses after purity: 0
% 0.21/0.66 # Propositional unsat core size : 0
% 0.21/0.66 # Propositional preprocessing time : 0.000
% 0.21/0.66 # Propositional encoding time : 0.000
% 0.21/0.66 # Propositional solver time : 0.000
% 0.21/0.66 # Success case prop preproc time : 0.000
% 0.21/0.66 # Success case prop encoding time : 0.000
% 0.21/0.66 # Success case prop solver time : 0.000
% 0.21/0.66 # Current number of processed clauses : 332
% 0.21/0.66 # Positive orientable unit clauses : 73
% 0.21/0.66 # Positive unorientable unit clauses: 0
% 0.21/0.66 # Negative unit clauses : 8
% 0.21/0.66 # Non-unit-clauses : 251
% 0.21/0.66 # Current number of unprocessed clauses: 3121
% 0.21/0.66 # ...number of literals in the above : 13998
% 0.21/0.66 # Current number of archived formulas : 0
% 0.21/0.66 # Current number of archived clauses : 483
% 0.21/0.66 # Clause-clause subsumption calls (NU) : 32223
% 0.21/0.66 # Rec. Clause-clause subsumption calls : 18138
% 0.21/0.66 # Non-unit clause-clause subsumptions : 974
% 0.21/0.66 # Unit Clause-clause subsumption calls : 821
% 0.21/0.66 # Rewrite failures with RHS unbound : 0
% 0.21/0.66 # BW rewrite match attempts : 73
% 0.21/0.66 # BW rewrite match successes : 43
% 0.21/0.66 # Condensation attempts : 0
% 0.21/0.66 # Condensation successes : 0
% 0.21/0.66 # Termbank termtop insertions : 105494
% 0.21/0.66
% 0.21/0.66 # -------------------------------------------------
% 0.21/0.66 # User time : 0.149 s
% 0.21/0.66 # System time : 0.006 s
% 0.21/0.66 # Total time : 0.155 s
% 0.21/0.66 # Maximum resident set size: 2000 pages
% 0.21/0.66
% 0.21/0.66 # -------------------------------------------------
% 0.21/0.66 # User time : 0.722 s
% 0.21/0.66 # System time : 0.040 s
% 0.21/0.66 # Total time : 0.762 s
% 0.21/0.66 # Maximum resident set size: 1732 pages
% 0.21/0.66 % E---3.1 exiting
%------------------------------------------------------------------------------