%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE070+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 : 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:58:46 PM UTC 2026
% Result : Theorem 0.09s 0.42s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 19 unt; 0 def)
% Number of atoms : 19 ( 18 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 : 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 : 28 ( 2 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] : addition(domain(X4),multiplication(domain(X4),domain(X5))) = domain(X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
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(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(domain3,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain3) ).
fof(c_0_5,negated_conjecture,
~ ! [X4,X5] : addition(domain(X4),multiplication(domain(X4),domain(X5))) = domain(X4),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_6,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_7,plain,
! [X30] : multiplication(X30,one) = X30,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_8,plain,
! [X14,X15] : addition(X14,X15) = addition(X15,X14),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_9,plain,
! [X11] : addition(domain(X11),one) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_10,negated_conjecture,
addition(domain(esk1_0),multiplication(domain(esk1_0),domain(esk2_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_5])])])]) ).
cnf(c_0_11,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
addition(domain(esk1_0),multiplication(domain(esk1_0),domain(esk2_0))) != domain(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_17,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_13]),c_0_17]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE070+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n012.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 22:41:53 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.09/0.42 % Version: 3.5.1
% 0.09/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.42 % Starting sh5l with 300s (1) cores
% 0.09/0.42 % sh5l with pid 1016908 completed with status 0
% 0.09/0.42 % Result found by sh5l
% 0.09/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.42 % Starting sh5l with 300s (1) cores
% 0.09/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.09/0.42 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.42 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.09/0.42 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.42 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.42 % SubtermCWHack with pid 1016914 completed with status 0
% 0.09/0.42 % Result found by SubtermCWHack
% 0.09/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.42 % Starting sh5l with 300s (1) cores
% 0.09/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.09/0.42 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.42 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.09/0.42 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.42 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.42 % Preprocessing time : 0.001 s
% 0.09/0.42
% 0.09/0.42 % Proof found!
% 0.09/0.42 % SZS status Theorem
% 0.09/0.42 % SZS output start CNFRefutation
% See solution above
% 0.09/0.43 % Parsed axioms : 18
% 0.09/0.43 % Removed by relevancy pruning/SinE : 1
% 0.09/0.43 % Initial clauses : 17
% 0.09/0.43 % Removed in clause preprocessing : 0
% 0.09/0.43 % Initial clauses in saturation : 17
% 0.09/0.43 % Processed clauses : 119
% 0.09/0.43 % ...of these trivial : 33
% 0.09/0.43 % ...subsumed : 37
% 0.09/0.43 % ...remaining for further processing : 49
% 0.09/0.43 % Other redundant clauses eliminated : 0
% 0.09/0.43 % Clauses deleted for lack of memory : 0
% 0.09/0.43 % Backward-subsumed : 0
% 0.09/0.43 % Backward-rewritten : 8
% 0.09/0.43 % Generated clauses : 894
% 0.09/0.43 % ...of the previous two non-redundant : 407
% 0.09/0.43 % ...aggressively subsumed : 0
% 0.09/0.43 % Contextual simplify-reflections : 0
% 0.09/0.43 % Paramodulations : 894
% 0.09/0.43 % Factorizations : 0
% 0.09/0.43 % NegExts : 0
% 0.09/0.43 % Equation resolutions : 0
% 0.09/0.43 % Disequality decompositions : 0
% 0.09/0.43 % Total rewrite steps : 1034
% 0.09/0.43 % ...of those cached : 698
% 0.09/0.43 % Propositional unsat checks : 0
% 0.09/0.43 % Propositional check models : 0
% 0.09/0.43 % Propositional check unsatisfiable : 0
% 0.09/0.43 % Propositional clauses : 0
% 0.09/0.43 % Propositional clauses after purity: 0
% 0.09/0.43 % Propositional unsat core size : 0
% 0.09/0.43 % Propositional preprocessing time : 0.000
% 0.09/0.43 % Propositional encoding time : 0.000
% 0.09/0.43 % Propositional solver time : 0.000
% 0.09/0.43 % Success case prop preproc time : 0.000
% 0.09/0.43 % Success case prop encoding time : 0.000
% 0.09/0.43 % Success case prop solver time : 0.000
% 0.09/0.43 % Current number of processed clauses : 41
% 0.09/0.43 % Positive orientable unit clauses : 38
% 0.09/0.43 % Positive unorientable unit clauses: 3
% 0.09/0.43 % Negative unit clauses : 0
% 0.09/0.43 % Non-unit-clauses : 0
% 0.09/0.43 % Current number of unprocessed clauses: 290
% 0.09/0.43 % ...number of literals in the above : 290
% 0.09/0.43 % Current number of archived formulas : 0
% 0.09/0.43 % Current number of archived clauses : 8
% 0.09/0.43 % Clause-clause subsumption calls (NU) : 0
% 0.09/0.43 % Rec. Clause-clause subsumption calls : 0
% 0.09/0.43 % Non-unit clause-clause subsumptions : 0
% 0.09/0.43 % Unit Clause-clause subsumption calls : 3
% 0.09/0.43 % Rewrite failures with RHS unbound : 0
% 0.09/0.43 % BW rewrite match attempts : 82
% 0.09/0.43 % BW rewrite match successes : 55
% 0.09/0.43 % Condensation attempts : 0
% 0.09/0.43 % Condensation successes : 0
% 0.09/0.43 % Termbank termtop insertions : 7644
% 0.09/0.43 % Search garbage collected termcells : 22
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.009 s
% 0.09/0.43 % System time : 0.002 s
% 0.09/0.43 % Total time : 0.011 s
% 0.09/0.43 % Maximum resident set size: 3648 pages
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.010 s
% 0.09/0.43 % System time : 0.007 s
% 0.09/0.43 % Total time : 0.016 s
% 0.09/0.43 % Maximum resident set size: 4864 pages
% 0.09/0.43 % E exiting
%------------------------------------------------------------------------------