%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE025+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 : 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:39 PM UTC 2026
% Result : Theorem 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 23 unt; 0 def)
% Number of atoms : 67 ( 42 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 52 ( 19 ~; 15 |; 11 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 1 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 : 52 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X6)
& test(X5) )
=> ( multiplication(multiplication(X5,X4),c(X6)) = zero
=> multiplication(X5,X4) = multiplication(multiplication(X5,X4),X6) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
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(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(c_0_8,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X6)
& test(X5) )
=> ( multiplication(multiplication(X5,X4),c(X6)) = zero
=> multiplication(X5,X4) = multiplication(multiplication(X5,X4),X6) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_9,negated_conjecture,
( multiplication(esk3_0,esk2_0) != multiplication(multiplication(esk3_0,esk2_0),esk4_0)
& multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) = zero
& test(esk4_0)
& test(esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_10,plain,
! [X14,X15,X16] : multiplication(X14,multiplication(X15,X16)) = multiplication(multiplication(X14,X15),X16),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_11,plain,
! [X19,X20,X21] : multiplication(X19,addition(X20,X21)) = addition(multiplication(X19,X20),multiplication(X19,X21)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_12,negated_conjecture,
multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)) = zero,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X12] : addition(X12,zero) = X12,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_15,plain,
! [X35,X36] :
( ( ~ test(X35)
| c(X35) = X36
| ~ complement(X35,X36) )
& ( ~ test(X35)
| complement(X35,X36)
| c(X35) != X36 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])])]) ).
cnf(c_0_16,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,c(esk4_0))) = zero,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X33,X34] :
( ( complement(X34,X33)
| addition(X33,X34) != one
| multiplication(X34,X33) != zero
| multiplication(X33,X34) != zero )
& ( ~ complement(X34,X33)
| addition(X33,X34) = one )
& ( ~ complement(X34,X33)
| multiplication(X34,X33) = zero )
& ( ~ complement(X34,X33)
| multiplication(X33,X34) = 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_20,plain,
( ~ test(X1)
| c(X1) != X2
| complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_22,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_16,c_0_17]),c_0_18]) ).
cnf(c_0_23,plain,
( ~ complement(X2,X1)
| addition(X1,X2) = one ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( ~ test(X1)
| complement(X1,c(X1)) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_26,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_27,negated_conjecture,
multiplication(esk3_0,esk2_0) != multiplication(multiplication(esk3_0,esk2_0),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,addition(X1,c(esk4_0)))) = multiplication(esk3_0,multiplication(esk2_0,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_29,plain,
( ~ test(X1)
| addition(X1,c(X1)) = one ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
test(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,esk4_0)) != multiplication(esk3_0,esk2_0),
inference(rw,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE025+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n014.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sun Sep 20 22:39:19 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.42 % Version: 3.5.1
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 % Starting sh5l with 300s (1) cores
% 0.14/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2514188 completed with status 0
% 0.14/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGUSM-FFMS21-SFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.42 % new_bool_1 with pid 2514196 completed with status 0
% 0.14/0.42 % Result found by new_bool_1
% 0.14/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGUSM-FFMS21-SFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.42 % Preprocessing time : 0.001 s
% 0.14/0.42 % Presaturation interreduction done
% 0.14/0.42
% 0.14/0.42 % Proof found!
% 0.14/0.42 % SZS status Theorem
% 0.14/0.42 % SZS output start CNFRefutation
% See solution above
% 0.14/0.42 % Parsed axioms : 19
% 0.14/0.42 % Removed by relevancy pruning/SinE : 0
% 0.14/0.42 % Initial clauses : 28
% 0.14/0.42 % Removed in clause preprocessing : 0
% 0.14/0.42 % Initial clauses in saturation : 28
% 0.14/0.42 % Processed clauses : 135
% 0.14/0.42 % ...of these trivial : 5
% 0.14/0.42 % ...subsumed : 25
% 0.14/0.42 % ...remaining for further processing : 105
% 0.14/0.42 % Other redundant clauses eliminated : 8
% 0.14/0.42 % Clauses deleted for lack of memory : 0
% 0.14/0.42 % Backward-subsumed : 0
% 0.14/0.42 % Backward-rewritten : 4
% 0.14/0.42 % Generated clauses : 502
% 0.14/0.42 % ...of the previous two non-redundant : 313
% 0.14/0.42 % ...aggressively subsumed : 0
% 0.14/0.42 % Contextual simplify-reflections : 4
% 0.14/0.42 % Paramodulations : 494
% 0.14/0.42 % Factorizations : 0
% 0.14/0.42 % NegExts : 0
% 0.14/0.42 % Equation resolutions : 8
% 0.14/0.42 % Disequality decompositions : 0
% 0.14/0.42 % Total rewrite steps : 588
% 0.14/0.42 % ...of those cached : 423
% 0.14/0.42 % Propositional unsat checks : 0
% 0.14/0.42 % Propositional check models : 0
% 0.14/0.42 % Propositional check unsatisfiable : 0
% 0.14/0.42 % Propositional clauses : 0
% 0.14/0.42 % Propositional clauses after purity: 0
% 0.14/0.42 % Propositional unsat core size : 0
% 0.14/0.42 % Propositional preprocessing time : 0.000
% 0.14/0.42 % Propositional encoding time : 0.000
% 0.14/0.42 % Propositional solver time : 0.000
% 0.14/0.42 % Success case prop preproc time : 0.000
% 0.14/0.42 % Success case prop encoding time : 0.000
% 0.14/0.42 % Success case prop solver time : 0.000
% 0.14/0.42 % Current number of processed clauses : 72
% 0.14/0.42 % Positive orientable unit clauses : 28
% 0.14/0.42 % Positive unorientable unit clauses: 1
% 0.14/0.42 % Negative unit clauses : 1
% 0.14/0.42 % Non-unit-clauses : 42
% 0.14/0.42 % Current number of unprocessed clauses: 224
% 0.14/0.42 % ...number of literals in the above : 584
% 0.14/0.42 % Current number of archived formulas : 0
% 0.14/0.42 % Current number of archived clauses : 32
% 0.14/0.42 % Clause-clause subsumption calls (NU) : 315
% 0.14/0.42 % Rec. Clause-clause subsumption calls : 312
% 0.14/0.42 % Non-unit clause-clause subsumptions : 29
% 0.14/0.42 % Unit Clause-clause subsumption calls : 14
% 0.14/0.42 % Rewrite failures with RHS unbound : 0
% 0.14/0.42 % BW rewrite match attempts : 20
% 0.14/0.42 % BW rewrite match successes : 16
% 0.14/0.42 % Condensation attempts : 0
% 0.14/0.42 % Condensation successes : 0
% 0.14/0.42 % Termbank termtop insertions : 7057
% 0.14/0.42 % Search garbage collected termcells : 216
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.006 s
% 0.14/0.42 % System time : 0.004 s
% 0.14/0.42 % Total time : 0.010 s
% 0.14/0.42 % Maximum resident set size: 3652 pages
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.033 s
% 0.14/0.42 % System time : 0.016 s
% 0.14/0.42 % Total time : 0.049 s
% 0.14/0.42 % Maximum resident set size: 4608 pages
% 0.14/0.42 % E exiting
%------------------------------------------------------------------------------