%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP006-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 : n007.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:34:05 PM UTC 2026
% Result : Satisfiable 0.15s 0.44s
% Output : Saturation 0.15s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_57ERROR: Could not build tree for root c_0_95ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_58,negated_conjecture,
( ~ seat(X7)
| ~ furniture(X7)
| ~ front(X7)
| ~ in(X6,X7)
| ~ in(X5,X7)
| ~ young(X6)
| ~ man(X6)
| ~ fellow(X6)
| ~ fellow(X5)
| ~ man(X5)
| ~ young(X5)
| ~ in(X3,X4)
| ~ city(X4)
| ~ hollywood(X4)
| ~ event(X3)
| ~ barrel(X3,X2)
| ~ down(X3,X1)
| ~ old(X2)
| ~ dirty(X2)
| ~ white(X2)
| ~ car(X2)
| ~ chevy(X2)
| ~ street(X1)
| ~ way(X1)
| ~ lonely(X1)
| X6 = X5
| ssSkC0 ),
c_0_57,
[final] ).
cnf(c_0_59,negated_conjecture,
( in(skc28,skc29)
| ssSkC0 ),
clause46,
[final] ).
cnf(c_0_60,negated_conjecture,
( in(skc23,skc24)
| ssSkC0 ),
clause48,
[final] ).
cnf(c_0_61,negated_conjecture,
fellow(skc23),
clause7,
[final] ).
cnf(c_0_62,negated_conjecture,
seat(skc24),
clause6,
[final] ).
cnf(c_0_63,negated_conjecture,
( front(skc24)
| ssSkC0 ),
clause27,
[final] ).
cnf(c_0_64,negated_conjecture,
( young(skc23)
| ssSkC0 ),
clause29,
[final] ).
cnf(c_0_65,negated_conjecture,
( furniture(skc24)
| ssSkC0 ),
clause28,
[final] ).
cnf(c_0_66,negated_conjecture,
( man(skc23)
| ssSkC0 ),
clause30,
[final] ).
cnf(c_0_67,negated_conjecture,
( in(skc22,skc25)
| ssSkC0 ),
clause47,
[final] ).
cnf(c_0_68,negated_conjecture,
young(skc22),
clause8,
[final] ).
cnf(c_0_69,negated_conjecture,
front(skc25),
clause5,
[final] ).
cnf(c_0_70,negated_conjecture,
( seat(skc25)
| ssSkC0 ),
clause23,
[final] ).
cnf(c_0_71,negated_conjecture,
( fellow(skc22)
| ssSkC0 ),
clause25,
[final] ).
cnf(c_0_72,negated_conjecture,
( furniture(skc25)
| ssSkC0 ),
clause24,
[final] ).
cnf(c_0_73,negated_conjecture,
( man(skc22)
| ssSkC0 ),
clause26,
[final] ).
cnf(c_0_95,negated_conjecture,
( ~ city(X3)
| ~ event(X2)
| ~ old(X4)
| ~ street(X5)
| ~ front(skc29)
| ~ seat(skc29)
| ~ fellow(X1)
| ~ fellow(skc28)
| ~ young(X1)
| ~ young(skc28)
| ~ lonely(X5)
| ~ way(X5)
| ~ chevy(X4)
| ~ car(X4)
| ~ white(X4)
| ~ dirty(X4)
| ~ hollywood(X3)
| ~ furniture(skc29)
| ~ man(X1)
| ~ man(skc28)
| ~ down(X2,X5)
| ~ barrel(X2,X4)
| ~ in(X2,X3)
| ~ in(X1,skc29)
| ssSkC0
| X1 = skc28 ),
inference(spm,[status(thm)],[c_0_58,c_0_59]),
[final] ).
cnf(c_0_96,negated_conjecture,
( ~ city(X3)
| ~ event(X2)
| ~ old(X4)
| ~ street(X5)
| ~ fellow(X1)
| ~ young(X1)
| ~ lonely(X5)
| ~ way(X5)
| ~ chevy(X4)
| ~ car(X4)
| ~ white(X4)
| ~ dirty(X4)
| ~ hollywood(X3)
| ~ man(X1)
| ~ down(X2,X5)
| ~ barrel(X2,X4)
| ~ in(X2,X3)
| ~ in(X1,skc24)
| ssSkC0
| X1 = skc23 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_60]),c_0_61]),c_0_62])]),c_0_63]),c_0_64]),c_0_65]),c_0_66]),
[final] ).
cnf(c_0_97,negated_conjecture,
( ~ city(X3)
| ~ event(X2)
| ~ old(X4)
| ~ street(X5)
| ~ fellow(X1)
| ~ young(X1)
| ~ lonely(X5)
| ~ way(X5)
| ~ chevy(X4)
| ~ car(X4)
| ~ white(X4)
| ~ dirty(X4)
| ~ hollywood(X3)
| ~ man(X1)
| ~ down(X2,X5)
| ~ barrel(X2,X4)
| ~ in(X2,X3)
| ~ in(X1,skc25)
| ssSkC0
| X1 = skc22 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_67]),c_0_68]),c_0_69])]),c_0_70]),c_0_71]),c_0_72]),c_0_73]),
[final] ).
cnf(c_0_98,negated_conjecture,
( ~ ssSkC0
| ~ fellow(X7)
| ~ man(X7)
| ~ young(X7)
| ~ seat(X8)
| ~ furniture(X8)
| ~ front(X8)
| ~ in(X7,X8)
| ~ young(X6)
| ~ man(X6)
| ~ fellow(X6)
| ~ in(X6,X5)
| ~ front(X5)
| ~ furniture(X5)
| ~ seat(X5)
| ~ in(X3,X4)
| ~ city(X4)
| ~ hollywood(X4)
| ~ event(X3)
| ~ barrel(X3,X2)
| ~ down(X3,X1)
| ~ old(X2)
| ~ dirty(X2)
| ~ white(X2)
| ~ car(X2)
| ~ chevy(X2)
| ~ street(X1)
| ~ way(X1)
| ~ lonely(X1)
| X7 = X6 ),
c_0_74,
[final] ).
cnf(c_0_99,negated_conjecture,
( barrel(skc28,skc27)
| ssSkC0 ),
clause45,
[final] ).
cnf(c_0_100,negated_conjecture,
( down(skc28,skc26)
| ssSkC0 ),
clause44,
[final] ).
cnf(c_0_101,negated_conjecture,
( ~ ssSkC0
| in(skc15,skc17) ),
c_0_75,
[final] ).
cnf(c_0_102,negated_conjecture,
( ~ ssSkC0
| in(skc16,skc17) ),
c_0_76,
[final] ).
cnf(c_0_103,negated_conjecture,
( ~ ssSkC0
| in(skc20,skc21) ),
c_0_77,
[final] ).
cnf(c_0_104,negated_conjecture,
( ~ ssSkC0
| barrel(skc20,skc19) ),
c_0_78,
[final] ).
cnf(c_0_105,negated_conjecture,
( ~ ssSkC0
| down(skc20,skc18) ),
c_0_79,
[final] ).
cnf(c_0_106,negated_conjecture,
( hollywood(skc29)
| ssSkC0 ),
clause22,
[final] ).
cnf(c_0_107,negated_conjecture,
( dirty(skc27)
| ssSkC0 ),
clause21,
[final] ).
cnf(c_0_108,negated_conjecture,
( white(skc27)
| ssSkC0 ),
clause20,
[final] ).
cnf(c_0_109,negated_conjecture,
( car(skc27)
| ssSkC0 ),
clause19,
[final] ).
cnf(c_0_110,negated_conjecture,
( chevy(skc27)
| ssSkC0 ),
clause18,
[final] ).
cnf(c_0_111,negated_conjecture,
( way(skc26)
| ssSkC0 ),
clause17,
[final] ).
cnf(c_0_112,negated_conjecture,
( lonely(skc26)
| ssSkC0 ),
clause16,
[final] ).
cnf(c_0_113,negated_conjecture,
( ~ ssSkC0
| man(skc15) ),
c_0_80,
[final] ).
cnf(c_0_114,negated_conjecture,
( ~ ssSkC0
| man(skc16) ),
c_0_81,
[final] ).
cnf(c_0_115,negated_conjecture,
( ~ ssSkC0
| furniture(skc17) ),
c_0_82,
[final] ).
cnf(c_0_116,negated_conjecture,
( ~ ssSkC0
| hollywood(skc21) ),
c_0_83,
[final] ).
cnf(c_0_117,negated_conjecture,
( ~ ssSkC0
| dirty(skc19) ),
c_0_84,
[final] ).
cnf(c_0_118,negated_conjecture,
( ~ ssSkC0
| white(skc19) ),
c_0_85,
[final] ).
cnf(c_0_119,negated_conjecture,
( ~ ssSkC0
| car(skc19) ),
c_0_86,
[final] ).
cnf(c_0_120,negated_conjecture,
( ~ ssSkC0
| chevy(skc19) ),
c_0_87,
[final] ).
cnf(c_0_121,negated_conjecture,
( ~ ssSkC0
| way(skc18) ),
c_0_88,
[final] ).
cnf(c_0_122,negated_conjecture,
( ~ ssSkC0
| lonely(skc18) ),
c_0_89,
[final] ).
cnf(c_0_123,negated_conjecture,
( ~ ssSkC0
| young(skc15) ),
c_0_90,
[final] ).
cnf(c_0_124,negated_conjecture,
( ~ ssSkC0
| fellow(skc16) ),
c_0_91,
[final] ).
cnf(c_0_125,negated_conjecture,
( ~ ssSkC0
| front(skc17) ),
c_0_92,
[final] ).
cnf(c_0_126,negated_conjecture,
( skc23 != skc22
| ssSkC0 ),
c_0_93,
[final] ).
cnf(c_0_127,negated_conjecture,
( ~ ssSkC0
| skc16 != skc15 ),
c_0_94,
[final] ).
cnf(c_0_128,negated_conjecture,
young(skc16),
clause14,
[final] ).
cnf(c_0_129,negated_conjecture,
fellow(skc15),
clause15,
[final] ).
cnf(c_0_130,negated_conjecture,
seat(skc17),
clause13,
[final] ).
cnf(c_0_131,negated_conjecture,
street(skc18),
clause12,
[final] ).
cnf(c_0_132,negated_conjecture,
street(skc26),
clause4,
[final] ).
cnf(c_0_133,negated_conjecture,
old(skc19),
clause11,
[final] ).
cnf(c_0_134,negated_conjecture,
old(skc27),
clause3,
[final] ).
cnf(c_0_135,negated_conjecture,
event(skc20),
clause10,
[final] ).
cnf(c_0_136,negated_conjecture,
event(skc28),
clause2,
[final] ).
cnf(c_0_137,negated_conjecture,
city(skc21),
clause9,
[final] ).
cnf(c_0_138,negated_conjecture,
city(skc29),
clause1,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP006-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n007.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:29:05 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.41 Running first-order theorem proving
% 0.15/0.41 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.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 4073931 completed with status 1
% 0.15/0.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FGHSF-FFMM00-SFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 4073936 completed with status 1
% 0.15/0.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.44 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FGHSF-FFMM00-SFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.44 % Preprocessing time : 0.002 s
% 0.15/0.44 % Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 % No proof found!
% 0.15/0.44 % SZS status Satisfiable
% 0.15/0.44 % SZS output start Saturation
% See solution above
% 0.15/0.44 % Parsed axioms : 57
% 0.15/0.44 % Removed by relevancy pruning/SinE : 0
% 0.15/0.44 % Initial clauses : 57
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 57
% 0.15/0.44 % Processed clauses : 117
% 0.15/0.44 % ...of these trivial : 0
% 0.15/0.44 % ...subsumed : 0
% 0.15/0.44 % ...remaining for further processing : 117
% 0.15/0.44 % Other redundant clauses eliminated : 0
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 0
% 0.15/0.44 % Backward-rewritten : 0
% 0.15/0.44 % Generated clauses : 3
% 0.15/0.44 % ...of the previous two non-redundant : 3
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 8
% 0.15/0.44 % Paramodulations : 3
% 0.15/0.44 % Factorizations : 0
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 0
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 4
% 0.15/0.44 % ...of those cached : 0
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 60
% 0.15/0.44 % Positive orientable unit clauses : 15
% 0.15/0.44 % Positive unorientable unit clauses: 0
% 0.15/0.44 % Negative unit clauses : 0
% 0.15/0.44 % Non-unit-clauses : 45
% 0.15/0.44 % Current number of unprocessed clauses: 0
% 0.15/0.44 % ...number of literals in the above : 0
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 57
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 2109
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 903
% 0.15/0.44 % Non-unit clause-clause subsumptions : 8
% 0.15/0.44 % Unit Clause-clause subsumption calls : 14
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 0
% 0.15/0.44 % BW rewrite match successes : 0
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 2326
% 0.15/0.44 % Search garbage collected termcells : 151
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.011 s
% 0.15/0.44 % System time : 0.002 s
% 0.15/0.44 % Total time : 0.013 s
% 0.15/0.44 % Maximum resident set size: 3628 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.048 s
% 0.15/0.44 % System time : 0.013 s
% 0.15/0.44 % Total time : 0.061 s
% 0.15/0.44 % Maximum resident set size: 4864 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------