%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KLE001+1 : 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 : n010.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 12:59:02 PM UTC 2026
% Result : Theorem 0.15s 0.63s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 6 unt; 0 def)
% Number of atoms : 20 ( 7 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 14 ( 6 ~; 3 |; 2 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( leq(X4,X5)
=> leq(addition(X4,X6),addition(X4,X6)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(c_0_3,negated_conjecture,
~ ! [X4,X5,X6] :
( leq(X4,X5)
=> leq(addition(X4,X6),addition(X4,X6)) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_4,plain,
! [X27,X28] :
( ( leq(X27,X28)
| addition(X27,X28) != X28 )
& ( addition(X27,X28) = X28
| ~ leq(X27,X28) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
fof(c_0_5,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_6,negated_conjecture,
( ~ leq(addition(esk1_0,esk3_0),addition(esk1_0,esk3_0))
& leq(esk1_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_7,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
~ leq(addition(esk1_0,esk3_0),addition(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE001+1 : 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.57 % Computer : n010.cluster.edu
% 0.11/0.57 % Model : x86_64 x86_64
% 0.11/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.57 % Memory : 8046.5625MB
% 0.11/0.57 % OS : Linux 6.8.0-71-generic
% 0.11/0.57 % CPULimit : 300
% 0.11/0.57 % WCLimit : 300
% 0.11/0.57 % DateTime : Sun Sep 20 22:37:55 UTC 2026
% 0.11/0.57 % CPUTime :
% 0.11/0.57 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.61 Running first-order theorem proving
% 0.11/0.61 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.15/0.63 % Version: 3.5.1
% 0.15/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.63 % Starting sh5l with 300s (1) cores
% 0.15/0.63 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3658920 completed with status 0
% 0.15/0.63 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.63 % No SInE strategy applied
% 0.15/0.63 % Search class: FHUSM-FFSF22-SFFFFFNN
% 0.15/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.63 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.15/0.63 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.63 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.63 % new_bool_1 with pid 3658928 completed with status 0
% 0.15/0.63 % Result found by new_bool_1
% 0.15/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.63 % No SInE strategy applied
% 0.15/0.63 % Search class: FHUSM-FFSF22-SFFFFFNN
% 0.15/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.63 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S2S with 136s (1) cores
% 0.15/0.63 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.63 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.63 % Preprocessing time : 0.001 s
% 0.15/0.63 % Presaturation interreduction done
% 0.15/0.63
% 0.15/0.63 % Proof found!
% 0.15/0.63 % SZS status Theorem
% 0.15/0.63 % SZS output start CNFRefutation
% See solution above
% 0.15/0.63 % Parsed axioms : 13
% 0.15/0.63 % Removed by relevancy pruning/SinE : 0
% 0.15/0.63 % Initial clauses : 15
% 0.15/0.63 % Removed in clause preprocessing : 0
% 0.15/0.63 % Initial clauses in saturation : 15
% 0.15/0.63 % Processed clauses : 26
% 0.15/0.63 % ...of these trivial : 0
% 0.15/0.63 % ...subsumed : 0
% 0.15/0.63 % ...remaining for further processing : 26
% 0.15/0.63 % Other redundant clauses eliminated : 1
% 0.15/0.63 % Clauses deleted for lack of memory : 0
% 0.15/0.63 % Backward-subsumed : 0
% 0.15/0.63 % Backward-rewritten : 1
% 0.15/0.63 % Generated clauses : 6
% 0.15/0.63 % ...of the previous two non-redundant : 3
% 0.15/0.63 % ...aggressively subsumed : 0
% 0.15/0.63 % Contextual simplify-reflections : 0
% 0.15/0.63 % Paramodulations : 5
% 0.15/0.63 % Factorizations : 0
% 0.15/0.63 % NegExts : 0
% 0.15/0.63 % Equation resolutions : 1
% 0.15/0.63 % Disequality decompositions : 0
% 0.15/0.63 % Total rewrite steps : 2
% 0.15/0.63 % ...of those cached : 0
% 0.15/0.63 % Propositional unsat checks : 0
% 0.15/0.63 % Propositional check models : 0
% 0.15/0.63 % Propositional check unsatisfiable : 0
% 0.15/0.63 % Propositional clauses : 0
% 0.15/0.63 % Propositional clauses after purity: 0
% 0.15/0.63 % Propositional unsat core size : 0
% 0.15/0.63 % Propositional preprocessing time : 0.000
% 0.15/0.63 % Propositional encoding time : 0.000
% 0.15/0.63 % Propositional solver time : 0.000
% 0.15/0.63 % Success case prop preproc time : 0.000
% 0.15/0.63 % Success case prop encoding time : 0.000
% 0.15/0.63 % Success case prop solver time : 0.000
% 0.15/0.63 % Current number of processed clauses : 10
% 0.15/0.63 % Positive orientable unit clauses : 8
% 0.15/0.63 % Positive unorientable unit clauses: 0
% 0.15/0.63 % Negative unit clauses : 0
% 0.15/0.63 % Non-unit-clauses : 2
% 0.15/0.63 % Current number of unprocessed clauses: 7
% 0.15/0.63 % ...number of literals in the above : 7
% 0.15/0.63 % Current number of archived formulas : 0
% 0.15/0.63 % Current number of archived clauses : 16
% 0.15/0.63 % Clause-clause subsumption calls (NU) : 0
% 0.15/0.63 % Rec. Clause-clause subsumption calls : 0
% 0.15/0.63 % Non-unit clause-clause subsumptions : 0
% 0.15/0.63 % Unit Clause-clause subsumption calls : 1
% 0.15/0.63 % Rewrite failures with RHS unbound : 0
% 0.15/0.63 % BW rewrite match attempts : 15
% 0.15/0.63 % BW rewrite match successes : 9
% 0.15/0.63 % Condensation attempts : 0
% 0.15/0.63 % Condensation successes : 0
% 0.15/0.63 % Termbank termtop insertions : 648
% 0.15/0.63 % Search garbage collected termcells : 52
% 0.15/0.63
% 0.15/0.63 % -------------------------------------------------
% 0.15/0.63 % User time : 0.002 s
% 0.15/0.63 % System time : 0.002 s
% 0.15/0.63 % Total time : 0.004 s
% 0.15/0.63 % Maximum resident set size: 3640 pages
% 0.15/0.63
% 0.15/0.63 % -------------------------------------------------
% 0.15/0.63 % User time : 0.008 s
% 0.15/0.63 % System time : 0.012 s
% 0.15/0.63 % Total time : 0.020 s
% 0.15/0.63 % Maximum resident set size: 4864 pages
% 0.15/0.63 % E exiting
%------------------------------------------------------------------------------