%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP115-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:00 PM UTC 2026
% Result : Satisfiable 0.24s 0.60s
% Output : Saturation 0.24s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause1ERROR: Could not build tree for root c_0_39ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_39,negated_conjecture,
actual_world(skc17),
clause1,
[final] ).
cnf(c_0_63,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_57]),
[final] ).
cnf(c_0_80,negated_conjecture,
( ~ actual_world(X1)
| ~ event(X1,X4)
| ~ present(X1,X4)
| ~ barrel(X1,X4)
| ~ lonely(X1,X5)
| ~ street(X1,X5)
| ~ old(X1,X3)
| ~ dirty(X1,X3)
| ~ white(X1,X3)
| ~ chevy(X1,X3)
| ~ city(X1,X3)
| ~ hollywood_placename(X1,X2)
| ~ placename(X1,X2)
| ~ down(X1,X4,X5)
| ~ in(X1,X4,X3)
| ~ agent(X1,X4,X3)
| ~ of(X1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]),
[final] ).
cnf(c_0_81,negated_conjecture,
of(skc11,skc14,skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_63])]),
[final] ).
cnf(c_0_82,negated_conjecture,
placename(skc11,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_63])]),
[final] ).
cnf(c_0_83,negated_conjecture,
hollywood_placename(skc11,skc14),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_63])]),
[final] ).
cnf(c_0_84,negated_conjecture,
city(skc11,skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_63])]),
[final] ).
cnf(c_0_85,negated_conjecture,
actual_world(skc11),
clause2,
[final] ).
cnf(c_0_98,negated_conjecture,
( ~ event(skc11,X1)
| ~ present(skc11,X1)
| ~ barrel(skc11,X1)
| ~ lonely(skc11,X2)
| ~ street(skc11,X2)
| ~ old(skc11,skc15)
| ~ dirty(skc11,skc15)
| ~ white(skc11,skc15)
| ~ chevy(skc11,skc15)
| ~ down(skc11,X1,X2)
| ~ in(skc11,X1,skc15)
| ~ agent(skc11,X1,skc15) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]),c_0_83]),c_0_84]),c_0_85])]),
[final] ).
cnf(c_0_99,negated_conjecture,
down(skc11,skc12,skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_63])]),
[final] ).
cnf(c_0_100,negated_conjecture,
in(skc11,skc12,skc15),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_63])]),
[final] ).
cnf(c_0_101,negated_conjecture,
agent(skc11,skc12,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_63])]),
[final] ).
cnf(c_0_102,negated_conjecture,
event(skc11,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_63])]),
[final] ).
cnf(c_0_103,negated_conjecture,
present(skc11,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_63])]),
[final] ).
cnf(c_0_104,negated_conjecture,
barrel(skc11,skc12),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_63])]),
[final] ).
cnf(c_0_105,negated_conjecture,
lonely(skc11,skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_63])]),
[final] ).
cnf(c_0_106,negated_conjecture,
street(skc11,skc16),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_63])]),
[final] ).
cnf(c_0_107,negated_conjecture,
old(skc11,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_63])]),
[final] ).
cnf(c_0_108,negated_conjecture,
dirty(skc11,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_63])]),
[final] ).
cnf(c_0_109,negated_conjecture,
white(skc11,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_63])]),
[final] ).
cnf(c_0_110,negated_conjecture,
chevy(skc11,skc13),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_63])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NLP115-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.44 % Computer : n013.cluster.edu
% 0.16/0.44 % Model : x86_64 x86_64
% 0.16/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.44 % Memory : 8046.5625MB
% 0.16/0.44 % OS : Linux 6.8.0-71-generic
% 0.16/0.44 % CPULimit : 300
% 0.16/0.44 % WCLimit : 300
% 0.16/0.44 % DateTime : Mon Sep 21 01:40:07 UTC 2026
% 0.16/0.45 % CPUTime :
% 0.16/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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.24/0.60 % Version: 3.5.1
% 0.24/0.60 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.24/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.24/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.60 % Starting sh5l with 300s (1) cores
% 0.24/0.60 % new_bool_3 with pid 3888204 completed with status 1
% 0.24/0.60 % Result found by new_bool_3
% 0.24/0.60 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.24/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.24/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.60 % Search class: FGHNF-FFMM00-SFFFFFNN
% 0.24/0.60 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.60 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.60 % SubtermCWHack with pid 3888212 completed with status 1
% 0.24/0.60 % Result found by SubtermCWHack
% 0.24/0.60 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.24/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.24/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.60 % Search class: FGHNF-FFMM00-SFFFFFNN
% 0.24/0.60 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.60 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.60 % Preprocessing time : 0.001 s
% 0.24/0.60
% 0.24/0.60 % No proof found!
% 0.24/0.60 % SZS status Satisfiable
% 0.24/0.60 % SZS output start Saturation
% See solution above
% 0.24/0.60 % Parsed axioms : 36
% 0.24/0.60 % Removed by relevancy pruning/SinE : 0
% 0.24/0.60 % Initial clauses : 36
% 0.24/0.60 % Removed in clause preprocessing : 0
% 0.24/0.60 % Initial clauses in saturation : 36
% 0.24/0.60 % Processed clauses : 56
% 0.24/0.60 % ...of these trivial : 0
% 0.24/0.60 % ...subsumed : 0
% 0.24/0.60 % ...remaining for further processing : 56
% 0.24/0.60 % Other redundant clauses eliminated : 0
% 0.24/0.60 % Clauses deleted for lack of memory : 0
% 0.24/0.60 % Backward-subsumed : 0
% 0.24/0.60 % Backward-rewritten : 35
% 0.24/0.60 % Generated clauses : 5
% 0.24/0.60 % ...of the previous two non-redundant : 21
% 0.24/0.60 % ...aggressively subsumed : 0
% 0.24/0.60 % Contextual simplify-reflections : 13
% 0.24/0.60 % Paramodulations : 5
% 0.24/0.60 % Factorizations : 0
% 0.24/0.60 % NegExts : 0
% 0.24/0.60 % Equation resolutions : 0
% 0.24/0.60 % Disequality decompositions : 0
% 0.24/0.60 % Total rewrite steps : 42
% 0.24/0.60 % ...of those cached : 36
% 0.24/0.60 % Propositional unsat checks : 0
% 0.24/0.60 % Propositional check models : 0
% 0.24/0.60 % Propositional check unsatisfiable : 0
% 0.24/0.60 % Propositional clauses : 0
% 0.24/0.60 % Propositional clauses after purity: 0
% 0.24/0.60 % Propositional unsat core size : 0
% 0.24/0.60 % Propositional preprocessing time : 0.000
% 0.24/0.60 % Propositional encoding time : 0.000
% 0.24/0.60 % Propositional solver time : 0.000
% 0.24/0.60 % Success case prop preproc time : 0.000
% 0.24/0.60 % Success case prop encoding time : 0.000
% 0.24/0.60 % Success case prop solver time : 0.000
% 0.24/0.60 % Current number of processed clauses : 21
% 0.24/0.60 % Positive orientable unit clauses : 19
% 0.24/0.60 % Positive unorientable unit clauses: 0
% 0.24/0.60 % Negative unit clauses : 0
% 0.24/0.60 % Non-unit-clauses : 2
% 0.24/0.60 % Current number of unprocessed clauses: 0
% 0.24/0.60 % ...number of literals in the above : 0
% 0.24/0.60 % Current number of archived formulas : 0
% 0.24/0.60 % Current number of archived clauses : 35
% 0.24/0.60 % Clause-clause subsumption calls (NU) : 107
% 0.24/0.60 % Rec. Clause-clause subsumption calls : 77
% 0.24/0.60 % Non-unit clause-clause subsumptions : 13
% 0.24/0.60 % Unit Clause-clause subsumption calls : 0
% 0.24/0.60 % Rewrite failures with RHS unbound : 0
% 0.24/0.60 % BW rewrite match attempts : 1
% 0.24/0.60 % BW rewrite match successes : 1
% 0.24/0.60 % Condensation attempts : 0
% 0.24/0.60 % Condensation successes : 0
% 0.24/0.60 % Termbank termtop insertions : 1561
% 0.24/0.60 % Search garbage collected termcells : 105
% 0.24/0.60
% 0.24/0.60 % -------------------------------------------------
% 0.24/0.60 % User time : 0.007 s
% 0.24/0.60 % System time : 0.002 s
% 0.24/0.60 % Total time : 0.009 s
% 0.24/0.60 % Maximum resident set size: 3664 pages
% 0.24/0.60
% 0.24/0.60 % -------------------------------------------------
% 0.24/0.60 % User time : 0.008 s
% 0.24/0.60 % System time : 0.011 s
% 0.24/0.60 % Total time : 0.019 s
% 0.24/0.60 % Maximum resident set size: 4608 pages
% 0.24/0.60 % E exiting
%------------------------------------------------------------------------------