TSTP Solution File: NLP237-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NLP237-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:43:09 EDT 2023
% Result : Satisfiable 0.33s 0.57s
% Output : Saturation 0.33s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause1)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_87,negated_conjecture,
actual_world(skc47),
clause1,
[final] ).
cnf(c_0_156,negated_conjecture,
actual_world(skc29),
clause2,
[final] ).
cnf(c_0_159,negated_conjecture,
ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_128]),c_0_129]),c_0_130]),
[final] ).
cnf(c_0_196,negated_conjecture,
( agent(skc40,skf5(X1),X1)
| ~ man(skc40,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_151,c_0_159])]),
[final] ).
cnf(c_0_197,negated_conjecture,
( man(X1,skf7(X1))
| ~ be(X2,X3,X4,X4)
| ~ agent(X5,X6,X7)
| ~ agent(X2,X8,X4)
| ~ agent(X2,X9,X10)
| ~ of(X2,X11,X4)
| ~ of(X2,X12,X4)
| ~ of(X2,X13,X7)
| ~ of(X2,X14,X10)
| ~ theme(X2,X8,X5)
| ~ theme(X2,X9,X1)
| ~ state(X2,X3)
| ~ smoke(X5,X6)
| ~ jules_forename(X2,X11)
| ~ jules_forename(X2,X13)
| ~ man(X2,X4)
| ~ man(X2,X7)
| ~ man(X2,X10)
| ~ vincent_forename(X2,X12)
| ~ vincent_forename(X2,X14)
| ~ forename(X2,X11)
| ~ forename(X2,X12)
| ~ forename(X2,X13)
| ~ forename(X2,X14)
| ~ think_believe_consider(X2,X8)
| ~ think_believe_consider(X2,X9)
| ~ present(X5,X6)
| ~ present(X2,X8)
| ~ present(X2,X9)
| ~ event(X5,X6)
| ~ event(X2,X8)
| ~ event(X2,X9)
| ~ proposition(X2,X5)
| ~ proposition(X2,X1)
| ~ accessible_world(X2,X5)
| ~ accessible_world(X2,X1)
| ~ actual_world(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_154,c_0_159])]),
[final] ).
cnf(c_0_198,negated_conjecture,
( event(skc40,skf5(X1))
| ~ man(skc40,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_152,c_0_159])]),
[final] ).
cnf(c_0_199,negated_conjecture,
( present(skc40,skf5(X1))
| ~ man(skc40,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_153,c_0_159])]),
[final] ).
cnf(c_0_200,negated_conjecture,
( smoke(skc40,skf5(X1))
| ~ man(skc40,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_160,c_0_159])]),
[final] ).
cnf(c_0_201,negated_conjecture,
( ~ be(X1,X2,X3,X3)
| ~ agent(X4,X5,skf7(X4))
| ~ agent(X6,X7,X8)
| ~ agent(X1,X9,X3)
| ~ agent(X1,X10,X11)
| ~ of(X1,X12,X3)
| ~ of(X1,X13,X3)
| ~ of(X1,X14,X8)
| ~ of(X1,X15,X11)
| ~ theme(X1,X9,X6)
| ~ theme(X1,X10,X4)
| ~ state(X1,X2)
| ~ smoke(X6,X7)
| ~ smoke(X4,X5)
| ~ jules_forename(X1,X12)
| ~ jules_forename(X1,X14)
| ~ man(X1,X3)
| ~ man(X1,X8)
| ~ man(X1,X11)
| ~ vincent_forename(X1,X13)
| ~ vincent_forename(X1,X15)
| ~ forename(X1,X12)
| ~ forename(X1,X13)
| ~ forename(X1,X14)
| ~ forename(X1,X15)
| ~ think_believe_consider(X1,X9)
| ~ think_believe_consider(X1,X10)
| ~ present(X6,X7)
| ~ present(X1,X9)
| ~ present(X1,X10)
| ~ present(X4,X5)
| ~ event(X6,X7)
| ~ event(X1,X9)
| ~ event(X1,X10)
| ~ event(X4,X5)
| ~ proposition(X1,X6)
| ~ proposition(X1,X4)
| ~ accessible_world(X1,X6)
| ~ accessible_world(X1,X4)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_150,c_0_159])]),
[final] ).
cnf(c_0_202,negated_conjecture,
( ~ be(X1,X2,X3,X3)
| ~ agent(X4,X5,X6)
| ~ agent(X1,X7,X3)
| ~ agent(X1,X8,X9)
| ~ of(X1,X10,X3)
| ~ of(X1,X11,X3)
| ~ of(X1,X12,X6)
| ~ of(X1,X13,X9)
| ~ theme(X1,X8,skc40)
| ~ theme(X1,X7,X4)
| ~ state(X1,X2)
| ~ smoke(skc40,skf5(skf7(skc40)))
| ~ smoke(X4,X5)
| ~ jules_forename(X1,X10)
| ~ jules_forename(X1,X12)
| ~ man(X1,X3)
| ~ man(X1,X6)
| ~ man(X1,X9)
| ~ vincent_forename(X1,X11)
| ~ vincent_forename(X1,X13)
| ~ forename(X1,X10)
| ~ forename(X1,X11)
| ~ forename(X1,X12)
| ~ forename(X1,X13)
| ~ think_believe_consider(X1,X7)
| ~ think_believe_consider(X1,X8)
| ~ present(X4,X5)
| ~ present(X1,X7)
| ~ present(X1,X8)
| ~ event(X4,X5)
| ~ event(X1,X7)
| ~ event(X1,X8)
| ~ proposition(X1,skc40)
| ~ proposition(X1,X4)
| ~ accessible_world(X1,skc40)
| ~ accessible_world(X1,X4)
| ~ actual_world(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_161,c_0_159])]),
[final] ).
cnf(c_0_203,negated_conjecture,
( man(X1,skf7(X1))
| ~ agent(skc29,X2,skc38)
| ~ agent(skc29,X3,X4)
| ~ agent(X5,X6,X7)
| ~ of(skc29,X8,skc38)
| ~ of(skc29,X9,skc38)
| ~ of(skc29,X10,X7)
| ~ of(skc29,X11,X4)
| ~ theme(skc29,X2,X5)
| ~ theme(skc29,X3,X1)
| ~ smoke(X5,X6)
| ~ jules_forename(skc29,X8)
| ~ jules_forename(skc29,X10)
| ~ man(skc29,X7)
| ~ man(skc29,X4)
| ~ vincent_forename(skc29,X9)
| ~ vincent_forename(skc29,X11)
| ~ forename(skc29,X8)
| ~ forename(skc29,X9)
| ~ forename(skc29,X10)
| ~ forename(skc29,X11)
| ~ think_believe_consider(skc29,X2)
| ~ think_believe_consider(skc29,X3)
| ~ present(skc29,X2)
| ~ present(skc29,X3)
| ~ present(X5,X6)
| ~ event(skc29,X2)
| ~ event(skc29,X3)
| ~ event(X5,X6)
| ~ proposition(skc29,X5)
| ~ proposition(skc29,X1)
| ~ accessible_world(skc29,X5)
| ~ accessible_world(skc29,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_162,c_0_159])]),
[final] ).
cnf(c_0_204,negated_conjecture,
be(skc29,skc37,skc38,skc38),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_155,c_0_159])]),
[final] ).
cnf(c_0_205,negated_conjecture,
theme(skc29,skc41,skc40),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_163,c_0_159])]),
[final] ).
cnf(c_0_206,negated_conjecture,
theme(skc29,skc31,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_164,c_0_159])]),
[final] ).
cnf(c_0_207,negated_conjecture,
of(skc29,skc42,skc43),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_165,c_0_159])]),
[final] ).
cnf(c_0_208,negated_conjecture,
of(skc29,skc39,skc38),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_159])]),
[final] ).
cnf(c_0_209,negated_conjecture,
of(skc29,skc34,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_167,c_0_159])]),
[final] ).
cnf(c_0_210,negated_conjecture,
of(skc29,skc32,skc33),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_168,c_0_159])]),
[final] ).
cnf(c_0_211,negated_conjecture,
agent(skc29,skc41,skc43),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_169,c_0_159])]),
[final] ).
cnf(c_0_212,negated_conjecture,
agent(skc29,skc31,skc33),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_170,c_0_159])]),
[final] ).
cnf(c_0_213,negated_conjecture,
agent(skc30,skc36,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_171,c_0_159])]),
[final] ).
cnf(c_0_214,negated_conjecture,
accessible_world(skc29,skc40),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_172,c_0_159])]),
[final] ).
cnf(c_0_215,negated_conjecture,
accessible_world(skc29,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_173,c_0_159])]),
[final] ).
cnf(c_0_216,negated_conjecture,
proposition(skc29,skc40),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_174,c_0_159])]),
[final] ).
cnf(c_0_217,negated_conjecture,
proposition(skc29,skc30),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_175,c_0_159])]),
[final] ).
cnf(c_0_218,negated_conjecture,
event(skc29,skc41),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_176,c_0_159])]),
[final] ).
cnf(c_0_219,negated_conjecture,
event(skc29,skc31),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_177,c_0_159])]),
[final] ).
cnf(c_0_220,negated_conjecture,
event(skc30,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_178,c_0_159])]),
[final] ).
cnf(c_0_221,negated_conjecture,
present(skc29,skc41),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_179,c_0_159])]),
[final] ).
cnf(c_0_222,negated_conjecture,
present(skc29,skc31),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_180,c_0_159])]),
[final] ).
cnf(c_0_223,negated_conjecture,
present(skc30,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_181,c_0_159])]),
[final] ).
cnf(c_0_224,negated_conjecture,
think_believe_consider(skc29,skc41),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_182,c_0_159])]),
[final] ).
cnf(c_0_225,negated_conjecture,
think_believe_consider(skc29,skc31),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_183,c_0_159])]),
[final] ).
cnf(c_0_226,negated_conjecture,
forename(skc29,skc42),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_184,c_0_159])]),
[final] ).
cnf(c_0_227,negated_conjecture,
forename(skc29,skc39),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_185,c_0_159])]),
[final] ).
cnf(c_0_228,negated_conjecture,
forename(skc29,skc34),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_186,c_0_159])]),
[final] ).
cnf(c_0_229,negated_conjecture,
forename(skc29,skc32),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_187,c_0_159])]),
[final] ).
cnf(c_0_230,negated_conjecture,
vincent_forename(skc29,skc42),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_188,c_0_159])]),
[final] ).
cnf(c_0_231,negated_conjecture,
vincent_forename(skc29,skc32),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_189,c_0_159])]),
[final] ).
cnf(c_0_232,negated_conjecture,
man(skc29,skc43),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_190,c_0_159])]),
[final] ).
cnf(c_0_233,negated_conjecture,
man(skc29,skc38),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_157,c_0_159])]),
[final] ).
cnf(c_0_234,negated_conjecture,
man(skc29,skc35),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_191,c_0_159])]),
[final] ).
cnf(c_0_235,negated_conjecture,
man(skc29,skc33),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_192,c_0_159])]),
[final] ).
cnf(c_0_236,negated_conjecture,
jules_forename(skc29,skc39),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_193,c_0_159])]),
[final] ).
cnf(c_0_237,negated_conjecture,
jules_forename(skc29,skc34),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_194,c_0_159])]),
[final] ).
cnf(c_0_238,negated_conjecture,
smoke(skc30,skc36),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_195,c_0_159])]),
[final] ).
cnf(c_0_239,negated_conjecture,
state(skc29,skc37),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_158,c_0_159])]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : NLP237-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.13/0.38 % Computer : n023.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8042.1875MB
% 0.13/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.38 % CPULimit : 2400
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Oct 2 11:24:38 EDT 2023
% 0.13/0.38 % CPUTime :
% 0.20/0.51 Running first-order theorem proving
% 0.20/0.51 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/tmp/tmp.8cNRtYGkqv/E---3.1_12798.p
% 0.33/0.57 # Version: 3.1pre001
% 0.33/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.33/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.33/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.33/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.33/0.57 # Starting sh5l with 300s (1) cores
% 0.33/0.57 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12876 completed with status 1
% 0.33/0.57 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.33/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.33/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.33/0.57 # No SInE strategy applied
% 0.33/0.57 # Search class: FGHNF-FFMM11-SFFFFFNN
% 0.33/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.33/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.33/0.57 # Starting new_bool_3 with 136s (1) cores
% 0.33/0.57 # Starting new_bool_1 with 136s (1) cores
% 0.33/0.57 # Starting sh5l with 136s (1) cores
% 0.33/0.57 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12884 completed with status 1
% 0.33/0.57 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.33/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.33/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.33/0.57 # No SInE strategy applied
% 0.33/0.57 # Search class: FGHNF-FFMM11-SFFFFFNN
% 0.33/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.57 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.33/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.33/0.57 # Preprocessing time : 0.003 s
% 0.33/0.57 # Presaturation interreduction done
% 0.33/0.57
% 0.33/0.57 # No proof found!
% 0.33/0.57 # SZS status Satisfiable
% 0.33/0.57 # SZS output start Saturation
% See solution above
% 0.33/0.57 # Parsed axioms : 85
% 0.33/0.57 # Removed by relevancy pruning/SinE : 0
% 0.33/0.57 # Initial clauses : 85
% 0.33/0.57 # Removed in clause preprocessing : 0
% 0.33/0.57 # Initial clauses in saturation : 85
% 0.33/0.57 # Processed clauses : 263
% 0.33/0.57 # ...of these trivial : 3
% 0.33/0.57 # ...subsumed : 4
% 0.33/0.57 # ...remaining for further processing : 256
% 0.33/0.57 # Other redundant clauses eliminated : 0
% 0.33/0.57 # Clauses deleted for lack of memory : 0
% 0.33/0.57 # Backward-subsumed : 28
% 0.33/0.57 # Backward-rewritten : 96
% 0.33/0.57 # Generated clauses : 54
% 0.33/0.57 # ...of the previous two non-redundant : 98
% 0.33/0.57 # ...aggressively subsumed : 0
% 0.33/0.57 # Contextual simplify-reflections : 99
% 0.33/0.57 # Paramodulations : 54
% 0.33/0.57 # Factorizations : 0
% 0.33/0.57 # NegExts : 0
% 0.33/0.57 # Equation resolutions : 0
% 0.33/0.57 # Total rewrite steps : 105
% 0.33/0.57 # Propositional unsat checks : 0
% 0.33/0.57 # Propositional check models : 0
% 0.33/0.57 # Propositional check unsatisfiable : 0
% 0.33/0.57 # Propositional clauses : 0
% 0.33/0.57 # Propositional clauses after purity: 0
% 0.33/0.57 # Propositional unsat core size : 0
% 0.33/0.57 # Propositional preprocessing time : 0.000
% 0.33/0.57 # Propositional encoding time : 0.000
% 0.33/0.57 # Propositional solver time : 0.000
% 0.33/0.57 # Success case prop preproc time : 0.000
% 0.33/0.57 # Success case prop encoding time : 0.000
% 0.33/0.57 # Success case prop solver time : 0.000
% 0.33/0.57 # Current number of processed clauses : 47
% 0.33/0.57 # Positive orientable unit clauses : 39
% 0.33/0.57 # Positive unorientable unit clauses: 0
% 0.33/0.57 # Negative unit clauses : 0
% 0.33/0.57 # Non-unit-clauses : 8
% 0.33/0.57 # Current number of unprocessed clauses: 0
% 0.33/0.57 # ...number of literals in the above : 0
% 0.33/0.57 # Current number of archived formulas : 0
% 0.33/0.57 # Current number of archived clauses : 209
% 0.33/0.57 # Clause-clause subsumption calls (NU) : 20136
% 0.33/0.57 # Rec. Clause-clause subsumption calls : 2083
% 0.33/0.57 # Non-unit clause-clause subsumptions : 131
% 0.33/0.57 # Unit Clause-clause subsumption calls : 0
% 0.33/0.57 # Rewrite failures with RHS unbound : 0
% 0.33/0.57 # BW rewrite match attempts : 1
% 0.33/0.57 # BW rewrite match successes : 1
% 0.33/0.57 # Condensation attempts : 0
% 0.33/0.57 # Condensation successes : 0
% 0.33/0.57 # Termbank termtop insertions : 10169
% 0.33/0.57
% 0.33/0.57 # -------------------------------------------------
% 0.33/0.57 # User time : 0.042 s
% 0.33/0.57 # System time : 0.005 s
% 0.33/0.57 # Total time : 0.047 s
% 0.33/0.57 # Maximum resident set size: 1836 pages
% 0.33/0.57
% 0.33/0.57 # -------------------------------------------------
% 0.33/0.57 # User time : 0.217 s
% 0.33/0.57 # System time : 0.009 s
% 0.33/0.57 # Total time : 0.226 s
% 0.33/0.57 # Maximum resident set size: 1800 pages
% 0.33/0.57 % E---3.1 exiting
% 0.33/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------