%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP221-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 : 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:41 PM UTC 2026
% Result : Satisfiable 0.09s 0.44s
% Output : Saturation 0.09s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause1ERROR: Could not build tree for root c_0_52ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_52,negated_conjecture,
actual_world(skc29),
clause1,
[final] ).
cnf(c_0_68,negated_conjecture,
actual_world(skc17),
clause2,
[final] ).
cnf(c_0_149,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_94]),c_0_95]),c_0_96]),
[final] ).
cnf(c_0_154,negated_conjecture,
( ~ actual_world(X2)
| ~ state(X2,X3)
| ~ man(X2,X5)
| ~ man(X2,X4)
| ~ accessible_world(X2,X1)
| ~ proposition(X2,X1)
| ~ event(X2,X6)
| ~ present(X2,X6)
| ~ think_believe_consider(X2,X6)
| ~ forename(X2,X8)
| ~ forename(X2,X7)
| ~ vincent_forename(X2,X8)
| ~ jules_forename(X2,X7)
| ~ theme(X2,X6,X1)
| ~ of(X2,X8,X4)
| ~ of(X2,X7,X4)
| ~ agent(X2,X6,X4)
| ~ be(X2,X3,X4,X5)
| man(X1,skf7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_149])]),
[final] ).
cnf(c_0_155,negated_conjecture,
( ~ man(skc22,X1)
| agent(skc22,skf5(X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_149])]),
[final] ).
cnf(c_0_156,negated_conjecture,
( ~ man(skc22,X2)
| event(skc22,skf5(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_131,c_0_149])]),
[final] ).
cnf(c_0_157,negated_conjecture,
( ~ man(skc22,X2)
| present(skc22,skf5(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_132,c_0_149])]),
[final] ).
cnf(c_0_158,negated_conjecture,
( ~ man(skc22,X2)
| smoke(skc22,skf5(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_149])]),
[final] ).
cnf(c_0_159,negated_conjecture,
( ~ accessible_world(skc17,X1)
| ~ proposition(skc17,X1)
| ~ event(skc17,X2)
| ~ present(skc17,X2)
| ~ think_believe_consider(skc17,X2)
| ~ forename(skc17,X4)
| ~ forename(skc17,X3)
| ~ vincent_forename(skc17,X4)
| ~ jules_forename(skc17,X3)
| ~ theme(skc17,X2,X1)
| ~ of(skc17,X4,skc21)
| ~ of(skc17,X3,skc21)
| ~ agent(skc17,X2,skc21)
| man(X1,skf7(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_149])]),
[final] ).
cnf(c_0_160,negated_conjecture,
( ~ forename(skc17,X1)
| ~ vincent_forename(skc17,X1)
| ~ of(skc17,X1,skc21)
| ~ agent(skc17,skc23,skc21)
| man(skc22,skf7(skc22)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_117,c_0_149])]),
[final] ).
cnf(c_0_161,negated_conjecture,
( ~ actual_world(X1)
| ~ state(X1,X2)
| ~ man(X1,X4)
| ~ man(X1,X3)
| ~ accessible_world(X1,skc22)
| ~ proposition(X1,skc22)
| ~ event(X1,X5)
| ~ event(skc22,skf5(skf7(skc22)))
| ~ present(X1,X5)
| ~ present(skc22,skf5(skf7(skc22)))
| ~ think_believe_consider(X1,X5)
| ~ forename(X1,X7)
| ~ forename(X1,X6)
| ~ vincent_forename(X1,X7)
| ~ jules_forename(X1,X6)
| ~ theme(X1,X5,skc22)
| ~ of(X1,X7,X3)
| ~ of(X1,X6,X3)
| ~ agent(X1,X5,X3)
| ~ be(X1,X2,X3,X4)
| ~ smoke(skc22,skf5(skf7(skc22))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_134,c_0_149])]),
[final] ).
cnf(c_0_162,negated_conjecture,
( ~ actual_world(X3)
| ~ state(X3,X4)
| ~ man(X3,X6)
| ~ man(X3,X5)
| ~ accessible_world(X3,X1)
| ~ proposition(X3,X1)
| ~ event(X3,X7)
| ~ event(X1,X2)
| ~ present(X3,X7)
| ~ present(X1,X2)
| ~ think_believe_consider(X3,X7)
| ~ forename(X3,X9)
| ~ forename(X3,X8)
| ~ vincent_forename(X3,X9)
| ~ jules_forename(X3,X8)
| ~ theme(X3,X7,X1)
| ~ of(X3,X9,X5)
| ~ of(X3,X8,X5)
| ~ agent(X3,X7,X5)
| ~ agent(X1,X2,skf7(X1))
| ~ be(X3,X4,X5,X6)
| ~ smoke(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_127,c_0_149])]),
[final] ).
cnf(c_0_163,negated_conjecture,
( ~ of(skc17,skc24,skc21)
| ~ agent(skc17,skc23,skc21) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_150,c_0_149])]),
[final] ).
cnf(c_0_164,negated_conjecture,
be(skc17,skc18,skc21,skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_149])]),
[final] ).
cnf(c_0_165,negated_conjecture,
theme(skc17,skc23,skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_149])]),
[final] ).
cnf(c_0_166,negated_conjecture,
of(skc17,skc24,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_151,c_0_149])]),
[final] ).
cnf(c_0_167,negated_conjecture,
of(skc17,skc20,skc21),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_149])]),
[final] ).
cnf(c_0_168,negated_conjecture,
agent(skc17,skc23,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_152,c_0_149])]),
[final] ).
cnf(c_0_169,negated_conjecture,
state(skc17,skc18),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_149])]),
[final] ).
cnf(c_0_170,negated_conjecture,
man(skc17,skc25),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_153,c_0_149])]),
[final] ).
cnf(c_0_171,negated_conjecture,
man(skc17,skc19),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_149])]),
[final] ).
cnf(c_0_172,negated_conjecture,
man(skc17,skc21),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_149])]),
[final] ).
cnf(c_0_173,negated_conjecture,
accessible_world(skc17,skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_149])]),
[final] ).
cnf(c_0_174,negated_conjecture,
proposition(skc17,skc22),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_149])]),
[final] ).
cnf(c_0_175,negated_conjecture,
event(skc17,skc23),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_149])]),
[final] ).
cnf(c_0_176,negated_conjecture,
present(skc17,skc23),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_149])]),
[final] ).
cnf(c_0_177,negated_conjecture,
think_believe_consider(skc17,skc23),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_149])]),
[final] ).
cnf(c_0_178,negated_conjecture,
forename(skc17,skc24),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_149])]),
[final] ).
cnf(c_0_179,negated_conjecture,
forename(skc17,skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_149])]),
[final] ).
cnf(c_0_180,negated_conjecture,
vincent_forename(skc17,skc24),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_118,c_0_149])]),
[final] ).
cnf(c_0_181,negated_conjecture,
jules_forename(skc17,skc20),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_149])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NLP221-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n018.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 01:53:14 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/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.09/0.44 % Version: 3.5.1
% 0.09/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.44 % Starting sh5l with 300s (1) cores
% 0.09/0.44 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 722932 completed with status 1
% 0.09/0.44 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.09/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.44 % No SInE strategy applied
% 0.09/0.44 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.09/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.09/0.44 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 722939 completed with status 1
% 0.09/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.09/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.44 % No SInE strategy applied
% 0.09/0.44 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.09/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/0.44 % Preprocessing time : 0.001 s
% 0.09/0.44 % Presaturation interreduction done
% 0.09/0.44
% 0.09/0.44 % No proof found!
% 0.09/0.44 % SZS status Satisfiable
% 0.09/0.44 % SZS output start Saturation
% See solution above
% 0.09/0.44 % Parsed axioms : 49
% 0.09/0.44 % Removed by relevancy pruning/SinE : 0
% 0.09/0.44 % Initial clauses : 49
% 0.09/0.44 % Removed in clause preprocessing : 0
% 0.09/0.44 % Initial clauses in saturation : 49
% 0.09/0.44 % Processed clauses : 158
% 0.09/0.44 % ...of these trivial : 2
% 0.09/0.44 % ...subsumed : 4
% 0.09/0.44 % ...remaining for further processing : 152
% 0.09/0.44 % Other redundant clauses eliminated : 0
% 0.09/0.44 % Clauses deleted for lack of memory : 0
% 0.09/0.44 % Backward-subsumed : 15
% 0.09/0.44 % Backward-rewritten : 57
% 0.09/0.44 % Generated clauses : 39
% 0.09/0.44 % ...of the previous two non-redundant : 62
% 0.09/0.44 % ...aggressively subsumed : 0
% 0.09/0.44 % Contextual simplify-reflections : 62
% 0.09/0.44 % Paramodulations : 39
% 0.09/0.44 % Factorizations : 0
% 0.09/0.44 % NegExts : 0
% 0.09/0.44 % Equation resolutions : 0
% 0.09/0.44 % Disequality decompositions : 0
% 0.09/0.44 % Total rewrite steps : 75
% 0.09/0.44 % ...of those cached : 63
% 0.09/0.44 % Propositional unsat checks : 0
% 0.09/0.44 % Propositional check models : 0
% 0.09/0.44 % Propositional check unsatisfiable : 0
% 0.09/0.44 % Propositional clauses : 0
% 0.09/0.44 % Propositional clauses after purity: 0
% 0.09/0.44 % Propositional unsat core size : 0
% 0.09/0.44 % Propositional preprocessing time : 0.000
% 0.09/0.44 % Propositional encoding time : 0.000
% 0.09/0.44 % Propositional solver time : 0.000
% 0.09/0.44 % Success case prop preproc time : 0.000
% 0.09/0.44 % Success case prop encoding time : 0.000
% 0.09/0.44 % Success case prop solver time : 0.000
% 0.09/0.44 % Current number of processed clauses : 31
% 0.09/0.44 % Positive orientable unit clauses : 21
% 0.09/0.44 % Positive unorientable unit clauses: 0
% 0.09/0.44 % Negative unit clauses : 0
% 0.09/0.44 % Non-unit-clauses : 10
% 0.09/0.44 % Current number of unprocessed clauses: 0
% 0.09/0.44 % ...number of literals in the above : 0
% 0.09/0.44 % Current number of archived formulas : 0
% 0.09/0.44 % Current number of archived clauses : 121
% 0.09/0.44 % Clause-clause subsumption calls (NU) : 2458
% 0.09/0.44 % Rec. Clause-clause subsumption calls : 571
% 0.09/0.44 % Non-unit clause-clause subsumptions : 81
% 0.09/0.44 % Unit Clause-clause subsumption calls : 6
% 0.09/0.44 % Rewrite failures with RHS unbound : 0
% 0.09/0.44 % BW rewrite match attempts : 3
% 0.09/0.44 % BW rewrite match successes : 1
% 0.09/0.44 % Condensation attempts : 0
% 0.09/0.44 % Condensation successes : 0
% 0.09/0.44 % Termbank termtop insertions : 5571
% 0.09/0.44 % Search garbage collected termcells : 252
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.012 s
% 0.09/0.44 % System time : 0.003 s
% 0.09/0.44 % Total time : 0.014 s
% 0.09/0.44 % Maximum resident set size: 3696 pages
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.052 s
% 0.09/0.44 % System time : 0.015 s
% 0.09/0.44 % Total time : 0.067 s
% 0.09/0.44 % Maximum resident set size: 4864 pages
% 0.09/0.44 % E exiting
%------------------------------------------------------------------------------