%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRA001-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:31:50 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of clauses : 47 ( 6 unt; 22 nHn; 47 RR)
% Number of literals : 114 ( 0 equ; 55 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 6 ( 5 usr; 6 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_2,negated_conjecture,
( ~ b
| ~ a ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_4,negated_conjecture,
( ~ c
| d
| a ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_3,negated_conjecture,
( ~ d
| c
| a ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_11,negated_conjecture,
( ~ e
| d ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
cnf(clause_8,negated_conjecture,
( ~ c
| e
| b ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_7,negated_conjecture,
( ~ e
| c
| b ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_12,negated_conjecture,
( ~ d
| e ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_12) ).
cnf(clause_5,negated_conjecture,
( ~ a
| d
| c ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_1,negated_conjecture,
( b
| a ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_9,negated_conjecture,
( ~ b
| e
| c ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_6,negated_conjecture,
( ~ d
| ~ c
| ~ a ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_10,negated_conjecture,
( ~ e
| ~ c
| ~ b ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
cnf(c_0_12,negated_conjecture,
( ~ b
| ~ a ),
inference(fof_simplification,[status(thm)],[clause_2]) ).
cnf(c_0_13,negated_conjecture,
( ~ c
| d
| a ),
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_14,negated_conjecture,
( ~ d
| c
| a ),
inference(fof_simplification,[status(thm)],[clause_3]) ).
cnf(c_0_15,negated_conjecture,
( ~ e
| d ),
inference(fof_simplification,[status(thm)],[clause_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ c
| e
| b ),
inference(fof_simplification,[status(thm)],[clause_8]) ).
cnf(c_0_17,negated_conjecture,
( ~ b
| ~ a ),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
( ~ c
| d
| a ),
c_0_13 ).
cnf(c_0_19,negated_conjecture,
( ~ e
| c
| b ),
inference(fof_simplification,[status(thm)],[clause_7]) ).
cnf(c_0_20,negated_conjecture,
( ~ d
| e ),
inference(fof_simplification,[status(thm)],[clause_12]) ).
cnf(c_0_21,negated_conjecture,
( ~ d
| c
| a ),
c_0_14 ).
cnf(c_0_22,negated_conjecture,
( ~ a
| d
| c ),
inference(fof_simplification,[status(thm)],[clause_5]) ).
cnf(c_0_23,negated_conjecture,
( ~ e
| d ),
c_0_15 ).
cnf(c_0_24,negated_conjecture,
( ~ c
| e
| b ),
c_0_16 ).
cnf(c_0_25,negated_conjecture,
( ~ b
| ~ c
| d ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( ~ e
| c
| b ),
c_0_19 ).
cnf(c_0_27,negated_conjecture,
( ~ d
| e ),
c_0_20 ).
cnf(c_0_28,negated_conjecture,
( ~ b
| ~ d
| c ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( ~ a
| d
| c ),
c_0_22 ).
cnf(c_0_30,negated_conjecture,
( b
| a ),
clause_1 ).
cnf(c_0_31,negated_conjecture,
( ~ c
| d ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( ~ b
| e
| c ),
inference(fof_simplification,[status(thm)],[clause_9]) ).
cnf(c_0_33,negated_conjecture,
( ~ d
| c ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( b
| d ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( ~ b
| e
| c ),
c_0_32 ).
cnf(c_0_36,negated_conjecture,
( b
| c ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( ~ d
| ~ c
| ~ a ),
inference(fof_simplification,[status(thm)],[clause_6]) ).
cnf(c_0_38,negated_conjecture,
d,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_35]),c_0_36]),c_0_31]) ).
cnf(c_0_39,negated_conjecture,
( ~ d
| ~ c
| ~ a ),
c_0_37 ).
cnf(c_0_40,negated_conjecture,
c,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_38])]) ).
cnf(c_0_41,negated_conjecture,
( ~ e
| ~ c
| ~ b ),
inference(fof_simplification,[status(thm)],[clause_10]) ).
cnf(c_0_42,negated_conjecture,
~ a,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_38])]),c_0_40])]) ).
cnf(c_0_43,negated_conjecture,
( ~ e
| ~ c
| ~ b ),
c_0_41 ).
cnf(c_0_44,negated_conjecture,
e,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_38])]) ).
cnf(c_0_45,negated_conjecture,
b,
inference(sr,[status(thm)],[c_0_30,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_40])]),c_0_44]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRA001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n015.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.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sun Sep 20 18:23:06 UTC 2026
% 0.14/0.35 % CPUTime :
% 0.14/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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
% 0.14/0.41 % Version: 3.5.1
% 0.14/0.41 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % new_bool_3 with pid 3665268 completed with status 0
% 0.14/0.41 % Result found by new_bool_3
% 0.14/0.41 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.14/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.41 % SubtermCWHack with pid 3665273 completed with status 0
% 0.14/0.41 % Result found by SubtermCWHack
% 0.14/0.41 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.14/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.41 % Preprocessing time : 0.001 s
% 0.14/0.41
% 0.14/0.41 % Proof found!
% 0.14/0.41 % SZS status Unsatisfiable
% 0.14/0.41 % SZS output start CNFRefutation
% See solution above
% 0.14/0.41 % Parsed axioms : 12
% 0.14/0.41 % Removed by relevancy pruning/SinE : 0
% 0.14/0.41 % Initial clauses : 12
% 0.14/0.41 % Removed in clause preprocessing : 0
% 0.14/0.41 % Initial clauses in saturation : 12
% 0.14/0.41 % Processed clauses : 24
% 0.14/0.41 % ...of these trivial : 0
% 0.14/0.41 % ...subsumed : 0
% 0.14/0.41 % ...remaining for further processing : 23
% 0.14/0.41 % Other redundant clauses eliminated : 0
% 0.14/0.41 % Clauses deleted for lack of memory : 0
% 0.14/0.41 % Backward-subsumed : 8
% 0.14/0.41 % Backward-rewritten : 9
% 0.14/0.41 % Generated clauses : 23
% 0.14/0.41 % ...of the previous two non-redundant : 15
% 0.14/0.41 % ...aggressively subsumed : 0
% 0.14/0.41 % Contextual simplify-reflections : 5
% 0.14/0.41 % Paramodulations : 22
% 0.14/0.41 % Factorizations : 0
% 0.14/0.41 % NegExts : 0
% 0.14/0.41 % Equation resolutions : 0
% 0.14/0.41 % Disequality decompositions : 0
% 0.14/0.41 % Total rewrite steps : 12
% 0.14/0.41 % ...of those cached : 8
% 0.14/0.41 % Propositional unsat checks : 0
% 0.14/0.41 % Propositional check models : 0
% 0.14/0.41 % Propositional check unsatisfiable : 0
% 0.14/0.41 % Propositional clauses : 0
% 0.14/0.41 % Propositional clauses after purity: 0
% 0.14/0.41 % Propositional unsat core size : 0
% 0.14/0.41 % Propositional preprocessing time : 0.000
% 0.14/0.41 % Propositional encoding time : 0.000
% 0.14/0.41 % Propositional solver time : 0.000
% 0.14/0.41 % Success case prop preproc time : 0.000
% 0.14/0.41 % Success case prop encoding time : 0.000
% 0.14/0.41 % Success case prop solver time : 0.000
% 0.14/0.41 % Current number of processed clauses : 5
% 0.14/0.41 % Positive orientable unit clauses : 4
% 0.14/0.41 % Positive unorientable unit clauses: 0
% 0.14/0.41 % Negative unit clauses : 1
% 0.14/0.41 % Non-unit-clauses : 0
% 0.14/0.41 % Current number of unprocessed clauses: 1
% 0.14/0.41 % ...number of literals in the above : 2
% 0.14/0.41 % Current number of archived formulas : 0
% 0.14/0.41 % Current number of archived clauses : 18
% 0.14/0.41 % Clause-clause subsumption calls (NU) : 10
% 0.14/0.41 % Rec. Clause-clause subsumption calls : 10
% 0.14/0.41 % Non-unit clause-clause subsumptions : 10
% 0.14/0.41 % Unit Clause-clause subsumption calls : 3
% 0.14/0.41 % Rewrite failures with RHS unbound : 0
% 0.14/0.41 % BW rewrite match attempts : 2
% 0.14/0.41 % BW rewrite match successes : 2
% 0.14/0.41 % Condensation attempts : 0
% 0.14/0.41 % Condensation successes : 0
% 0.14/0.41 % Termbank termtop insertions : 410
% 0.14/0.41 % Search garbage collected termcells : 18
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.003 s
% 0.14/0.41 % System time : 0.002 s
% 0.14/0.41 % Total time : 0.005 s
% 0.14/0.41 % Maximum resident set size: 3628 pages
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.004 s
% 0.14/0.41 % System time : 0.007 s
% 0.14/0.41 % Total time : 0.011 s
% 0.14/0.41 % Maximum resident set size: 4864 pages
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------