%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : KLE004+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 : 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:02 PM UTC 2026
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 20 unt; 0 def)
% Number of atoms : 68 ( 39 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 64 ( 29 ~; 24 |; 7 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 3 sgn 22 !; 1 ?)
% 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(goals,conjecture,
c(zero) = one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
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_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(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
fof(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_annihilation) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(c_0_8,plain,
! [X10,X11] :
( ( ~ test(X10)
| c(X10) = X11
| ~ complement(X10,X11) )
& ( ~ test(X10)
| complement(X10,X11)
| c(X10) != X11 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])])]) ).
fof(c_0_9,negated_conjecture,
c(zero) != one,
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_10,plain,
! [X13] : addition(X13,zero) = X13,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_11,plain,
! [X25,X26] : addition(X25,X26) = addition(X26,X25),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_12,plain,
! [X8,X9] :
( ( complement(X9,X8)
| addition(X8,X9) != one
| multiplication(X9,X8) != zero
| multiplication(X8,X9) != zero )
& ( ~ complement(X9,X8)
| addition(X8,X9) = one )
& ( ~ complement(X9,X8)
| multiplication(X9,X8) = zero )
& ( ~ complement(X9,X8)
| multiplication(X8,X9) = 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_13,plain,
( ~ test(X1)
| c(X1) != X2
| complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,negated_conjecture,
c(zero) != one,
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X31,X33,X34] :
( ( test(X33)
| ~ complement(X34,X33) )
& ( complement(esk1_1(X31),X31)
| ~ test(X31) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[test_1])])])])])]) ).
cnf(c_0_16,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ complement(X2,X1)
| addition(X1,X2) = one ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ test(X1)
| complement(X1,c(X1)) ),
inference(er,[status(thm)],[c_0_13]) ).
fof(c_0_20,negated_conjecture,
c(zero) != one,
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ complement(X1,X2)
| test(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( addition(X1,X2) != one
| multiplication(X2,X1) != zero
| multiplication(X1,X2) != zero
| complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_23,plain,
! [X14] : multiplication(X14,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
fof(c_0_24,plain,
! [X15] : multiplication(zero,X15) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_25,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,plain,
( ~ test(X1)
| addition(X1,c(X1)) = one ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]) ).
cnf(c_0_27,negated_conjecture,
c(zero) != one,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X1,X2) != one
| test(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
~ test(zero),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_32,plain,
$false,
inference(er,[status(thm)],[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_25]),c_0_29]),c_0_30])]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE004+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n016.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 22:42:22 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.16/0.46 % Version: 3.5.1
% 0.16/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 % Starting sh5l with 300s (1) cores
% 0.16/0.46 % new_bool_3 with pid 948210 completed with status 0
% 0.16/0.46 % Result found by new_bool_3
% 0.16/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 % Search class: FGUSM-FFSF21-SFFFFFNN
% 0.16/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.46 % SubtermCWHack with pid 948213 completed with status 0
% 0.16/0.46 % Result found by SubtermCWHack
% 0.16/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 % Search class: FGUSM-FFSF21-SFFFFFNN
% 0.16/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.46 % Preprocessing time : 0.001 s
% 0.16/0.46
% 0.16/0.46 % Proof found!
% 0.16/0.46 % SZS status Theorem
% 0.16/0.46 % SZS output start CNFRefutation
% See solution above
% 0.16/0.46 % Parsed axioms : 17
% 0.16/0.46 % Removed by relevancy pruning/SinE : 1
% 0.16/0.46 % Initial clauses : 21
% 0.16/0.46 % Removed in clause preprocessing : 0
% 0.16/0.46 % Initial clauses in saturation : 21
% 0.16/0.46 % Processed clauses : 253
% 0.16/0.46 % ...of these trivial : 6
% 0.16/0.46 % ...subsumed : 164
% 0.16/0.46 % ...remaining for further processing : 83
% 0.16/0.46 % Other redundant clauses eliminated : 4
% 0.16/0.46 % Clauses deleted for lack of memory : 0
% 0.16/0.46 % Backward-subsumed : 7
% 0.16/0.46 % Backward-rewritten : 2
% 0.16/0.46 % Generated clauses : 1593
% 0.16/0.46 % ...of the previous two non-redundant : 1236
% 0.16/0.46 % ...aggressively subsumed : 0
% 0.16/0.46 % Contextual simplify-reflections : 1
% 0.16/0.46 % Paramodulations : 1589
% 0.16/0.46 % Factorizations : 0
% 0.16/0.46 % NegExts : 0
% 0.16/0.46 % Equation resolutions : 4
% 0.16/0.46 % Disequality decompositions : 0
% 0.16/0.46 % Total rewrite steps : 1290
% 0.16/0.46 % ...of those cached : 866
% 0.16/0.46 % Propositional unsat checks : 0
% 0.16/0.46 % Propositional check models : 0
% 0.16/0.46 % Propositional check unsatisfiable : 0
% 0.16/0.46 % Propositional clauses : 0
% 0.16/0.46 % Propositional clauses after purity: 0
% 0.16/0.46 % Propositional unsat core size : 0
% 0.16/0.46 % Propositional preprocessing time : 0.000
% 0.16/0.46 % Propositional encoding time : 0.000
% 0.16/0.46 % Propositional solver time : 0.000
% 0.16/0.46 % Success case prop preproc time : 0.000
% 0.16/0.46 % Success case prop encoding time : 0.000
% 0.16/0.46 % Success case prop solver time : 0.000
% 0.16/0.46 % Current number of processed clauses : 73
% 0.16/0.46 % Positive orientable unit clauses : 18
% 0.16/0.46 % Positive unorientable unit clauses: 4
% 0.16/0.46 % Negative unit clauses : 4
% 0.16/0.46 % Non-unit-clauses : 47
% 0.16/0.46 % Current number of unprocessed clauses: 980
% 0.16/0.46 % ...number of literals in the above : 1899
% 0.16/0.46 % Current number of archived formulas : 0
% 0.16/0.46 % Current number of archived clauses : 9
% 0.16/0.46 % Clause-clause subsumption calls (NU) : 535
% 0.16/0.46 % Rec. Clause-clause subsumption calls : 433
% 0.16/0.46 % Non-unit clause-clause subsumptions : 92
% 0.16/0.46 % Unit Clause-clause subsumption calls : 14
% 0.16/0.46 % Rewrite failures with RHS unbound : 0
% 0.16/0.46 % BW rewrite match attempts : 59
% 0.16/0.46 % BW rewrite match successes : 43
% 0.16/0.46 % Condensation attempts : 0
% 0.16/0.46 % Condensation successes : 0
% 0.16/0.46 % Termbank termtop insertions : 14958
% 0.16/0.46 % Search garbage collected termcells : 121
% 0.16/0.46
% 0.16/0.46 % -------------------------------------------------
% 0.16/0.46 % User time : 0.021 s
% 0.16/0.46 % System time : 0.002 s
% 0.16/0.46 % Total time : 0.022 s
% 0.16/0.46 % Maximum resident set size: 3648 pages
% 0.16/0.46
% 0.16/0.46 % -------------------------------------------------
% 0.16/0.46 % User time : 0.022 s
% 0.16/0.46 % System time : 0.007 s
% 0.16/0.46 % Total time : 0.029 s
% 0.16/0.46 % Maximum resident set size: 4608 pages
% 0.16/0.46 % E exiting
%------------------------------------------------------------------------------