%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP223-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 : n005.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.12s 0.44s
% Output : Saturation 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_48ERROR: Could not build tree for root c_0_54ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_49,negated_conjecture,
( ~ actual_world(X1)
| ~ of(X1,X8,X7)
| ~ jules_forename(X1,X8)
| ~ forename(X1,X8)
| ~ be(X1,X2,X7,X3)
| ~ agent(X1,X5,X7)
| ~ man(X1,X7)
| ~ of(X1,X6,X7)
| ~ vincent_forename(X1,X6)
| ~ forename(X1,X6)
| ~ think_believe_consider(X1,X5)
| ~ present(X1,X5)
| ~ event(X1,X5)
| ~ theme(X1,X5,X4)
| ~ proposition(X1,X4)
| ~ accessible_world(X1,X4)
| ~ man(X1,X3)
| ~ state(X1,X2)
| man(X4,skf13(X4))
| ssSkC0 ),
c_0_48,
[final] ).
cnf(c_0_50,negated_conjecture,
( be(skc27,skc28,skc29,skc29)
| ssSkC0 ),
clause35,
[final] ).
cnf(c_0_51,negated_conjecture,
actual_world(skc27),
clause1,
[final] ).
cnf(c_0_52,negated_conjecture,
( man(skc27,skc29)
| ssSkC0 ),
clause12,
[final] ).
cnf(c_0_53,negated_conjecture,
( state(skc27,skc28)
| ssSkC0 ),
clause11,
[final] ).
cnf(c_0_54,negated_conjecture,
( ~ proposition(skc27,X1)
| ~ accessible_world(skc27,X1)
| ~ think_believe_consider(skc27,X4)
| ~ present(skc27,X4)
| ~ event(skc27,X4)
| ~ vincent_forename(skc27,X3)
| ~ forename(skc27,X3)
| ~ forename(skc27,X2)
| ~ jules_forename(skc27,X2)
| ~ theme(skc27,X4,X1)
| ~ agent(skc27,X4,skc29)
| ~ of(skc27,X3,skc29)
| ~ of(skc27,X2,skc29)
| ssSkC0
| man(X1,skf13(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]),c_0_52]),c_0_53]),
[final] ).
cnf(c_0_55,negated_conjecture,
( theme(skc27,skc32,skc31)
| ssSkC0 ),
clause27,
[final] ).
cnf(c_0_56,negated_conjecture,
( proposition(skc27,skc31)
| ssSkC0 ),
clause3,
[final] ).
cnf(c_0_57,negated_conjecture,
( accessible_world(skc27,skc31)
| ssSkC0 ),
clause4,
[final] ).
cnf(c_0_58,negated_conjecture,
( think_believe_consider(skc27,skc32)
| ssSkC0 ),
clause5,
[final] ).
cnf(c_0_59,negated_conjecture,
( present(skc27,skc32)
| ssSkC0 ),
clause6,
[final] ).
cnf(c_0_60,negated_conjecture,
( event(skc27,skc32)
| ssSkC0 ),
clause7,
[final] ).
cnf(c_0_62,negated_conjecture,
( jules_forename(skc27,skc30)
| ssSkC0 ),
clause14,
[final] ).
cnf(c_0_63,negated_conjecture,
( forename(skc27,skc30)
| ssSkC0 ),
clause13,
[final] ).
cnf(c_0_64,negated_conjecture,
( of(skc27,skc30,skc29)
| ssSkC0 ),
clause30,
[final] ).
cnf(c_0_70,negated_conjecture,
( ~ vincent_forename(skc27,X1)
| ~ forename(skc27,X1)
| ~ agent(skc27,skc32,skc29)
| ~ of(skc27,X1,skc29)
| ssSkC0
| man(skc31,skf13(skc31)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_64]),
[final] ).
cnf(c_0_71,negated_conjecture,
( vincent_forename(skc27,skc33)
| ssSkC0 ),
clause8,
[final] ).
cnf(c_0_72,negated_conjecture,
( forename(skc27,skc33)
| ssSkC0 ),
clause9,
[final] ).
cnf(c_0_73,negated_conjecture,
( ~ actual_world(X1)
| ~ of(X1,X9,X8)
| ~ jules_forename(X1,X9)
| ~ forename(X1,X9)
| ~ be(X1,X2,X8,X3)
| ~ agent(X1,X6,X8)
| ~ man(X1,X8)
| ~ of(X1,X7,X8)
| ~ vincent_forename(X1,X7)
| ~ forename(X1,X7)
| ~ think_believe_consider(X1,X6)
| ~ present(X1,X6)
| ~ event(X1,X6)
| ~ theme(X1,X6,X4)
| ~ proposition(X1,X4)
| ~ accessible_world(X1,X4)
| ~ event(X4,X5)
| ~ agent(X4,X5,skf13(X4))
| ~ present(X4,X5)
| ~ smoke(X4,X5)
| ~ man(X1,X3)
| ~ state(X1,X2)
| ssSkC0 ),
c_0_65,
[final] ).
cnf(c_0_74,negated_conjecture,
( ~ man(skc31,X1)
| agent(skc31,skf11(X1),X1)
| ssSkC0 ),
c_0_66,
[final] ).
cnf(c_0_75,negated_conjecture,
( ~ man(skc31,X1)
| present(skc31,skf11(X2))
| ssSkC0 ),
c_0_67,
[final] ).
cnf(c_0_76,negated_conjecture,
( ~ man(skc31,X1)
| event(skc31,skf11(X2))
| ssSkC0 ),
c_0_68,
[final] ).
cnf(c_0_77,negated_conjecture,
( ~ man(skc31,X1)
| smoke(skc31,skf11(X2))
| ssSkC0 ),
c_0_69,
[final] ).
cnf(c_0_79,negated_conjecture,
( ~ actual_world(X1)
| ~ proposition(X1,skc31)
| ~ accessible_world(X1,skc31)
| ~ think_believe_consider(X1,X7)
| ~ present(X1,X7)
| ~ event(X1,X7)
| ~ vincent_forename(X1,X6)
| ~ forename(X1,X6)
| ~ forename(X1,X5)
| ~ man(X1,X4)
| ~ man(X1,X3)
| ~ state(X1,X2)
| ~ jules_forename(X1,X5)
| ~ theme(X1,X7,skc31)
| ~ agent(X1,X7,X3)
| ~ of(X1,X6,X3)
| ~ of(X1,X5,X3)
| ~ be(X1,X2,X3,X4)
| ~ smoke(skc31,skf11(skf13(skc31)))
| ssSkC0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]),c_0_76]),c_0_49]),
[final] ).
cnf(c_0_89,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ of(X1,X9,X8)
| ~ jules_forename(X1,X9)
| ~ forename(X1,X9)
| ~ be(X1,X7,X8,X8)
| ~ man(X1,X8)
| ~ state(X1,X7)
| ~ of(X1,X5,X6)
| ~ man(X1,X6)
| ~ agent(X1,X4,X6)
| ~ forename(X1,X5)
| ~ vincent_forename(X1,X5)
| ~ theme(X1,X4,X2)
| ~ event(X1,X4)
| ~ present(X1,X4)
| ~ think_believe_consider(X1,X4)
| ~ event(X2,X3)
| ~ agent(X2,X3,skf9(X2))
| ~ present(X2,X3)
| ~ smoke(X2,X3)
| ~ accessible_world(X1,X2)
| ~ proposition(X1,X2) ),
c_0_83,
[final] ).
cnf(c_0_90,negated_conjecture,
( ~ ssSkC0
| ~ man(skc19,X1)
| agent(skc19,skf7(X1),X1) ),
c_0_84,
[final] ).
cnf(c_0_91,negated_conjecture,
( ~ ssSkC0
| ~ man(skc19,X1)
| present(skc19,skf7(X2)) ),
c_0_85,
[final] ).
cnf(c_0_92,negated_conjecture,
( ~ ssSkC0
| ~ man(skc19,X1)
| event(skc19,skf7(X2)) ),
c_0_86,
[final] ).
cnf(c_0_93,negated_conjecture,
( ~ ssSkC0
| ~ actual_world(X1)
| ~ of(X1,X8,X7)
| ~ jules_forename(X1,X8)
| ~ forename(X1,X8)
| ~ be(X1,X6,X7,X7)
| ~ man(X1,X7)
| ~ state(X1,X6)
| ~ of(X1,X4,X5)
| ~ man(X1,X5)
| ~ agent(X1,X3,X5)
| ~ forename(X1,X4)
| ~ vincent_forename(X1,X4)
| ~ theme(X1,X3,X2)
| ~ event(X1,X3)
| ~ present(X1,X3)
| ~ think_believe_consider(X1,X3)
| ~ accessible_world(X1,X2)
| ~ proposition(X1,X2)
| man(X2,skf9(X2)) ),
c_0_87,
[final] ).
cnf(c_0_113,negated_conjecture,
( ~ actual_world(X1)
| ~ ssSkC0
| ~ proposition(X1,skc19)
| ~ accessible_world(X1,skc19)
| ~ think_believe_consider(X1,X7)
| ~ present(X1,X7)
| ~ event(X1,X7)
| ~ vincent_forename(X1,X5)
| ~ forename(X1,X5)
| ~ forename(X1,X4)
| ~ man(X1,X6)
| ~ man(X1,X3)
| ~ state(X1,X2)
| ~ jules_forename(X1,X4)
| ~ theme(X1,X7,skc19)
| ~ agent(X1,X7,X6)
| ~ of(X1,X5,X6)
| ~ of(X1,X4,X3)
| ~ be(X1,X2,X3,X3)
| ~ smoke(skc19,skf7(skf9(skc19))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]),c_0_92]),c_0_93]),
[final] ).
cnf(c_0_114,negated_conjecture,
( ~ agent(skc27,skc32,skc29)
| ~ of(skc27,skc33,skc29)
| ssSkC0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_71]),c_0_72]),
[final] ).
cnf(c_0_115,negated_conjecture,
( ~ ssSkC0
| ~ man(skc19,X1)
| smoke(skc19,skf7(X2)) ),
c_0_95,
[final] ).
cnf(c_0_116,negated_conjecture,
( ~ ssSkC0
| be(skc16,skc17,skc22,skc18) ),
c_0_96,
[final] ).
cnf(c_0_117,negated_conjecture,
( ~ ssSkC0
| of(skc16,skc23,skc22) ),
c_0_97,
[final] ).
cnf(c_0_118,negated_conjecture,
( ~ ssSkC0
| of(skc16,skc21,skc22) ),
c_0_98,
[final] ).
cnf(c_0_119,negated_conjecture,
( ~ ssSkC0
| agent(skc16,skc20,skc22) ),
c_0_99,
[final] ).
cnf(c_0_120,negated_conjecture,
( ~ ssSkC0
| theme(skc16,skc20,skc19) ),
c_0_100,
[final] ).
cnf(c_0_121,negated_conjecture,
( of(skc27,skc33,skc34)
| ssSkC0 ),
clause29,
[final] ).
cnf(c_0_122,negated_conjecture,
( agent(skc27,skc32,skc34)
| ssSkC0 ),
clause28,
[final] ).
cnf(c_0_123,negated_conjecture,
( ~ ssSkC0
| jules_forename(skc16,skc23) ),
c_0_101,
[final] ).
cnf(c_0_124,negated_conjecture,
( ~ ssSkC0
| state(skc16,skc17) ),
c_0_102,
[final] ).
cnf(c_0_125,negated_conjecture,
( ~ ssSkC0
| man(skc16,skc22) ),
c_0_103,
[final] ).
cnf(c_0_126,negated_conjecture,
( ~ ssSkC0
| man(skc16,skc18) ),
c_0_104,
[final] ).
cnf(c_0_127,negated_conjecture,
( ~ ssSkC0
| forename(skc16,skc23) ),
c_0_105,
[final] ).
cnf(c_0_128,negated_conjecture,
( ~ ssSkC0
| forename(skc16,skc21) ),
c_0_106,
[final] ).
cnf(c_0_129,negated_conjecture,
( ~ ssSkC0
| vincent_forename(skc16,skc21) ),
c_0_107,
[final] ).
cnf(c_0_130,negated_conjecture,
( ~ ssSkC0
| event(skc16,skc20) ),
c_0_108,
[final] ).
cnf(c_0_131,negated_conjecture,
( ~ ssSkC0
| present(skc16,skc20) ),
c_0_109,
[final] ).
cnf(c_0_132,negated_conjecture,
( ~ ssSkC0
| think_believe_consider(skc16,skc20) ),
c_0_110,
[final] ).
cnf(c_0_133,negated_conjecture,
( ~ ssSkC0
| accessible_world(skc16,skc19) ),
c_0_111,
[final] ).
cnf(c_0_134,negated_conjecture,
( ~ ssSkC0
| proposition(skc16,skc19) ),
c_0_112,
[final] ).
cnf(c_0_135,negated_conjecture,
( man(skc27,skc34)
| ssSkC0 ),
clause10,
[final] ).
cnf(c_0_136,negated_conjecture,
actual_world(skc16),
clause2,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP223-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.12/0.37 % Computer : n005.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 01:51:04 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.44 % Version: 3.5.1
% 0.12/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % new_bool_1 with pid 2296465 completed with status 1
% 0.12/0.44 % Result found by new_bool_1
% 0.12/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.44 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.12/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.44 % SubtermCWHack with pid 2296467 completed with status 1
% 0.12/0.44 % Result found by SubtermCWHack
% 0.12/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.44 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.12/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.44 % Preprocessing time : 0.002 s
% 0.12/0.44
% 0.12/0.44 % No proof found!
% 0.12/0.44 % SZS status Satisfiable
% 0.12/0.44 % SZS output start Saturation
% See solution above
% 0.12/0.44 % Parsed axioms : 48
% 0.12/0.44 % Removed by relevancy pruning/SinE : 0
% 0.12/0.44 % Initial clauses : 48
% 0.12/0.44 % Removed in clause preprocessing : 0
% 0.12/0.44 % Initial clauses in saturation : 48
% 0.12/0.44 % Processed clauses : 64
% 0.12/0.44 % ...of these trivial : 2
% 0.12/0.44 % ...subsumed : 0
% 0.12/0.44 % ...remaining for further processing : 62
% 0.12/0.44 % Other redundant clauses eliminated : 0
% 0.12/0.44 % Clauses deleted for lack of memory : 0
% 0.12/0.44 % Backward-subsumed : 9
% 0.12/0.44 % Backward-rewritten : 0
% 0.12/0.44 % Generated clauses : 19
% 0.12/0.44 % ...of the previous two non-redundant : 17
% 0.12/0.44 % ...aggressively subsumed : 0
% 0.12/0.44 % Contextual simplify-reflections : 26
% 0.12/0.44 % Paramodulations : 19
% 0.12/0.44 % Factorizations : 0
% 0.12/0.44 % NegExts : 0
% 0.12/0.44 % Equation resolutions : 0
% 0.12/0.44 % Disequality decompositions : 0
% 0.12/0.44 % Total rewrite steps : 5
% 0.12/0.44 % ...of those cached : 3
% 0.12/0.44 % Propositional unsat checks : 0
% 0.12/0.44 % Propositional check models : 0
% 0.12/0.44 % Propositional check unsatisfiable : 0
% 0.12/0.44 % Propositional clauses : 0
% 0.12/0.44 % Propositional clauses after purity: 0
% 0.12/0.44 % Propositional unsat core size : 0
% 0.12/0.44 % Propositional preprocessing time : 0.000
% 0.12/0.44 % Propositional encoding time : 0.000
% 0.12/0.44 % Propositional solver time : 0.000
% 0.12/0.44 % Success case prop preproc time : 0.000
% 0.12/0.44 % Success case prop encoding time : 0.000
% 0.12/0.44 % Success case prop solver time : 0.000
% 0.12/0.44 % Current number of processed clauses : 53
% 0.12/0.44 % Positive orientable unit clauses : 2
% 0.12/0.44 % Positive unorientable unit clauses: 0
% 0.12/0.44 % Negative unit clauses : 0
% 0.12/0.44 % Non-unit-clauses : 51
% 0.12/0.44 % Current number of unprocessed clauses: 0
% 0.12/0.44 % ...number of literals in the above : 0
% 0.12/0.44 % Current number of archived formulas : 0
% 0.12/0.44 % Current number of archived clauses : 9
% 0.12/0.44 % Clause-clause subsumption calls (NU) : 1083
% 0.12/0.44 % Rec. Clause-clause subsumption calls : 208
% 0.12/0.44 % Non-unit clause-clause subsumptions : 35
% 0.12/0.44 % Unit Clause-clause subsumption calls : 0
% 0.12/0.44 % Rewrite failures with RHS unbound : 0
% 0.12/0.44 % BW rewrite match attempts : 0
% 0.12/0.44 % BW rewrite match successes : 0
% 0.12/0.44 % Condensation attempts : 0
% 0.12/0.44 % Condensation successes : 0
% 0.12/0.44 % Termbank termtop insertions : 3803
% 0.12/0.44 % Search garbage collected termcells : 241
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.008 s
% 0.12/0.44 % System time : 0.003 s
% 0.12/0.44 % Total time : 0.011 s
% 0.12/0.44 % Maximum resident set size: 3692 pages
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.009 s
% 0.12/0.44 % System time : 0.008 s
% 0.12/0.44 % Total time : 0.018 s
% 0.12/0.44 % Maximum resident set size: 4608 pages
% 0.12/0.44 % E exiting
%------------------------------------------------------------------------------