%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM466+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 : n013.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:11 PM UTC 2026
% Result : Theorem 0.09s 0.45s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 81 ( 23 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 87 ( 32 ~; 25 |; 25 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 15 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( doDivides0(xm,xn)
& ? [X1] :
( xn = sdtasdt0(xm,X1)
& aNaturalNumber0(X1) )
& doDivides0(xl,xm)
& ? [X1] :
( xm = sdtasdt0(xl,X1)
& aNaturalNumber0(X1) ) )
=> ( doDivides0(xl,xn)
| ? [X1] :
( xn = sdtasdt0(xl,X1)
& aNaturalNumber0(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).
fof(m__1218,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1218) ).
fof(mMulAsso,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulAsso) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(c_0_5,negated_conjecture,
~ ( ( doDivides0(xm,xn)
& ? [X1] :
( xn = sdtasdt0(xm,X1)
& aNaturalNumber0(X1) )
& doDivides0(xl,xm)
& ? [X1] :
( xm = sdtasdt0(xl,X1)
& aNaturalNumber0(X1) ) )
=> ( doDivides0(xl,xn)
| ? [X1] :
( xn = sdtasdt0(xl,X1)
& aNaturalNumber0(X1) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,negated_conjecture,
! [X72] :
( ~ doDivides0(xl,xn)
& ( xn != sdtasdt0(xl,X72)
| ~ aNaturalNumber0(X72) )
& doDivides0(xm,xn)
& xn = sdtasdt0(xm,esk4_0)
& aNaturalNumber0(esk4_0)
& doDivides0(xl,xm)
& xm = sdtasdt0(xl,esk3_0)
& aNaturalNumber0(esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_7,plain,
! [X15,X16] :
( sdtasdt0(X15,X16) = sdtasdt0(X16,X15)
| ~ aNaturalNumber0(X16)
| ~ aNaturalNumber0(X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
cnf(c_0_8,negated_conjecture,
( xn != sdtasdt0(xl,X1)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1218]) ).
fof(c_0_11,plain,
! [X17,X18,X19] :
( sdtasdt0(sdtasdt0(X17,X18),X19) = sdtasdt0(X17,sdtasdt0(X18,X19))
| ~ aNaturalNumber0(X19)
| ~ aNaturalNumber0(X18)
| ~ aNaturalNumber0(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
fof(c_0_12,plain,
! [X7,X8] :
( aNaturalNumber0(sdtasdt0(X7,X8))
| ~ aNaturalNumber0(X8)
| ~ aNaturalNumber0(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ aNaturalNumber0(X1)
| sdtasdt0(X1,xl) != xn ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_14,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtasdt0(X1,sdtasdt0(X2,xl)) != xn ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_10])]),c_0_15]) ).
cnf(c_0_17,negated_conjecture,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtasdt0(X1,sdtasdt0(xl,X2)) != xn ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_9]),c_0_10])]) ).
cnf(c_0_18,negated_conjecture,
xm = sdtasdt0(xl,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
aNaturalNumber0(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
( ~ aNaturalNumber0(X1)
| sdtasdt0(X1,xm) != xn ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_21,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1218]) ).
cnf(c_0_22,negated_conjecture,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xm,X1) != xn ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_9]),c_0_21])]) ).
cnf(c_0_23,negated_conjecture,
xn = sdtasdt0(xm,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
aNaturalNumber0(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM466+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n013.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 02:31:53 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.45 % Version: 3.5.1
% 0.09/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.45 % Starting sh5l with 300s (1) cores
% 0.09/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3954991 completed with status 0
% 0.09/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.09/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.45 % No SInE strategy applied
% 0.09/0.45 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.09/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.09/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.09/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.09/0.45 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 3954998 completed with status 0
% 0.09/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.09/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.09/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.45 % No SInE strategy applied
% 0.09/0.45 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.09/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.09/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/0.45 % Preprocessing time : 0.002 s
% 0.09/0.45 % Presaturation interreduction done
% 0.09/0.45
% 0.09/0.45 % Proof found!
% 0.09/0.45 % SZS status Theorem
% 0.09/0.45 % SZS output start CNFRefutation
% See solution above
% 0.09/0.45 % Parsed axioms : 33
% 0.09/0.45 % Removed by relevancy pruning/SinE : 0
% 0.09/0.45 % Initial clauses : 66
% 0.09/0.45 % Removed in clause preprocessing : 3
% 0.09/0.45 % Initial clauses in saturation : 63
% 0.09/0.45 % Processed clauses : 168
% 0.09/0.45 % ...of these trivial : 0
% 0.09/0.45 % ...subsumed : 34
% 0.09/0.45 % ...remaining for further processing : 134
% 0.09/0.45 % Other redundant clauses eliminated : 23
% 0.09/0.45 % Clauses deleted for lack of memory : 0
% 0.09/0.45 % Backward-subsumed : 1
% 0.09/0.45 % Backward-rewritten : 1
% 0.09/0.45 % Generated clauses : 264
% 0.09/0.45 % ...of the previous two non-redundant : 221
% 0.09/0.45 % ...aggressively subsumed : 0
% 0.09/0.45 % Contextual simplify-reflections : 7
% 0.09/0.45 % Paramodulations : 237
% 0.09/0.45 % Factorizations : 0
% 0.09/0.45 % NegExts : 0
% 0.09/0.45 % Equation resolutions : 27
% 0.09/0.45 % Disequality decompositions : 0
% 0.09/0.45 % Total rewrite steps : 214
% 0.09/0.45 % ...of those cached : 204
% 0.09/0.45 % Propositional unsat checks : 0
% 0.09/0.45 % Propositional check models : 0
% 0.09/0.45 % Propositional check unsatisfiable : 0
% 0.09/0.45 % Propositional clauses : 0
% 0.09/0.45 % Propositional clauses after purity: 0
% 0.09/0.45 % Propositional unsat core size : 0
% 0.09/0.45 % Propositional preprocessing time : 0.000
% 0.09/0.45 % Propositional encoding time : 0.000
% 0.09/0.45 % Propositional solver time : 0.000
% 0.09/0.45 % Success case prop preproc time : 0.000
% 0.09/0.45 % Success case prop encoding time : 0.000
% 0.09/0.45 % Success case prop solver time : 0.000
% 0.09/0.45 % Current number of processed clauses : 65
% 0.09/0.45 % Positive orientable unit clauses : 12
% 0.09/0.45 % Positive unorientable unit clauses: 0
% 0.09/0.45 % Negative unit clauses : 6
% 0.09/0.45 % Non-unit-clauses : 47
% 0.09/0.45 % Current number of unprocessed clauses: 164
% 0.09/0.45 % ...number of literals in the above : 706
% 0.09/0.45 % Current number of archived formulas : 0
% 0.09/0.45 % Current number of archived clauses : 60
% 0.09/0.45 % Clause-clause subsumption calls (NU) : 815
% 0.09/0.45 % Rec. Clause-clause subsumption calls : 249
% 0.09/0.45 % Non-unit clause-clause subsumptions : 24
% 0.09/0.45 % Unit Clause-clause subsumption calls : 14
% 0.09/0.45 % Rewrite failures with RHS unbound : 0
% 0.09/0.45 % BW rewrite match attempts : 1
% 0.09/0.45 % BW rewrite match successes : 1
% 0.09/0.45 % Condensation attempts : 0
% 0.09/0.45 % Condensation successes : 0
% 0.09/0.45 % Termbank termtop insertions : 8702
% 0.09/0.45 % Search garbage collected termcells : 1048
% 0.09/0.45
% 0.09/0.45 % -------------------------------------------------
% 0.09/0.45 % User time : 0.016 s
% 0.09/0.45 % System time : 0.004 s
% 0.09/0.45 % Total time : 0.020 s
% 0.09/0.45 % Maximum resident set size: 3668 pages
% 0.09/0.45
% 0.09/0.45 % -------------------------------------------------
% 0.09/0.45 % User time : 0.063 s
% 0.09/0.45 % System time : 0.014 s
% 0.09/0.45 % Total time : 0.077 s
% 0.09/0.45 % Maximum resident set size: 4864 pages
% 0.09/0.45 % E exiting
%------------------------------------------------------------------------------