%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE119+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 : n018.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:58:53 PM UTC 2026
% Result : Theorem 0.26s 0.55s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 36 ( 36 unt; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 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 : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 2 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(codomain3,axiom,
! [X4] : addition(coantidomain(coantidomain(X4)),coantidomain(X4)) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain3) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(codomain1,axiom,
! [X4] : multiplication(X4,coantidomain(X4)) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain1) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(goals,conjecture,
! [X4,X5] : addition(backward_diamond(zero,domain(X4)),domain(X5)) = domain(X5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(backward_diamond,axiom,
! [X4,X5] : backward_diamond(X4,X5) = codomain(multiplication(codomain(X5),X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+6.ax',backward_diamond) ).
fof(codomain4,axiom,
! [X4] : codomain(X4) = coantidomain(coantidomain(X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain4) ).
fof(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_annihilation) ).
fof(c_0_9,plain,
! [X37] : addition(coantidomain(coantidomain(X37)),coantidomain(X37)) = one,
inference(variable_rename,[status(thm)],[codomain3]) ).
fof(c_0_10,plain,
! [X9,X10] : addition(X9,X10) = addition(X10,X9),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_11,plain,
! [X39] : multiplication(one,X39) = X39,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_12,plain,
! [X27] : multiplication(X27,coantidomain(X27)) = zero,
inference(variable_rename,[status(thm)],[codomain1]) ).
fof(c_0_13,plain,
! [X23] : addition(X23,zero) = X23,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_14,negated_conjecture,
~ ! [X4,X5] : addition(backward_diamond(zero,domain(X4)),domain(X5)) = domain(X5),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_15,plain,
! [X21,X22] : backward_diamond(X21,X22) = codomain(multiplication(codomain(X22),X21)),
inference(variable_rename,[status(thm)],[backward_diamond]) ).
fof(c_0_16,plain,
! [X34] : codomain(X34) = coantidomain(coantidomain(X34)),
inference(variable_rename,[status(thm)],[codomain4]) ).
cnf(c_0_17,plain,
addition(coantidomain(coantidomain(X1)),coantidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
multiplication(X1,coantidomain(X1)) = zero,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_22,negated_conjecture,
addition(backward_diamond(zero,domain(esk1_0)),domain(esk2_0)) != domain(esk2_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_23,plain,
backward_diamond(X1,X2) = codomain(multiplication(codomain(X2),X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
codomain(X1) = coantidomain(coantidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_25,plain,
! [X24] : multiplication(X24,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
cnf(c_0_26,plain,
addition(coantidomain(X1),coantidomain(coantidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
coantidomain(one) = zero,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_29,negated_conjecture,
addition(backward_diamond(zero,domain(esk1_0)),domain(esk2_0)) != domain(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
coantidomain(coantidomain(multiplication(coantidomain(coantidomain(X1)),X2))) = backward_diamond(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_31,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
coantidomain(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_33,negated_conjecture,
addition(domain(esk2_0),backward_diamond(zero,domain(esk1_0))) != domain(esk2_0),
inference(rw,[status(thm)],[c_0_29,c_0_18]) ).
cnf(c_0_34,plain,
backward_diamond(zero,X1) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_27]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KLE119+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.18/0.44 % Computer : n018.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Sun Sep 20 22:46:59 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.45 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.55 % Version: 3.5.1
% 0.26/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.55 % Starting sh5l with 300s (1) cores
% 0.26/0.55 % new_bool_3 with pid 361942 completed with status 0
% 0.26/0.55 % Result found by new_bool_3
% 0.26/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.55 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.26/0.55 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.55 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.55 % SubtermCWHack with pid 361945 completed with status 0
% 0.26/0.55 % Result found by SubtermCWHack
% 0.26/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.55 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.26/0.55 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.55 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.55 % Preprocessing time : 0.002 s
% 0.26/0.55
% 0.26/0.55 % Proof found!
% 0.26/0.55 % SZS status Theorem
% 0.26/0.55 % SZS output start CNFRefutation
% See solution above
% 0.26/0.55 % Parsed axioms : 27
% 0.26/0.55 % Removed by relevancy pruning/SinE : 6
% 0.26/0.55 % Initial clauses : 21
% 0.26/0.55 % Removed in clause preprocessing : 0
% 0.26/0.55 % Initial clauses in saturation : 21
% 0.26/0.55 % Processed clauses : 35
% 0.26/0.55 % ...of these trivial : 7
% 0.26/0.55 % ...subsumed : 0
% 0.26/0.55 % ...remaining for further processing : 28
% 0.26/0.55 % Other redundant clauses eliminated : 0
% 0.26/0.55 % Clauses deleted for lack of memory : 0
% 0.26/0.55 % Backward-subsumed : 0
% 0.26/0.55 % Backward-rewritten : 2
% 0.26/0.55 % Generated clauses : 52
% 0.26/0.55 % ...of the previous two non-redundant : 28
% 0.26/0.55 % ...aggressively subsumed : 0
% 0.26/0.55 % Contextual simplify-reflections : 0
% 0.26/0.55 % Paramodulations : 52
% 0.26/0.55 % Factorizations : 0
% 0.26/0.55 % NegExts : 0
% 0.26/0.55 % Equation resolutions : 0
% 0.26/0.55 % Disequality decompositions : 0
% 0.26/0.55 % Total rewrite steps : 82
% 0.26/0.55 % ...of those cached : 49
% 0.26/0.55 % Propositional unsat checks : 0
% 0.26/0.55 % Propositional check models : 0
% 0.26/0.55 % Propositional check unsatisfiable : 0
% 0.26/0.55 % Propositional clauses : 0
% 0.26/0.55 % Propositional clauses after purity: 0
% 0.26/0.55 % Propositional unsat core size : 0
% 0.26/0.55 % Propositional preprocessing time : 0.000
% 0.26/0.55 % Propositional encoding time : 0.000
% 0.26/0.55 % Propositional solver time : 0.000
% 0.26/0.55 % Success case prop preproc time : 0.000
% 0.26/0.55 % Success case prop encoding time : 0.000
% 0.26/0.55 % Success case prop solver time : 0.000
% 0.26/0.55 % Current number of processed clauses : 26
% 0.26/0.55 % Positive orientable unit clauses : 25
% 0.26/0.55 % Positive unorientable unit clauses: 1
% 0.26/0.55 % Negative unit clauses : 0
% 0.26/0.55 % Non-unit-clauses : 0
% 0.26/0.55 % Current number of unprocessed clauses: 14
% 0.26/0.55 % ...number of literals in the above : 14
% 0.26/0.55 % Current number of archived formulas : 0
% 0.26/0.55 % Current number of archived clauses : 2
% 0.26/0.55 % Clause-clause subsumption calls (NU) : 0
% 0.26/0.55 % Rec. Clause-clause subsumption calls : 0
% 0.26/0.55 % Non-unit clause-clause subsumptions : 0
% 0.26/0.55 % Unit Clause-clause subsumption calls : 0
% 0.26/0.55 % Rewrite failures with RHS unbound : 0
% 0.26/0.55 % BW rewrite match attempts : 7
% 0.26/0.55 % BW rewrite match successes : 6
% 0.26/0.55 % Condensation attempts : 0
% 0.26/0.55 % Condensation successes : 0
% 0.26/0.55 % Termbank termtop insertions : 1257
% 0.26/0.55 % Search garbage collected termcells : 50
% 0.26/0.55
% 0.26/0.55 % -------------------------------------------------
% 0.26/0.55 % User time : 0.006 s
% 0.26/0.55 % System time : 0.002 s
% 0.26/0.55 % Total time : 0.008 s
% 0.26/0.55 % Maximum resident set size: 3660 pages
% 0.26/0.55
% 0.26/0.55 % -------------------------------------------------
% 0.26/0.55 % User time : 0.009 s
% 0.26/0.55 % System time : 0.008 s
% 0.26/0.55 % Total time : 0.017 s
% 0.26/0.55 % Maximum resident set size: 4864 pages
% 0.26/0.55 % E exiting
%------------------------------------------------------------------------------