%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KLE034+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 : n002.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:10 PM UTC 2026
% Result : Theorem 0.26s 0.68s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 50 ( 35 unt; 0 def)
% Number of atoms : 95 ( 47 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 69 ( 24 ~; 19 |; 20 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 68 ( 2 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6,X7,X8] :
( ( leq(multiplication(multiplication(X7,X5),c(X8)),zero)
& leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& test(X8)
& test(X6)
& test(X7) )
=> leq(multiplication(multiplication(multiplication(X6,X4),X5),c(X8)),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
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(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(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(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(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
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_10,negated_conjecture,
~ ! [X4,X5,X6,X7,X8] :
( ( leq(multiplication(multiplication(X7,X5),c(X8)),zero)
& leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& test(X8)
& test(X6)
& test(X7) )
=> leq(multiplication(multiplication(multiplication(X6,X4),X5),c(X8)),zero) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_11,negated_conjecture,
( ~ leq(multiplication(multiplication(multiplication(esk4_0,esk2_0),esk3_0),c(esk6_0)),zero)
& leq(multiplication(multiplication(esk5_0,esk3_0),c(esk6_0)),zero)
& leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero)
& test(esk6_0)
& test(esk4_0)
& test(esk5_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_12,plain,
! [X16,X17,X18] : multiplication(X16,multiplication(X17,X18)) = multiplication(multiplication(X16,X17),X18),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_13,plain,
! [X29,X30] :
( ( leq(X29,X30)
| addition(X29,X30) != X30 )
& ( addition(X29,X30) = X30
| ~ leq(X29,X30) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
cnf(c_0_14,negated_conjecture,
leq(multiplication(multiplication(esk5_0,esk3_0),c(esk6_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ leq(X1,X2)
| addition(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
leq(multiplication(esk5_0,multiplication(esk3_0,c(esk6_0))),zero),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_19,plain,
! [X14] : addition(X14,zero) = X14,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_20,plain,
! [X9,X10] : addition(X9,X10) = addition(X10,X9),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_21,plain,
! [X37,X38] :
( ( ~ test(X37)
| c(X37) = X38
| ~ complement(X37,X38) )
& ( ~ test(X37)
| complement(X37,X38)
| c(X37) != X38 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])])]) ).
cnf(c_0_22,negated_conjecture,
leq(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero),
inference(rw,[status(thm)],[c_0_16,c_0_15]) ).
fof(c_0_23,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_24,negated_conjecture,
addition(multiplication(esk5_0,multiplication(esk3_0,c(esk6_0))),zero) = zero,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_27,plain,
! [X35,X36] :
( ( complement(X36,X35)
| addition(X35,X36) != one
| multiplication(X36,X35) != zero
| multiplication(X35,X36) != zero )
& ( ~ complement(X36,X35)
| addition(X35,X36) = one )
& ( ~ complement(X36,X35)
| multiplication(X36,X35) = zero )
& ( ~ complement(X36,X35)
| multiplication(X35,X36) = 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_28,plain,
( ~ test(X1)
| c(X1) != X2
| complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
addition(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero) = zero,
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
fof(c_0_30,plain,
! [X28] : multiplication(zero,X28) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_31,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,negated_conjecture,
multiplication(esk5_0,multiplication(esk3_0,c(esk6_0))) = zero,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
( ~ complement(X2,X1)
| addition(X1,X2) = one ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
( ~ test(X1)
| complement(X1,c(X1)) ),
inference(er,[status(thm)],[c_0_28]) ).
fof(c_0_36,plain,
! [X20] : multiplication(one,X20) = X20,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_37,negated_conjecture,
~ leq(multiplication(multiplication(multiplication(esk4_0,esk2_0),esk3_0),c(esk6_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_38,negated_conjecture,
multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))) = zero,
inference(rw,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_39,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,negated_conjecture,
multiplication(addition(esk5_0,X1),multiplication(esk3_0,c(esk6_0))) = multiplication(X1,multiplication(esk3_0,c(esk6_0))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_41,plain,
( ~ test(X1)
| addition(X1,c(X1)) = one ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_26]) ).
cnf(c_0_42,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,negated_conjecture,
test(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_44,negated_conjecture,
~ leq(multiplication(esk4_0,multiplication(esk2_0,multiplication(esk3_0,c(esk6_0)))),zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_15]),c_0_15]) ).
cnf(c_0_45,plain,
( addition(X1,X2) != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_46,negated_conjecture,
multiplication(esk4_0,multiplication(esk2_0,multiplication(c(esk5_0),X1))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_38]),c_0_39]),c_0_15]) ).
cnf(c_0_47,negated_conjecture,
multiplication(c(esk5_0),multiplication(esk3_0,c(esk6_0))) = multiplication(esk3_0,c(esk6_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_48,negated_conjecture,
multiplication(esk4_0,multiplication(esk2_0,multiplication(esk3_0,c(esk6_0)))) != zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_25]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE034+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n002.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Sun Sep 20 22:42:16 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.54 Running first-order theorem proving
% 0.18/0.54 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.26/0.68 % Version: 3.5.1
% 0.26/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.68 % Starting sh5l with 300s (1) cores
% 0.26/0.68 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1859809 completed with status 0
% 0.26/0.68 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.68 % No SInE strategy applied
% 0.26/0.68 % Search class: FGUSM-FFMS21-MFFFFFNN
% 0.26/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.68 % Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 136s (1) cores
% 0.26/0.68 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.68 % Starting new_bool_1 with 136s (1) cores
% 0.26/0.68 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1859814 completed with status 0
% 0.26/0.68 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.68 % No SInE strategy applied
% 0.26/0.68 % Search class: FGUSM-FFMS21-MFFFFFNN
% 0.26/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.68 % Preprocessing time : 0.002 s
% 0.26/0.68 % Presaturation interreduction done
% 0.26/0.68
% 0.26/0.68 % Proof found!
% 0.26/0.68 % SZS status Theorem
% 0.26/0.68 % SZS output start CNFRefutation
% See solution above
% 0.26/0.68 % Parsed axioms : 17
% 0.26/0.68 % Removed by relevancy pruning/SinE : 0
% 0.26/0.68 % Initial clauses : 28
% 0.26/0.68 % Removed in clause preprocessing : 0
% 0.26/0.68 % Initial clauses in saturation : 28
% 0.26/0.68 % Processed clauses : 510
% 0.26/0.68 % ...of these trivial : 30
% 0.26/0.68 % ...subsumed : 222
% 0.26/0.68 % ...remaining for further processing : 258
% 0.26/0.68 % Other redundant clauses eliminated : 26
% 0.26/0.68 % Clauses deleted for lack of memory : 0
% 0.26/0.68 % Backward-subsumed : 17
% 0.26/0.68 % Backward-rewritten : 26
% 0.26/0.68 % Generated clauses : 3589
% 0.26/0.68 % ...of the previous two non-redundant : 2245
% 0.26/0.68 % ...aggressively subsumed : 0
% 0.26/0.68 % Contextual simplify-reflections : 16
% 0.26/0.68 % Paramodulations : 3563
% 0.26/0.68 % Factorizations : 0
% 0.26/0.68 % NegExts : 0
% 0.26/0.68 % Equation resolutions : 26
% 0.26/0.68 % Disequality decompositions : 0
% 0.26/0.68 % Total rewrite steps : 4523
% 0.26/0.68 % ...of those cached : 3469
% 0.26/0.68 % Propositional unsat checks : 0
% 0.26/0.68 % Propositional check models : 0
% 0.26/0.68 % Propositional check unsatisfiable : 0
% 0.26/0.68 % Propositional clauses : 0
% 0.26/0.68 % Propositional clauses after purity: 0
% 0.26/0.68 % Propositional unsat core size : 0
% 0.26/0.68 % Propositional preprocessing time : 0.000
% 0.26/0.68 % Propositional encoding time : 0.000
% 0.26/0.68 % Propositional solver time : 0.000
% 0.26/0.68 % Success case prop preproc time : 0.000
% 0.26/0.68 % Success case prop encoding time : 0.000
% 0.26/0.68 % Success case prop solver time : 0.000
% 0.26/0.68 % Current number of processed clauses : 186
% 0.26/0.68 % Positive orientable unit clauses : 79
% 0.26/0.68 % Positive unorientable unit clauses: 3
% 0.26/0.68 % Negative unit clauses : 4
% 0.26/0.68 % Non-unit-clauses : 100
% 0.26/0.68 % Current number of unprocessed clauses: 1742
% 0.26/0.68 % ...number of literals in the above : 3136
% 0.26/0.68 % Current number of archived formulas : 0
% 0.26/0.68 % Current number of archived clauses : 71
% 0.26/0.68 % Clause-clause subsumption calls (NU) : 2220
% 0.26/0.68 % Rec. Clause-clause subsumption calls : 1593
% 0.26/0.68 % Non-unit clause-clause subsumptions : 222
% 0.26/0.68 % Unit Clause-clause subsumption calls : 154
% 0.26/0.68 % Rewrite failures with RHS unbound : 0
% 0.26/0.68 % BW rewrite match attempts : 79
% 0.26/0.68 % BW rewrite match successes : 41
% 0.26/0.68 % Condensation attempts : 0
% 0.26/0.68 % Condensation successes : 0
% 0.26/0.68 % Termbank termtop insertions : 43183
% 0.26/0.68 % Search garbage collected termcells : 224
% 0.26/0.68
% 0.26/0.68 % -------------------------------------------------
% 0.26/0.68 % User time : 0.088 s
% 0.26/0.68 % System time : 0.012 s
% 0.26/0.68 % Total time : 0.100 s
% 0.26/0.68 % Maximum resident set size: 3652 pages
% 0.26/0.68
% 0.26/0.68 % -------------------------------------------------
% 0.26/0.68 % User time : 0.383 s
% 0.26/0.68 % System time : 0.043 s
% 0.26/0.68 % Total time : 0.426 s
% 0.26/0.68 % Maximum resident set size: 4864 pages
% 0.26/0.68 % E exiting
%------------------------------------------------------------------------------