%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM478+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 : n004.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:55:10 PM UTC 2026
% Result : Theorem 0.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 14 unt; 0 def)
% Number of atoms : 100 ( 49 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 104 ( 38 ~; 33 |; 21 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 19 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mMulCanc,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2) )
=> ( ( sdtasdt0(X2,X1) = sdtasdt0(X3,X1)
| sdtasdt0(X1,X2) = sdtasdt0(X1,X3) )
=> X2 = X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulCanc) ).
fof(m__1524_04,hypothesis,
( doDivides0(xl,xm)
& ? [X1] :
( xm = sdtasdt0(xl,X1)
& aNaturalNumber0(X1) )
& xl != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1524_04) ).
fof(m__,conjecture,
( ( xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xm,xl)) )
=> ( sdtasdt0(xn,sdtsldt0(xm,xl)) = sdtsldt0(sdtasdt0(xn,xm),xl)
| sdtasdt0(xn,xm) = sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__1524,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1524) ).
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(mMulComm,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1) )
=> sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).
fof(m__1553,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1553) ).
fof(c_0_7,plain,
! [X1] :
( aNaturalNumber0(X1)
=> ( X1 != sz00
=> ! [X2,X3] :
( ( aNaturalNumber0(X3)
& aNaturalNumber0(X2) )
=> ( ( sdtasdt0(X2,X1) = sdtasdt0(X3,X1)
| sdtasdt0(X1,X2) = sdtasdt0(X1,X3) )
=> X2 = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[mMulCanc]) ).
fof(c_0_8,hypothesis,
( doDivides0(xl,xm)
& ? [X1] :
( xm = sdtasdt0(xl,X1)
& aNaturalNumber0(X1) )
& xl != sz00 ),
inference(fof_simplification,[status(thm)],[m__1524_04]) ).
fof(c_0_9,plain,
! [X32,X33,X34] :
( ( ~ aNaturalNumber0(X32)
| X32 = sz00
| ~ aNaturalNumber0(X34)
| ~ aNaturalNumber0(X33)
| X33 = X34
| sdtasdt0(X33,X32) != sdtasdt0(X34,X32) )
& ( ~ aNaturalNumber0(X32)
| X32 = sz00
| ~ aNaturalNumber0(X34)
| ~ aNaturalNumber0(X33)
| X33 = X34
| sdtasdt0(X32,X33) != sdtasdt0(X32,X34) ) ),
inference(distribute,[status(thm)],[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_10,hypothesis,
( doDivides0(xl,xm)
& xm = sdtasdt0(xl,esk1_0)
& aNaturalNumber0(esk1_0)
& xl != sz00 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,negated_conjecture,
~ ( ( xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xm,xl)) )
=> ( sdtasdt0(xn,sdtsldt0(xm,xl)) = sdtsldt0(sdtasdt0(xn,xm),xl)
| sdtasdt0(xn,xm) = sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_12,plain,
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| sdtasdt0(X1,X2) != sdtasdt0(X1,X3)
| X1 = sz00
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
xm = sdtasdt0(xl,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
aNaturalNumber0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1524]) ).
cnf(c_0_16,hypothesis,
xl != sz00,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,negated_conjecture,
( sdtasdt0(xn,sdtsldt0(xm,xl)) != sdtsldt0(sdtasdt0(xn,xm),xl)
& sdtasdt0(xn,xm) != sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl)))
& xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xm,xl)) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
fof(c_0_18,plain,
! [X25,X26,X27] :
( sdtasdt0(sdtasdt0(X25,X26),X27) = sdtasdt0(X25,sdtasdt0(X26,X27))
| ~ aNaturalNumber0(X27)
| ~ aNaturalNumber0(X26)
| ~ aNaturalNumber0(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
cnf(c_0_19,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xl,X1) != xm
| X1 = esk1_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_20,negated_conjecture,
xm = sdtasdt0(xl,sdtsldt0(xm,xl)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
aNaturalNumber0(sdtsldt0(xm,xl)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,plain,
! [X23,X24] :
( sdtasdt0(X23,X24) = sdtasdt0(X24,X23)
| ~ aNaturalNumber0(X24)
| ~ aNaturalNumber0(X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])])]) ).
cnf(c_0_24,negated_conjecture,
sdtasdt0(xn,xm) != sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
sdtsldt0(xm,xl) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_26,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xl,sdtasdt0(esk1_0,X1)) = sdtasdt0(xm,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_27,plain,
( ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
sdtasdt0(xl,sdtasdt0(xn,esk1_0)) != sdtasdt0(xn,xm),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,hypothesis,
( ~ aNaturalNumber0(X1)
| sdtasdt0(xl,sdtasdt0(X1,esk1_0)) = sdtasdt0(xm,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_14])]) ).
cnf(c_0_30,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1553]) ).
cnf(c_0_31,negated_conjecture,
sdtasdt0(xn,xm) != sdtasdt0(xm,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_32,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1524]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_27]),c_0_32]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM478+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.11/0.36 % Computer : n004.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 02:33:49 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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.14/0.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % new_bool_3 with pid 2063088 completed with status 0
% 0.14/0.45 % Result found by new_bool_3
% 0.14/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FGUSF-FFMM22-MFFFFFNN
% 0.14/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % SubtermCWHack with pid 2063096 completed with status 0
% 0.14/0.45 % Result found by SubtermCWHack
% 0.14/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FGUSF-FFMM22-MFFFFFNN
% 0.14/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % Preprocessing time : 0.001 s
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Theorem
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 39
% 0.14/0.45 % Removed by relevancy pruning/SinE : 6
% 0.14/0.45 % Initial clauses : 59
% 0.14/0.45 % Removed in clause preprocessing : 1
% 0.14/0.45 % Initial clauses in saturation : 58
% 0.14/0.45 % Processed clauses : 359
% 0.14/0.45 % ...of these trivial : 7
% 0.14/0.45 % ...subsumed : 158
% 0.14/0.45 % ...remaining for further processing : 194
% 0.14/0.45 % Other redundant clauses eliminated : 20
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 7
% 0.14/0.45 % Backward-rewritten : 30
% 0.14/0.45 % Generated clauses : 776
% 0.14/0.45 % ...of the previous two non-redundant : 648
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 2
% 0.14/0.45 % Paramodulations : 752
% 0.14/0.45 % Factorizations : 0
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 24
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 776
% 0.14/0.45 % ...of those cached : 748
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 151
% 0.14/0.45 % Positive orientable unit clauses : 26
% 0.14/0.45 % Positive unorientable unit clauses: 0
% 0.14/0.45 % Negative unit clauses : 7
% 0.14/0.45 % Non-unit-clauses : 118
% 0.14/0.45 % Current number of unprocessed clauses: 307
% 0.14/0.45 % ...number of literals in the above : 1568
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 37
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 1853
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 1102
% 0.14/0.45 % Non-unit clause-clause subsumptions : 157
% 0.14/0.45 % Unit Clause-clause subsumption calls : 157
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 11
% 0.14/0.45 % BW rewrite match successes : 11
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 16271
% 0.14/0.45 % Search garbage collected termcells : 1023
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.019 s
% 0.14/0.45 % System time : 0.001 s
% 0.14/0.45 % Total time : 0.020 s
% 0.14/0.45 % Maximum resident set size: 3676 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.022 s
% 0.14/0.45 % System time : 0.005 s
% 0.14/0.45 % Total time : 0.026 s
% 0.14/0.45 % Maximum resident set size: 4864 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------