%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM477+1 : 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 : n003.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:14 PM UTC 2026
% Result : Theorem 0.23s 5.62s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 14 unt; 0 def)
% Number of atoms : 73 ( 20 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 77 ( 33 ~; 25 |; 12 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 13 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__1494_04,hypothesis,
( xn != sz00
& doDivides0(xm,xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1494_04) ).
fof(m__,conjecture,
sdtlseqdt0(xm,xn),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mMonMul2,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( X1 != sz00
=> sdtlseqdt0(X2,sdtasdt0(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMonMul2) ).
fof(mDefDiv,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( doDivides0(X1,X2)
<=> ? [X3] :
( X2 = sdtasdt0(X1,X3)
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiv) ).
fof(m__1494,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1494) ).
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(c_0_6,hypothesis,
( xn != sz00
& doDivides0(xm,xn) ),
inference(fof_simplification,[status(thm)],[m__1494_04]) ).
fof(c_0_7,negated_conjecture,
~ sdtlseqdt0(xm,xn),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( X1 != sz00
=> sdtlseqdt0(X2,sdtasdt0(X2,X1)) ) ),
inference(fof_simplification,[status(thm)],[mMonMul2]) ).
fof(c_0_9,plain,
! [X63,X64,X66] :
( ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| doDivides0(X63,X64)
| X64 != sdtasdt0(X63,X66)
| ~ aNaturalNumber0(X66) )
& ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| ~ doDivides0(X63,X64)
| X64 = sdtasdt0(X63,esk2_2(X63,X64)) )
& ( ~ aNaturalNumber0(X64)
| ~ aNaturalNumber0(X63)
| ~ doDivides0(X63,X64)
| aNaturalNumber0(esk2_2(X63,X64)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiv])])])])])]) ).
fof(c_0_10,hypothesis,
( xn != sz00
& doDivides0(xm,xn) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
~ sdtlseqdt0(xm,xn),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X57,X58] :
( sdtlseqdt0(X58,sdtasdt0(X58,X57))
| X57 = sz00
| ~ aNaturalNumber0(X58)
| ~ aNaturalNumber0(X57) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_13,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X1 = sdtasdt0(X2,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
doDivides0(xm,xn),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1494]) ).
cnf(c_0_16,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1494]) ).
cnf(c_0_17,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2)
| aNaturalNumber0(esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_18,negated_conjecture,
~ sdtlseqdt0(xm,xn),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X2,sdtasdt0(X2,X1))
| X1 = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,hypothesis,
sdtasdt0(xm,esk2_2(xm,xn)) = xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_21,hypothesis,
aNaturalNumber0(esk2_2(xm,xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_16]),c_0_15])]) ).
cnf(c_0_22,negated_conjecture,
~ sdtlseqdt0(xm,xn),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,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_24,hypothesis,
esk2_2(xm,xn) = sz00,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_15]),c_0_21])]),c_0_22]) ).
cnf(c_0_25,plain,
( ~ aNaturalNumber0(X1)
| sdtasdt0(X1,sz00) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,hypothesis,
sdtasdt0(xm,sz00) = xn,
inference(rw,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_27,hypothesis,
xn != sz00,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_15])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM477+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/5.47 % Computer : n003.cluster.edu
% 0.19/5.47 % Model : x86_64 x86_64
% 0.19/5.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.47 % Memory : 8046.5625MB
% 0.19/5.47 % OS : Linux 6.8.0-71-generic
% 0.19/5.47 % CPULimit : 300
% 0.19/5.47 % WCLimit : 300
% 0.19/5.47 % DateTime : Mon Sep 21 02:35:05 UTC 2026
% 0.19/5.47 % CPUTime :
% 0.19/5.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/5.53 Running first-order theorem proving
% 0.23/5.53 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.23/5.62 % Version: 3.5.1
% 0.23/5.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.62 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.62 % Starting new_bool_1 with 300s (1) cores
% 0.23/5.62 % Starting sh5l with 300s (1) cores
% 0.23/5.62 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3216711 completed with status 0
% 0.23/5.62 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/5.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.62 % No SInE strategy applied
% 0.23/5.62 % Search class: FGUSF-FFMS22-SFFFFFNN
% 0.23/5.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.62 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/5.62 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.23/5.62 % Starting new_bool_3 with 136s (1) cores
% 0.23/5.62 % Starting new_bool_1 with 136s (1) cores
% 0.23/5.62 % new_bool_3 with pid 3216719 completed with status 0
% 0.23/5.62 % Result found by new_bool_3
% 0.23/5.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.62 % No SInE strategy applied
% 0.23/5.62 % Search class: FGUSF-FFMS22-SFFFFFNN
% 0.23/5.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.62 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/5.62 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.23/5.62 % Starting new_bool_3 with 136s (1) cores
% 0.23/5.62 % Preprocessing time : 0.003 s
% 0.23/5.62 % Presaturation interreduction done
% 0.23/5.62
% 0.23/5.62 % Proof found!
% 0.23/5.62 % SZS status Theorem
% 0.23/5.62 % SZS output start CNFRefutation
% See solution above
% 0.23/5.62 % Parsed axioms : 37
% 0.23/5.62 % Removed by relevancy pruning/SinE : 0
% 0.23/5.62 % Initial clauses : 63
% 0.23/5.62 % Removed in clause preprocessing : 3
% 0.23/5.62 % Initial clauses in saturation : 60
% 0.23/5.62 % Processed clauses : 175
% 0.23/5.62 % ...of these trivial : 1
% 0.23/5.62 % ...subsumed : 33
% 0.23/5.62 % ...remaining for further processing : 141
% 0.23/5.62 % Other redundant clauses eliminated : 13
% 0.23/5.62 % Clauses deleted for lack of memory : 0
% 0.23/5.62 % Backward-subsumed : 0
% 0.23/5.62 % Backward-rewritten : 4
% 0.23/5.62 % Generated clauses : 241
% 0.23/5.62 % ...of the previous two non-redundant : 200
% 0.23/5.62 % ...aggressively subsumed : 0
% 0.23/5.62 % Contextual simplify-reflections : 6
% 0.23/5.62 % Paramodulations : 223
% 0.23/5.62 % Factorizations : 2
% 0.23/5.62 % NegExts : 0
% 0.23/5.62 % Equation resolutions : 15
% 0.23/5.62 % Disequality decompositions : 0
% 0.23/5.62 % Total rewrite steps : 256
% 0.23/5.62 % ...of those cached : 244
% 0.23/5.62 % Propositional unsat checks : 0
% 0.23/5.62 % Propositional check models : 0
% 0.23/5.62 % Propositional check unsatisfiable : 0
% 0.23/5.62 % Propositional clauses : 0
% 0.23/5.62 % Propositional clauses after purity: 0
% 0.23/5.62 % Propositional unsat core size : 0
% 0.23/5.62 % Propositional preprocessing time : 0.000
% 0.23/5.62 % Propositional encoding time : 0.000
% 0.23/5.62 % Propositional solver time : 0.000
% 0.23/5.62 % Success case prop preproc time : 0.000
% 0.23/5.62 % Success case prop encoding time : 0.000
% 0.23/5.62 % Success case prop solver time : 0.000
% 0.23/5.62 % Current number of processed clauses : 72
% 0.23/5.62 % Positive orientable unit clauses : 16
% 0.23/5.62 % Positive unorientable unit clauses: 0
% 0.23/5.62 % Negative unit clauses : 5
% 0.23/5.62 % Non-unit-clauses : 51
% 0.23/5.62 % Current number of unprocessed clauses: 138
% 0.23/5.62 % ...number of literals in the above : 540
% 0.23/5.62 % Current number of archived formulas : 0
% 0.23/5.62 % Current number of archived clauses : 60
% 0.23/5.62 % Clause-clause subsumption calls (NU) : 661
% 0.23/5.62 % Rec. Clause-clause subsumption calls : 236
% 0.23/5.62 % Non-unit clause-clause subsumptions : 34
% 0.23/5.62 % Unit Clause-clause subsumption calls : 103
% 0.23/5.62 % Rewrite failures with RHS unbound : 0
% 0.23/5.62 % BW rewrite match attempts : 2
% 0.23/5.62 % BW rewrite match successes : 2
% 0.23/5.62 % Condensation attempts : 0
% 0.23/5.62 % Condensation successes : 0
% 0.23/5.62 % Termbank termtop insertions : 9131
% 0.23/5.62 % Search garbage collected termcells : 1071
% 0.23/5.62
% 0.23/5.62 % -------------------------------------------------
% 0.23/5.62 % User time : 0.021 s
% 0.23/5.62 % System time : 0.005 s
% 0.23/5.62 % Total time : 0.026 s
% 0.23/5.62 % Maximum resident set size: 3672 pages
% 0.23/5.62
% 0.23/5.62 % -------------------------------------------------
% 0.23/5.62 % User time : 0.066 s
% 0.23/5.62 % System time : 0.024 s
% 0.23/5.62 % Total time : 0.090 s
% 0.23/5.62 % Maximum resident set size: 4864 pages
% 0.23/5.62 % E exiting
%------------------------------------------------------------------------------