%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MSC015-1.005 : TPTP v9.3.1. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 01:28:39 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 7
% Syntax : Number of clauses : 51 ( 36 unt; 0 nHn; 51 RR)
% Number of literals : 66 ( 0 equ; 48 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-5 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(goal,negated_conjecture,
~ p(s1,s1,s1,s1,s1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(rule1,axiom,
( ~ p(X1,X2,X3,X4,s0)
| p(X1,X2,X3,X4,s1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule1) ).
cnf(rule2,axiom,
( ~ p(X1,X2,X3,s0,s1)
| p(X1,X2,X3,s1,s0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule2) ).
cnf(rule3,axiom,
( ~ p(X1,X2,s0,s1,s1)
| p(X1,X2,s1,s0,s0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule3) ).
cnf(rule4,axiom,
( ~ p(X1,s0,s1,s1,s1)
| p(X1,s1,s0,s0,s0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule4) ).
cnf(rule5,axiom,
( ~ p(s0,s1,s1,s1,s1)
| p(s1,s0,s0,s0,s0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule5) ).
cnf(init,axiom,
p(s0,s0,s0,s0,s0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',init) ).
cnf(c_0_7,negated_conjecture,
~ p(s1,s1,s1,s1,s1),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_8,plain,
( ~ p(X1,X2,X3,X4,s0)
| p(X1,X2,X3,X4,s1) ),
inference(fof_simplification,[status(thm)],[rule1]) ).
cnf(c_0_9,negated_conjecture,
~ p(s1,s1,s1,s1,s1),
c_0_7 ).
cnf(c_0_10,plain,
( ~ p(X1,X2,X3,X4,s0)
| p(X1,X2,X3,X4,s1) ),
c_0_8 ).
cnf(c_0_11,plain,
( ~ p(X1,X2,X3,s0,s1)
| p(X1,X2,X3,s1,s0) ),
inference(fof_simplification,[status(thm)],[rule2]) ).
cnf(c_0_12,negated_conjecture,
~ p(s1,s1,s1,s1,s0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( ~ p(X1,X2,X3,s0,s1)
| p(X1,X2,X3,s1,s0) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
~ p(s1,s1,s1,s0,s1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( ~ p(X1,X2,s0,s1,s1)
| p(X1,X2,s1,s0,s0) ),
inference(fof_simplification,[status(thm)],[rule3]) ).
cnf(c_0_16,negated_conjecture,
~ p(s1,s1,s1,s0,s0),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_17,plain,
( ~ p(X1,X2,s0,s1,s1)
| p(X1,X2,s1,s0,s0) ),
c_0_15 ).
cnf(c_0_18,negated_conjecture,
~ p(s1,s1,s0,s1,s1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
~ p(s1,s1,s0,s1,s0),
inference(spm,[status(thm)],[c_0_18,c_0_10]) ).
cnf(c_0_20,negated_conjecture,
~ p(s1,s1,s0,s0,s1),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_21,plain,
( ~ p(X1,s0,s1,s1,s1)
| p(X1,s1,s0,s0,s0) ),
inference(fof_simplification,[status(thm)],[rule4]) ).
cnf(c_0_22,negated_conjecture,
~ p(s1,s1,s0,s0,s0),
inference(spm,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_23,plain,
( ~ p(X1,s0,s1,s1,s1)
| p(X1,s1,s0,s0,s0) ),
c_0_21 ).
cnf(c_0_24,negated_conjecture,
~ p(s1,s0,s1,s1,s1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
~ p(s1,s0,s1,s1,s0),
inference(spm,[status(thm)],[c_0_24,c_0_10]) ).
cnf(c_0_26,negated_conjecture,
~ p(s1,s0,s1,s0,s1),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_27,negated_conjecture,
~ p(s1,s0,s1,s0,s0),
inference(spm,[status(thm)],[c_0_26,c_0_10]) ).
cnf(c_0_28,negated_conjecture,
~ p(s1,s0,s0,s1,s1),
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_29,negated_conjecture,
~ p(s1,s0,s0,s1,s0),
inference(spm,[status(thm)],[c_0_28,c_0_10]) ).
cnf(c_0_30,negated_conjecture,
~ p(s1,s0,s0,s0,s1),
inference(spm,[status(thm)],[c_0_29,c_0_13]) ).
cnf(c_0_31,plain,
( ~ p(s0,s1,s1,s1,s1)
| p(s1,s0,s0,s0,s0) ),
inference(fof_simplification,[status(thm)],[rule5]) ).
cnf(c_0_32,negated_conjecture,
~ p(s1,s0,s0,s0,s0),
inference(spm,[status(thm)],[c_0_30,c_0_10]) ).
cnf(c_0_33,plain,
( ~ p(s0,s1,s1,s1,s1)
| p(s1,s0,s0,s0,s0) ),
c_0_31 ).
cnf(c_0_34,negated_conjecture,
~ p(s0,s1,s1,s1,s1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
~ p(s0,s1,s1,s1,s0),
inference(spm,[status(thm)],[c_0_34,c_0_10]) ).
cnf(c_0_36,negated_conjecture,
~ p(s0,s1,s1,s0,s1),
inference(spm,[status(thm)],[c_0_35,c_0_13]) ).
cnf(c_0_37,negated_conjecture,
~ p(s0,s1,s1,s0,s0),
inference(spm,[status(thm)],[c_0_36,c_0_10]) ).
cnf(c_0_38,negated_conjecture,
~ p(s0,s1,s0,s1,s1),
inference(spm,[status(thm)],[c_0_37,c_0_17]) ).
cnf(c_0_39,negated_conjecture,
~ p(s0,s1,s0,s1,s0),
inference(spm,[status(thm)],[c_0_38,c_0_10]) ).
cnf(c_0_40,negated_conjecture,
~ p(s0,s1,s0,s0,s1),
inference(spm,[status(thm)],[c_0_39,c_0_13]) ).
cnf(c_0_41,negated_conjecture,
~ p(s0,s1,s0,s0,s0),
inference(spm,[status(thm)],[c_0_40,c_0_10]) ).
cnf(c_0_42,negated_conjecture,
~ p(s0,s0,s1,s1,s1),
inference(spm,[status(thm)],[c_0_41,c_0_23]) ).
cnf(c_0_43,negated_conjecture,
~ p(s0,s0,s1,s1,s0),
inference(spm,[status(thm)],[c_0_42,c_0_10]) ).
cnf(c_0_44,negated_conjecture,
~ p(s0,s0,s1,s0,s1),
inference(spm,[status(thm)],[c_0_43,c_0_13]) ).
cnf(c_0_45,negated_conjecture,
~ p(s0,s0,s1,s0,s0),
inference(spm,[status(thm)],[c_0_44,c_0_10]) ).
cnf(c_0_46,negated_conjecture,
~ p(s0,s0,s0,s1,s1),
inference(spm,[status(thm)],[c_0_45,c_0_17]) ).
cnf(c_0_47,negated_conjecture,
~ p(s0,s0,s0,s1,s0),
inference(spm,[status(thm)],[c_0_46,c_0_10]) ).
cnf(c_0_48,negated_conjecture,
~ p(s0,s0,s0,s0,s1),
inference(spm,[status(thm)],[c_0_47,c_0_13]) ).
cnf(c_0_49,axiom,
p(s0,s0,s0,s0,s0),
init ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_10]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC015-1.005 : TPTP v9.3.1. Released v3.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n016.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 01:32:23 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.15/0.43 % Version: 3.5.1
% 0.15/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 % Starting sh5l with 300s (1) cores
% 0.15/0.43 % new_bool_3 with pid 1286141 completed with status 0
% 0.15/0.43 % Result found by new_bool_3
% 0.15/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 % Search class: FHUNF-FFSF00-SFFFFFNN
% 0.15/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.43 % SubtermCWHack with pid 1286147 completed with status 0
% 0.15/0.43 % Result found by SubtermCWHack
% 0.15/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 % Search class: FHUNF-FFSF00-SFFFFFNN
% 0.15/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.43 % Preprocessing time : 0.001 s
% 0.15/0.43
% 0.15/0.43 % Proof found!
% 0.15/0.43 % SZS status Unsatisfiable
% 0.15/0.43 % SZS output start CNFRefutation
% See solution above
% 0.15/0.43 % Parsed axioms : 7
% 0.15/0.43 % Removed by relevancy pruning/SinE : 0
% 0.15/0.43 % Initial clauses : 7
% 0.15/0.43 % Removed in clause preprocessing : 0
% 0.15/0.43 % Initial clauses in saturation : 7
% 0.15/0.43 % Processed clauses : 37
% 0.15/0.43 % ...of these trivial : 0
% 0.15/0.43 % ...subsumed : 0
% 0.15/0.43 % ...remaining for further processing : 37
% 0.15/0.43 % Other redundant clauses eliminated : 0
% 0.15/0.43 % Clauses deleted for lack of memory : 0
% 0.15/0.43 % Backward-subsumed : 1
% 0.15/0.43 % Backward-rewritten : 0
% 0.15/0.43 % Generated clauses : 31
% 0.15/0.43 % ...of the previous two non-redundant : 30
% 0.15/0.43 % ...aggressively subsumed : 0
% 0.15/0.43 % Contextual simplify-reflections : 0
% 0.15/0.43 % Paramodulations : 31
% 0.15/0.43 % Factorizations : 0
% 0.15/0.43 % NegExts : 0
% 0.15/0.43 % Equation resolutions : 0
% 0.15/0.43 % Disequality decompositions : 0
% 0.15/0.43 % Total rewrite steps : 1
% 0.15/0.43 % ...of those cached : 0
% 0.15/0.43 % Propositional unsat checks : 0
% 0.15/0.43 % Propositional check models : 0
% 0.15/0.43 % Propositional check unsatisfiable : 0
% 0.15/0.43 % Propositional clauses : 0
% 0.15/0.43 % Propositional clauses after purity: 0
% 0.15/0.43 % Propositional unsat core size : 0
% 0.15/0.43 % Propositional preprocessing time : 0.000
% 0.15/0.43 % Propositional encoding time : 0.000
% 0.15/0.43 % Propositional solver time : 0.000
% 0.15/0.43 % Success case prop preproc time : 0.000
% 0.15/0.43 % Success case prop encoding time : 0.000
% 0.15/0.43 % Success case prop solver time : 0.000
% 0.15/0.43 % Current number of processed clauses : 36
% 0.15/0.43 % Positive orientable unit clauses : 1
% 0.15/0.43 % Positive unorientable unit clauses: 0
% 0.15/0.43 % Negative unit clauses : 31
% 0.15/0.43 % Non-unit-clauses : 4
% 0.15/0.43 % Current number of unprocessed clauses: 0
% 0.15/0.43 % ...number of literals in the above : 0
% 0.15/0.43 % Current number of archived formulas : 0
% 0.15/0.43 % Current number of archived clauses : 1
% 0.15/0.43 % Clause-clause subsumption calls (NU) : 10
% 0.15/0.43 % Rec. Clause-clause subsumption calls : 10
% 0.15/0.43 % Non-unit clause-clause subsumptions : 0
% 0.15/0.43 % Unit Clause-clause subsumption calls : 115
% 0.15/0.43 % Rewrite failures with RHS unbound : 0
% 0.15/0.43 % BW rewrite match attempts : 0
% 0.15/0.43 % BW rewrite match successes : 0
% 0.15/0.43 % Condensation attempts : 0
% 0.15/0.43 % Condensation successes : 0
% 0.15/0.43 % Termbank termtop insertions : 321
% 0.15/0.43 % Search garbage collected termcells : 17
% 0.15/0.43
% 0.15/0.43 % -------------------------------------------------
% 0.15/0.43 % User time : 0.002 s
% 0.15/0.43 % System time : 0.002 s
% 0.15/0.43 % Total time : 0.004 s
% 0.15/0.43 % Maximum resident set size: 3632 pages
% 0.15/0.43
% 0.15/0.43 % -------------------------------------------------
% 0.15/0.43 % User time : 0.003 s
% 0.15/0.43 % System time : 0.006 s
% 0.15/0.43 % Total time : 0.009 s
% 0.15/0.43 % Maximum resident set size: 4608 pages
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------