%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ROB015-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 02:06:44 PM UTC 2026
% Result : Unsatisfiable 43.69s 6.89s
% Output : CNFRefutation 43.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 12 RR)
% Number of literals : 31 ( 30 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-4 aty)
% Number of variables : 55 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(lemma_3_2,axiom,
ifeq4(negate(add(X1,negate(add(X2,X3)))),negate(add(X2,negate(add(X1,X3)))),X1,X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_3_2) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_add) ).
cnf(lemma_3_4,axiom,
ifeq2(positive_integer(X1),true,ifeq4(negate(add(X2,negate(X3))),X4,negate(add(X2,negate(add(X3,multiply(X1,add(X2,X4)))))),X4),X4) = X4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_3_4) ).
cnf(ifeq_axiom,axiom,
ifeq4(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(k_positive,axiom,
positive_integer(k) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_positive) ).
cnf(ifeq_axiom_002,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_002) ).
cnf(condition,hypothesis,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condition) ).
cnf(goal,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(base_step,axiom,
ifeq3(negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))),negate(e),a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',base_step) ).
cnf(ifeq_axiom_001,axiom,
ifeq3(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(c_0_10,axiom,
ifeq4(negate(add(X1,negate(add(X2,X3)))),negate(add(X2,negate(add(X1,X3)))),X1,X2) = X2,
lemma_3_2 ).
cnf(c_0_11,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_12,axiom,
ifeq2(positive_integer(X1),true,ifeq4(negate(add(X2,negate(X3))),X4,negate(add(X2,negate(add(X3,multiply(X1,add(X2,X4)))))),X4),X4) = X4,
lemma_3_4 ).
cnf(c_0_13,axiom,
ifeq4(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_14,plain,
ifeq4(negate(add(X1,negate(add(X2,X3)))),negate(add(X2,negate(add(X3,X1)))),X1,X2) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
ifeq2(positive_integer(X1),true,negate(add(X2,negate(add(X3,multiply(X1,add(X2,negate(add(X2,negate(X3))))))))),negate(add(X2,negate(X3)))) = negate(add(X2,negate(X3))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
positive_integer(k) = true,
k_positive ).
cnf(c_0_17,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom_002 ).
cnf(c_0_18,plain,
ifeq4(negate(add(X1,negate(add(X2,X3)))),negate(add(negate(add(X3,X1)),X2)),X1,X2) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_19,plain,
negate(add(X1,negate(add(X2,multiply(k,add(X1,negate(add(X1,negate(X2))))))))) = negate(add(X1,negate(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,plain,
ifeq4(negate(add(X1,negate(add(X2,X3)))),negate(add(negate(add(X2,X1)),X3)),X1,X3) = X3,
inference(spm,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_21,plain,
negate(add(X1,negate(add(X2,multiply(k,add(X1,negate(add(negate(X2),X1)))))))) = negate(add(negate(X2),X1)),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_22,hypothesis,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
condition ).
cnf(c_0_23,plain,
ifeq4(negate(add(negate(add(X1,X2)),X3)),negate(add(negate(add(X1,X3)),X2)),X3,X2) = X2,
inference(spm,[status(thm)],[c_0_20,c_0_11]) ).
cnf(c_0_24,hypothesis,
negate(add(negate(add(d,negate(e))),negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))))) = d,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_11]) ).
cnf(c_0_25,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_26,axiom,
ifeq3(negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))),negate(e),a,b) = b,
base_step ).
cnf(c_0_27,hypothesis,
negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) = negate(e),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_19]),c_0_11]),c_0_22]),c_0_13]) ).
cnf(c_0_28,axiom,
ifeq3(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_29,negated_conjecture,
a != b,
c_0_25 ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ROB015-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n005.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.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 04:23:17 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/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
% 43.69/6.89 % Version: 3.5.1
% 43.69/6.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 43.69/6.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 43.69/6.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 43.69/6.89 % Starting new_bool_3 with 300s (1) cores
% 43.69/6.89 % Starting new_bool_1 with 300s (1) cores
% 43.69/6.89 % Starting sh5l with 300s (1) cores
% 43.69/6.89 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2543014 completed with status 0
% 43.69/6.89 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 43.69/6.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 43.69/6.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 43.69/6.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 43.69/6.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 43.69/6.89 % No SInE strategy applied
% 43.69/6.89 % Search class: FUUPM-FFSS32-DFFFFFNN
% 43.69/6.89 % partial match(1): FUUPM-FFSF32-DFFFFFNN
% 43.69/6.89 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 43.69/6.89 % Starting SubtermCWHack with 136s (1) cores
% 43.69/6.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 43.69/6.89 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 43.69/6.89 % Starting new_bool_3 with 136s (1) cores
% 43.69/6.89 % Starting new_bool_1 with 136s (1) cores
% 43.69/6.89 % new_bool_3 with pid 2543023 completed with status 0
% 43.69/6.89 % Result found by new_bool_3
% 43.69/6.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 43.69/6.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 43.69/6.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 43.69/6.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 43.69/6.89 % No SInE strategy applied
% 43.69/6.89 % Search class: FUUPM-FFSS32-DFFFFFNN
% 43.69/6.89 % partial match(1): FUUPM-FFSF32-DFFFFFNN
% 43.69/6.89 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 43.69/6.89 % Starting SubtermCWHack with 136s (1) cores
% 43.69/6.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 43.69/6.89 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 43.69/6.89 % Starting new_bool_3 with 136s (1) cores
% 43.69/6.89 % Preprocessing time : 0.001 s
% 43.69/6.89 % Presaturation interreduction done
% 43.69/6.89
% 43.69/6.89 % Proof found!
% 43.69/6.89 % SZS status Unsatisfiable
% 43.69/6.89 % SZS output start CNFRefutation
% See solution above
% 43.69/6.89 % Parsed axioms : 18
% 43.69/6.89 % Removed by relevancy pruning/SinE : 0
% 43.69/6.89 % Initial clauses : 18
% 43.69/6.89 % Removed in clause preprocessing : 0
% 43.69/6.89 % Initial clauses in saturation : 18
% 43.69/6.89 % Processed clauses : 2521
% 43.69/6.89 % ...of these trivial : 1720
% 43.69/6.89 % ...subsumed : 186
% 43.69/6.89 % ...remaining for further processing : 615
% 43.69/6.89 % Other redundant clauses eliminated : 0
% 43.69/6.89 % Clauses deleted for lack of memory : 0
% 43.69/6.89 % Backward-subsumed : 0
% 43.69/6.89 % Backward-rewritten : 7
% 43.69/6.89 % Generated clauses : 148254
% 43.69/6.89 % ...of the previous two non-redundant : 143313
% 43.69/6.89 % ...aggressively subsumed : 0
% 43.69/6.89 % Contextual simplify-reflections : 0
% 43.69/6.89 % Paramodulations : 148254
% 43.69/6.89 % Factorizations : 0
% 43.69/6.89 % NegExts : 0
% 43.69/6.89 % Equation resolutions : 0
% 43.69/6.89 % Disequality decompositions : 0
% 43.69/6.89 % Total rewrite steps : 116397
% 43.69/6.89 % ...of those cached : 79643
% 43.69/6.89 % Propositional unsat checks : 0
% 43.69/6.89 % Propositional check models : 0
% 43.69/6.89 % Propositional check unsatisfiable : 0
% 43.69/6.89 % Propositional clauses : 0
% 43.69/6.89 % Propositional clauses after purity: 0
% 43.69/6.89 % Propositional unsat core size : 0
% 43.69/6.89 % Propositional preprocessing time : 0.000
% 43.69/6.89 % Propositional encoding time : 0.000
% 43.69/6.89 % Propositional solver time : 0.000
% 43.69/6.89 % Success case prop preproc time : 0.000
% 43.69/6.89 % Success case prop encoding time : 0.000
% 43.69/6.89 % Success case prop solver time : 0.000
% 43.69/6.89 % Current number of processed clauses : 590
% 43.69/6.89 % Positive orientable unit clauses : 585
% 43.69/6.89 % Positive unorientable unit clauses: 4
% 43.69/6.89 % Negative unit clauses : 1
% 43.69/6.89 % Non-unit-clauses : 0
% 43.69/6.89 % Current number of unprocessed clauses: 140828
% 43.69/6.89 % ...number of literals in the above : 140828
% 43.69/6.89 % Current number of archived formulas : 0
% 43.69/6.89 % Current number of archived clauses : 25
% 43.69/6.89 % Clause-clause subsumption calls (NU) : 0
% 43.69/6.89 % Rec. Clause-clause subsumption calls : 0
% 43.69/6.89 % Non-unit clause-clause subsumptions : 0
% 43.69/6.89 % Unit Clause-clause subsumption calls : 42
% 43.69/6.89 % Rewrite failures with RHS unbound : 0
% 43.69/6.89 % BW rewrite match attempts : 33127
% 43.69/6.89 % BW rewrite match successes : 22
% 43.69/6.89 % Condensation attempts : 0
% 43.69/6.89 % Condensation successes : 0
% 43.69/6.89 % Termbank termtop insertions : 6228054
% 43.69/6.89 % Search garbage collected termcells : 2
% 43.69/6.89
% 43.69/6.89 % -------------------------------------------------
% 43.69/6.89 % User time : 5.934 s
% 43.69/6.89 % System time : 0.262 s
% 43.69/6.89 % Total time : 6.196 s
% 43.69/6.89 % Maximum resident set size: 3648 pages
% 43.69/6.89
% 43.69/6.89 % -------------------------------------------------
% 43.69/6.89 % User time : 29.383 s
% 43.69/6.89 % System time : 1.414 s
% 43.69/6.89 % Total time : 30.797 s
% 43.69/6.89 % Maximum resident set size: 4864 pages
% 43.69/6.89 % E exiting
%------------------------------------------------------------------------------