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