%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM469+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:49:12 PM UTC 2026
% Result : Theorem 0.27s 0.56s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 12 unt; 0 def)
% Number of atoms : 95 ( 43 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 82 ( 22 ~; 23 |; 32 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 9 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( doDivides0(xl,sdtpldt0(xm,xn))
| ? [X1] :
( sdtpldt0(xm,xn) = sdtasdt0(xl,X1)
& aNaturalNumber0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__1298,hypothesis,
( xl != sz00
=> ( sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl)))
& xn = sdtasdt0(xl,sdtsldt0(xn,xl))
& aNaturalNumber0(sdtsldt0(xn,xl))
& xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xm,xl)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1298) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(m__1240_04,hypothesis,
( doDivides0(xl,xn)
& ? [X1] :
( xn = sdtasdt0(xl,X1)
& aNaturalNumber0(X1) )
& doDivides0(xl,xm)
& ? [X1] :
( xm = sdtasdt0(xl,X1)
& aNaturalNumber0(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1240_04) ).
fof(m_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sz00 = sdtasdt0(sz00,X1)
& sdtasdt0(X1,sz00) = sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_MulZero) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sdtpldt0(sz00,X1)
& sdtpldt0(X1,sz00) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_AddZero) ).
fof(m__1240,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1240) ).
fof(c_0_7,negated_conjecture,
~ ( doDivides0(xl,sdtpldt0(xm,xn))
| ? [X1] :
( sdtpldt0(xm,xn) = sdtasdt0(xl,X1)
& aNaturalNumber0(X1) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,hypothesis,
( xl != sz00
=> ( sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl)))
& xn = sdtasdt0(xl,sdtsldt0(xn,xl))
& aNaturalNumber0(sdtsldt0(xn,xl))
& xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xm,xl)) ) ),
inference(fof_simplification,[status(thm)],[m__1298]) ).
fof(c_0_9,negated_conjecture,
! [X75] :
( ~ doDivides0(xl,sdtpldt0(xm,xn))
& ( sdtpldt0(xm,xn) != sdtasdt0(xl,X75)
| ~ aNaturalNumber0(X75) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,hypothesis,
( ( xl = sz00
| sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) )
& ( xl = sz00
| xn = sdtasdt0(xl,sdtsldt0(xn,xl)) )
& ( xl = sz00
| aNaturalNumber0(sdtsldt0(xn,xl)) )
& ( xl = sz00
| xm = sdtasdt0(xl,sdtsldt0(xm,xl)) )
& ( xl = sz00
| aNaturalNumber0(sdtsldt0(xm,xl)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).
cnf(c_0_11,negated_conjecture,
( sdtpldt0(xm,xn) != sdtasdt0(xl,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,hypothesis,
( xl = sz00
| sdtpldt0(xm,xn) = sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X5,X6] :
( aNaturalNumber0(sdtpldt0(X5,X6))
| ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
fof(c_0_14,hypothesis,
( doDivides0(xl,xn)
& xn = sdtasdt0(xl,esk4_0)
& aNaturalNumber0(esk4_0)
& doDivides0(xl,xm)
& xm = sdtasdt0(xl,esk3_0)
& aNaturalNumber0(esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__1240_04])]) ).
cnf(c_0_15,negated_conjecture,
( ~ aNaturalNumber0(sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl)))
| xl = sz00 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,hypothesis,
( xl = sz00
| aNaturalNumber0(sdtsldt0(xm,xl)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,hypothesis,
( xl = sz00
| aNaturalNumber0(sdtsldt0(xn,xl)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_19,plain,
! [X21] :
( ( ~ aNaturalNumber0(X21)
| sz00 = sdtasdt0(sz00,X21) )
& ( ~ aNaturalNumber0(X21)
| sdtasdt0(X21,sz00) = sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulZero])])])]) ).
cnf(c_0_20,hypothesis,
xn = sdtasdt0(xl,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
xl = sz00,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
~ doDivides0(xl,sdtpldt0(xm,xn)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( ~ aNaturalNumber0(X1)
| sz00 = sdtasdt0(sz00,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,hypothesis,
sdtasdt0(sz00,esk4_0) = xn,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,hypothesis,
aNaturalNumber0(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,negated_conjecture,
~ doDivides0(sz00,sdtpldt0(xm,xn)),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_27,hypothesis,
xn = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
fof(c_0_28,plain,
! [X14] :
( ( ~ aNaturalNumber0(X14)
| X14 = sdtpldt0(sz00,X14) )
& ( ~ aNaturalNumber0(X14)
| sdtpldt0(X14,sz00) = X14 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])])]) ).
cnf(c_0_29,hypothesis,
doDivides0(xl,xm),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,negated_conjecture,
~ doDivides0(sz00,sdtpldt0(xm,sz00)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( ~ aNaturalNumber0(X1)
| sdtpldt0(X1,sz00) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,hypothesis,
doDivides0(sz00,xm),
inference(rw,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_33,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1240]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM469+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n011.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 02:32:40 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.51 Running first-order theorem proving
% 0.27/0.51 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.27/0.56 % Version: 3.5.1
% 0.27/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.56 % Starting sh5l with 300s (1) cores
% 0.27/0.56 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 777320 completed with status 0
% 0.27/0.56 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.27/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.56 % No SInE strategy applied
% 0.27/0.56 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.27/0.56 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.27/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.27/0.56 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.27/0.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.27/0.56 % Starting new_bool_3 with 136s (1) cores
% 0.27/0.56 % SAT001_MinMin_p005000_rr_RG with pid 777328 completed with status 0
% 0.27/0.56 % Result found by SAT001_MinMin_p005000_rr_RG
% 0.27/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.56 % No SInE strategy applied
% 0.27/0.56 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.27/0.56 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.27/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.27/0.56 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.27/0.56 % Preprocessing time : 0.003 s
% 0.27/0.56 % Presaturation interreduction done
% 0.27/0.56
% 0.27/0.56 % Proof found!
% 0.27/0.56 % SZS status Theorem
% 0.27/0.56 % SZS output start CNFRefutation
% See solution above
% 0.27/0.56 % Parsed axioms : 36
% 0.27/0.56 % Removed by relevancy pruning/SinE : 0
% 0.27/0.56 % Initial clauses : 72
% 0.27/0.56 % Removed in clause preprocessing : 3
% 0.27/0.56 % Initial clauses in saturation : 69
% 0.27/0.56 % Processed clauses : 123
% 0.27/0.56 % ...of these trivial : 0
% 0.27/0.56 % ...subsumed : 5
% 0.27/0.56 % ...remaining for further processing : 118
% 0.27/0.56 % Other redundant clauses eliminated : 9
% 0.27/0.56 % Clauses deleted for lack of memory : 0
% 0.27/0.56 % Backward-subsumed : 0
% 0.27/0.56 % Backward-rewritten : 20
% 0.27/0.56 % Generated clauses : 32
% 0.27/0.56 % ...of the previous two non-redundant : 28
% 0.27/0.56 % ...aggressively subsumed : 0
% 0.27/0.56 % Contextual simplify-reflections : 10
% 0.27/0.56 % Paramodulations : 23
% 0.27/0.56 % Factorizations : 0
% 0.27/0.56 % NegExts : 0
% 0.27/0.56 % Equation resolutions : 9
% 0.27/0.56 % Disequality decompositions : 0
% 0.27/0.56 % Total rewrite steps : 61
% 0.27/0.56 % ...of those cached : 51
% 0.27/0.56 % Propositional unsat checks : 0
% 0.27/0.56 % Propositional check models : 0
% 0.27/0.56 % Propositional check unsatisfiable : 0
% 0.27/0.56 % Propositional clauses : 0
% 0.27/0.56 % Propositional clauses after purity: 0
% 0.27/0.56 % Propositional unsat core size : 0
% 0.27/0.56 % Propositional preprocessing time : 0.000
% 0.27/0.56 % Propositional encoding time : 0.000
% 0.27/0.56 % Propositional solver time : 0.000
% 0.27/0.56 % Success case prop preproc time : 0.000
% 0.27/0.56 % Success case prop encoding time : 0.000
% 0.27/0.56 % Success case prop solver time : 0.000
% 0.27/0.56 % Current number of processed clauses : 25
% 0.27/0.56 % Positive orientable unit clauses : 8
% 0.27/0.56 % Positive unorientable unit clauses: 0
% 0.27/0.56 % Negative unit clauses : 3
% 0.27/0.56 % Non-unit-clauses : 14
% 0.27/0.56 % Current number of unprocessed clauses: 38
% 0.27/0.56 % ...number of literals in the above : 157
% 0.27/0.56 % Current number of archived formulas : 0
% 0.27/0.56 % Current number of archived clauses : 84
% 0.27/0.56 % Clause-clause subsumption calls (NU) : 552
% 0.27/0.56 % Rec. Clause-clause subsumption calls : 152
% 0.27/0.56 % Non-unit clause-clause subsumptions : 15
% 0.27/0.56 % Unit Clause-clause subsumption calls : 2
% 0.27/0.56 % Rewrite failures with RHS unbound : 0
% 0.27/0.56 % BW rewrite match attempts : 2
% 0.27/0.56 % BW rewrite match successes : 2
% 0.27/0.56 % Condensation attempts : 0
% 0.27/0.56 % Condensation successes : 0
% 0.27/0.56 % Termbank termtop insertions : 6351
% 0.27/0.56 % Search garbage collected termcells : 1049
% 0.27/0.56
% 0.27/0.56 % -------------------------------------------------
% 0.27/0.56 % User time : 0.022 s
% 0.27/0.56 % System time : 0.005 s
% 0.27/0.56 % Total time : 0.027 s
% 0.27/0.56 % Maximum resident set size: 3676 pages
% 0.27/0.56
% 0.27/0.56 % -------------------------------------------------
% 0.27/0.56 % User time : 0.082 s
% 0.27/0.56 % System time : 0.018 s
% 0.27/0.56 % Total time : 0.100 s
% 0.27/0.56 % Maximum resident set size: 4864 pages
% 0.27/0.56 % E exiting
%------------------------------------------------------------------------------