%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KLE007+2 : 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 : n016.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:03 PM UTC 2026
% Result : Theorem 0.29s 0.53s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 15 unt; 0 def)
% Number of atoms : 69 ( 30 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 63 ( 24 ~; 20 |; 13 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( addition(X4,X5) = one
& multiplication(X5,X4) = zero
& multiplication(X4,X5) = zero ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
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,X5] :
( ( test(X4)
& test(X5) )
=> ( leq(addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5))),one)
& leq(one,addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5)))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(c_0_7,plain,
! [X29,X30] :
( ( ~ test(X29)
| c(X29) = X30
| ~ complement(X29,X30) )
& ( ~ test(X29)
| complement(X29,X30)
| c(X29) != X30 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])])]) ).
fof(c_0_8,plain,
! [X12,X13] :
( ( complement(X13,X12)
| addition(X12,X13) != one
| multiplication(X13,X12) != zero
| multiplication(X12,X13) != zero )
& ( ~ complement(X13,X12)
| addition(X12,X13) = one )
& ( ~ complement(X13,X12)
| multiplication(X13,X12) = zero )
& ( ~ complement(X13,X12)
| multiplication(X12,X13) = zero ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])])]) ).
cnf(c_0_9,plain,
( ~ test(X1)
| c(X1) != X2
| complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X14,X15] : addition(X14,X15) = addition(X15,X14),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_11,negated_conjecture,
~ ! [X4,X5] :
( ( test(X4)
& test(X5) )
=> ( leq(addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5))),one)
& leq(one,addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5)))) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_12,plain,
( ~ complement(X2,X1)
| addition(X1,X2) = one ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ test(X1)
| complement(X1,c(X1)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,negated_conjecture,
( ( ~ leq(addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))),one)
| ~ leq(one,addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0)))) )
& test(esk1_0)
& test(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_16,plain,
( ~ test(X1)
| addition(X1,c(X1)) = one ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
test(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X11] : multiplication(one,X11) = X11,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_19,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( ~ leq(addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))),one)
| ~ leq(one,addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
addition(esk1_0,c(esk1_0)) = one,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
addition(esk2_0,c(esk2_0)) = one,
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
fof(c_0_24,plain,
! [X8,X9] :
( ( leq(X8,X9)
| addition(X8,X9) != X9 )
& ( addition(X8,X9) = X9
| ~ leq(X8,X9) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
fof(c_0_25,plain,
! [X19] : addition(X19,X19) = X19,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_26,negated_conjecture,
~ leq(one,one),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_21]),c_0_22]),c_0_23]),c_0_21]),c_0_22]),c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_27,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE007+2 : 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 : n016.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:42:52 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.45 Running first-order theorem proving
% 0.14/0.45 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.29/0.53 % Version: 3.5.1
% 0.29/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.53 % Starting sh5l with 300s (1) cores
% 0.29/0.53 % new_bool_1 with pid 949880 completed with status 0
% 0.29/0.53 % Result found by new_bool_1
% 0.29/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.29/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/0.53 % Search class: FGHSM-FFMF21-MFFFFFNN
% 0.29/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.29/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.29/0.53 % SubtermCWHack with pid 949884 completed with status 0
% 0.29/0.53 % Result found by SubtermCWHack
% 0.29/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.29/0.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.29/0.53 % Search class: FGHSM-FFMF21-MFFFFFNN
% 0.29/0.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.29/0.53 % Starting SubtermCWHack with 31s (1) cores
% 0.29/0.53 % Preprocessing time : 0.002 s
% 0.29/0.53
% 0.29/0.53 % Proof found!
% 0.29/0.53 % SZS status Theorem
% 0.29/0.53 % SZS output start CNFRefutation
% See solution above
% 0.29/0.53 % Parsed axioms : 17
% 0.29/0.53 % Removed by relevancy pruning/SinE : 0
% 0.29/0.53 % Initial clauses : 25
% 0.29/0.53 % Removed in clause preprocessing : 0
% 0.29/0.53 % Initial clauses in saturation : 25
% 0.29/0.53 % Processed clauses : 99
% 0.29/0.53 % ...of these trivial : 12
% 0.29/0.53 % ...subsumed : 12
% 0.29/0.53 % ...remaining for further processing : 75
% 0.29/0.53 % Other redundant clauses eliminated : 1
% 0.29/0.53 % Clauses deleted for lack of memory : 0
% 0.29/0.53 % Backward-subsumed : 0
% 0.29/0.53 % Backward-rewritten : 0
% 0.29/0.53 % Generated clauses : 358
% 0.29/0.53 % ...of the previous two non-redundant : 181
% 0.29/0.53 % ...aggressively subsumed : 0
% 0.29/0.53 % Contextual simplify-reflections : 1
% 0.29/0.53 % Paramodulations : 356
% 0.29/0.53 % Factorizations : 1
% 0.29/0.53 % NegExts : 0
% 0.29/0.53 % Equation resolutions : 1
% 0.29/0.53 % Disequality decompositions : 0
% 0.29/0.53 % Total rewrite steps : 379
% 0.29/0.53 % ...of those cached : 225
% 0.29/0.53 % Propositional unsat checks : 0
% 0.29/0.53 % Propositional check models : 0
% 0.29/0.53 % Propositional check unsatisfiable : 0
% 0.29/0.53 % Propositional clauses : 0
% 0.29/0.53 % Propositional clauses after purity: 0
% 0.29/0.53 % Propositional unsat core size : 0
% 0.29/0.53 % Propositional preprocessing time : 0.000
% 0.29/0.53 % Propositional encoding time : 0.000
% 0.29/0.53 % Propositional solver time : 0.000
% 0.29/0.53 % Success case prop preproc time : 0.000
% 0.29/0.53 % Success case prop encoding time : 0.000
% 0.29/0.53 % Success case prop solver time : 0.000
% 0.29/0.53 % Current number of processed clauses : 74
% 0.29/0.53 % Positive orientable unit clauses : 36
% 0.29/0.53 % Positive unorientable unit clauses: 1
% 0.29/0.53 % Negative unit clauses : 1
% 0.29/0.53 % Non-unit-clauses : 36
% 0.29/0.53 % Current number of unprocessed clauses: 107
% 0.29/0.53 % ...number of literals in the above : 168
% 0.29/0.53 % Current number of archived formulas : 0
% 0.29/0.53 % Current number of archived clauses : 0
% 0.29/0.53 % Clause-clause subsumption calls (NU) : 199
% 0.29/0.53 % Rec. Clause-clause subsumption calls : 148
% 0.29/0.53 % Non-unit clause-clause subsumptions : 13
% 0.29/0.53 % Unit Clause-clause subsumption calls : 57
% 0.29/0.53 % Rewrite failures with RHS unbound : 0
% 0.29/0.53 % BW rewrite match attempts : 9
% 0.29/0.53 % BW rewrite match successes : 4
% 0.29/0.53 % Condensation attempts : 0
% 0.29/0.53 % Condensation successes : 0
% 0.29/0.53 % Termbank termtop insertions : 3997
% 0.29/0.53 % Search garbage collected termcells : 188
% 0.29/0.53
% 0.29/0.53 % -------------------------------------------------
% 0.29/0.53 % User time : 0.017 s
% 0.29/0.53 % System time : 0.004 s
% 0.29/0.53 % Total time : 0.021 s
% 0.29/0.53 % Maximum resident set size: 3648 pages
% 0.29/0.53
% 0.29/0.53 % -------------------------------------------------
% 0.29/0.53 % User time : 0.019 s
% 0.29/0.53 % System time : 0.011 s
% 0.29/0.53 % Total time : 0.030 s
% 0.29/0.53 % Maximum resident set size: 4608 pages
% 0.29/0.53 % E exiting
%------------------------------------------------------------------------------