%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE035+2 : 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 : n019.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:41 PM UTC 2026
% Result : Theorem 0.14s 0.47s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 24 unt; 0 def)
% Number of atoms : 49 ( 25 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 27 ( 9 ~; 4 |; 11 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6,X7] :
( ( leq(multiplication(multiplication(X6,X5),c(X7)),zero)
& leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& test(X6)
& test(X7) )
=> leq(multiplication(multiplication(X6,addition(X4,X5)),c(X7)),zero) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(c_0_6,negated_conjecture,
~ ! [X4,X5,X6,X7] :
( ( leq(multiplication(multiplication(X6,X5),c(X7)),zero)
& leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& test(X6)
& test(X7) )
=> leq(multiplication(multiplication(X6,addition(X4,X5)),c(X7)),zero) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,plain,
! [X12,X13] :
( ( leq(X12,X13)
| addition(X12,X13) != X13 )
& ( addition(X12,X13) = X13
| ~ leq(X12,X13) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
fof(c_0_8,negated_conjecture,
( ~ leq(multiplication(multiplication(esk3_0,addition(esk1_0,esk2_0)),c(esk4_0)),zero)
& leq(multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)),zero)
& leq(multiplication(multiplication(esk3_0,esk1_0),c(esk4_0)),zero)
& test(esk3_0)
& test(esk4_0) ),
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_9,plain,
! [X14] : addition(X14,zero) = X14,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_10,plain,
( ~ leq(X1,X2)
| addition(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
leq(multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X18,X19,X20] : multiplication(X18,multiplication(X19,X20)) = multiplication(multiplication(X18,X19),X20),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_14,plain,
! [X21,X22,X23] : multiplication(X21,addition(X22,X23)) = addition(multiplication(X21,X22),multiplication(X21,X23)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_15,negated_conjecture,
multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_16,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ leq(multiplication(multiplication(esk3_0,addition(esk1_0,esk2_0)),c(esk4_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,c(esk4_0))) = zero,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,plain,
! [X24,X25,X26] : multiplication(addition(X24,X25),X26) = addition(multiplication(X24,X26),multiplication(X25,X26)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_22,negated_conjecture,
leq(multiplication(multiplication(esk3_0,esk1_0),c(esk4_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
multiplication(multiplication(esk3_0,addition(esk1_0,esk2_0)),c(esk4_0)) != zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_12]) ).
cnf(c_0_24,negated_conjecture,
multiplication(esk3_0,addition(X1,multiplication(esk2_0,c(esk4_0)))) = multiplication(esk3_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_12]) ).
cnf(c_0_25,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
multiplication(multiplication(esk3_0,esk1_0),c(esk4_0)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_22]),c_0_12]) ).
cnf(c_0_27,negated_conjecture,
multiplication(esk3_0,multiplication(addition(esk1_0,esk2_0),c(esk4_0))) != zero,
inference(rw,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_28,negated_conjecture,
multiplication(esk3_0,multiplication(addition(X1,esk2_0),c(esk4_0))) = multiplication(esk3_0,multiplication(X1,c(esk4_0))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
multiplication(esk3_0,multiplication(esk1_0,c(esk4_0))) = zero,
inference(rw,[status(thm)],[c_0_26,c_0_16]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE035+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 22:39:49 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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.14/0.47 % Version: 3.5.1
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 % Starting sh5l with 300s (1) cores
% 0.14/0.47 % new_bool_1 with pid 1069546 completed with status 0
% 0.14/0.47 % Result found by new_bool_1
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.47 % Search class: FGUSM-FFSS21-MFFFFFNN
% 0.14/0.47 % partial match(1): FGUSM-FFSS21-SFFFFFNN
% 0.14/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.47 % SubtermCWHack with pid 1069548 completed with status 0
% 0.14/0.47 % Result found by SubtermCWHack
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.47 % Search class: FGUSM-FFSS21-MFFFFFNN
% 0.14/0.47 % partial match(1): FGUSM-FFSS21-SFFFFFNN
% 0.14/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.47 % Preprocessing time : 0.001 s
% 0.14/0.47
% 0.14/0.47 % Proof found!
% 0.14/0.47 % SZS status Theorem
% 0.14/0.47 % SZS output start CNFRefutation
% See solution above
% 0.14/0.47 % Parsed axioms : 19
% 0.14/0.47 % Removed by relevancy pruning/SinE : 5
% 0.14/0.47 % Initial clauses : 19
% 0.14/0.47 % Removed in clause preprocessing : 0
% 0.14/0.47 % Initial clauses in saturation : 19
% 0.14/0.47 % Processed clauses : 409
% 0.14/0.47 % ...of these trivial : 117
% 0.14/0.47 % ...subsumed : 170
% 0.14/0.47 % ...remaining for further processing : 122
% 0.14/0.47 % Other redundant clauses eliminated : 0
% 0.14/0.47 % Clauses deleted for lack of memory : 0
% 0.14/0.47 % Backward-subsumed : 0
% 0.14/0.47 % Backward-rewritten : 10
% 0.14/0.47 % Generated clauses : 2717
% 0.14/0.47 % ...of the previous two non-redundant : 2247
% 0.14/0.47 % ...aggressively subsumed : 0
% 0.14/0.47 % Contextual simplify-reflections : 0
% 0.14/0.47 % Paramodulations : 2717
% 0.14/0.47 % Factorizations : 0
% 0.14/0.47 % NegExts : 0
% 0.14/0.47 % Equation resolutions : 0
% 0.14/0.47 % Disequality decompositions : 0
% 0.14/0.47 % Total rewrite steps : 2088
% 0.14/0.47 % ...of those cached : 1411
% 0.14/0.47 % Propositional unsat checks : 0
% 0.14/0.47 % Propositional check models : 0
% 0.14/0.47 % Propositional check unsatisfiable : 0
% 0.14/0.47 % Propositional clauses : 0
% 0.14/0.47 % Propositional clauses after purity: 0
% 0.14/0.47 % Propositional unsat core size : 0
% 0.14/0.47 % Propositional preprocessing time : 0.000
% 0.14/0.47 % Propositional encoding time : 0.000
% 0.14/0.47 % Propositional solver time : 0.000
% 0.14/0.47 % Success case prop preproc time : 0.000
% 0.14/0.47 % Success case prop encoding time : 0.000
% 0.14/0.47 % Success case prop solver time : 0.000
% 0.14/0.47 % Current number of processed clauses : 112
% 0.14/0.47 % Positive orientable unit clauses : 44
% 0.14/0.47 % Positive unorientable unit clauses: 4
% 0.14/0.47 % Negative unit clauses : 0
% 0.14/0.47 % Non-unit-clauses : 64
% 0.14/0.47 % Current number of unprocessed clauses: 1820
% 0.14/0.47 % ...number of literals in the above : 5007
% 0.14/0.47 % Current number of archived formulas : 0
% 0.14/0.47 % Current number of archived clauses : 10
% 0.14/0.47 % Clause-clause subsumption calls (NU) : 773
% 0.14/0.47 % Rec. Clause-clause subsumption calls : 773
% 0.14/0.47 % Non-unit clause-clause subsumptions : 90
% 0.14/0.47 % Unit Clause-clause subsumption calls : 7
% 0.14/0.47 % Rewrite failures with RHS unbound : 0
% 0.14/0.47 % BW rewrite match attempts : 63
% 0.14/0.47 % BW rewrite match successes : 37
% 0.14/0.47 % Condensation attempts : 0
% 0.14/0.47 % Condensation successes : 0
% 0.14/0.47 % Termbank termtop insertions : 41407
% 0.14/0.47 % Search garbage collected termcells : 157
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.037 s
% 0.14/0.47 % System time : 0.004 s
% 0.14/0.47 % Total time : 0.041 s
% 0.14/0.47 % Maximum resident set size: 3652 pages
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.038 s
% 0.14/0.47 % System time : 0.009 s
% 0.14/0.47 % Total time : 0.047 s
% 0.14/0.47 % Maximum resident set size: 4608 pages
% 0.14/0.47 % E exiting
%------------------------------------------------------------------------------