%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE054+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 : n008.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:44 PM UTC 2026
% Result : Theorem 0.19s 10.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 32 unt; 0 def)
% Number of atoms : 32 ( 31 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 : 4 ( 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 : 46 ( 4 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(domain3,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain3) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(goals,conjecture,
! [X4,X5] : addition(domain(multiplication(X4,X5)),domain(X4)) = domain(X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(domain5,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain5) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain2) ).
fof(c_0_8,plain,
! [X11] : addition(domain(X11),one) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_9,plain,
! [X14,X15] : addition(X14,X15) = addition(X15,X14),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_10,plain,
! [X8] : addition(X8,multiplication(domain(X8),X8)) = multiplication(domain(X8),X8),
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_11,plain,
! [X30] : multiplication(X30,one) = X30,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_12,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,negated_conjecture,
~ ! [X4,X5] : addition(domain(multiplication(X4,X5)),domain(X4)) = domain(X4),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_15,plain,
! [X12,X13] : domain(addition(X12,X13)) = addition(domain(X12),domain(X13)),
inference(variable_rename,[status(thm)],[domain5]) ).
cnf(c_0_16,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_19,negated_conjecture,
addition(domain(multiplication(esk1_0,esk2_0)),domain(esk1_0)) != domain(esk1_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_20,plain,
! [X21,X22,X23] : multiplication(X21,addition(X22,X23)) = addition(multiplication(X21,X22),multiplication(X21,X23)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_21,plain,
! [X9,X10] : domain(multiplication(X9,X10)) = domain(multiplication(X9,domain(X10))),
inference(variable_rename,[status(thm)],[domain2]) ).
cnf(c_0_22,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
domain(one) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
addition(domain(multiplication(esk1_0,esk2_0)),domain(esk1_0)) != domain(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
domain(addition(one,X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_18]) ).
cnf(c_0_28,negated_conjecture,
domain(addition(esk1_0,multiplication(esk1_0,esk2_0))) != domain(esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_22]),c_0_13]) ).
cnf(c_0_29,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_13]) ).
cnf(c_0_30,plain,
domain(multiplication(X1,addition(one,X2))) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_17]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_13]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KLE054+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/10.43 % Computer : n008.cluster.edu
% 0.15/10.43 % Model : x86_64 x86_64
% 0.15/10.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/10.43 % Memory : 8046.5625MB
% 0.15/10.43 % OS : Linux 6.8.0-71-generic
% 0.15/10.43 % CPULimit : 300
% 0.15/10.43 % WCLimit : 300
% 0.15/10.43 % DateTime : Sun Sep 20 22:42:34 UTC 2026
% 0.15/10.44 % CPUTime :
% 0.15/10.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/10.48 Running first-order theorem proving
% 0.15/10.48 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.19/10.51 % Version: 3.5.1
% 0.19/10.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/10.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/10.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/10.51 % Starting new_bool_3 with 300s (1) cores
% 0.19/10.51 % Starting new_bool_1 with 300s (1) cores
% 0.19/10.51 % Starting sh5l with 300s (1) cores
% 0.19/10.51 % sh5l with pid 3756081 completed with status 0
% 0.19/10.51 % Result found by sh5l
% 0.19/10.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/10.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/10.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/10.51 % Starting new_bool_3 with 300s (1) cores
% 0.19/10.51 % Starting new_bool_1 with 300s (1) cores
% 0.19/10.51 % Starting sh5l with 300s (1) cores
% 0.19/10.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.19/10.51 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/10.51 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.19/10.51 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.19/10.51 % Starting SubtermCWHack with 28s (1) cores
% 0.19/10.51 % SubtermCWHack with pid 3756088 completed with status 0
% 0.19/10.51 % Result found by SubtermCWHack
% 0.19/10.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/10.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/10.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/10.51 % Starting new_bool_3 with 300s (1) cores
% 0.19/10.51 % Starting new_bool_1 with 300s (1) cores
% 0.19/10.51 % Starting sh5l with 300s (1) cores
% 0.19/10.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.19/10.51 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/10.51 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.19/10.51 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.19/10.51 % Starting SubtermCWHack with 28s (1) cores
% 0.19/10.51 % Preprocessing time : 0.001 s
% 0.19/10.51
% 0.19/10.51 % Proof found!
% 0.19/10.51 % SZS status Theorem
% 0.19/10.51 % SZS output start CNFRefutation
% See solution above
% 0.19/10.51 % Parsed axioms : 18
% 0.19/10.51 % Removed by relevancy pruning/SinE : 1
% 0.19/10.51 % Initial clauses : 17
% 0.19/10.51 % Removed in clause preprocessing : 0
% 0.19/10.51 % Initial clauses in saturation : 17
% 0.19/10.51 % Processed clauses : 119
% 0.19/10.51 % ...of these trivial : 33
% 0.19/10.51 % ...subsumed : 37
% 0.19/10.51 % ...remaining for further processing : 49
% 0.19/10.51 % Other redundant clauses eliminated : 0
% 0.19/10.51 % Clauses deleted for lack of memory : 0
% 0.19/10.51 % Backward-subsumed : 0
% 0.19/10.51 % Backward-rewritten : 8
% 0.19/10.51 % Generated clauses : 896
% 0.19/10.51 % ...of the previous two non-redundant : 406
% 0.19/10.51 % ...aggressively subsumed : 0
% 0.19/10.51 % Contextual simplify-reflections : 0
% 0.19/10.51 % Paramodulations : 896
% 0.19/10.51 % Factorizations : 0
% 0.19/10.51 % NegExts : 0
% 0.19/10.51 % Equation resolutions : 0
% 0.19/10.51 % Disequality decompositions : 0
% 0.19/10.51 % Total rewrite steps : 1039
% 0.19/10.51 % ...of those cached : 700
% 0.19/10.51 % Propositional unsat checks : 0
% 0.19/10.51 % Propositional check models : 0
% 0.19/10.51 % Propositional check unsatisfiable : 0
% 0.19/10.51 % Propositional clauses : 0
% 0.19/10.51 % Propositional clauses after purity: 0
% 0.19/10.51 % Propositional unsat core size : 0
% 0.19/10.51 % Propositional preprocessing time : 0.000
% 0.19/10.51 % Propositional encoding time : 0.000
% 0.19/10.51 % Propositional solver time : 0.000
% 0.19/10.51 % Success case prop preproc time : 0.000
% 0.19/10.51 % Success case prop encoding time : 0.000
% 0.19/10.51 % Success case prop solver time : 0.000
% 0.19/10.51 % Current number of processed clauses : 41
% 0.19/10.51 % Positive orientable unit clauses : 38
% 0.19/10.51 % Positive unorientable unit clauses: 3
% 0.19/10.51 % Negative unit clauses : 0
% 0.19/10.51 % Non-unit-clauses : 0
% 0.19/10.51 % Current number of unprocessed clauses: 289
% 0.19/10.51 % ...number of literals in the above : 289
% 0.19/10.51 % Current number of archived formulas : 0
% 0.19/10.51 % Current number of archived clauses : 8
% 0.19/10.51 % Clause-clause subsumption calls (NU) : 0
% 0.19/10.51 % Rec. Clause-clause subsumption calls : 0
% 0.19/10.51 % Non-unit clause-clause subsumptions : 0
% 0.19/10.51 % Unit Clause-clause subsumption calls : 3
% 0.19/10.51 % Rewrite failures with RHS unbound : 0
% 0.19/10.51 % BW rewrite match attempts : 83
% 0.19/10.51 % BW rewrite match successes : 55
% 0.19/10.51 % Condensation attempts : 0
% 0.19/10.51 % Condensation successes : 0
% 0.19/10.51 % Termbank termtop insertions : 7665
% 0.19/10.51 % Search garbage collected termcells : 22
% 0.19/10.51
% 0.19/10.51 % -------------------------------------------------
% 0.19/10.51 % User time : 0.011 s
% 0.19/10.51 % System time : 0.003 s
% 0.19/10.51 % Total time : 0.014 s
% 0.19/10.51 % Maximum resident set size: 3616 pages
% 0.19/10.51
% 0.19/10.51 % -------------------------------------------------
% 0.19/10.51 % User time : 0.012 s
% 0.19/10.51 % System time : 0.008 s
% 0.19/10.51 % Total time : 0.020 s
% 0.19/10.51 % Maximum resident set size: 4608 pages
% 0.19/10.51 % E exiting
%------------------------------------------------------------------------------