%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ROB016-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 15 unt; 0 nHn; 13 RR)
% Number of literals : 24 ( 18 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_result,negated_conjecture,
negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) != negate(e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_result) ).
cnf(lemma_3_6,axiom,
( ~ positive_integer(X3)
| negate(add(negate(X1),negate(add(X2,negate(X1))))) != X2
| negate(add(X1,multiply(X3,add(X2,negate(add(X2,negate(X1))))))) = negate(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_3_6) ).
cnf(robbins_axiom,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).
cnf(condition,hypothesis,
negate(add(d,e)) = negate(e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condition) ).
cnf(k_positive,axiom,
positive_integer(k),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_positive) ).
cnf(c_0_6,negated_conjecture,
negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) != negate(e),
inference(fof_simplification,[status(thm)],[prove_result]) ).
cnf(c_0_7,plain,
( ~ positive_integer(X3)
| negate(add(negate(X1),negate(add(X2,negate(X1))))) != X2
| negate(add(X1,multiply(X3,add(X2,negate(add(X2,negate(X1))))))) = negate(X1) ),
inference(fof_simplification,[status(thm)],[lemma_3_6]) ).
cnf(c_0_8,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
robbins_axiom ).
cnf(c_0_9,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_10,hypothesis,
negate(add(d,e)) = negate(e),
condition ).
cnf(c_0_11,negated_conjecture,
negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) != negate(e),
c_0_6 ).
cnf(c_0_12,plain,
( ~ positive_integer(X3)
| negate(add(negate(X1),negate(add(X2,negate(X1))))) != X2
| negate(add(X1,multiply(X3,add(X2,negate(add(X2,negate(X1))))))) = negate(X1) ),
c_0_7 ).
cnf(c_0_13,axiom,
positive_integer(k),
k_positive ).
cnf(c_0_14,plain,
negate(add(negate(add(X1,X2)),negate(add(X2,negate(X1))))) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,hypothesis,
negate(add(e,d)) = negate(e),
inference(rw,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_16,negated_conjecture,
negate(add(negate(e),negate(add(d,negate(e))))) != d,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_17,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ROB016-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n026.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % 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:26:23 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % new_bool_3 with pid 1360730 completed with status 0
% 0.10/0.44 % Result found by new_bool_3
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FHUSS-FFSF21-DFFFFFNN
% 0.10/0.44 % partial match(1): FHUSS-FFSF21-SFFFFFNN
% 0.10/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.44 % SubtermCWHack with pid 1360736 completed with status 0
% 0.10/0.44 % Result found by SubtermCWHack
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FHUSS-FFSF21-DFFFFFNN
% 0.10/0.44 % partial match(1): FHUSS-FFSF21-SFFFFFNN
% 0.10/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.44 % Preprocessing time : 0.001 s
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Unsatisfiable
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 11
% 0.10/0.44 % Removed by relevancy pruning/SinE : 4
% 0.10/0.44 % Initial clauses : 7
% 0.10/0.44 % Removed in clause preprocessing : 0
% 0.10/0.44 % Initial clauses in saturation : 7
% 0.10/0.44 % Processed clauses : 56
% 0.10/0.44 % ...of these trivial : 4
% 0.10/0.44 % ...subsumed : 37
% 0.10/0.44 % ...remaining for further processing : 15
% 0.10/0.44 % Other redundant clauses eliminated : 0
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 0
% 0.10/0.44 % Backward-rewritten : 1
% 0.10/0.44 % Generated clauses : 203
% 0.10/0.44 % ...of the previous two non-redundant : 192
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 0
% 0.10/0.44 % Paramodulations : 203
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 0
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 113
% 0.10/0.44 % ...of those cached : 64
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 14
% 0.10/0.44 % Positive orientable unit clauses : 7
% 0.10/0.44 % Positive unorientable unit clauses: 4
% 0.10/0.44 % Negative unit clauses : 2
% 0.10/0.44 % Non-unit-clauses : 1
% 0.10/0.44 % Current number of unprocessed clauses: 114
% 0.10/0.44 % ...number of literals in the above : 152
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 1
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 0
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.44 % Non-unit clause-clause subsumptions : 0
% 0.10/0.44 % Unit Clause-clause subsumption calls : 9
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 24
% 0.10/0.44 % BW rewrite match successes : 14
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 2368
% 0.10/0.44 % Search garbage collected termcells : 25
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.006 s
% 0.10/0.44 % System time : 0.002 s
% 0.10/0.44 % Total time : 0.008 s
% 0.10/0.44 % Maximum resident set size: 3644 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.009 s
% 0.10/0.44 % System time : 0.005 s
% 0.10/0.44 % Total time : 0.014 s
% 0.10/0.44 % Maximum resident set size: 4608 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------