%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KLE150+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 : n012.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:28 PM UTC 2026
% Result : Theorem 0.06s 0.34s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 24 unt; 0 def)
% Number of atoms : 44 ( 30 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 23 ( 12 ~; 7 |; 3 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 1 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4] :
( leq(addition(one,multiplication(X4,zero)),strong_iteration(multiplication(X4,zero)))
& leq(strong_iteration(multiplication(X4,zero)),addition(one,multiplication(X4,zero))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
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(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(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',idempotence) ).
fof(c_0_8,negated_conjecture,
~ ! [X4] :
( leq(addition(one,multiplication(X4,zero)),strong_iteration(multiplication(X4,zero)))
& leq(strong_iteration(multiplication(X4,zero)),addition(one,multiplication(X4,zero))) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_9,plain,
! [X32] : strong_iteration(X32) = addition(multiplication(X32,strong_iteration(X32)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
fof(c_0_10,plain,
! [X5,X6] : addition(X5,X6) = addition(X6,X5),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_11,negated_conjecture,
( ~ leq(addition(one,multiplication(esk1_0,zero)),strong_iteration(multiplication(esk1_0,zero)))
| ~ leq(strong_iteration(multiplication(esk1_0,zero)),addition(one,multiplication(esk1_0,zero))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_12,plain,
! [X37,X38] :
( ( leq(X37,X38)
| addition(X37,X38) != X38 )
& ( addition(X37,X38) = X38
| ~ leq(X37,X38) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
fof(c_0_13,plain,
! [X7,X8,X9] : addition(X9,addition(X8,X7)) = addition(addition(X9,X8),X7),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
cnf(c_0_14,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X12,X13,X14] : multiplication(X12,multiplication(X13,X14)) = multiplication(multiplication(X12,X13),X14),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_17,negated_conjecture,
( ~ leq(addition(one,multiplication(esk1_0,zero)),strong_iteration(multiplication(esk1_0,zero)))
| ~ leq(strong_iteration(multiplication(esk1_0,zero)),addition(one,multiplication(esk1_0,zero))) ),
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(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X23] : multiplication(zero,X23) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_23,plain,
! [X11] : addition(X11,X11) = X11,
inference(variable_rename,[status(thm)],[idempotence]) ).
cnf(c_0_24,negated_conjecture,
( ~ leq(addition(one,multiplication(esk1_0,zero)),strong_iteration(multiplication(esk1_0,zero)))
| addition(one,addition(multiplication(esk1_0,zero),strong_iteration(multiplication(esk1_0,zero)))) != addition(one,multiplication(esk1_0,zero)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]),c_0_19]) ).
cnf(c_0_25,plain,
addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2))))) = strong_iteration(multiplication(X1,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( addition(one,addition(multiplication(esk1_0,zero),strong_iteration(multiplication(esk1_0,zero)))) != strong_iteration(multiplication(esk1_0,zero))
| addition(one,addition(multiplication(esk1_0,zero),strong_iteration(multiplication(esk1_0,zero)))) != addition(one,multiplication(esk1_0,zero)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_18]),c_0_19]) ).
cnf(c_0_29,plain,
strong_iteration(multiplication(X1,zero)) = addition(one,multiplication(X1,zero)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X3,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_31,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_27]),c_0_31]),c_0_29]),c_0_30]),c_0_27]),c_0_31]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : KLE150+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Sun Sep 20 22:46:37 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.32 Running first-order theorem proving
% 0.04/0.32 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.06/0.34 % Version: 3.5.1
% 0.06/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.06/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.06/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.34 % Starting new_bool_1 with 300s (1) cores
% 0.06/0.34 % Starting sh5l with 300s (1) cores
% 0.06/0.34 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1024071 completed with status 0
% 0.06/0.34 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.06/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.06/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.06/0.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.34 % No SInE strategy applied
% 0.06/0.34 % Search class: FHHSM-FFSF21-MFFFFFNN
% 0.06/0.34 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.06/0.34 % Starting SubtermCWHack with 136s (1) cores
% 0.06/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.06/0.34 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.06/0.34 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.06/0.34 % Starting new_bool_3 with 136s (1) cores
% 0.06/0.34 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1024076 completed with status 0
% 0.06/0.34 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.06/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.06/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.06/0.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.34 % No SInE strategy applied
% 0.06/0.34 % Search class: FHHSM-FFSF21-MFFFFFNN
% 0.06/0.34 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.06/0.34 % Starting SubtermCWHack with 136s (1) cores
% 0.06/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.06/0.34 % Preprocessing time : 0.001 s
% 0.06/0.34 % Presaturation interreduction done
% 0.06/0.34
% 0.06/0.34 % Proof found!
% 0.06/0.34 % SZS status Theorem
% 0.06/0.34 % SZS output start CNFRefutation
% See solution above
% 0.06/0.34 % Parsed axioms : 19
% 0.06/0.34 % Removed by relevancy pruning/SinE : 0
% 0.06/0.34 % Initial clauses : 20
% 0.06/0.34 % Removed in clause preprocessing : 0
% 0.06/0.34 % Initial clauses in saturation : 20
% 0.06/0.34 % Processed clauses : 188
% 0.06/0.34 % ...of these trivial : 34
% 0.06/0.34 % ...subsumed : 26
% 0.06/0.34 % ...remaining for further processing : 128
% 0.06/0.34 % Other redundant clauses eliminated : 3
% 0.06/0.34 % Clauses deleted for lack of memory : 0
% 0.06/0.34 % Backward-subsumed : 0
% 0.06/0.34 % Backward-rewritten : 30
% 0.06/0.34 % Generated clauses : 1541
% 0.06/0.34 % ...of the previous two non-redundant : 781
% 0.06/0.34 % ...aggressively subsumed : 0
% 0.06/0.34 % Contextual simplify-reflections : 0
% 0.06/0.34 % Paramodulations : 1538
% 0.06/0.34 % Factorizations : 0
% 0.06/0.34 % NegExts : 0
% 0.06/0.34 % Equation resolutions : 3
% 0.06/0.34 % Disequality decompositions : 0
% 0.06/0.34 % Total rewrite steps : 1752
% 0.06/0.34 % ...of those cached : 1343
% 0.06/0.34 % Propositional unsat checks : 0
% 0.06/0.34 % Propositional check models : 0
% 0.06/0.34 % Propositional check unsatisfiable : 0
% 0.06/0.34 % Propositional clauses : 0
% 0.06/0.34 % Propositional clauses after purity: 0
% 0.06/0.34 % Propositional unsat core size : 0
% 0.06/0.34 % Propositional preprocessing time : 0.000
% 0.06/0.34 % Propositional encoding time : 0.000
% 0.06/0.34 % Propositional solver time : 0.000
% 0.06/0.34 % Success case prop preproc time : 0.000
% 0.06/0.34 % Success case prop encoding time : 0.000
% 0.06/0.34 % Success case prop solver time : 0.000
% 0.06/0.34 % Current number of processed clauses : 78
% 0.06/0.34 % Positive orientable unit clauses : 60
% 0.06/0.34 % Positive unorientable unit clauses: 3
% 0.06/0.34 % Negative unit clauses : 0
% 0.06/0.34 % Non-unit-clauses : 15
% 0.06/0.34 % Current number of unprocessed clauses: 588
% 0.06/0.34 % ...number of literals in the above : 810
% 0.06/0.34 % Current number of archived formulas : 0
% 0.06/0.34 % Current number of archived clauses : 50
% 0.06/0.34 % Clause-clause subsumption calls (NU) : 78
% 0.06/0.34 % Rec. Clause-clause subsumption calls : 78
% 0.06/0.34 % Non-unit clause-clause subsumptions : 14
% 0.06/0.34 % Unit Clause-clause subsumption calls : 23
% 0.06/0.34 % Rewrite failures with RHS unbound : 0
% 0.06/0.34 % BW rewrite match attempts : 115
% 0.06/0.34 % BW rewrite match successes : 66
% 0.06/0.34 % Condensation attempts : 0
% 0.06/0.34 % Condensation successes : 0
% 0.06/0.34 % Termbank termtop insertions : 14963
% 0.06/0.34 % Search garbage collected termcells : 83
% 0.06/0.34
% 0.06/0.34 % -------------------------------------------------
% 0.06/0.34 % User time : 0.011 s
% 0.06/0.34 % System time : 0.002 s
% 0.06/0.34 % Total time : 0.013 s
% 0.06/0.34 % Maximum resident set size: 3652 pages
% 0.06/0.34
% 0.06/0.34 % -------------------------------------------------
% 0.06/0.34 % User time : 0.050 s
% 0.06/0.34 % System time : 0.011 s
% 0.06/0.34 % Total time : 0.060 s
% 0.06/0.34 % Maximum resident set size: 4864 pages
% 0.06/0.34 % E exiting
%------------------------------------------------------------------------------