%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP136-1 : TPTP v9.3.1. Released v2.4.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 01:35:14 PM UTC 2026
% Result : Satisfiable 0.26s 10.61s
% Output : Saturation 0.26s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause2ERROR: Could not build tree for root c_0_63ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_63,negated_conjecture,
actual_world(skc13),
clause2,
[final] ).
cnf(c_0_111,negated_conjecture,
~ ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_104]),c_0_102]),c_0_103]),
[final] ).
cnf(c_0_120,negated_conjecture,
( ~ actual_world(X1)
| ~ ssSkP0(X6,X1)
| ~ two(X1,X6)
| ~ group(X1,X6)
| ~ placename(X1,X5)
| ~ hollywood_placename(X1,X5)
| ~ of(X1,X5,X4)
| ~ city(X1,X4)
| ~ street(X1,X4)
| ~ lonely(X1,X4)
| ~ down(X1,X2,X4)
| ~ in(X1,X2,X4)
| ~ chevy(X1,X3)
| ~ white(X1,X3)
| ~ dirty(X1,X3)
| ~ old(X1,X3)
| ~ agent(X1,X2,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| member(X1,skf13(X1,X6),X6)
| ssSkC0 ),
c_0_109,
[final] ).
cnf(c_0_121,negated_conjecture,
down(skc33,skc35,skc36),
inference(sr,[status(thm)],[c_0_110,c_0_111]),
[final] ).
cnf(c_0_122,negated_conjecture,
lonely(skc33,skc36),
inference(sr,[status(thm)],[c_0_112,c_0_111]),
[final] ).
cnf(c_0_123,negated_conjecture,
street(skc33,skc36),
inference(sr,[status(thm)],[c_0_113,c_0_111]),
[final] ).
cnf(c_0_124,negated_conjecture,
event(skc33,skc35),
inference(sr,[status(thm)],[c_0_114,c_0_111]),
[final] ).
cnf(c_0_125,negated_conjecture,
present(skc33,skc35),
inference(sr,[status(thm)],[c_0_115,c_0_111]),
[final] ).
cnf(c_0_126,negated_conjecture,
barrel(skc33,skc35),
inference(sr,[status(thm)],[c_0_116,c_0_111]),
[final] ).
cnf(c_0_127,negated_conjecture,
actual_world(skc33),
clause1,
[final] ).
cnf(c_0_128,negated_conjecture,
( ~ actual_world(X1)
| ~ ssSkP0(X7,X1)
| ~ two(X1,X7)
| ~ group(X1,X7)
| ~ fellow(X1,skf13(X1,X6))
| ~ young(X1,skf13(X1,X6))
| ~ placename(X1,X5)
| ~ hollywood_placename(X1,X5)
| ~ of(X1,X5,X4)
| ~ city(X1,X4)
| ~ street(X1,X4)
| ~ lonely(X1,X4)
| ~ down(X1,X2,X4)
| ~ in(X1,X2,X4)
| ~ chevy(X1,X3)
| ~ white(X1,X3)
| ~ dirty(X1,X3)
| ~ old(X1,X3)
| ~ agent(X1,X2,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ssSkC0 ),
c_0_117,
[final] ).
cnf(c_0_129,negated_conjecture,
( ~ member(skc33,X1,skc34)
| young(skc33,X1)
| ssSkC0 ),
c_0_118,
[final] ).
cnf(c_0_130,negated_conjecture,
( ~ member(skc33,X1,skc34)
| fellow(skc33,X1)
| ssSkC0 ),
c_0_119,
[final] ).
cnf(c_0_148,negated_conjecture,
( ~ old(skc33,X3)
| ~ dirty(skc33,X3)
| ~ white(skc33,X3)
| ~ chevy(skc33,X3)
| ~ hollywood_placename(skc33,X2)
| ~ placename(skc33,X2)
| ~ city(skc33,skc36)
| ~ ssSkP0(X1,skc33)
| ~ two(skc33,X1)
| ~ group(skc33,X1)
| ~ agent(skc33,skc35,X3)
| ~ in(skc33,skc35,skc36)
| ~ of(skc33,X2,skc36)
| member(skc33,skf13(skc33,X1),X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_122]),c_0_123]),c_0_124]),c_0_125]),c_0_126]),c_0_127])]),c_0_111]),
[final] ).
cnf(c_0_149,negated_conjecture,
( ~ old(skc33,X5)
| ~ dirty(skc33,X5)
| ~ white(skc33,X5)
| ~ chevy(skc33,X5)
| ~ barrel(skc33,X2)
| ~ present(skc33,X2)
| ~ event(skc33,X2)
| ~ hollywood_placename(skc33,X4)
| ~ placename(skc33,X4)
| ~ city(skc33,X3)
| ~ street(skc33,X3)
| ~ lonely(skc33,X3)
| ~ ssSkP0(X6,skc33)
| ~ two(skc33,X6)
| ~ group(skc33,X6)
| ~ agent(skc33,X2,X5)
| ~ in(skc33,X2,X3)
| ~ of(skc33,X4,X3)
| ~ down(skc33,X2,X3)
| ~ member(skc33,skf13(skc33,X1),skc34)
| ssSkC0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_127])]),c_0_130]),
[final] ).
cnf(c_0_150,negated_conjecture,
( ~ state(X1,X4)
| ~ be(X1,X4,skf11(X1,X3),X2)
| ~ in(X1,X2,skf11(X1,X3))
| ssSkP0(X5,X1) ),
c_0_131,
[final] ).
cnf(c_0_151,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ frontseat(X1,X2)
| ~ member(X1,X2,X3)
| be(X1,skf8(X1,X2),X2,skf7(X2,X1)) ),
c_0_132,
[final] ).
cnf(c_0_152,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ frontseat(X1,X2)
| ~ member(X1,X2,X3)
| in(X1,skf7(X2,X1),X2) ),
c_0_133,
[final] ).
cnf(c_0_153,negated_conjecture,
( ~ ssSkP0(X3,X1)
| ~ frontseat(X1,X2)
| ~ member(X1,X2,X3)
| state(X1,skf8(X1,X4)) ),
c_0_134,
[final] ).
cnf(c_0_154,negated_conjecture,
( member(X2,skf11(X2,X1),X1)
| ssSkP0(X1,X2) ),
clause42,
[final] ).
cnf(c_0_155,negated_conjecture,
( frontseat(X2,skf11(X2,X3))
| ssSkP0(X1,X2) ),
clause41,
[final] ).
cnf(c_0_156,negated_conjecture,
of(skc33,skc37,skc38),
inference(sr,[status(thm)],[c_0_135,c_0_111]),
[final] ).
cnf(c_0_157,negated_conjecture,
in(skc33,skc35,skc38),
inference(sr,[status(thm)],[c_0_136,c_0_111]),
[final] ).
cnf(c_0_158,negated_conjecture,
agent(skc33,skc35,skc39),
inference(sr,[status(thm)],[c_0_137,c_0_111]),
[final] ).
cnf(c_0_159,negated_conjecture,
group(skc33,skc34),
inference(sr,[status(thm)],[c_0_138,c_0_111]),
[final] ).
cnf(c_0_160,negated_conjecture,
two(skc33,skc34),
inference(sr,[status(thm)],[c_0_139,c_0_111]),
[final] ).
cnf(c_0_161,negated_conjecture,
ssSkP0(skc34,skc33),
inference(sr,[status(thm)],[c_0_140,c_0_111]),
[final] ).
cnf(c_0_162,negated_conjecture,
city(skc33,skc38),
inference(sr,[status(thm)],[c_0_141,c_0_111]),
[final] ).
cnf(c_0_163,negated_conjecture,
placename(skc33,skc37),
inference(sr,[status(thm)],[c_0_142,c_0_111]),
[final] ).
cnf(c_0_164,negated_conjecture,
hollywood_placename(skc33,skc37),
inference(sr,[status(thm)],[c_0_143,c_0_111]),
[final] ).
cnf(c_0_165,negated_conjecture,
chevy(skc33,skc39),
inference(sr,[status(thm)],[c_0_144,c_0_111]),
[final] ).
cnf(c_0_166,negated_conjecture,
white(skc33,skc39),
inference(sr,[status(thm)],[c_0_145,c_0_111]),
[final] ).
cnf(c_0_167,negated_conjecture,
dirty(skc33,skc39),
inference(sr,[status(thm)],[c_0_146,c_0_111]),
[final] ).
cnf(c_0_168,negated_conjecture,
old(skc33,skc39),
inference(sr,[status(thm)],[c_0_147,c_0_111]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NLP136-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/10.50 % Computer : n026.cluster.edu
% 0.08/10.50 % Model : x86_64 x86_64
% 0.08/10.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/10.50 % Memory : 8046.5625MB
% 0.08/10.50 % OS : Linux 6.8.0-71-generic
% 0.08/10.50 % CPULimit : 300
% 0.08/10.50 % WCLimit : 300
% 0.08/10.50 % DateTime : Mon Sep 21 01:45:16 UTC 2026
% 0.08/10.50 % CPUTime :
% 0.08/10.50 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/10.55 Running first-order theorem proving
% 0.08/10.55 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.26/10.61 % Version: 3.5.1
% 0.26/10.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/10.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/10.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/10.61 % Starting new_bool_3 with 300s (1) cores
% 0.26/10.61 % Starting new_bool_1 with 300s (1) cores
% 0.26/10.61 % Starting sh5l with 300s (1) cores
% 0.26/10.61 % new_bool_1 with pid 1101271 completed with status 1
% 0.26/10.61 % Result found by new_bool_1
% 0.26/10.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/10.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/10.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/10.61 % Starting new_bool_3 with 300s (1) cores
% 0.26/10.61 % Starting new_bool_1 with 300s (1) cores
% 0.26/10.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/10.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/10.61 % Search class: FGHNF-FFMM22-SFFFFFNN
% 0.26/10.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/10.61 % Starting SubtermCWHack with 31s (1) cores
% 0.26/10.61 % SubtermCWHack with pid 1101279 completed with status 1
% 0.26/10.61 % Result found by SubtermCWHack
% 0.26/10.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.26/10.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/10.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.26/10.61 % Starting new_bool_3 with 300s (1) cores
% 0.26/10.61 % Starting new_bool_1 with 300s (1) cores
% 0.26/10.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/10.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/10.61 % Search class: FGHNF-FFMM22-SFFFFFNN
% 0.26/10.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/10.61 % Starting SubtermCWHack with 31s (1) cores
% 0.26/10.61 % Preprocessing time : 0.001 s
% 0.26/10.61
% 0.26/10.61 % No proof found!
% 0.26/10.61 % SZS status Satisfiable
% 0.26/10.61 % SZS output start Saturation
% See solution above
% 0.26/10.61 % Parsed axioms : 54
% 0.26/10.61 % Removed by relevancy pruning/SinE : 0
% 0.26/10.61 % Initial clauses : 54
% 0.26/10.61 % Removed in clause preprocessing : 0
% 0.26/10.61 % Initial clauses in saturation : 54
% 0.26/10.61 % Processed clauses : 90
% 0.26/10.61 % ...of these trivial : 2
% 0.26/10.61 % ...subsumed : 0
% 0.26/10.61 % ...remaining for further processing : 88
% 0.26/10.61 % Other redundant clauses eliminated : 0
% 0.26/10.61 % Clauses deleted for lack of memory : 0
% 0.26/10.61 % Backward-subsumed : 35
% 0.26/10.61 % Backward-rewritten : 0
% 0.26/10.61 % Generated clauses : 41
% 0.26/10.61 % ...of the previous two non-redundant : 36
% 0.26/10.61 % ...aggressively subsumed : 0
% 0.26/10.61 % Contextual simplify-reflections : 38
% 0.26/10.61 % Paramodulations : 22
% 0.26/10.61 % Factorizations : 0
% 0.26/10.61 % NegExts : 0
% 0.26/10.61 % Equation resolutions : 0
% 0.26/10.61 % Disequality decompositions : 0
% 0.26/10.61 % Total rewrite steps : 14
% 0.26/10.61 % ...of those cached : 7
% 0.26/10.61 % Propositional unsat checks : 0
% 0.26/10.61 % Propositional check models : 0
% 0.26/10.61 % Propositional check unsatisfiable : 0
% 0.26/10.61 % Propositional clauses : 0
% 0.26/10.61 % Propositional clauses after purity: 0
% 0.26/10.61 % Propositional unsat core size : 0
% 0.26/10.61 % Propositional preprocessing time : 0.000
% 0.26/10.61 % Propositional encoding time : 0.000
% 0.26/10.61 % Propositional solver time : 0.000
% 0.26/10.61 % Success case prop preproc time : 0.000
% 0.26/10.61 % Success case prop encoding time : 0.000
% 0.26/10.61 % Success case prop solver time : 0.000
% 0.26/10.61 % Current number of processed clauses : 34
% 0.26/10.61 % Positive orientable unit clauses : 21
% 0.26/10.61 % Positive unorientable unit clauses: 0
% 0.26/10.61 % Negative unit clauses : 1
% 0.26/10.61 % Non-unit-clauses : 12
% 0.26/10.61 % Current number of unprocessed clauses: 0
% 0.26/10.61 % ...number of literals in the above : 0
% 0.26/10.61 % Current number of archived formulas : 0
% 0.26/10.61 % Current number of archived clauses : 54
% 0.26/10.61 % Clause-clause subsumption calls (NU) : 5208
% 0.26/10.61 % Rec. Clause-clause subsumption calls : 560
% 0.26/10.61 % Non-unit clause-clause subsumptions : 49
% 0.26/10.61 % Unit Clause-clause subsumption calls : 113
% 0.26/10.61 % Rewrite failures with RHS unbound : 0
% 0.26/10.61 % BW rewrite match attempts : 2
% 0.26/10.61 % BW rewrite match successes : 0
% 0.26/10.61 % Condensation attempts : 0
% 0.26/10.61 % Condensation successes : 0
% 0.26/10.61 % Termbank termtop insertions : 4448
% 0.26/10.61 % Search garbage collected termcells : 209
% 0.26/10.61
% 0.26/10.61 % -------------------------------------------------
% 0.26/10.61 % User time : 0.015 s
% 0.26/10.61 % System time : 0.006 s
% 0.26/10.61 % Total time : 0.021 s
% 0.26/10.61 % Maximum resident set size: 3692 pages
% 0.26/10.61
% 0.26/10.61 % -------------------------------------------------
% 0.26/10.61 % User time : 0.016 s
% 0.26/10.61 % System time : 0.012 s
% 0.26/10.61 % Total time : 0.028 s
% 0.26/10.61 % Maximum resident set size: 4864 pages
% 0.26/10.61 % E exiting
%------------------------------------------------------------------------------