%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM480+2 : 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 : n008.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:15 PM UTC 2026
% Result : Theorem 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 9 unt; 0 def)
% Number of atoms : 40 ( 19 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 33 ( 10 ~; 8 |; 12 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__1594,hypothesis,
( sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))
& sdtasdt0(xn,xm) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl))
& aNaturalNumber0(sdtsldt0(sdtasdt0(xn,xm),xl))
& xm = sdtasdt0(xl,sdtsldt0(xm,xl))
& aNaturalNumber0(sdtsldt0(xm,xl)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1594) ).
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/sandbox2/benchmark/theBenchmark.p',mMulAsso) ).
fof(m__1553,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1553) ).
fof(m__1524,hypothesis,
( aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1524) ).
fof(c_0_5,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_6,hypothesis,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
inference(split_conjunct,[status(thm)],[m__1594]) ).
cnf(c_0_7,hypothesis,
sdtasdt0(xn,xm) = sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
inference(split_conjunct,[status(thm)],[m__1594]) ).
fof(c_0_8,plain,
! [X17,X18,X19] :
( sdtasdt0(sdtasdt0(X17,X18),X19) = sdtasdt0(X17,sdtasdt0(X18,X19))
| ~ aNaturalNumber0(X19)
| ~ aNaturalNumber0(X18)
| ~ aNaturalNumber0(X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])])]) ).
fof(c_0_9,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_5])]) ).
cnf(c_0_10,hypothesis,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) = sdtasdt0(xn,xm),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,hypothesis,
aNaturalNumber0(sdtsldt0(xm,xl)),
inference(split_conjunct,[status(thm)],[m__1594]) ).
cnf(c_0_13,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1553]) ).
cnf(c_0_14,hypothesis,
aNaturalNumber0(xl),
inference(split_conjunct,[status(thm)],[m__1524]) ).
cnf(c_0_15,negated_conjecture,
sdtasdt0(xn,xm) != sdtasdt0(xl,sdtasdt0(xn,sdtsldt0(xm,xl))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14])]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM480+2 : 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 : n008.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:34:26 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/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.15/0.45 % Version: 3.5.1
% 0.15/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 4153185 completed with status 0
% 0.15/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45 % No SInE strategy applied
% 0.15/0.45 % Search class: FGUSF-FFMM22-MFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 4153192 completed with status 0
% 0.15/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45 % No SInE strategy applied
% 0.15/0.45 % Search class: FGUSF-FFMM22-MFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.45 % Preprocessing time : 0.002 s
% 0.15/0.45 % Presaturation interreduction done
% 0.15/0.45
% 0.15/0.45 % Proof found!
% 0.15/0.45 % SZS status Theorem
% 0.15/0.45 % SZS output start CNFRefutation
% See solution above
% 0.15/0.45 % Parsed axioms : 40
% 0.15/0.45 % Removed by relevancy pruning/SinE : 0
% 0.15/0.45 % Initial clauses : 75
% 0.15/0.45 % Removed in clause preprocessing : 3
% 0.15/0.45 % Initial clauses in saturation : 72
% 0.15/0.45 % Processed clauses : 133
% 0.15/0.45 % ...of these trivial : 2
% 0.15/0.45 % ...subsumed : 5
% 0.15/0.45 % ...remaining for further processing : 126
% 0.15/0.45 % Other redundant clauses eliminated : 13
% 0.15/0.45 % Clauses deleted for lack of memory : 0
% 0.15/0.45 % Backward-subsumed : 0
% 0.15/0.45 % Backward-rewritten : 0
% 0.15/0.45 % Generated clauses : 176
% 0.15/0.45 % ...of the previous two non-redundant : 140
% 0.15/0.45 % ...aggressively subsumed : 0
% 0.15/0.45 % Contextual simplify-reflections : 6
% 0.15/0.45 % Paramodulations : 159
% 0.15/0.45 % Factorizations : 2
% 0.15/0.45 % NegExts : 0
% 0.15/0.45 % Equation resolutions : 15
% 0.15/0.45 % Disequality decompositions : 0
% 0.15/0.45 % Total rewrite steps : 119
% 0.15/0.45 % ...of those cached : 108
% 0.15/0.45 % Propositional unsat checks : 0
% 0.15/0.45 % Propositional check models : 0
% 0.15/0.45 % Propositional check unsatisfiable : 0
% 0.15/0.45 % Propositional clauses : 0
% 0.15/0.45 % Propositional clauses after purity: 0
% 0.15/0.45 % Propositional unsat core size : 0
% 0.15/0.45 % Propositional preprocessing time : 0.000
% 0.15/0.45 % Propositional encoding time : 0.000
% 0.15/0.45 % Propositional solver time : 0.000
% 0.15/0.45 % Success case prop preproc time : 0.000
% 0.15/0.45 % Success case prop encoding time : 0.000
% 0.15/0.45 % Success case prop solver time : 0.000
% 0.15/0.45 % Current number of processed clauses : 52
% 0.15/0.45 % Positive orientable unit clauses : 13
% 0.15/0.45 % Positive unorientable unit clauses: 0
% 0.15/0.45 % Negative unit clauses : 4
% 0.15/0.45 % Non-unit-clauses : 35
% 0.15/0.45 % Current number of unprocessed clauses: 134
% 0.15/0.45 % ...number of literals in the above : 468
% 0.15/0.45 % Current number of archived formulas : 0
% 0.15/0.45 % Current number of archived clauses : 65
% 0.15/0.45 % Clause-clause subsumption calls (NU) : 571
% 0.15/0.45 % Rec. Clause-clause subsumption calls : 144
% 0.15/0.45 % Non-unit clause-clause subsumptions : 11
% 0.15/0.45 % Unit Clause-clause subsumption calls : 2
% 0.15/0.45 % Rewrite failures with RHS unbound : 0
% 0.15/0.45 % BW rewrite match attempts : 0
% 0.15/0.45 % BW rewrite match successes : 0
% 0.15/0.45 % Condensation attempts : 0
% 0.15/0.45 % Condensation successes : 0
% 0.15/0.45 % Termbank termtop insertions : 8916
% 0.15/0.45 % Search garbage collected termcells : 1124
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.008 s
% 0.15/0.45 % System time : 0.008 s
% 0.15/0.45 % Total time : 0.016 s
% 0.15/0.45 % Maximum resident set size: 3676 pages
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.029 s
% 0.15/0.45 % System time : 0.020 s
% 0.15/0.45 % Total time : 0.049 s
% 0.15/0.45 % Maximum resident set size: 4864 pages
% 0.15/0.45 % E exiting
%------------------------------------------------------------------------------