%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE066+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 : n018.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:46 PM UTC 2026
% Result : Theorem 0.30s 0.65s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 18 unt; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 4 ~; 0 |; 1 &)
% ( 0 <=>; 1 =>; 2 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 1 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( multiplication(X4,X5) = zero
<= multiplication(X4,domain(X5)) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain2) ).
fof(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(domain4,axiom,
domain(zero) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain4) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(c_0_6,negated_conjecture,
~ ! [X4,X5] :
( multiplication(X4,X5) = zero
<= multiplication(X4,domain(X5)) = zero ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,negated_conjecture,
~ ! [X4,X5] :
( multiplication(X4,domain(X5)) = zero
=> multiplication(X4,X5) = zero ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X23,X24] : domain(multiplication(X23,X24)) = domain(multiplication(X23,domain(X24))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_9,negated_conjecture,
( multiplication(esk1_0,esk2_0) != zero
& multiplication(esk1_0,domain(esk2_0)) = zero ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,plain,
! [X22] : addition(X22,multiplication(domain(X22),X22)) = multiplication(domain(X22),X22),
inference(variable_rename,[status(thm)],[domain1]) ).
cnf(c_0_11,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
multiplication(esk1_0,domain(esk2_0)) = zero,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
domain(zero) = zero,
inference(split_conjunct,[status(thm)],[domain4]) ).
fof(c_0_14,plain,
! [X10] : multiplication(zero,X10) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_15,plain,
! [X8] : addition(X8,zero) = X8,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_16,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
domain(multiplication(esk1_0,esk2_0)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_18,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
multiplication(esk1_0,esk2_0) != zero,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_18]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KLE066+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.52 % Computer : n018.cluster.edu
% 0.21/0.52 % Model : x86_64 x86_64
% 0.21/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.52 % Memory : 8046.5625MB
% 0.21/0.52 % OS : Linux 6.8.0-71-generic
% 0.21/0.52 % CPULimit : 300
% 0.21/0.52 % WCLimit : 300
% 0.21/0.52 % DateTime : Sun Sep 20 22:43:43 UTC 2026
% 0.21/0.53 % CPUTime :
% 0.21/0.53 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.60 Running first-order theorem proving
% 0.21/0.60 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.30/0.65 % Version: 3.5.1
% 0.30/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.65 % Starting sh5l with 300s (1) cores
% 0.30/0.65 % sh5l with pid 356502 completed with status 0
% 0.30/0.65 % Result found by sh5l
% 0.30/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.65 % Starting sh5l with 300s (1) cores
% 0.30/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.30/0.65 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.30/0.65 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.30/0.65 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.65 % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.65 % SubtermCWHack with pid 356503 completed with status 0
% 0.30/0.65 % Result found by SubtermCWHack
% 0.30/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.65 % Starting sh5l with 300s (1) cores
% 0.30/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.30/0.65 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.30/0.65 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.30/0.65 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.65 % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.65 % Preprocessing time : 0.002 s
% 0.30/0.65
% 0.30/0.65 % Proof found!
% 0.30/0.65 % SZS status Theorem
% 0.30/0.65 % SZS output start CNFRefutation
% See solution above
% 0.30/0.65 % Parsed axioms : 18
% 0.30/0.65 % Removed by relevancy pruning/SinE : 1
% 0.30/0.65 % Initial clauses : 18
% 0.30/0.65 % Removed in clause preprocessing : 0
% 0.30/0.65 % Initial clauses in saturation : 18
% 0.30/0.65 % Processed clauses : 22
% 0.30/0.65 % ...of these trivial : 1
% 0.30/0.65 % ...subsumed : 2
% 0.30/0.65 % ...remaining for further processing : 19
% 0.30/0.65 % Other redundant clauses eliminated : 0
% 0.30/0.65 % Clauses deleted for lack of memory : 0
% 0.30/0.65 % Backward-subsumed : 0
% 0.30/0.65 % Backward-rewritten : 1
% 0.30/0.65 % Generated clauses : 45
% 0.30/0.65 % ...of the previous two non-redundant : 20
% 0.30/0.65 % ...aggressively subsumed : 0
% 0.30/0.65 % Contextual simplify-reflections : 0
% 0.30/0.65 % Paramodulations : 45
% 0.30/0.65 % Factorizations : 0
% 0.30/0.65 % NegExts : 0
% 0.30/0.65 % Equation resolutions : 0
% 0.30/0.65 % Disequality decompositions : 0
% 0.30/0.65 % Total rewrite steps : 46
% 0.30/0.65 % ...of those cached : 21
% 0.30/0.65 % Propositional unsat checks : 0
% 0.30/0.65 % Propositional check models : 0
% 0.30/0.65 % Propositional check unsatisfiable : 0
% 0.30/0.65 % Propositional clauses : 0
% 0.30/0.65 % Propositional clauses after purity: 0
% 0.30/0.65 % Propositional unsat core size : 0
% 0.30/0.65 % Propositional preprocessing time : 0.000
% 0.30/0.65 % Propositional encoding time : 0.000
% 0.30/0.65 % Propositional solver time : 0.000
% 0.30/0.65 % Success case prop preproc time : 0.000
% 0.30/0.65 % Success case prop encoding time : 0.000
% 0.30/0.65 % Success case prop solver time : 0.000
% 0.30/0.65 % Current number of processed clauses : 18
% 0.30/0.65 % Positive orientable unit clauses : 16
% 0.30/0.65 % Positive unorientable unit clauses: 1
% 0.30/0.65 % Negative unit clauses : 1
% 0.30/0.65 % Non-unit-clauses : 0
% 0.30/0.65 % Current number of unprocessed clauses: 14
% 0.30/0.65 % ...number of literals in the above : 14
% 0.30/0.65 % Current number of archived formulas : 0
% 0.30/0.65 % Current number of archived clauses : 1
% 0.30/0.65 % Clause-clause subsumption calls (NU) : 0
% 0.30/0.65 % Rec. Clause-clause subsumption calls : 0
% 0.30/0.65 % Non-unit clause-clause subsumptions : 0
% 0.30/0.65 % Unit Clause-clause subsumption calls : 0
% 0.30/0.65 % Rewrite failures with RHS unbound : 0
% 0.30/0.65 % BW rewrite match attempts : 7
% 0.30/0.65 % BW rewrite match successes : 6
% 0.30/0.65 % Condensation attempts : 0
% 0.30/0.65 % Condensation successes : 0
% 0.30/0.65 % Termbank termtop insertions : 1008
% 0.30/0.65 % Search garbage collected termcells : 33
% 0.30/0.65
% 0.30/0.65 % -------------------------------------------------
% 0.30/0.65 % User time : 0.006 s
% 0.30/0.65 % System time : 0.004 s
% 0.30/0.65 % Total time : 0.010 s
% 0.30/0.65 % Maximum resident set size: 3648 pages
% 0.30/0.65
% 0.30/0.65 % -------------------------------------------------
% 0.30/0.65 % User time : 0.009 s
% 0.30/0.65 % System time : 0.009 s
% 0.30/0.65 % Total time : 0.018 s
% 0.30/0.65 % Maximum resident set size: 4608 pages
% 0.30/0.65 % E exiting
%------------------------------------------------------------------------------