%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM464+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 : n009.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.26s 0.53s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 65 ( 32 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 67 ( 26 ~; 21 |; 14 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 6 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( xm != sz00
=> ( sdtlseqdt0(sz10,xm)
| ? [X1] :
( sdtpldt0(sz10,X1) = xm
& aNaturalNumber0(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(mSortsC_01,axiom,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(mLENTr,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( ( sdtlseqdt0(sz10,X1)
& sz10 != X1 )
| X1 = sz10
| X1 = sz00 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLENTr) ).
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(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(m__987,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__987) ).
fof(c_0_6,negated_conjecture,
~ ( xm != sz00
=> ( sdtlseqdt0(sz10,xm)
| ? [X1] :
( sdtpldt0(sz10,X1) = xm
& aNaturalNumber0(X1) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,negated_conjecture,
~ ( xm != sz00
=> ( sdtlseqdt0(sz10,xm)
| ? [X1] :
( sdtpldt0(sz10,X1) = xm
& aNaturalNumber0(X1) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
inference(fof_simplification,[status(thm)],[mSortsC_01]) ).
fof(c_0_9,plain,
! [X1] :
( aNaturalNumber0(X1)
=> ( ( sdtlseqdt0(sz10,X1)
& sz10 != X1 )
| X1 = sz10
| X1 = sz00 ) ),
inference(fof_simplification,[status(thm)],[mLENTr]) ).
fof(c_0_10,negated_conjecture,
! [X4] :
( ~ sdtlseqdt0(sz10,xm)
& ( sdtpldt0(sz10,X4) != xm
| ~ aNaturalNumber0(X4) )
& xm != sz00 ),
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_11,plain,
! [X33] :
( ( ~ aNaturalNumber0(X33)
| X33 = sdtpldt0(sz00,X33) )
& ( ~ aNaturalNumber0(X33)
| sdtpldt0(X33,sz00) = X33 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_AddZero])])])]) ).
fof(c_0_12,plain,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X25] :
( ( ~ aNaturalNumber0(X25)
| X25 = sz10
| X25 = sz00
| sdtlseqdt0(sz10,X25) )
& ( ~ aNaturalNumber0(X25)
| X25 = sz10
| X25 = sz00
| sz10 != X25 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_14,negated_conjecture,
( sdtpldt0(sz10,X1) != xm
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ aNaturalNumber0(X1)
| sdtpldt0(X1,sz00) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_17,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
~ sdtlseqdt0(sz10,xm),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( ~ aNaturalNumber0(X1)
| X1 = sz10
| X1 = sz00
| sdtlseqdt0(sz10,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__987]) ).
cnf(c_0_21,negated_conjecture,
xm != sz10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
xm != sz00,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM464+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n009.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 02:32:27 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.49 Running first-order theorem proving
% 0.17/0.49 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.26/0.53 % Version: 3.5.1
% 0.26/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.53 % Starting sh5l with 300s (1) cores
% 0.26/0.53 % new_bool_3 with pid 651799 completed with status 0
% 0.26/0.53 % Result found by new_bool_3
% 0.26/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.53 % Search class: FGHSF-FFMS22-SFFFFFNN
% 0.26/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.53 % SubtermCWHack with pid 651802 completed with status 0
% 0.26/0.53 % Result found by SubtermCWHack
% 0.26/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.53 % Search class: FGHSF-FFMS22-SFFFFFNN
% 0.26/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.53 % Preprocessing time : 0.001 s
% 0.26/0.53
% 0.26/0.53 % Proof found!
% 0.26/0.53 % SZS status Theorem
% 0.26/0.53 % SZS output start CNFRefutation
% See solution above
% 0.26/0.53 % Parsed axioms : 28
% 0.26/0.53 % Removed by relevancy pruning/SinE : 1
% 0.26/0.53 % Initial clauses : 48
% 0.26/0.53 % Removed in clause preprocessing : 2
% 0.26/0.53 % Initial clauses in saturation : 46
% 0.26/0.53 % Processed clauses : 22
% 0.26/0.53 % ...of these trivial : 0
% 0.26/0.53 % ...subsumed : 1
% 0.26/0.53 % ...remaining for further processing : 21
% 0.26/0.53 % Other redundant clauses eliminated : 1
% 0.26/0.53 % Clauses deleted for lack of memory : 0
% 0.26/0.53 % Backward-subsumed : 0
% 0.26/0.53 % Backward-rewritten : 0
% 0.26/0.53 % Generated clauses : 15
% 0.26/0.53 % ...of the previous two non-redundant : 8
% 0.26/0.53 % ...aggressively subsumed : 0
% 0.26/0.53 % Contextual simplify-reflections : 0
% 0.26/0.53 % Paramodulations : 14
% 0.26/0.53 % Factorizations : 0
% 0.26/0.53 % NegExts : 0
% 0.26/0.53 % Equation resolutions : 1
% 0.26/0.53 % Disequality decompositions : 0
% 0.26/0.53 % Total rewrite steps : 11
% 0.26/0.53 % ...of those cached : 8
% 0.26/0.53 % Propositional unsat checks : 0
% 0.26/0.53 % Propositional check models : 0
% 0.26/0.53 % Propositional check unsatisfiable : 0
% 0.26/0.53 % Propositional clauses : 0
% 0.26/0.53 % Propositional clauses after purity: 0
% 0.26/0.53 % Propositional unsat core size : 0
% 0.26/0.53 % Propositional preprocessing time : 0.000
% 0.26/0.53 % Propositional encoding time : 0.000
% 0.26/0.53 % Propositional solver time : 0.000
% 0.26/0.53 % Success case prop preproc time : 0.000
% 0.26/0.53 % Success case prop encoding time : 0.000
% 0.26/0.53 % Success case prop solver time : 0.000
% 0.26/0.53 % Current number of processed clauses : 20
% 0.26/0.53 % Positive orientable unit clauses : 4
% 0.26/0.53 % Positive unorientable unit clauses: 0
% 0.26/0.53 % Negative unit clauses : 4
% 0.26/0.53 % Non-unit-clauses : 12
% 0.26/0.53 % Current number of unprocessed clauses: 32
% 0.26/0.53 % ...number of literals in the above : 155
% 0.26/0.53 % Current number of archived formulas : 0
% 0.26/0.53 % Current number of archived clauses : 0
% 0.26/0.53 % Clause-clause subsumption calls (NU) : 19
% 0.26/0.53 % Rec. Clause-clause subsumption calls : 13
% 0.26/0.53 % Non-unit clause-clause subsumptions : 1
% 0.26/0.53 % Unit Clause-clause subsumption calls : 2
% 0.26/0.53 % Rewrite failures with RHS unbound : 0
% 0.26/0.53 % BW rewrite match attempts : 0
% 0.26/0.53 % BW rewrite match successes : 0
% 0.26/0.53 % Condensation attempts : 0
% 0.26/0.53 % Condensation successes : 0
% 0.26/0.53 % Termbank termtop insertions : 3852
% 0.26/0.53 % Search garbage collected termcells : 750
% 0.26/0.53
% 0.26/0.53 % -------------------------------------------------
% 0.26/0.53 % User time : 0.006 s
% 0.26/0.53 % System time : 0.003 s
% 0.26/0.53 % Total time : 0.008 s
% 0.26/0.53 % Maximum resident set size: 3660 pages
% 0.26/0.53
% 0.26/0.53 % -------------------------------------------------
% 0.26/0.53 % User time : 0.009 s
% 0.26/0.53 % System time : 0.005 s
% 0.26/0.53 % Total time : 0.014 s
% 0.26/0.53 % Maximum resident set size: 4864 pages
% 0.26/0.53 % E exiting
%------------------------------------------------------------------------------