%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KLE146+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 12:59:27 PM UTC 2026
% Result : Theorem 0.27s 0.58s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 21 unt; 0 def)
% Number of atoms : 29 ( 20 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 3 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4] : leq(one,strong_iteration(X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_associativity) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',idempotence) ).
fof(infty_unfold1,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_commutativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',order) ).
fof(c_0_6,negated_conjecture,
~ ! [X4] : leq(one,strong_iteration(X4)),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,plain,
! [X34,X35,X36] : addition(X36,addition(X35,X34)) = addition(addition(X36,X35),X34),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_8,plain,
! [X37] : addition(X37,X37) = X37,
inference(variable_rename,[status(thm)],[idempotence]) ).
fof(c_0_9,plain,
! [X17] : strong_iteration(X17) = addition(multiplication(X17,strong_iteration(X17)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
fof(c_0_10,plain,
! [X32,X33] : addition(X32,X33) = addition(X33,X32),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_11,negated_conjecture,
~ leq(one,strong_iteration(esk1_0)),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_12,plain,
! [X15,X16] :
( ( leq(X15,X16)
| addition(X15,X16) != X16 )
& ( addition(X15,X16) = X16
| ~ leq(X15,X16) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
cnf(c_0_13,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
~ leq(one,strong_iteration(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
addition(one,strong_iteration(esk1_0)) != strong_iteration(esk1_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
addition(one,strong_iteration(X1)) = strong_iteration(X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KLE146+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.45 % Computer : n011.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Sun Sep 20 22:46:26 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.53 Running first-order theorem proving
% 0.27/0.53 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.27/0.58 % Version: 3.5.1
% 0.27/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.58 % Starting sh5l with 300s (1) cores
% 0.27/0.58 % new_bool_3 with pid 356402 completed with status 0
% 0.27/0.58 % Result found by new_bool_3
% 0.27/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.58 % Search class: FHUSM-FFSF21-MFFFFFNN
% 0.27/0.58 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.58 % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.58 % SubtermCWHack with pid 356410 completed with status 0
% 0.27/0.58 % Result found by SubtermCWHack
% 0.27/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.58 % Search class: FHUSM-FFSF21-MFFFFFNN
% 0.27/0.58 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.58 % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.58 % Preprocessing time : 0.002 s
% 0.27/0.58
% 0.27/0.58 % Proof found!
% 0.27/0.58 % SZS status Theorem
% 0.27/0.58 % SZS output start CNFRefutation
% See solution above
% 0.27/0.58 % Parsed axioms : 19
% 0.27/0.58 % Removed by relevancy pruning/SinE : 0
% 0.27/0.58 % Initial clauses : 20
% 0.27/0.58 % Removed in clause preprocessing : 0
% 0.27/0.58 % Initial clauses in saturation : 20
% 0.27/0.58 % Processed clauses : 25
% 0.27/0.58 % ...of these trivial : 1
% 0.27/0.58 % ...subsumed : 0
% 0.27/0.58 % ...remaining for further processing : 24
% 0.27/0.58 % Other redundant clauses eliminated : 0
% 0.27/0.58 % Clauses deleted for lack of memory : 0
% 0.27/0.58 % Backward-subsumed : 0
% 0.27/0.58 % Backward-rewritten : 3
% 0.27/0.58 % Generated clauses : 62
% 0.27/0.58 % ...of the previous two non-redundant : 30
% 0.27/0.58 % ...aggressively subsumed : 0
% 0.27/0.58 % Contextual simplify-reflections : 0
% 0.27/0.58 % Paramodulations : 62
% 0.27/0.58 % Factorizations : 0
% 0.27/0.58 % NegExts : 0
% 0.27/0.58 % Equation resolutions : 0
% 0.27/0.58 % Disequality decompositions : 0
% 0.27/0.58 % Total rewrite steps : 55
% 0.27/0.58 % ...of those cached : 20
% 0.27/0.58 % Propositional unsat checks : 0
% 0.27/0.58 % Propositional check models : 0
% 0.27/0.58 % Propositional check unsatisfiable : 0
% 0.27/0.58 % Propositional clauses : 0
% 0.27/0.58 % Propositional clauses after purity: 0
% 0.27/0.58 % Propositional unsat core size : 0
% 0.27/0.58 % Propositional preprocessing time : 0.000
% 0.27/0.58 % Propositional encoding time : 0.000
% 0.27/0.58 % Propositional solver time : 0.000
% 0.27/0.58 % Success case prop preproc time : 0.000
% 0.27/0.58 % Success case prop encoding time : 0.000
% 0.27/0.58 % Success case prop solver time : 0.000
% 0.27/0.58 % Current number of processed clauses : 21
% 0.27/0.58 % Positive orientable unit clauses : 17
% 0.27/0.58 % Positive unorientable unit clauses: 1
% 0.27/0.58 % Negative unit clauses : 1
% 0.27/0.58 % Non-unit-clauses : 2
% 0.27/0.58 % Current number of unprocessed clauses: 25
% 0.27/0.58 % ...number of literals in the above : 28
% 0.27/0.58 % Current number of archived formulas : 0
% 0.27/0.58 % Current number of archived clauses : 3
% 0.27/0.58 % Clause-clause subsumption calls (NU) : 0
% 0.27/0.58 % Rec. Clause-clause subsumption calls : 0
% 0.27/0.58 % Non-unit clause-clause subsumptions : 0
% 0.27/0.58 % Unit Clause-clause subsumption calls : 0
% 0.27/0.58 % Rewrite failures with RHS unbound : 0
% 0.27/0.58 % BW rewrite match attempts : 9
% 0.27/0.58 % BW rewrite match successes : 7
% 0.27/0.58 % Condensation attempts : 0
% 0.27/0.58 % Condensation successes : 0
% 0.27/0.58 % Termbank termtop insertions : 1308
% 0.27/0.58 % Search garbage collected termcells : 70
% 0.27/0.58
% 0.27/0.58 % -------------------------------------------------
% 0.27/0.58 % User time : 0.008 s
% 0.27/0.58 % System time : 0.003 s
% 0.27/0.58 % Total time : 0.010 s
% 0.27/0.58 % Maximum resident set size: 3652 pages
% 0.27/0.58
% 0.27/0.58 % -------------------------------------------------
% 0.27/0.58 % User time : 0.010 s
% 0.27/0.58 % System time : 0.009 s
% 0.27/0.58 % Total time : 0.019 s
% 0.27/0.58 % Maximum resident set size: 4608 pages
% 0.27/0.58 % E exiting
%------------------------------------------------------------------------------