%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KLE150+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 : n026.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.26s 0.56s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 27 ( 1 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(goals,conjecture,
! [X4] : strong_iteration(multiplication(X4,zero)) = addition(one,multiplication(X4,zero)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(c_0_5,plain,
! [X32] : strong_iteration(X32) = addition(multiplication(X32,strong_iteration(X32)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
fof(c_0_6,plain,
! [X5,X6] : addition(X5,X6) = addition(X6,X5),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_7,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X12,X13,X14] : multiplication(X12,multiplication(X13,X14)) = multiplication(multiplication(X12,X13),X14),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_10,negated_conjecture,
~ ! [X4] : strong_iteration(multiplication(X4,zero)) = addition(one,multiplication(X4,zero)),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_11,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X23] : multiplication(zero,X23) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_14,negated_conjecture,
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_10])])])]) ).
cnf(c_0_15,plain,
addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2))))) = strong_iteration(multiplication(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
strong_iteration(multiplication(esk1_0,zero)) != addition(one,multiplication(esk1_0,zero)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
addition(one,multiplication(X1,zero)) = strong_iteration(multiplication(X1,zero)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : KLE150+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 % Computer : n026.cluster.edu
% 0.15/0.44 % Model : x86_64 x86_64
% 0.15/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.44 % Memory : 8046.5625MB
% 0.15/0.44 % OS : Linux 6.8.0-71-generic
% 0.15/0.44 % CPULimit : 300
% 0.15/0.44 % WCLimit : 300
% 0.15/0.44 % DateTime : Sun Sep 20 22:49:22 UTC 2026
% 0.15/0.44 % CPUTime :
% 0.15/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 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.26/0.56 % Version: 3.5.1
% 0.26/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.56 % Starting sh5l with 300s (1) cores
% 0.26/0.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 762154 completed with status 0
% 0.26/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.56 % No SInE strategy applied
% 0.26/0.56 % Search class: FHUSM-FFSF21-MFFFFFNN
% 0.26/0.56 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.56 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.26/0.56 % Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.26/0.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.26/0.56 % G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with pid 762163 completed with status 0
% 0.26/0.56 % Result found by G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y
% 0.26/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.56 % No SInE strategy applied
% 0.26/0.56 % Search class: FHUSM-FFSF21-MFFFFFNN
% 0.26/0.56 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.56 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.26/0.56 % Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.26/0.56 % Preprocessing time : 0.002 s
% 0.26/0.56 % Presaturation interreduction done
% 0.26/0.56
% 0.26/0.56 % Proof found!
% 0.26/0.56 % SZS status Theorem
% 0.26/0.56 % SZS output start CNFRefutation
% See solution above
% 0.26/0.56 % Parsed axioms : 19
% 0.26/0.56 % Removed by relevancy pruning/SinE : 0
% 0.26/0.56 % Initial clauses : 20
% 0.26/0.56 % Removed in clause preprocessing : 0
% 0.26/0.56 % Initial clauses in saturation : 20
% 0.26/0.56 % Processed clauses : 138
% 0.26/0.56 % ...of these trivial : 9
% 0.26/0.56 % ...subsumed : 41
% 0.26/0.56 % ...remaining for further processing : 88
% 0.26/0.56 % Other redundant clauses eliminated : 0
% 0.26/0.56 % Clauses deleted for lack of memory : 0
% 0.26/0.56 % Backward-subsumed : 6
% 0.26/0.56 % Backward-rewritten : 8
% 0.26/0.56 % Generated clauses : 664
% 0.26/0.56 % ...of the previous two non-redundant : 481
% 0.26/0.56 % ...aggressively subsumed : 0
% 0.26/0.56 % Contextual simplify-reflections : 0
% 0.26/0.56 % Paramodulations : 664
% 0.26/0.56 % Factorizations : 0
% 0.26/0.56 % NegExts : 0
% 0.26/0.56 % Equation resolutions : 0
% 0.26/0.56 % Disequality decompositions : 0
% 0.26/0.56 % Total rewrite steps : 463
% 0.26/0.56 % ...of those cached : 299
% 0.26/0.56 % Propositional unsat checks : 0
% 0.26/0.56 % Propositional check models : 0
% 0.26/0.56 % Propositional check unsatisfiable : 0
% 0.26/0.56 % Propositional clauses : 0
% 0.26/0.56 % Propositional clauses after purity: 0
% 0.26/0.56 % Propositional unsat core size : 0
% 0.26/0.56 % Propositional preprocessing time : 0.000
% 0.26/0.56 % Propositional encoding time : 0.000
% 0.26/0.56 % Propositional solver time : 0.000
% 0.26/0.56 % Success case prop preproc time : 0.000
% 0.26/0.56 % Success case prop encoding time : 0.000
% 0.26/0.56 % Success case prop solver time : 0.000
% 0.26/0.56 % Current number of processed clauses : 54
% 0.26/0.56 % Positive orientable unit clauses : 31
% 0.26/0.56 % Positive unorientable unit clauses: 3
% 0.26/0.56 % Negative unit clauses : 1
% 0.26/0.56 % Non-unit-clauses : 19
% 0.26/0.56 % Current number of unprocessed clauses: 366
% 0.26/0.56 % ...number of literals in the above : 515
% 0.26/0.56 % Current number of archived formulas : 0
% 0.26/0.56 % Current number of archived clauses : 34
% 0.26/0.56 % Clause-clause subsumption calls (NU) : 87
% 0.26/0.56 % Rec. Clause-clause subsumption calls : 86
% 0.26/0.56 % Non-unit clause-clause subsumptions : 25
% 0.26/0.56 % Unit Clause-clause subsumption calls : 13
% 0.26/0.56 % Rewrite failures with RHS unbound : 0
% 0.26/0.56 % BW rewrite match attempts : 48
% 0.26/0.56 % BW rewrite match successes : 38
% 0.26/0.56 % Condensation attempts : 138
% 0.26/0.56 % Condensation successes : 0
% 0.26/0.56 % Termbank termtop insertions : 6102
% 0.26/0.56 % Search garbage collected termcells : 71
% 0.26/0.56
% 0.26/0.56 % -------------------------------------------------
% 0.26/0.56 % User time : 0.017 s
% 0.26/0.56 % System time : 0.008 s
% 0.26/0.56 % Total time : 0.025 s
% 0.26/0.56 % Maximum resident set size: 3652 pages
% 0.26/0.56
% 0.26/0.56 % -------------------------------------------------
% 0.26/0.56 % User time : 0.092 s
% 0.26/0.56 % System time : 0.026 s
% 0.26/0.56 % Total time : 0.119 s
% 0.26/0.56 % Maximum resident set size: 4608 pages
% 0.26/0.56 % E exiting
%------------------------------------------------------------------------------