%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ROB015-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:40 PM UTC 2026
% Result : Unsatisfiable 34.96s 5.68s
% Output : CNFRefutation 34.96s
% 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 : 10 ( 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/sandbox2/benchmark/theBenchmark.p',lemma_3_2) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',lemma_3_4) ).
cnf(k_positive,axiom,
positive_integer(k) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_positive) ).
cnf(ifeq_axiom_002,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_002) ).
cnf(ifeq_axiom,axiom,
ifeq4(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(condition,hypothesis,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condition) ).
cnf(goal,negated_conjecture,
a != b,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',base_step) ).
cnf(ifeq_axiom_001,axiom,
ifeq3(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/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,
positive_integer(k) = true,
k_positive ).
cnf(c_0_14,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom_002 ).
cnf(c_0_15,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_16,axiom,
ifeq4(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_17,plain,
ifeq4(negate(add(X1,negate(X2))),X3,negate(add(X1,negate(add(X2,multiply(k,add(X1,X3)))))),X3) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
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_15,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(spm,[status(thm)],[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_16]) ).
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.05 % Problem : ROB015-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n001.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 04:28:58 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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
% 34.96/5.68 % Version: 3.5.1
% 34.96/5.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 34.96/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.96/5.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.96/5.68 % Starting new_bool_3 with 300s (1) cores
% 34.96/5.68 % Starting new_bool_1 with 300s (1) cores
% 34.96/5.68 % Starting sh5l with 300s (1) cores
% 34.96/5.68 % new_bool_3 with pid 2184810 completed with status 0
% 34.96/5.68 % Result found by new_bool_3
% 34.96/5.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 34.96/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.96/5.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.96/5.68 % Starting new_bool_3 with 300s (1) cores
% 34.96/5.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 34.96/5.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 34.96/5.68 % Search class: FUUPM-FFSS32-DFFFFFNN
% 34.96/5.68 % partial match(1): FUUPM-FFSF32-DFFFFFNN
% 34.96/5.68 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 34.96/5.68 % Starting SubtermCWHack with 31s (1) cores
% 34.96/5.68 % SubtermCWHack with pid 2184815 completed with status 0
% 34.96/5.68 % Result found by SubtermCWHack
% 34.96/5.68 % Preprocessing class: FSMSSMSSSSSNFFN.
% 34.96/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.96/5.68 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.96/5.68 % Starting new_bool_3 with 300s (1) cores
% 34.96/5.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 34.96/5.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 34.96/5.68 % Search class: FUUPM-FFSS32-DFFFFFNN
% 34.96/5.68 % partial match(1): FUUPM-FFSF32-DFFFFFNN
% 34.96/5.68 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 34.96/5.68 % Starting SubtermCWHack with 31s (1) cores
% 34.96/5.68 % Preprocessing time : 0.001 s
% 34.96/5.68
% 34.96/5.68 % Proof found!
% 34.96/5.68 % SZS status Unsatisfiable
% 34.96/5.68 % SZS output start CNFRefutation
% See solution above
% 34.96/5.68 % Parsed axioms : 18
% 34.96/5.68 % Removed by relevancy pruning/SinE : 2
% 34.96/5.68 % Initial clauses : 16
% 34.96/5.68 % Removed in clause preprocessing : 0
% 34.96/5.68 % Initial clauses in saturation : 16
% 34.96/5.68 % Processed clauses : 2592
% 34.96/5.68 % ...of these trivial : 1988
% 34.96/5.68 % ...subsumed : 178
% 34.96/5.68 % ...remaining for further processing : 426
% 34.96/5.68 % Other redundant clauses eliminated : 0
% 34.96/5.68 % Clauses deleted for lack of memory : 0
% 34.96/5.68 % Backward-subsumed : 0
% 34.96/5.68 % Backward-rewritten : 1
% 34.96/5.68 % Generated clauses : 227231
% 34.96/5.68 % ...of the previous two non-redundant : 223336
% 34.96/5.68 % ...aggressively subsumed : 0
% 34.96/5.68 % Contextual simplify-reflections : 0
% 34.96/5.68 % Paramodulations : 227231
% 34.96/5.68 % Factorizations : 0
% 34.96/5.68 % NegExts : 0
% 34.96/5.68 % Equation resolutions : 0
% 34.96/5.68 % Disequality decompositions : 0
% 34.96/5.68 % Total rewrite steps : 134574
% 34.96/5.68 % ...of those cached : 93458
% 34.96/5.68 % Propositional unsat checks : 0
% 34.96/5.68 % Propositional check models : 0
% 34.96/5.68 % Propositional check unsatisfiable : 0
% 34.96/5.68 % Propositional clauses : 0
% 34.96/5.68 % Propositional clauses after purity: 0
% 34.96/5.68 % Propositional unsat core size : 0
% 34.96/5.68 % Propositional preprocessing time : 0.000
% 34.96/5.68 % Propositional encoding time : 0.000
% 34.96/5.68 % Propositional solver time : 0.000
% 34.96/5.68 % Success case prop preproc time : 0.000
% 34.96/5.68 % Success case prop encoding time : 0.000
% 34.96/5.68 % Success case prop solver time : 0.000
% 34.96/5.68 % Current number of processed clauses : 425
% 34.96/5.68 % Positive orientable unit clauses : 419
% 34.96/5.68 % Positive unorientable unit clauses: 5
% 34.96/5.68 % Negative unit clauses : 1
% 34.96/5.68 % Non-unit-clauses : 0
% 34.96/5.68 % Current number of unprocessed clauses: 220760
% 34.96/5.68 % ...number of literals in the above : 220760
% 34.96/5.68 % Current number of archived formulas : 0
% 34.96/5.68 % Current number of archived clauses : 1
% 34.96/5.68 % Clause-clause subsumption calls (NU) : 0
% 34.96/5.68 % Rec. Clause-clause subsumption calls : 0
% 34.96/5.68 % Non-unit clause-clause subsumptions : 0
% 34.96/5.68 % Unit Clause-clause subsumption calls : 8
% 34.96/5.68 % Rewrite failures with RHS unbound : 0
% 34.96/5.68 % BW rewrite match attempts : 32491
% 34.96/5.68 % BW rewrite match successes : 15
% 34.96/5.68 % Condensation attempts : 0
% 34.96/5.68 % Condensation successes : 0
% 34.96/5.68 % Termbank termtop insertions : 7923975
% 34.96/5.68 % Search garbage collected termcells : 7
% 34.96/5.68
% 34.96/5.68 % -------------------------------------------------
% 34.96/5.68 % User time : 4.673 s
% 34.96/5.68 % System time : 0.253 s
% 34.96/5.68 % Total time : 4.927 s
% 34.96/5.68 % Maximum resident set size: 3648 pages
% 34.96/5.68
% 34.96/5.68 % -------------------------------------------------
% 34.96/5.68 % User time : 4.673 s
% 34.96/5.68 % System time : 0.259 s
% 34.96/5.68 % Total time : 4.932 s
% 34.96/5.68 % Maximum resident set size: 4608 pages
% 34.96/5.68 % E exiting
%------------------------------------------------------------------------------