%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE085+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:49 PM UTC 2026
% Result : Theorem 0.14s 5.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 1 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4] : addition(domain(X4),one) = one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(domain4,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain4) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(domain3,axiom,
! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain3) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(c_0_6,negated_conjecture,
~ ! [X4] : addition(domain(X4),one) = one,
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,negated_conjecture,
addition(domain(esk1_0),one) != one,
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_8,plain,
! [X23] : domain(X23) = antidomain(antidomain(X23)),
inference(variable_rename,[status(thm)],[domain4]) ).
fof(c_0_9,plain,
! [X13,X14,X15] : addition(X15,addition(X14,X13)) = addition(addition(X15,X14),X13),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_10,plain,
! [X16] : addition(X16,X16) = X16,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_11,plain,
! [X9] : addition(antidomain(antidomain(X9)),antidomain(X9)) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_12,plain,
! [X11,X12] : addition(X11,X12) = addition(X12,X11),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_13,negated_conjecture,
addition(domain(esk1_0),one) != one,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
addition(antidomain(antidomain(esk1_0)),one) != one,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
addition(one,antidomain(antidomain(esk1_0))) != one,
inference(rw,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_23,plain,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE085+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/5.37 % Computer : n014.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Sun Sep 20 22:42:39 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.41 Running first-order theorem proving
% 0.14/5.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.14/5.43 % Version: 3.5.1
% 0.14/5.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.43 % Starting sh5l with 300s (1) cores
% 0.14/5.43 % new_bool_3 with pid 2522676 completed with status 0
% 0.14/5.43 % Result found by new_bool_3
% 0.14/5.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.43 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.14/5.43 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.43 % Starting SubtermCWHack with 28s (1) cores
% 0.14/5.43 % SubtermCWHack with pid 2522679 completed with status 0
% 0.14/5.43 % Result found by SubtermCWHack
% 0.14/5.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.43 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.14/5.43 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.43 % Starting SubtermCWHack with 28s (1) cores
% 0.14/5.43 % Preprocessing time : 0.001 s
% 0.14/5.43
% 0.14/5.43 % Proof found!
% 0.14/5.43 % SZS status Theorem
% 0.14/5.43 % SZS output start CNFRefutation
% See solution above
% 0.14/5.43 % Parsed axioms : 21
% 0.14/5.43 % Removed by relevancy pruning/SinE : 2
% 0.14/5.43 % Initial clauses : 19
% 0.14/5.43 % Removed in clause preprocessing : 0
% 0.14/5.43 % Initial clauses in saturation : 19
% 0.14/5.43 % Processed clauses : 26
% 0.14/5.43 % ...of these trivial : 3
% 0.14/5.43 % ...subsumed : 0
% 0.14/5.43 % ...remaining for further processing : 23
% 0.14/5.43 % Other redundant clauses eliminated : 0
% 0.14/5.43 % Clauses deleted for lack of memory : 0
% 0.14/5.43 % Backward-subsumed : 0
% 0.14/5.43 % Backward-rewritten : 2
% 0.14/5.43 % Generated clauses : 49
% 0.14/5.43 % ...of the previous two non-redundant : 24
% 0.14/5.43 % ...aggressively subsumed : 0
% 0.14/5.43 % Contextual simplify-reflections : 0
% 0.14/5.43 % Paramodulations : 49
% 0.14/5.43 % Factorizations : 0
% 0.14/5.43 % NegExts : 0
% 0.14/5.43 % Equation resolutions : 0
% 0.14/5.43 % Disequality decompositions : 0
% 0.14/5.43 % Total rewrite steps : 47
% 0.14/5.43 % ...of those cached : 15
% 0.14/5.43 % Propositional unsat checks : 0
% 0.14/5.43 % Propositional check models : 0
% 0.14/5.43 % Propositional check unsatisfiable : 0
% 0.14/5.43 % Propositional clauses : 0
% 0.14/5.43 % Propositional clauses after purity: 0
% 0.14/5.43 % Propositional unsat core size : 0
% 0.14/5.43 % Propositional preprocessing time : 0.000
% 0.14/5.43 % Propositional encoding time : 0.000
% 0.14/5.43 % Propositional solver time : 0.000
% 0.14/5.43 % Success case prop preproc time : 0.000
% 0.14/5.43 % Success case prop encoding time : 0.000
% 0.14/5.43 % Success case prop solver time : 0.000
% 0.14/5.43 % Current number of processed clauses : 21
% 0.14/5.43 % Positive orientable unit clauses : 20
% 0.14/5.43 % Positive unorientable unit clauses: 1
% 0.14/5.43 % Negative unit clauses : 0
% 0.14/5.43 % Non-unit-clauses : 0
% 0.14/5.43 % Current number of unprocessed clauses: 17
% 0.14/5.43 % ...number of literals in the above : 17
% 0.14/5.43 % Current number of archived formulas : 0
% 0.14/5.43 % Current number of archived clauses : 2
% 0.14/5.43 % Clause-clause subsumption calls (NU) : 0
% 0.14/5.43 % Rec. Clause-clause subsumption calls : 0
% 0.14/5.43 % Non-unit clause-clause subsumptions : 0
% 0.14/5.43 % Unit Clause-clause subsumption calls : 0
% 0.14/5.43 % Rewrite failures with RHS unbound : 0
% 0.14/5.43 % BW rewrite match attempts : 9
% 0.14/5.43 % BW rewrite match successes : 7
% 0.14/5.43 % Condensation attempts : 0
% 0.14/5.43 % Condensation successes : 0
% 0.14/5.43 % Termbank termtop insertions : 1029
% 0.14/5.43 % Search garbage collected termcells : 19
% 0.14/5.43
% 0.14/5.43 % -------------------------------------------------
% 0.14/5.43 % User time : 0.002 s
% 0.14/5.43 % System time : 0.004 s
% 0.14/5.43 % Total time : 0.006 s
% 0.14/5.43 % Maximum resident set size: 3396 pages
% 0.14/5.43
% 0.14/5.43 % -------------------------------------------------
% 0.14/5.43 % User time : 0.004 s
% 0.14/5.43 % System time : 0.009 s
% 0.14/5.43 % Total time : 0.012 s
% 0.14/5.43 % Maximum resident set size: 4608 pages
% 0.14/5.43 % E exiting
%------------------------------------------------------------------------------