%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE114+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 : n007.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.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 46 unt; 0 def)
% Number of atoms : 46 ( 45 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 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; 3 con; 0-2 aty)
% Number of variables : 48 ( 3 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(complement,axiom,
! [X4] : c(X4) = antidomain(domain(X4)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+6.ax',complement) ).
fof(domain4,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain4) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(domain1,axiom,
! [X4] : multiplication(antidomain(X4),X4) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain1) ).
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(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(forward_diamond,axiom,
! [X4,X5] : forward_diamond(X4,X5) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+6.ax',forward_diamond) ).
fof(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_annihilation) ).
fof(goals,conjecture,
! [X4] : forward_box(X4,one) = one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(forward_box,axiom,
! [X4,X5] : forward_box(X4,X5) = c(forward_diamond(X4,c(X5))),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+6.ax',forward_box) ).
fof(c_0_11,plain,
! [X35] : c(X35) = antidomain(domain(X35)),
inference(variable_rename,[status(thm)],[complement]) ).
fof(c_0_12,plain,
! [X31] : domain(X31) = antidomain(antidomain(X31)),
inference(variable_rename,[status(thm)],[domain4]) ).
fof(c_0_13,plain,
! [X7] : multiplication(X7,one) = X7,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_14,plain,
! [X28] : multiplication(antidomain(X28),X28) = zero,
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_15,plain,
! [X9] : addition(antidomain(antidomain(X9)),antidomain(X9)) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_16,plain,
! [X22,X23] : addition(X22,X23) = addition(X23,X22),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_17,plain,
! [X38] : addition(X38,zero) = X38,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_18,plain,
c(X1) = antidomain(domain(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_25,plain,
! [X36,X37] : forward_diamond(X36,X37) = domain(multiplication(X36,domain(X37))),
inference(variable_rename,[status(thm)],[forward_diamond]) ).
cnf(c_0_26,plain,
antidomain(antidomain(antidomain(X1))) = c(X1),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_30,plain,
forward_diamond(X1,X2) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_31,plain,
! [X39] : multiplication(X39,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
fof(c_0_32,negated_conjecture,
~ ! [X4] : forward_box(X4,one) = one,
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_33,plain,
! [X11,X12] : forward_box(X11,X12) = c(forward_diamond(X11,c(X12))),
inference(variable_rename,[status(thm)],[forward_box]) ).
cnf(c_0_34,plain,
c(one) = antidomain(antidomain(zero)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_29]) ).
cnf(c_0_36,plain,
antidomain(antidomain(multiplication(X1,antidomain(antidomain(X2))))) = forward_diamond(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_19]),c_0_19]) ).
cnf(c_0_37,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_38,negated_conjecture,
forward_box(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_32])])])]) ).
cnf(c_0_39,plain,
forward_box(X1,X2) = c(forward_diamond(X1,c(X2))),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
c(one) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_27]) ).
cnf(c_0_41,plain,
forward_diamond(X1,zero) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_35]),c_0_27]),c_0_37]),c_0_35]),c_0_27]) ).
cnf(c_0_42,plain,
c(zero) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_35]),c_0_27]),c_0_35]) ).
cnf(c_0_43,negated_conjecture,
forward_box(esk1_0,one) != one,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,plain,
forward_box(X1,one) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE114+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.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 22:41:36 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.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.15/0.43 % Version: 3.5.1
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 % Starting sh5l with 300s (1) cores
% 0.15/0.43 % new_bool_3 with pid 3745125 completed with status 0
% 0.15/0.43 % Result found by new_bool_3
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.15/0.43 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.43 % SubtermCWHack with pid 3745128 completed with status 0
% 0.15/0.43 % Result found by SubtermCWHack
% 0.15/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.15/0.43 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.43 % Preprocessing time : 0.001 s
% 0.15/0.43
% 0.15/0.43 % Proof found!
% 0.15/0.43 % SZS status Theorem
% 0.15/0.43 % SZS output start CNFRefutation
% See solution above
% 0.15/0.43 % Parsed axioms : 27
% 0.15/0.43 % Removed by relevancy pruning/SinE : 5
% 0.15/0.43 % Initial clauses : 22
% 0.15/0.43 % Removed in clause preprocessing : 0
% 0.15/0.43 % Initial clauses in saturation : 22
% 0.15/0.43 % Processed clauses : 45
% 0.15/0.43 % ...of these trivial : 6
% 0.15/0.43 % ...subsumed : 0
% 0.15/0.43 % ...remaining for further processing : 39
% 0.15/0.43 % Other redundant clauses eliminated : 0
% 0.15/0.43 % Clauses deleted for lack of memory : 0
% 0.15/0.43 % Backward-subsumed : 0
% 0.15/0.43 % Backward-rewritten : 5
% 0.15/0.43 % Generated clauses : 120
% 0.15/0.43 % ...of the previous two non-redundant : 78
% 0.15/0.43 % ...aggressively subsumed : 0
% 0.15/0.43 % Contextual simplify-reflections : 0
% 0.15/0.43 % Paramodulations : 120
% 0.15/0.43 % Factorizations : 0
% 0.15/0.43 % NegExts : 0
% 0.15/0.43 % Equation resolutions : 0
% 0.15/0.43 % Disequality decompositions : 0
% 0.15/0.43 % Total rewrite steps : 156
% 0.15/0.43 % ...of those cached : 108
% 0.15/0.43 % Propositional unsat checks : 0
% 0.15/0.43 % Propositional check models : 0
% 0.15/0.43 % Propositional check unsatisfiable : 0
% 0.15/0.43 % Propositional clauses : 0
% 0.15/0.43 % Propositional clauses after purity: 0
% 0.15/0.43 % Propositional unsat core size : 0
% 0.15/0.43 % Propositional preprocessing time : 0.000
% 0.15/0.43 % Propositional encoding time : 0.000
% 0.15/0.43 % Propositional solver time : 0.000
% 0.15/0.43 % Success case prop preproc time : 0.000
% 0.15/0.43 % Success case prop encoding time : 0.000
% 0.15/0.43 % Success case prop solver time : 0.000
% 0.15/0.43 % Current number of processed clauses : 34
% 0.15/0.43 % Positive orientable unit clauses : 33
% 0.15/0.43 % Positive unorientable unit clauses: 1
% 0.15/0.43 % Negative unit clauses : 0
% 0.15/0.43 % Non-unit-clauses : 0
% 0.15/0.43 % Current number of unprocessed clauses: 55
% 0.15/0.43 % ...number of literals in the above : 55
% 0.15/0.43 % Current number of archived formulas : 0
% 0.15/0.43 % Current number of archived clauses : 5
% 0.15/0.43 % Clause-clause subsumption calls (NU) : 0
% 0.15/0.43 % Rec. Clause-clause subsumption calls : 0
% 0.15/0.43 % Non-unit clause-clause subsumptions : 0
% 0.15/0.43 % Unit Clause-clause subsumption calls : 0
% 0.15/0.43 % Rewrite failures with RHS unbound : 0
% 0.15/0.43 % BW rewrite match attempts : 9
% 0.15/0.43 % BW rewrite match successes : 8
% 0.15/0.43 % Condensation attempts : 0
% 0.15/0.43 % Condensation successes : 0
% 0.15/0.43 % Termbank termtop insertions : 1812
% 0.15/0.43 % Search garbage collected termcells : 36
% 0.15/0.43
% 0.15/0.43 % -------------------------------------------------
% 0.15/0.43 % User time : 0.006 s
% 0.15/0.43 % System time : 0.001 s
% 0.15/0.43 % Total time : 0.007 s
% 0.15/0.43 % Maximum resident set size: 3660 pages
% 0.15/0.43
% 0.15/0.43 % -------------------------------------------------
% 0.15/0.43 % User time : 0.008 s
% 0.15/0.43 % System time : 0.006 s
% 0.15/0.43 % Total time : 0.014 s
% 0.15/0.43 % Maximum resident set size: 4608 pages
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------