%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NLP222+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 : n020.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:38:09 PM UTC 2026
% Result : CounterSatisfiable 0.12s 0.42s
% Output : Saturation 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_45ERROR: Could not build tree for root c_0_67ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_44,plain,
epred1_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_6]),c_0_10]),c_0_26]),c_0_22]),c_0_7]),c_0_27]),c_0_11]),c_0_28]),c_0_15]),c_0_21]),c_0_14]),c_0_16]),c_0_39]),c_0_17]),c_0_40]),c_0_18]),c_0_19]),c_0_41]),c_0_12]),c_0_8]),c_0_5]),
[final] ).
cnf(c_0_48,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]),
[final] ).
cnf(c_0_67,plain,
( ~ be(X2,X8,X7,X7)
| ~ theme(X2,X5,X1)
| ~ agent(X2,X5,X3)
| ~ of(X2,X4,X3)
| ~ of(X2,X6,X7)
| ~ state(X2,X8)
| ~ jules_forename(X2,X6)
| ~ accessible_world(X2,X1)
| ~ think_believe_consider(X2,X5)
| ~ present(X2,X5)
| ~ event(X2,X5)
| ~ proposition(X2,X1)
| ~ forename(X2,X4)
| ~ forename(X2,X6)
| ~ vincent_forename(X2,X4)
| ~ man(X2,X3)
| ~ man(X2,X7)
| ~ actual_world(X2)
| man(X1,esk21_8(X2,X3,X4,X5,X1,X6,X7,X8))
| epred2_0 ),
inference(cn,[status(thm)],[c_0_45]),
[final] ).
cnf(c_0_68,plain,
( ~ agent(X1,X2,esk21_8(X3,X4,X5,X6,X1,X7,X8,X9))
| ~ be(X3,X9,X8,X8)
| ~ theme(X3,X6,X1)
| ~ agent(X3,X6,X4)
| ~ of(X3,X5,X4)
| ~ of(X3,X7,X8)
| ~ state(X3,X9)
| ~ jules_forename(X3,X7)
| ~ smoke(X1,X2)
| ~ accessible_world(X3,X1)
| ~ think_believe_consider(X3,X6)
| ~ present(X1,X2)
| ~ present(X3,X6)
| ~ event(X1,X2)
| ~ event(X3,X6)
| ~ proposition(X3,X1)
| ~ forename(X3,X5)
| ~ forename(X3,X7)
| ~ vincent_forename(X3,X5)
| ~ man(X3,X4)
| ~ man(X3,X8)
| ~ actual_world(X3)
| epred2_0 ),
inference(cn,[status(thm)],[c_0_46]),
[final] ).
cnf(c_0_69,plain,
( ~ man(esk17_0,X1)
| epred2_0
| agent(esk17_0,esk20_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_70,plain,
( ~ man(esk17_0,X1)
| epred2_0
| smoke(esk17_0,esk20_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_71,plain,
( ~ man(esk17_0,X1)
| epred2_0
| present(esk17_0,esk20_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_72,plain,
( ~ man(esk17_0,X1)
| epred2_0
| event(esk17_0,esk20_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_42]),
[final] ).
cnf(c_0_73,plain,
be(esk11_0,esk19_0,esk12_0,esk18_0),
inference(sr,[status(thm)],[c_0_47,c_0_48]),
[final] ).
cnf(c_0_74,plain,
theme(esk11_0,esk16_0,esk17_0),
inference(sr,[status(thm)],[c_0_49,c_0_48]),
[final] ).
cnf(c_0_75,plain,
agent(esk11_0,esk16_0,esk14_0),
inference(sr,[status(thm)],[c_0_50,c_0_48]),
[final] ).
cnf(c_0_76,plain,
of(esk11_0,esk15_0,esk14_0),
inference(sr,[status(thm)],[c_0_51,c_0_48]),
[final] ).
cnf(c_0_77,plain,
of(esk11_0,esk13_0,esk12_0),
inference(sr,[status(thm)],[c_0_52,c_0_48]),
[final] ).
cnf(c_0_78,plain,
state(esk11_0,esk19_0),
inference(sr,[status(thm)],[c_0_53,c_0_48]),
[final] ).
cnf(c_0_79,plain,
jules_forename(esk11_0,esk13_0),
inference(sr,[status(thm)],[c_0_54,c_0_48]),
[final] ).
cnf(c_0_80,plain,
accessible_world(esk11_0,esk17_0),
inference(sr,[status(thm)],[c_0_55,c_0_48]),
[final] ).
cnf(c_0_81,plain,
think_believe_consider(esk11_0,esk16_0),
inference(sr,[status(thm)],[c_0_56,c_0_48]),
[final] ).
cnf(c_0_82,plain,
present(esk11_0,esk16_0),
inference(sr,[status(thm)],[c_0_57,c_0_48]),
[final] ).
cnf(c_0_83,plain,
event(esk11_0,esk16_0),
inference(sr,[status(thm)],[c_0_58,c_0_48]),
[final] ).
cnf(c_0_84,plain,
proposition(esk11_0,esk17_0),
inference(sr,[status(thm)],[c_0_59,c_0_48]),
[final] ).
cnf(c_0_85,plain,
forename(esk11_0,esk15_0),
inference(sr,[status(thm)],[c_0_60,c_0_48]),
[final] ).
cnf(c_0_86,plain,
forename(esk11_0,esk13_0),
inference(sr,[status(thm)],[c_0_61,c_0_48]),
[final] ).
cnf(c_0_87,plain,
vincent_forename(esk11_0,esk15_0),
inference(sr,[status(thm)],[c_0_62,c_0_48]),
[final] ).
cnf(c_0_88,plain,
man(esk11_0,esk18_0),
inference(sr,[status(thm)],[c_0_63,c_0_48]),
[final] ).
cnf(c_0_89,plain,
man(esk11_0,esk14_0),
inference(sr,[status(thm)],[c_0_64,c_0_48]),
[final] ).
cnf(c_0_90,plain,
man(esk11_0,esk12_0),
inference(sr,[status(thm)],[c_0_65,c_0_48]),
[final] ).
cnf(c_0_91,plain,
actual_world(esk11_0),
inference(sr,[status(thm)],[c_0_66,c_0_48]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NLP222+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.08/0.35 % Computer : n020.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:52:18 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.42 % Version: 3.5.1
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.42 % Starting sh5l with 300s (1) cores
% 0.12/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1745059 completed with status 1
% 0.12/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.42 % No SInE strategy applied
% 0.12/0.42 % Search class: FGHNF-FFMM33-SFFFFFNN
% 0.12/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.12/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1745065 completed with status 1
% 0.12/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.42 % No SInE strategy applied
% 0.12/0.42 % Search class: FGHNF-FFMM33-SFFFFFNN
% 0.12/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.42 % Preprocessing time : 0.001 s
% 0.12/0.42 % Presaturation interreduction done
% 0.12/0.42
% 0.12/0.42 % No proof found!
% 0.12/0.42 % SZS status CounterSatisfiable
% 0.12/0.42 % SZS output start Saturation
% See solution above
% 0.12/0.42 % Parsed axioms : 1
% 0.12/0.42 % Removed by relevancy pruning/SinE : 0
% 0.12/0.42 % Initial clauses : 51
% 0.12/0.42 % Removed in clause preprocessing : 0
% 0.12/0.42 % Initial clauses in saturation : 51
% 0.12/0.42 % Processed clauses : 149
% 0.12/0.42 % ...of these trivial : 0
% 0.12/0.42 % ...subsumed : 1
% 0.12/0.42 % ...remaining for further processing : 148
% 0.12/0.42 % Other redundant clauses eliminated : 0
% 0.12/0.42 % Clauses deleted for lack of memory : 0
% 0.12/0.42 % Backward-subsumed : 18
% 0.12/0.42 % Backward-rewritten : 34
% 0.12/0.42 % Generated clauses : 49
% 0.12/0.42 % ...of the previous two non-redundant : 49
% 0.12/0.42 % ...aggressively subsumed : 0
% 0.12/0.42 % Contextual simplify-reflections : 82
% 0.12/0.42 % Paramodulations : 30
% 0.12/0.42 % Factorizations : 0
% 0.12/0.42 % NegExts : 0
% 0.12/0.42 % Equation resolutions : 0
% 0.12/0.42 % Disequality decompositions : 0
% 0.12/0.42 % Total rewrite steps : 34
% 0.12/0.42 % ...of those cached : 33
% 0.12/0.42 % Propositional unsat checks : 0
% 0.12/0.42 % Propositional check models : 0
% 0.12/0.42 % Propositional check unsatisfiable : 0
% 0.12/0.42 % Propositional clauses : 0
% 0.12/0.42 % Propositional clauses after purity: 0
% 0.12/0.42 % Propositional unsat core size : 0
% 0.12/0.42 % Propositional preprocessing time : 0.000
% 0.12/0.42 % Propositional encoding time : 0.000
% 0.12/0.42 % Propositional solver time : 0.000
% 0.12/0.42 % Success case prop preproc time : 0.000
% 0.12/0.42 % Success case prop encoding time : 0.000
% 0.12/0.42 % Success case prop solver time : 0.000
% 0.12/0.42 % Current number of processed clauses : 27
% 0.12/0.42 % Positive orientable unit clauses : 20
% 0.12/0.42 % Positive unorientable unit clauses: 0
% 0.12/0.42 % Negative unit clauses : 1
% 0.12/0.42 % Non-unit-clauses : 6
% 0.12/0.42 % Current number of unprocessed clauses: 0
% 0.12/0.42 % ...number of literals in the above : 0
% 0.12/0.42 % Current number of archived formulas : 0
% 0.12/0.42 % Current number of archived clauses : 121
% 0.12/0.42 % Clause-clause subsumption calls (NU) : 4169
% 0.12/0.42 % Rec. Clause-clause subsumption calls : 981
% 0.12/0.42 % Non-unit clause-clause subsumptions : 100
% 0.12/0.42 % Unit Clause-clause subsumption calls : 32
% 0.12/0.42 % Rewrite failures with RHS unbound : 0
% 0.12/0.42 % BW rewrite match attempts : 1
% 0.12/0.42 % BW rewrite match successes : 1
% 0.12/0.42 % Condensation attempts : 0
% 0.12/0.42 % Condensation successes : 0
% 0.12/0.42 % Termbank termtop insertions : 6797
% 0.12/0.42 % Search garbage collected termcells : 1553
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.010 s
% 0.12/0.42 % System time : 0.005 s
% 0.12/0.42 % Total time : 0.015 s
% 0.12/0.42 % Maximum resident set size: 3600 pages
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.044 s
% 0.12/0.42 % System time : 0.014 s
% 0.12/0.42 % Total time : 0.059 s
% 0.12/0.42 % Maximum resident set size: 4608 pages
% 0.12/0.42 % E exiting
%------------------------------------------------------------------------------