%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KLE083+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 : n003.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:18 PM UTC 2026
% Result : Theorem 0.14s 5.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 31 unt; 0 def)
% Number of atoms : 31 ( 30 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_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(goals,conjecture,
! [X4] : X4 = multiplication(domain(X4),X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(domain1,axiom,
! [X4] : multiplication(antidomain(X4),X4) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain1) ).
fof(domain3,axiom,
! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain3) ).
fof(domain4,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain4) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(c_0_8,plain,
! [X34] : addition(X34,zero) = X34,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_9,plain,
! [X29,X30] : addition(X29,X30) = addition(X30,X29),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_10,negated_conjecture,
~ ! [X4] : X4 = multiplication(domain(X4),X4),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_11,plain,
! [X15,X16,X17] : multiplication(addition(X15,X16),X17) = addition(multiplication(X15,X17),multiplication(X16,X17)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_12,plain,
! [X20] : multiplication(antidomain(X20),X20) = zero,
inference(variable_rename,[status(thm)],[domain1]) ).
cnf(c_0_13,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X27] : addition(antidomain(antidomain(X27)),antidomain(X27)) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_16,negated_conjecture,
esk1_0 != multiplication(domain(esk1_0),esk1_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_17,plain,
! [X26] : domain(X26) = antidomain(antidomain(X26)),
inference(variable_rename,[status(thm)],[domain4]) ).
cnf(c_0_18,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X11] : multiplication(one,X11) = X11,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_23,negated_conjecture,
esk1_0 != multiplication(domain(esk1_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
multiplication(addition(antidomain(X1),X2),X1) = multiplication(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_26,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_27,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
multiplication(antidomain(antidomain(esk1_0)),esk1_0) != esk1_0,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
multiplication(antidomain(antidomain(X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE083+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.37 % Computer : n003.cluster.edu
% 0.11/5.37 % Model : x86_64 x86_64
% 0.11/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37 % Memory : 8046.5625MB
% 0.11/5.37 % OS : Linux 6.8.0-71-generic
% 0.11/5.37 % CPULimit : 300
% 0.11/5.37 % WCLimit : 300
% 0.11/5.37 % DateTime : Sun Sep 20 22:43:51 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.42 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.14/5.45 % Version: 3.5.1
% 0.14/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.45 % Starting sh5l with 300s (1) cores
% 0.14/5.45 % sh5l with pid 2777348 completed with status 0
% 0.14/5.45 % Result found by sh5l
% 0.14/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.45 % Starting sh5l with 300s (1) cores
% 0.14/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/5.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/5.45 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.14/5.45 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.45 % Starting SubtermCWHack with 28s (1) cores
% 0.14/5.45 % SubtermCWHack with pid 2777354 completed with status 0
% 0.14/5.45 % Result found by SubtermCWHack
% 0.14/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.45 % Starting sh5l with 300s (1) cores
% 0.14/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/5.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/5.45 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.14/5.45 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.45 % Starting SubtermCWHack with 28s (1) cores
% 0.14/5.45 % Preprocessing time : 0.001 s
% 0.14/5.45
% 0.14/5.45 % Proof found!
% 0.14/5.45 % SZS status Theorem
% 0.14/5.45 % SZS output start CNFRefutation
% See solution above
% 0.14/5.45 % Parsed axioms : 21
% 0.14/5.45 % Removed by relevancy pruning/SinE : 1
% 0.14/5.45 % Initial clauses : 20
% 0.14/5.45 % Removed in clause preprocessing : 0
% 0.14/5.45 % Initial clauses in saturation : 20
% 0.14/5.45 % Processed clauses : 64
% 0.14/5.45 % ...of these trivial : 16
% 0.14/5.45 % ...subsumed : 2
% 0.14/5.45 % ...remaining for further processing : 46
% 0.14/5.45 % Other redundant clauses eliminated : 0
% 0.14/5.45 % Clauses deleted for lack of memory : 0
% 0.14/5.45 % Backward-subsumed : 0
% 0.14/5.45 % Backward-rewritten : 1
% 0.14/5.45 % Generated clauses : 385
% 0.14/5.45 % ...of the previous two non-redundant : 149
% 0.14/5.45 % ...aggressively subsumed : 0
% 0.14/5.45 % Contextual simplify-reflections : 0
% 0.14/5.45 % Paramodulations : 385
% 0.14/5.45 % Factorizations : 0
% 0.14/5.45 % NegExts : 0
% 0.14/5.45 % Equation resolutions : 0
% 0.14/5.45 % Disequality decompositions : 0
% 0.14/5.45 % Total rewrite steps : 476
% 0.14/5.45 % ...of those cached : 302
% 0.14/5.45 % Propositional unsat checks : 0
% 0.14/5.45 % Propositional check models : 0
% 0.14/5.45 % Propositional check unsatisfiable : 0
% 0.14/5.45 % Propositional clauses : 0
% 0.14/5.45 % Propositional clauses after purity: 0
% 0.14/5.45 % Propositional unsat core size : 0
% 0.14/5.45 % Propositional preprocessing time : 0.000
% 0.14/5.45 % Propositional encoding time : 0.000
% 0.14/5.45 % Propositional solver time : 0.000
% 0.14/5.45 % Success case prop preproc time : 0.000
% 0.14/5.45 % Success case prop encoding time : 0.000
% 0.14/5.45 % Success case prop solver time : 0.000
% 0.14/5.45 % Current number of processed clauses : 45
% 0.14/5.45 % Positive orientable unit clauses : 44
% 0.14/5.45 % Positive unorientable unit clauses: 1
% 0.14/5.45 % Negative unit clauses : 0
% 0.14/5.45 % Non-unit-clauses : 0
% 0.14/5.45 % Current number of unprocessed clauses: 105
% 0.14/5.45 % ...number of literals in the above : 105
% 0.14/5.45 % Current number of archived formulas : 0
% 0.14/5.45 % Current number of archived clauses : 1
% 0.14/5.45 % Clause-clause subsumption calls (NU) : 0
% 0.14/5.45 % Rec. Clause-clause subsumption calls : 0
% 0.14/5.45 % Non-unit clause-clause subsumptions : 0
% 0.14/5.45 % Unit Clause-clause subsumption calls : 0
% 0.14/5.45 % Rewrite failures with RHS unbound : 0
% 0.14/5.45 % BW rewrite match attempts : 10
% 0.14/5.45 % BW rewrite match successes : 5
% 0.14/5.45 % Condensation attempts : 0
% 0.14/5.45 % Condensation successes : 0
% 0.14/5.45 % Termbank termtop insertions : 3588
% 0.14/5.45 % Search garbage collected termcells : 16
% 0.14/5.45
% 0.14/5.45 % -------------------------------------------------
% 0.14/5.45 % User time : 0.005 s
% 0.14/5.45 % System time : 0.002 s
% 0.14/5.45 % Total time : 0.007 s
% 0.14/5.45 % Maximum resident set size: 3652 pages
% 0.14/5.45
% 0.14/5.45 % -------------------------------------------------
% 0.14/5.45 % User time : 0.007 s
% 0.14/5.45 % System time : 0.006 s
% 0.14/5.45 % Total time : 0.013 s
% 0.14/5.45 % Maximum resident set size: 4864 pages
% 0.14/5.45 % E exiting
%------------------------------------------------------------------------------