%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM465+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 : n026.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 2.30s 0.82s
% Output : CNFRefutation 2.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 13 unt; 0 def)
% Number of atoms : 148 ( 51 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 170 ( 66 ~; 60 |; 31 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 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 : 30 ( 0 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( xm != sz00
=> sdtlseqdt0(xn,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mMonMul,axiom,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X3)
& X2 != X3
& X1 != sz00 )
=> ( sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
& sdtasdt0(X2,X1) != sdtasdt0(X3,X1)
& sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(X1,X2) != sdtasdt0(X1,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mMonMul) ).
fof(mSortsC_01,axiom,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC_01) ).
fof(m__1007,hypothesis,
( xm != sz00
=> sdtlseqdt0(sz10,xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1007) ).
fof(m_MulUnit,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 = sdtasdt0(sz10,X1)
& sdtasdt0(X1,sz10) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_MulUnit) ).
fof(mLETotal,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& X2 != X1 )
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLETotal) ).
fof(m__987,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__987) ).
fof(mSortsC,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).
fof(m_MulZero,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( sz00 = sdtasdt0(sz00,X1)
& sdtasdt0(X1,sz00) = sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_MulZero) ).
fof(c_0_9,negated_conjecture,
~ ( xm != sz00
=> sdtlseqdt0(xn,sdtasdt0(xn,xm)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_10,plain,
! [X1,X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X3)
& X2 != X3
& X1 != sz00 )
=> ( sdtlseqdt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1))
& sdtasdt0(X2,X1) != sdtasdt0(X3,X1)
& sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
& sdtasdt0(X1,X2) != sdtasdt0(X1,X3) ) ) ),
inference(fof_simplification,[status(thm)],[mMonMul]) ).
fof(c_0_11,plain,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
inference(fof_simplification,[status(thm)],[mSortsC_01]) ).
fof(c_0_12,hypothesis,
( xm != sz00
=> sdtlseqdt0(sz10,xm) ),
inference(fof_simplification,[status(thm)],[m__1007]) ).
fof(c_0_13,negated_conjecture,
~ ( xm != sz00
=> sdtlseqdt0(xn,sdtasdt0(xn,xm)) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X20,X21,X22] :
( ( ~ aNaturalNumber0(X22)
| ~ aNaturalNumber0(X21)
| ~ aNaturalNumber0(X20)
| ~ sdtlseqdt0(X21,X22)
| X21 = X22
| X20 = sz00
| sdtlseqdt0(sdtasdt0(X21,X20),sdtasdt0(X22,X20)) )
& ( ~ aNaturalNumber0(X22)
| ~ aNaturalNumber0(X21)
| ~ aNaturalNumber0(X20)
| ~ sdtlseqdt0(X21,X22)
| X21 = X22
| X20 = sz00
| sdtasdt0(X21,X20) != sdtasdt0(X22,X20) )
& ( ~ aNaturalNumber0(X22)
| ~ aNaturalNumber0(X21)
| ~ aNaturalNumber0(X20)
| ~ sdtlseqdt0(X21,X22)
| X21 = X22
| X20 = sz00
| sdtlseqdt0(sdtasdt0(X20,X21),sdtasdt0(X20,X22)) )
& ( ~ aNaturalNumber0(X22)
| ~ aNaturalNumber0(X21)
| ~ aNaturalNumber0(X20)
| ~ sdtlseqdt0(X21,X22)
| X21 = X22
| X20 = sz00
| sdtasdt0(X20,X21) != sdtasdt0(X20,X22) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_15,plain,
! [X23] :
( ( ~ aNaturalNumber0(X23)
| X23 = sdtasdt0(sz10,X23) )
& ( ~ aNaturalNumber0(X23)
| sdtasdt0(X23,sz10) = X23 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m_MulUnit])])])]) ).
fof(c_0_16,plain,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
fof(c_0_17,hypothesis,
( sdtlseqdt0(sz10,xm)
| xm = sz00 ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
fof(c_0_18,negated_conjecture,
( ~ sdtlseqdt0(xn,sdtasdt0(xn,xm))
& xm != sz00 ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
fof(c_0_19,plain,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> ( ( sdtlseqdt0(X2,X1)
& X2 != X1 )
| sdtlseqdt0(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[mLETotal]) ).
cnf(c_0_20,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X2,X3)
| X2 = X3
| X1 = sz00
| sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ aNaturalNumber0(X1)
| sdtasdt0(X1,sz10) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
aNaturalNumber0(sz10),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,hypothesis,
( sdtlseqdt0(sz10,xm)
| xm = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
xm != sz00,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X15,X16] :
( ( ~ aNaturalNumber0(X16)
| ~ aNaturalNumber0(X15)
| sdtlseqdt0(X15,X16)
| sdtlseqdt0(X16,X15) )
& ( ~ aNaturalNumber0(X16)
| ~ aNaturalNumber0(X15)
| sdtlseqdt0(X15,X16)
| X16 != X15 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
cnf(c_0_26,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(xn,xm)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(sz10,X1)
| sdtlseqdt0(X2,sdtasdt0(X2,X1))
| X2 = sz00
| sz10 = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_28,hypothesis,
sdtlseqdt0(sz10,xm),
inference(sr,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__987]) ).
cnf(c_0_30,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__987]) ).
cnf(c_0_31,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| sdtlseqdt0(X2,X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
aNaturalNumber0(sz00),
inference(split_conjunct,[status(thm)],[mSortsC]) ).
cnf(c_0_33,negated_conjecture,
( xm = sz10
| xn = sz00 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),c_0_30])]) ).
fof(c_0_34,plain,
! [X26] :
( ( ~ aNaturalNumber0(X26)
| sz00 = sdtasdt0(sz00,X26) )
& ( ~ aNaturalNumber0(X26)
| sdtasdt0(X26,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_35,plain,
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,sz00)
| sdtlseqdt0(sz00,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( ~ sdtlseqdt0(sz00,sdtasdt0(sz00,xm))
| xm = sz10 ),
inference(spm,[status(thm)],[c_0_26,c_0_33]) ).
cnf(c_0_37,plain,
( ~ aNaturalNumber0(X1)
| sz00 = sdtasdt0(sz00,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,plain,
sdtlseqdt0(sz00,sz00),
inference(spm,[status(thm)],[c_0_35,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
xm = sz10,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_29])]) ).
cnf(c_0_40,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtlseqdt0(X1,xn)
| sdtlseqdt0(xn,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_41,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(xn,sz10)),
inference(spm,[status(thm)],[c_0_26,c_0_39]) ).
cnf(c_0_42,hypothesis,
sdtlseqdt0(xn,xn),
inference(spm,[status(thm)],[c_0_40,c_0_30]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_21]),c_0_42]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM465+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.13/0.38 % Computer : n026.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 02:35:08 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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
% 2.30/0.82 % Version: 3.5.1
% 2.30/0.82 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.30/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.30/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.30/0.82 % Starting new_bool_3 with 300s (1) cores
% 2.30/0.82 % Starting new_bool_1 with 300s (1) cores
% 2.30/0.82 % Starting sh5l with 300s (1) cores
% 2.30/0.82 % new_bool_3 with pid 1177414 completed with status 0
% 2.30/0.82 % Result found by new_bool_3
% 2.30/0.82 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.30/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.30/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.30/0.82 % Starting new_bool_3 with 300s (1) cores
% 2.30/0.82 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.30/0.82 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.30/0.82 % Search class: FGUSF-FFMS22-SFFFFFNN
% 2.30/0.82 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.30/0.82 % Starting SubtermCWHack with 31s (1) cores
% 2.30/0.82 % SubtermCWHack with pid 1177422 completed with status 0
% 2.30/0.82 % Result found by SubtermCWHack
% 2.30/0.82 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.30/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.30/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.30/0.82 % Starting new_bool_3 with 300s (1) cores
% 2.30/0.82 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.30/0.82 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.30/0.82 % Search class: FGUSF-FFMS22-SFFFFFNN
% 2.30/0.82 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.30/0.82 % Starting SubtermCWHack with 31s (1) cores
% 2.30/0.82 % Preprocessing time : 0.002 s
% 2.30/0.82
% 2.30/0.82 % Proof found!
% 2.30/0.82 % SZS status Theorem
% 2.30/0.82 % SZS output start CNFRefutation
% See solution above
% 2.30/0.82 % Parsed axioms : 29
% 2.30/0.82 % Removed by relevancy pruning/SinE : 1
% 2.30/0.82 % Initial clauses : 48
% 2.30/0.82 % Removed in clause preprocessing : 2
% 2.30/0.82 % Initial clauses in saturation : 46
% 2.30/0.82 % Processed clauses : 2191
% 2.30/0.82 % ...of these trivial : 34
% 2.30/0.82 % ...subsumed : 1638
% 2.30/0.82 % ...remaining for further processing : 519
% 2.30/0.82 % Other redundant clauses eliminated : 46
% 2.30/0.82 % Clauses deleted for lack of memory : 0
% 2.30/0.82 % Backward-subsumed : 10
% 2.30/0.82 % Backward-rewritten : 124
% 2.30/0.82 % Generated clauses : 13477
% 2.30/0.82 % ...of the previous two non-redundant : 11260
% 2.30/0.82 % ...aggressively subsumed : 0
% 2.30/0.82 % Contextual simplify-reflections : 73
% 2.30/0.82 % Paramodulations : 13423
% 2.30/0.82 % Factorizations : 2
% 2.30/0.82 % NegExts : 0
% 2.30/0.82 % Equation resolutions : 52
% 2.30/0.82 % Disequality decompositions : 0
% 2.30/0.82 % Total rewrite steps : 13276
% 2.30/0.82 % ...of those cached : 13226
% 2.30/0.82 % Propositional unsat checks : 0
% 2.30/0.82 % Propositional check models : 0
% 2.30/0.82 % Propositional check unsatisfiable : 0
% 2.30/0.82 % Propositional clauses : 0
% 2.30/0.82 % Propositional clauses after purity: 0
% 2.30/0.82 % Propositional unsat core size : 0
% 2.30/0.82 % Propositional preprocessing time : 0.000
% 2.30/0.82 % Propositional encoding time : 0.000
% 2.30/0.82 % Propositional solver time : 0.000
% 2.30/0.82 % Success case prop preproc time : 0.000
% 2.30/0.82 % Success case prop encoding time : 0.000
% 2.30/0.82 % Success case prop solver time : 0.000
% 2.30/0.82 % Current number of processed clauses : 383
% 2.30/0.82 % Positive orientable unit clauses : 31
% 2.30/0.82 % Positive unorientable unit clauses: 0
% 2.30/0.82 % Negative unit clauses : 5
% 2.30/0.82 % Non-unit-clauses : 347
% 2.30/0.82 % Current number of unprocessed clauses: 9006
% 2.30/0.82 % ...number of literals in the above : 47670
% 2.30/0.82 % Current number of archived formulas : 0
% 2.30/0.82 % Current number of archived clauses : 134
% 2.30/0.82 % Clause-clause subsumption calls (NU) : 23222
% 2.30/0.82 % Rec. Clause-clause subsumption calls : 15796
% 2.30/0.82 % Non-unit clause-clause subsumptions : 1636
% 2.30/0.82 % Unit Clause-clause subsumption calls : 140
% 2.30/0.82 % Rewrite failures with RHS unbound : 0
% 2.30/0.82 % BW rewrite match attempts : 17
% 2.30/0.82 % BW rewrite match successes : 13
% 2.30/0.82 % Condensation attempts : 0
% 2.30/0.82 % Condensation successes : 0
% 2.30/0.82 % Termbank termtop insertions : 243518
% 2.30/0.82 % Search garbage collected termcells : 725
% 2.30/0.82
% 2.30/0.82 % -------------------------------------------------
% 2.30/0.82 % User time : 0.348 s
% 2.30/0.82 % System time : 0.019 s
% 2.30/0.82 % Total time : 0.367 s
% 2.30/0.82 % Maximum resident set size: 3660 pages
% 2.30/0.82
% 2.30/0.82 % -------------------------------------------------
% 2.30/0.82 % User time : 0.352 s
% 2.30/0.82 % System time : 0.022 s
% 2.30/0.82 % Total time : 0.374 s
% 2.30/0.82 % Maximum resident set size: 4864 pages
% 2.30/0.82 % E exiting
%------------------------------------------------------------------------------