%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ROB011-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 : n019.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:43 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 8 RR)
% Number of literals : 18 ( 17 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_base_step,negated_conjecture,
negate(add(a,negate(add(b,multiply(one,add(a,c)))))) != c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_base_step) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).
cnf(associativity_of_add,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-0.ax',associativity_of_add) ).
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(condition,hypothesis,
negate(add(a,negate(b))) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condition) ).
cnf(one_times_x,axiom,
multiply(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/ROB001-1.ax',one_times_x) ).
cnf(c_0_6,negated_conjecture,
negate(add(a,negate(add(b,multiply(one,add(a,c)))))) != c,
inference(fof_simplification,[status(thm)],[prove_base_step]) ).
cnf(c_0_7,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_8,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_9,axiom,
negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1,
robbins_axiom ).
cnf(c_0_10,hypothesis,
negate(add(a,negate(b))) = c,
condition ).
cnf(c_0_11,negated_conjecture,
negate(add(a,negate(add(b,multiply(one,add(a,c)))))) != c,
c_0_6 ).
cnf(c_0_12,axiom,
multiply(one,X1) = X1,
one_times_x ).
cnf(c_0_13,plain,
add(X1,add(X2,X3)) = add(X3,add(X1,X2)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_14,plain,
add(X1,add(X2,X3)) = add(X2,add(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_7]),c_0_8]) ).
cnf(c_0_15,hypothesis,
negate(add(c,negate(add(a,b)))) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_7]) ).
cnf(c_0_16,negated_conjecture,
negate(add(a,negate(add(a,add(c,b))))) != c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_7]),c_0_14]) ).
cnf(c_0_17,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_15]),c_0_14]),c_0_7]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ROB011-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.12/0.36 % Computer : n019.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 04:23:20 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1675446 completed with status 0
% 0.13/0.42 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.13/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FHUSM-FFSF21-DFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.13/0.42 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 271s (1) cores
% 0.13/0.42 % Starting new_bool_3 with 271s (1) cores
% 0.13/0.42 % Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 1675450 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FHUSM-FFSF21-DFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Unsatisfiable
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 9
% 0.13/0.42 % Removed by relevancy pruning/SinE : 0
% 0.13/0.42 % Initial clauses : 9
% 0.13/0.42 % Removed in clause preprocessing : 0
% 0.13/0.42 % Initial clauses in saturation : 9
% 0.13/0.42 % Processed clauses : 57
% 0.13/0.42 % ...of these trivial : 2
% 0.13/0.42 % ...subsumed : 39
% 0.13/0.42 % ...remaining for further processing : 15
% 0.13/0.42 % Other redundant clauses eliminated : 0
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 0
% 0.13/0.42 % Backward-rewritten : 0
% 0.13/0.42 % Generated clauses : 152
% 0.13/0.42 % ...of the previous two non-redundant : 148
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 0
% 0.13/0.42 % Paramodulations : 152
% 0.13/0.42 % Factorizations : 0
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 0
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 80
% 0.13/0.42 % ...of those cached : 53
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 15
% 0.13/0.42 % Positive orientable unit clauses : 7
% 0.13/0.42 % Positive unorientable unit clauses: 4
% 0.13/0.42 % Negative unit clauses : 1
% 0.13/0.42 % Non-unit-clauses : 3
% 0.13/0.42 % Current number of unprocessed clauses: 100
% 0.13/0.42 % ...number of literals in the above : 127
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 0
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 2
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 2
% 0.13/0.42 % Non-unit clause-clause subsumptions : 2
% 0.13/0.42 % Unit Clause-clause subsumption calls : 6
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 13
% 0.13/0.42 % BW rewrite match successes : 12
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 1371
% 0.13/0.42 % Search garbage collected termcells : 6
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.004 s
% 0.13/0.42 % System time : 0.002 s
% 0.13/0.42 % Total time : 0.005 s
% 0.13/0.42 % Maximum resident set size: 3640 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.014 s
% 0.13/0.42 % System time : 0.007 s
% 0.13/0.42 % Total time : 0.021 s
% 0.13/0.42 % Maximum resident set size: 4608 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------