%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM458+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:09 PM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 56 ( 9 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 63 ( 28 ~; 24 |; 7 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 11 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
sdtlseqdt0(xm,xm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDefLE,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( sdtlseqdt0(X1,X2)
<=> ? [X3] :
( sdtpldt0(X1,X3) = X2
& aNaturalNumber0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefLE) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(m_AddZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sdtpldt0(sz00,X1)
& sdtpldt0(X1,sz00) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_AddZero) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).
fof(m__718,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__718) ).
fof(c_0_6,negated_conjecture,
~ sdtlseqdt0(xm,xm),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,plain,
! [X5,X6,X8] :
( ( ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X5)
| sdtlseqdt0(X5,X6)
| sdtpldt0(X5,X8) != X6
| ~ aNaturalNumber0(X8) )
& ( ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X5)
| ~ sdtlseqdt0(X5,X6)
| sdtpldt0(X5,esk1_2(X5,X6)) = X6 )
& ( ~ aNaturalNumber0(X6)
| ~ aNaturalNumber0(X5)
| ~ sdtlseqdt0(X5,X6)
| aNaturalNumber0(esk1_2(X5,X6)) ) ),
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)],[mDefLE])])])])])]) ).
fof(c_0_8,plain,
! [X9,X10] :
( aNaturalNumber0(sdtpldt0(X9,X10))
| ~ aNaturalNumber0(X10)
| ~ aNaturalNumber0(X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).
fof(c_0_9,negated_conjecture,
~ sdtlseqdt0(xm,xm),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtpldt0(X2,X1) != X3
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X16] :
( ( ~ aNaturalNumber0(X16)
| X16 = sdtpldt0(sz00,X16) )
& ( ~ aNaturalNumber0(X16)
| sdtpldt0(X16,sz00) = X16 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])])]) ).
fof(c_0_13,negated_conjecture,
~ sdtlseqdt0(xm,xm),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,sdtpldt0(X1,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_10]),c_0_11]) ).
cnf(c_0_15,plain,
( ~ aNaturalNumber0(X1)
| sdtpldt0(X1,sz00) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_17,negated_conjecture,
~ sdtlseqdt0(xm,xm),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_19,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__718]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM458+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n017.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 02:27:12 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % new_bool_1 with pid 1226504 completed with status 0
% 0.11/0.44 % Result found by new_bool_1
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FGUSF-FFMF22-SFFFFFNN
% 0.11/0.44 % partial match(1): FGUSF-FFMM22-SFFFFFNN
% 0.11/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44 % SubtermCWHack with pid 1226506 completed with status 0
% 0.11/0.44 % Result found by SubtermCWHack
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FGUSF-FFMF22-SFFFFFNN
% 0.11/0.44 % partial match(1): FGUSF-FFMM22-SFFFFFNN
% 0.11/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Theorem
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.44 % Parsed axioms : 21
% 0.11/0.44 % Removed by relevancy pruning/SinE : 3
% 0.11/0.44 % Initial clauses : 26
% 0.11/0.44 % Removed in clause preprocessing : 1
% 0.11/0.44 % Initial clauses in saturation : 25
% 0.11/0.44 % Processed clauses : 35
% 0.11/0.44 % ...of these trivial : 0
% 0.11/0.44 % ...subsumed : 16
% 0.11/0.44 % ...remaining for further processing : 19
% 0.11/0.44 % Other redundant clauses eliminated : 1
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 0
% 0.11/0.44 % Backward-rewritten : 0
% 0.11/0.44 % Generated clauses : 30
% 0.11/0.44 % ...of the previous two non-redundant : 23
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 1
% 0.11/0.44 % Paramodulations : 29
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 1
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 19
% 0.11/0.44 % ...of those cached : 17
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 18
% 0.11/0.44 % Positive orientable unit clauses : 2
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 1
% 0.11/0.44 % Non-unit-clauses : 15
% 0.11/0.44 % Current number of unprocessed clauses: 13
% 0.11/0.44 % ...number of literals in the above : 58
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 0
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 40
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 38
% 0.11/0.44 % Non-unit clause-clause subsumptions : 17
% 0.11/0.44 % Unit Clause-clause subsumption calls : 0
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 0
% 0.11/0.44 % BW rewrite match successes : 0
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 2489
% 0.11/0.44 % Search garbage collected termcells : 423
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.005 s
% 0.11/0.44 % System time : 0.002 s
% 0.11/0.44 % Total time : 0.007 s
% 0.11/0.44 % Maximum resident set size: 3648 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.006 s
% 0.11/0.44 % System time : 0.007 s
% 0.11/0.44 % Total time : 0.013 s
% 0.11/0.44 % Maximum resident set size: 4608 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------