%------------------------------------------------------------------------------
% 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/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 : CounterSatisfiable 0.09s 0.44s
% Output : Saturation 0.09s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_13ERROR: Could not build tree for root c_0_16ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_16,plain,
( ~ actual_world(X3)
| ~ be(X3,X9,X5,X8)
| ~ state(X3,X9)
| ~ man(X3,X8)
| ~ accessible_world(X3,X1)
| ~ think_believe_consider(X3,X7)
| ~ present(X3,X7)
| ~ event(X3,X7)
| ~ theme(X3,X7,X1)
| ~ agent(X3,X7,X5)
| ~ proposition(X3,X1)
| ~ forename(X3,X6)
| ~ vincent_forename(X3,X6)
| ~ man(X3,X5)
| ~ of(X3,X6,X5)
| ~ forename(X3,X4)
| ~ jules_forename(X3,X4)
| ~ of(X3,X4,X5)
| ~ smoke(X1,X2)
| ~ present(X1,X2)
| ~ agent(X1,X2,esk21_8(X3,X4,X5,X6,X7,X1,X8,X9))
| ~ event(X1,X2)
| epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]),
[final] ).
cnf(c_0_17,plain,
( ~ man(esk17_0,X1)
| epred1_0
| agent(esk17_0,esk20_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]),
[final] ).
cnf(c_0_18,plain,
( ~ actual_world(X2)
| ~ be(X2,X8,X4,X7)
| ~ state(X2,X8)
| ~ man(X2,X7)
| ~ accessible_world(X2,X1)
| ~ think_believe_consider(X2,X6)
| ~ present(X2,X6)
| ~ event(X2,X6)
| ~ theme(X2,X6,X1)
| ~ agent(X2,X6,X4)
| ~ proposition(X2,X1)
| ~ forename(X2,X5)
| ~ vincent_forename(X2,X5)
| ~ man(X2,X4)
| ~ of(X2,X5,X4)
| ~ forename(X2,X3)
| ~ jules_forename(X2,X3)
| ~ of(X2,X3,X4)
| epred1_0
| man(X1,esk21_8(X2,X3,X4,X5,X6,X1,X7,X8)) ),
inference(split_conjunct,[status(thm)],[c_0_13]),
[final] ).
cnf(c_0_28,plain,
( ~ man(esk17_0,X1)
| epred1_0
| smoke(esk17_0,esk20_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]),
[final] ).
cnf(c_0_35,plain,
( ~ man(esk17_0,X1)
| epred1_0
| present(esk17_0,esk20_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]),
[final] ).
cnf(c_0_39,plain,
( ~ man(esk17_0,X1)
| epred1_0
| event(esk17_0,esk20_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]),
[final] ).
cnf(c_0_44,plain,
( ~ actual_world(X1)
| ~ of(X1,X7,X3)
| ~ of(X1,X6,X3)
| ~ jules_forename(X1,X7)
| ~ forename(X1,X7)
| ~ forename(X1,X6)
| ~ man(X1,X3)
| ~ man(X1,X4)
| ~ vincent_forename(X1,X6)
| ~ proposition(X1,esk17_0)
| ~ agent(X1,X5,X3)
| ~ theme(X1,X5,esk17_0)
| ~ event(X1,X5)
| ~ present(X1,X5)
| ~ think_believe_consider(X1,X5)
| ~ accessible_world(X1,esk17_0)
| ~ state(X1,X2)
| ~ be(X1,X2,X3,X4)
| epred1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_18]),
[final] ).
cnf(c_0_62,negated_conjecture,
~ epred1_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55]),
[final] ).
cnf(c_0_65,plain,
vincent_forename(esk11_0,esk15_0),
inference(sr,[status(thm)],[c_0_61,c_0_62]),
[final] ).
cnf(c_0_66,plain,
forename(esk11_0,esk15_0),
inference(sr,[status(thm)],[c_0_63,c_0_62]),
[final] ).
cnf(c_0_70,plain,
be(esk11_0,esk19_0,esk12_0,esk18_0),
inference(sr,[status(thm)],[c_0_45,c_0_62]),
[final] ).
cnf(c_0_71,plain,
state(esk11_0,esk19_0),
inference(sr,[status(thm)],[c_0_51,c_0_62]),
[final] ).
cnf(c_0_72,plain,
accessible_world(esk11_0,esk17_0),
inference(sr,[status(thm)],[c_0_50,c_0_62]),
[final] ).
cnf(c_0_73,plain,
proposition(esk11_0,esk17_0),
inference(sr,[status(thm)],[c_0_49,c_0_62]),
[final] ).
cnf(c_0_74,plain,
man(esk11_0,esk18_0),
inference(sr,[status(thm)],[c_0_48,c_0_62]),
[final] ).
cnf(c_0_75,plain,
man(esk11_0,esk12_0),
inference(sr,[status(thm)],[c_0_47,c_0_62]),
[final] ).
cnf(c_0_76,plain,
actual_world(esk11_0),
inference(sr,[status(thm)],[c_0_46,c_0_62]),
[final] ).
cnf(c_0_77,plain,
theme(esk11_0,esk16_0,esk17_0),
inference(sr,[status(thm)],[c_0_57,c_0_62]),
[final] ).
cnf(c_0_78,plain,
think_believe_consider(esk11_0,esk16_0),
inference(sr,[status(thm)],[c_0_60,c_0_62]),
[final] ).
cnf(c_0_79,plain,
present(esk11_0,esk16_0),
inference(sr,[status(thm)],[c_0_59,c_0_62]),
[final] ).
cnf(c_0_80,plain,
event(esk11_0,esk16_0),
inference(sr,[status(thm)],[c_0_58,c_0_62]),
[final] ).
cnf(c_0_82,plain,
jules_forename(esk11_0,esk13_0),
inference(sr,[status(thm)],[c_0_67,c_0_62]),
[final] ).
cnf(c_0_83,plain,
forename(esk11_0,esk13_0),
inference(sr,[status(thm)],[c_0_68,c_0_62]),
[final] ).
cnf(c_0_84,plain,
of(esk11_0,esk13_0,esk12_0),
inference(sr,[status(thm)],[c_0_69,c_0_62]),
[final] ).
cnf(c_0_88,plain,
( ~ of(esk11_0,X3,esk12_0)
| ~ of(esk11_0,X2,esk12_0)
| ~ jules_forename(esk11_0,X3)
| ~ forename(esk11_0,X3)
| ~ forename(esk11_0,X2)
| ~ vincent_forename(esk11_0,X2)
| ~ agent(esk11_0,X1,esk12_0)
| ~ theme(esk11_0,X1,esk17_0)
| ~ event(esk11_0,X1)
| ~ present(esk11_0,X1)
| ~ think_believe_consider(esk11_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_70]),c_0_71]),c_0_72]),c_0_73]),c_0_74]),c_0_75]),c_0_76])]),c_0_62]),
[final] ).
cnf(c_0_89,plain,
( ~ of(esk11_0,X2,esk12_0)
| ~ of(esk11_0,X1,esk12_0)
| ~ jules_forename(esk11_0,X2)
| ~ forename(esk11_0,X2)
| ~ forename(esk11_0,X1)
| ~ vincent_forename(esk11_0,X1)
| ~ agent(esk11_0,esk16_0,esk12_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_77]),c_0_78]),c_0_79]),c_0_80])]),c_0_62]),
[final] ).
cnf(c_0_90,plain,
( ~ of(esk11_0,esk15_0,esk12_0)
| ~ agent(esk11_0,esk16_0,esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]),c_0_84])]),
[final] ).
cnf(c_0_91,plain,
agent(esk11_0,esk16_0,esk14_0),
inference(sr,[status(thm)],[c_0_85,c_0_62]),
[final] ).
cnf(c_0_92,plain,
of(esk11_0,esk15_0,esk14_0),
inference(sr,[status(thm)],[c_0_86,c_0_62]),
[final] ).
cnf(c_0_93,plain,
man(esk11_0,esk14_0),
inference(sr,[status(thm)],[c_0_87,c_0_62]),
[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/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n017.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:45:45 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.44 % Version: 3.5.1
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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 % new_bool_3 with pid 1165024 completed with status 1
% 0.09/0.44 % Result found by new_bool_3
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.44 % Search class: FGHNF-FFMM33-SFFFFFNN
% 0.09/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.44 % SubtermCWHack with pid 1165031 completed with status 1
% 0.09/0.44 % Result found by SubtermCWHack
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.44 % Search class: FGHNF-FFMM33-SFFFFFNN
% 0.09/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.44 % Preprocessing time : 0.001 s
% 0.09/0.44
% 0.09/0.44 % No proof found!
% 0.09/0.44 % SZS status CounterSatisfiable
% 0.09/0.44 % SZS output start Saturation
% See solution above
% 0.09/0.44 % Parsed axioms : 1
% 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 : 93
% 0.09/0.44 % ...of these trivial : 2
% 0.09/0.44 % ...subsumed : 2
% 0.09/0.44 % ...remaining for further processing : 89
% 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 : 40
% 0.09/0.44 % Backward-rewritten : 0
% 0.09/0.44 % Generated clauses : 46
% 0.09/0.44 % ...of the previous two non-redundant : 44
% 0.09/0.44 % ...aggressively subsumed : 0
% 0.09/0.44 % Contextual simplify-reflections : 34
% 0.09/0.44 % Paramodulations : 27
% 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 : 16
% 0.09/0.44 % ...of those cached : 4
% 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 : 30
% 0.09/0.44 % Positive orientable unit clauses : 19
% 0.09/0.44 % Positive unorientable unit clauses: 0
% 0.09/0.44 % Negative unit clauses : 1
% 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 : 59
% 0.09/0.44 % Clause-clause subsumption calls (NU) : 1688
% 0.09/0.44 % Rec. Clause-clause subsumption calls : 249
% 0.09/0.44 % Non-unit clause-clause subsumptions : 50
% 0.09/0.44 % Unit Clause-clause subsumption calls : 40
% 0.09/0.44 % Rewrite failures with RHS unbound : 0
% 0.09/0.44 % BW rewrite match attempts : 2
% 0.09/0.44 % BW rewrite match successes : 0
% 0.09/0.44 % Condensation attempts : 0
% 0.09/0.44 % Condensation successes : 0
% 0.09/0.44 % Termbank termtop insertions : 6705
% 0.09/0.44 % Search garbage collected termcells : 1498
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.010 s
% 0.09/0.44 % System time : 0.003 s
% 0.09/0.44 % Total time : 0.012 s
% 0.09/0.44 % Maximum resident set size: 3908 pages
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.011 s
% 0.09/0.44 % System time : 0.007 s
% 0.09/0.44 % Total time : 0.018 s
% 0.09/0.44 % Maximum resident set size: 4608 pages
% 0.09/0.44 % E exiting
%------------------------------------------------------------------------------