%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP237-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 : n018.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:48 PM UTC 2026
% Result : Satisfiable 0.19s 0.48s
% Output : Saturation 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause1ERROR: Could not build tree for root c_0_88ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_88,negated_conjecture,
actual_world(skc47),
clause1,
[final] ).
cnf(c_0_171,negated_conjecture,
actual_world(skc29),
clause2,
[final] ).
cnf(c_0_208,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_130]),c_0_131]),c_0_132]),
[final] ).
cnf(c_0_244,negated_conjecture,
( ~ actual_world(X1)
| ~ accessible_world(X1,X4)
| ~ accessible_world(X1,skc40)
| ~ proposition(X1,X4)
| ~ proposition(X1,skc40)
| ~ event(X1,X8)
| ~ event(X1,X7)
| ~ event(X4,X5)
| ~ present(X1,X8)
| ~ present(X1,X7)
| ~ present(X4,X5)
| ~ think_believe_consider(X1,X8)
| ~ think_believe_consider(X1,X7)
| ~ forename(X1,X13)
| ~ forename(X1,X12)
| ~ forename(X1,X11)
| ~ forename(X1,X10)
| ~ vincent_forename(X1,X13)
| ~ vincent_forename(X1,X11)
| ~ man(X1,X9)
| ~ man(X1,X6)
| ~ man(X1,X3)
| ~ jules_forename(X1,X12)
| ~ jules_forename(X1,X10)
| ~ smoke(X4,X5)
| ~ smoke(skc40,skf5(skf7(skc40)))
| ~ state(X1,X2)
| ~ theme(X1,X7,X4)
| ~ theme(X1,X8,skc40)
| ~ of(X1,X13,X9)
| ~ of(X1,X12,X6)
| ~ of(X1,X11,X3)
| ~ of(X1,X10,X3)
| ~ agent(X1,X8,X9)
| ~ agent(X1,X7,X3)
| ~ agent(X4,X5,X6)
| ~ be(X1,X2,X3,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_207,c_0_208])]),
[final] ).
cnf(c_0_245,negated_conjecture,
( ~ man(skc40,X1)
| agent(skc40,skf5(X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_164,c_0_208])]),
[final] ).
cnf(c_0_246,negated_conjecture,
( ~ man(skc40,X2)
| event(skc40,skf5(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_165,c_0_208])]),
[final] ).
cnf(c_0_247,negated_conjecture,
( ~ man(skc40,X2)
| present(skc40,skf5(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_208])]),
[final] ).
cnf(c_0_248,negated_conjecture,
( ~ man(skc40,X2)
| smoke(skc40,skf5(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_209,c_0_208])]),
[final] ).
cnf(c_0_249,negated_conjecture,
( ~ actual_world(X2)
| ~ accessible_world(X2,X1)
| ~ accessible_world(X2,X5)
| ~ proposition(X2,X1)
| ~ proposition(X2,X5)
| ~ event(X2,X9)
| ~ event(X2,X8)
| ~ event(X5,X6)
| ~ present(X2,X9)
| ~ present(X2,X8)
| ~ present(X5,X6)
| ~ think_believe_consider(X2,X9)
| ~ think_believe_consider(X2,X8)
| ~ forename(X2,X14)
| ~ forename(X2,X13)
| ~ forename(X2,X12)
| ~ forename(X2,X11)
| ~ vincent_forename(X2,X14)
| ~ vincent_forename(X2,X12)
| ~ man(X2,X10)
| ~ man(X2,X7)
| ~ man(X2,X4)
| ~ jules_forename(X2,X13)
| ~ jules_forename(X2,X11)
| ~ smoke(X5,X6)
| ~ state(X2,X3)
| ~ theme(X2,X9,X1)
| ~ theme(X2,X8,X5)
| ~ of(X2,X14,X10)
| ~ of(X2,X13,X7)
| ~ of(X2,X12,X4)
| ~ of(X2,X11,X4)
| ~ agent(X2,X9,X10)
| ~ agent(X2,X8,X4)
| ~ agent(X5,X6,X7)
| ~ be(X2,X3,X4,X4)
| man(X1,skf7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_167,c_0_208])]),
[final] ).
cnf(c_0_250,negated_conjecture,
( ~ actual_world(X1)
| ~ accessible_world(X1,X4)
| ~ accessible_world(X1,X6)
| ~ proposition(X1,X4)
| ~ proposition(X1,X6)
| ~ event(X4,X5)
| ~ event(X1,X10)
| ~ event(X1,X9)
| ~ event(X6,X7)
| ~ present(X4,X5)
| ~ present(X1,X10)
| ~ present(X1,X9)
| ~ present(X6,X7)
| ~ think_believe_consider(X1,X10)
| ~ think_believe_consider(X1,X9)
| ~ forename(X1,X15)
| ~ forename(X1,X14)
| ~ forename(X1,X13)
| ~ forename(X1,X12)
| ~ vincent_forename(X1,X15)
| ~ vincent_forename(X1,X13)
| ~ man(X1,X11)
| ~ man(X1,X8)
| ~ man(X1,X3)
| ~ jules_forename(X1,X14)
| ~ jules_forename(X1,X12)
| ~ smoke(X4,X5)
| ~ smoke(X6,X7)
| ~ state(X1,X2)
| ~ theme(X1,X10,X4)
| ~ theme(X1,X9,X6)
| ~ of(X1,X15,X11)
| ~ of(X1,X14,X8)
| ~ of(X1,X13,X3)
| ~ of(X1,X12,X3)
| ~ agent(X1,X10,X11)
| ~ agent(X1,X9,X3)
| ~ agent(X6,X7,X8)
| ~ agent(X4,X5,skf7(X4))
| ~ be(X1,X2,X3,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_163,c_0_208])]),
[final] ).
cnf(c_0_251,negated_conjecture,
( ~ accessible_world(skc29,X1)
| ~ accessible_world(skc29,X5)
| ~ proposition(skc29,X1)
| ~ proposition(skc29,X5)
| ~ event(X5,X6)
| ~ event(skc29,X3)
| ~ event(skc29,X2)
| ~ present(X5,X6)
| ~ present(skc29,X3)
| ~ present(skc29,X2)
| ~ think_believe_consider(skc29,X3)
| ~ think_believe_consider(skc29,X2)
| ~ forename(skc29,X11)
| ~ forename(skc29,X10)
| ~ forename(skc29,X9)
| ~ forename(skc29,X8)
| ~ vincent_forename(skc29,X11)
| ~ vincent_forename(skc29,X9)
| ~ man(skc29,X4)
| ~ man(skc29,X7)
| ~ jules_forename(skc29,X10)
| ~ jules_forename(skc29,X8)
| ~ smoke(X5,X6)
| ~ theme(skc29,X3,X1)
| ~ theme(skc29,X2,X5)
| ~ of(skc29,X11,X4)
| ~ of(skc29,X10,X7)
| ~ of(skc29,X9,skc38)
| ~ of(skc29,X8,skc38)
| ~ agent(X5,X6,X7)
| ~ agent(skc29,X3,X4)
| ~ agent(skc29,X2,skc38)
| man(X1,skf7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_210,c_0_208])]),
[final] ).
cnf(c_0_252,negated_conjecture,
be(skc29,skc37,skc38,skc38),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_170,c_0_208])]),
[final] ).
cnf(c_0_253,negated_conjecture,
theme(skc29,skc41,skc40),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_211,c_0_208])]),
[final] ).
cnf(c_0_254,negated_conjecture,
theme(skc29,skc31,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_212,c_0_208])]),
[final] ).
cnf(c_0_255,negated_conjecture,
of(skc29,skc42,skc43),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_213,c_0_208])]),
[final] ).
cnf(c_0_256,negated_conjecture,
of(skc29,skc39,skc38),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_214,c_0_208])]),
[final] ).
cnf(c_0_257,negated_conjecture,
of(skc29,skc34,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_215,c_0_208])]),
[final] ).
cnf(c_0_258,negated_conjecture,
of(skc29,skc32,skc33),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_216,c_0_208])]),
[final] ).
cnf(c_0_259,negated_conjecture,
agent(skc29,skc41,skc43),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_217,c_0_208])]),
[final] ).
cnf(c_0_260,negated_conjecture,
agent(skc29,skc31,skc33),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_218,c_0_208])]),
[final] ).
cnf(c_0_261,negated_conjecture,
agent(skc30,skc36,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_219,c_0_208])]),
[final] ).
cnf(c_0_262,negated_conjecture,
accessible_world(skc29,skc40),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_220,c_0_208])]),
[final] ).
cnf(c_0_263,negated_conjecture,
accessible_world(skc29,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_221,c_0_208])]),
[final] ).
cnf(c_0_264,negated_conjecture,
proposition(skc29,skc40),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_222,c_0_208])]),
[final] ).
cnf(c_0_265,negated_conjecture,
proposition(skc29,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_208])]),
[final] ).
cnf(c_0_266,negated_conjecture,
event(skc29,skc41),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_224,c_0_208])]),
[final] ).
cnf(c_0_267,negated_conjecture,
event(skc29,skc31),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_208])]),
[final] ).
cnf(c_0_268,negated_conjecture,
event(skc30,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_226,c_0_208])]),
[final] ).
cnf(c_0_269,negated_conjecture,
present(skc29,skc41),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_227,c_0_208])]),
[final] ).
cnf(c_0_270,negated_conjecture,
present(skc29,skc31),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_228,c_0_208])]),
[final] ).
cnf(c_0_271,negated_conjecture,
present(skc30,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_229,c_0_208])]),
[final] ).
cnf(c_0_272,negated_conjecture,
think_believe_consider(skc29,skc41),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_230,c_0_208])]),
[final] ).
cnf(c_0_273,negated_conjecture,
think_believe_consider(skc29,skc31),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_231,c_0_208])]),
[final] ).
cnf(c_0_274,negated_conjecture,
forename(skc29,skc42),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_232,c_0_208])]),
[final] ).
cnf(c_0_275,negated_conjecture,
forename(skc29,skc39),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_233,c_0_208])]),
[final] ).
cnf(c_0_276,negated_conjecture,
forename(skc29,skc34),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_234,c_0_208])]),
[final] ).
cnf(c_0_277,negated_conjecture,
forename(skc29,skc32),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_235,c_0_208])]),
[final] ).
cnf(c_0_278,negated_conjecture,
vincent_forename(skc29,skc42),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_236,c_0_208])]),
[final] ).
cnf(c_0_279,negated_conjecture,
vincent_forename(skc29,skc32),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_237,c_0_208])]),
[final] ).
cnf(c_0_280,negated_conjecture,
man(skc29,skc43),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_238,c_0_208])]),
[final] ).
cnf(c_0_281,negated_conjecture,
man(skc29,skc38),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_172,c_0_208])]),
[final] ).
cnf(c_0_282,negated_conjecture,
man(skc29,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_239,c_0_208])]),
[final] ).
cnf(c_0_283,negated_conjecture,
man(skc29,skc33),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_240,c_0_208])]),
[final] ).
cnf(c_0_284,negated_conjecture,
jules_forename(skc29,skc39),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_241,c_0_208])]),
[final] ).
cnf(c_0_285,negated_conjecture,
jules_forename(skc29,skc34),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_242,c_0_208])]),
[final] ).
cnf(c_0_286,negated_conjecture,
smoke(skc30,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_243,c_0_208])]),
[final] ).
cnf(c_0_287,negated_conjecture,
state(skc29,skc37),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_173,c_0_208])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NLP237-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n018.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 01:55:28 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.19/0.48 % Version: 3.5.1
% 0.19/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.48 % Starting sh5l with 300s (1) cores
% 0.19/0.48 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 726203 completed with status 1
% 0.19/0.48 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.48 % No SInE strategy applied
% 0.19/0.48 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.19/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.19/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.19/0.48 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 726210 completed with status 1
% 0.19/0.48 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.48 % No SInE strategy applied
% 0.19/0.48 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.19/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.48 % Preprocessing time : 0.002 s
% 0.19/0.48 % Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 % No proof found!
% 0.19/0.48 % SZS status Satisfiable
% 0.19/0.48 % SZS output start Saturation
% See solution above
% 0.19/0.48 % Parsed axioms : 85
% 0.19/0.48 % Removed by relevancy pruning/SinE : 0
% 0.19/0.48 % Initial clauses : 85
% 0.19/0.48 % Removed in clause preprocessing : 0
% 0.19/0.48 % Initial clauses in saturation : 85
% 0.19/0.48 % Processed clauses : 263
% 0.19/0.48 % ...of these trivial : 3
% 0.19/0.48 % ...subsumed : 4
% 0.19/0.48 % ...remaining for further processing : 256
% 0.19/0.48 % Other redundant clauses eliminated : 0
% 0.19/0.48 % Clauses deleted for lack of memory : 0
% 0.19/0.48 % Backward-subsumed : 28
% 0.19/0.48 % Backward-rewritten : 96
% 0.19/0.48 % Generated clauses : 54
% 0.19/0.48 % ...of the previous two non-redundant : 98
% 0.19/0.48 % ...aggressively subsumed : 0
% 0.19/0.48 % Contextual simplify-reflections : 99
% 0.19/0.48 % Paramodulations : 54
% 0.19/0.48 % Factorizations : 0
% 0.19/0.48 % NegExts : 0
% 0.19/0.48 % Equation resolutions : 0
% 0.19/0.48 % Disequality decompositions : 0
% 0.19/0.48 % Total rewrite steps : 105
% 0.19/0.48 % ...of those cached : 100
% 0.19/0.48 % Propositional unsat checks : 0
% 0.19/0.48 % Propositional check models : 0
% 0.19/0.48 % Propositional check unsatisfiable : 0
% 0.19/0.48 % Propositional clauses : 0
% 0.19/0.48 % Propositional clauses after purity: 0
% 0.19/0.48 % Propositional unsat core size : 0
% 0.19/0.48 % Propositional preprocessing time : 0.000
% 0.19/0.48 % Propositional encoding time : 0.000
% 0.19/0.48 % Propositional solver time : 0.000
% 0.19/0.48 % Success case prop preproc time : 0.000
% 0.19/0.48 % Success case prop encoding time : 0.000
% 0.19/0.48 % Success case prop solver time : 0.000
% 0.19/0.48 % Current number of processed clauses : 47
% 0.19/0.48 % Positive orientable unit clauses : 39
% 0.19/0.48 % Positive unorientable unit clauses: 0
% 0.19/0.48 % Negative unit clauses : 0
% 0.19/0.48 % Non-unit-clauses : 8
% 0.19/0.48 % Current number of unprocessed clauses: 0
% 0.19/0.48 % ...number of literals in the above : 0
% 0.19/0.48 % Current number of archived formulas : 0
% 0.19/0.48 % Current number of archived clauses : 209
% 0.19/0.48 % Clause-clause subsumption calls (NU) : 15188
% 0.19/0.48 % Rec. Clause-clause subsumption calls : 1607
% 0.19/0.48 % Non-unit clause-clause subsumptions : 131
% 0.19/0.48 % Unit Clause-clause subsumption calls : 0
% 0.19/0.48 % Rewrite failures with RHS unbound : 0
% 0.19/0.48 % BW rewrite match attempts : 1
% 0.19/0.48 % BW rewrite match successes : 1
% 0.19/0.48 % Condensation attempts : 0
% 0.19/0.48 % Condensation successes : 0
% 0.19/0.48 % Termbank termtop insertions : 11758
% 0.19/0.48 % Search garbage collected termcells : 482
% 0.19/0.48
% 0.19/0.48 % -------------------------------------------------
% 0.19/0.48 % User time : 0.027 s
% 0.19/0.48 % System time : 0.003 s
% 0.19/0.48 % Total time : 0.030 s
% 0.19/0.48 % Maximum resident set size: 3748 pages
% 0.19/0.48
% 0.19/0.48 % -------------------------------------------------
% 0.19/0.48 % User time : 0.141 s
% 0.19/0.48 % System time : 0.016 s
% 0.19/0.48 % Total time : 0.157 s
% 0.19/0.48 % Maximum resident set size: 4864 pages
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------