%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE129+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 : n004.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:54 PM UTC 2026
% Result : Theorem 0.22s 0.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 16 unt; 0 def)
% Number of atoms : 34 ( 33 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 8 ~; 4 |; 1 &)
% ( 0 <=>; 4 =>; 2 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4] :
( divergence(X4) = zero
<= ! [X5] :
( addition(domain(X5),forward_diamond(X4,domain(X5))) = forward_diamond(X4,domain(X5))
=> domain(X5) = zero ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(forward_diamond,axiom,
! [X4,X5] : forward_diamond(X4,X5) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+6.ax',forward_diamond) ).
fof(domain4,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain4) ).
fof(divergence1,axiom,
! [X4] : forward_diamond(X4,divergence(X4)) = divergence(X4),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+7.ax',divergence1) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(c_0_5,negated_conjecture,
~ ! [X4] :
( divergence(X4) = zero
<= ! [X5] :
( addition(domain(X5),forward_diamond(X4,domain(X5))) = forward_diamond(X4,domain(X5))
=> domain(X5) = zero ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_6,negated_conjecture,
~ ! [X4] :
( ! [X5] :
( addition(domain(X5),forward_diamond(X4,domain(X5))) = forward_diamond(X4,domain(X5))
=> domain(X5) = zero )
=> divergence(X4) = zero ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X42,X43] : forward_diamond(X42,X43) = domain(multiplication(X42,domain(X43))),
inference(variable_rename,[status(thm)],[forward_diamond]) ).
fof(c_0_8,plain,
! [X33] : domain(X33) = antidomain(antidomain(X33)),
inference(variable_rename,[status(thm)],[domain4]) ).
fof(c_0_9,negated_conjecture,
! [X55] :
( divergence(esk1_0) != zero
& ( domain(X55) = zero
| addition(domain(X55),forward_diamond(esk1_0,domain(X55))) != forward_diamond(esk1_0,domain(X55)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
cnf(c_0_10,plain,
forward_diamond(X1,X2) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X50] : forward_diamond(X50,divergence(X50)) = divergence(X50),
inference(variable_rename,[status(thm)],[divergence1]) ).
cnf(c_0_13,negated_conjecture,
( addition(domain(X1),forward_diamond(esk1_0,domain(X1))) != forward_diamond(esk1_0,domain(X1))
| domain(X1) = zero ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
forward_diamond(X1,X2) = antidomain(antidomain(multiplication(X1,antidomain(antidomain(X2))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
cnf(c_0_15,plain,
forward_diamond(X1,divergence(X1)) = divergence(X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( addition(antidomain(antidomain(X1)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1)))))))) != antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1)))))))
| antidomain(antidomain(X1)) = zero ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_11]),c_0_11]),c_0_11]),c_0_14]),c_0_14]) ).
cnf(c_0_17,plain,
antidomain(antidomain(multiplication(X1,antidomain(antidomain(divergence(X1)))))) = divergence(X1),
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
fof(c_0_18,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_19,negated_conjecture,
( addition(divergence(X1),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(divergence(X1))))))) != antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(divergence(X1))))))
| divergence(X1) = zero ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
divergence(esk1_0) != zero,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_20])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE129+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n004.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 20 22:45:07 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.46 Running first-order theorem proving
% 0.16/0.46 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.22/0.55 % Version: 3.5.1
% 0.22/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.55 % Starting sh5l with 300s (1) cores
% 0.22/0.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1654542 completed with status 0
% 0.22/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.55 % No SInE strategy applied
% 0.22/0.55 % Search class: FHUSM-FFMF21-DFFFFFNN
% 0.22/0.55 % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.22/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.55 % Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_S0Y with 212s (1) cores
% 0.22/0.55 % Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 0.22/0.55 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.22/0.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1654547 completed with status 0
% 0.22/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.55 % No SInE strategy applied
% 0.22/0.55 % Search class: FHUSM-FFMF21-DFFFFFNN
% 0.22/0.55 % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.22/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.55 % Preprocessing time : 0.002 s
% 0.22/0.55 % Presaturation interreduction done
% 0.22/0.55
% 0.22/0.55 % Proof found!
% 0.22/0.55 % SZS status Theorem
% 0.22/0.55 % SZS output start CNFRefutation
% See solution above
% 0.22/0.55 % Parsed axioms : 29
% 0.22/0.55 % Removed by relevancy pruning/SinE : 0
% 0.22/0.55 % Initial clauses : 31
% 0.22/0.55 % Removed in clause preprocessing : 8
% 0.22/0.55 % Initial clauses in saturation : 23
% 0.22/0.55 % Processed clauses : 123
% 0.22/0.55 % ...of these trivial : 22
% 0.22/0.55 % ...subsumed : 16
% 0.22/0.55 % ...remaining for further processing : 85
% 0.22/0.55 % Other redundant clauses eliminated : 0
% 0.22/0.55 % Clauses deleted for lack of memory : 0
% 0.22/0.55 % Backward-subsumed : 0
% 0.22/0.55 % Backward-rewritten : 7
% 0.22/0.55 % Generated clauses : 644
% 0.22/0.55 % ...of the previous two non-redundant : 417
% 0.22/0.55 % ...aggressively subsumed : 0
% 0.22/0.55 % Contextual simplify-reflections : 0
% 0.22/0.55 % Paramodulations : 644
% 0.22/0.55 % Factorizations : 0
% 0.22/0.55 % NegExts : 0
% 0.22/0.55 % Equation resolutions : 0
% 0.22/0.55 % Disequality decompositions : 0
% 0.22/0.55 % Total rewrite steps : 898
% 0.22/0.55 % ...of those cached : 663
% 0.22/0.55 % Propositional unsat checks : 0
% 0.22/0.55 % Propositional check models : 0
% 0.22/0.55 % Propositional check unsatisfiable : 0
% 0.22/0.55 % Propositional clauses : 0
% 0.22/0.55 % Propositional clauses after purity: 0
% 0.22/0.55 % Propositional unsat core size : 0
% 0.22/0.55 % Propositional preprocessing time : 0.000
% 0.22/0.55 % Propositional encoding time : 0.000
% 0.22/0.55 % Propositional solver time : 0.000
% 0.22/0.55 % Success case prop preproc time : 0.000
% 0.22/0.55 % Success case prop encoding time : 0.000
% 0.22/0.55 % Success case prop solver time : 0.000
% 0.22/0.55 % Current number of processed clauses : 55
% 0.22/0.55 % Positive orientable unit clauses : 44
% 0.22/0.55 % Positive unorientable unit clauses: 3
% 0.22/0.55 % Negative unit clauses : 1
% 0.22/0.55 % Non-unit-clauses : 7
% 0.22/0.55 % Current number of unprocessed clauses: 335
% 0.22/0.55 % ...number of literals in the above : 373
% 0.22/0.55 % Current number of archived formulas : 0
% 0.22/0.55 % Current number of archived clauses : 38
% 0.22/0.55 % Clause-clause subsumption calls (NU) : 2
% 0.22/0.55 % Rec. Clause-clause subsumption calls : 2
% 0.22/0.55 % Non-unit clause-clause subsumptions : 1
% 0.22/0.55 % Unit Clause-clause subsumption calls : 6
% 0.22/0.55 % Rewrite failures with RHS unbound : 0
% 0.22/0.55 % BW rewrite match attempts : 77
% 0.22/0.55 % BW rewrite match successes : 46
% 0.22/0.55 % Condensation attempts : 0
% 0.22/0.55 % Condensation successes : 0
% 0.22/0.55 % Termbank termtop insertions : 8870
% 0.22/0.55 % Search garbage collected termcells : 82
% 0.22/0.55
% 0.22/0.55 % -------------------------------------------------
% 0.22/0.55 % User time : 0.018 s
% 0.22/0.55 % System time : 0.005 s
% 0.22/0.55 % Total time : 0.023 s
% 0.22/0.55 % Maximum resident set size: 3612 pages
% 0.22/0.55
% 0.22/0.55 % -------------------------------------------------
% 0.22/0.55 % User time : 0.068 s
% 0.22/0.55 % System time : 0.022 s
% 0.22/0.55 % Total time : 0.090 s
% 0.22/0.55 % Maximum resident set size: 4864 pages
% 0.22/0.55 % E exiting
%------------------------------------------------------------------------------