TSTP Solution File: NLP230-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NLP230-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:45:21 EDT 2023
% Result : Satisfiable 0.18s 0.53s
% Output : Saturation 0.18s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause2)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_87,negated_conjecture,
actual_world(skc29),
clause2,
[final] ).
cnf(c_0_150,negated_conjecture,
( ssSkC0
| man(X2,skf11(X2))
| ~ accessible_world(X1,X2)
| ~ proposition(X1,X2)
| ~ theme(X1,X3,X2)
| ~ event(X1,X3)
| ~ present(X1,X3)
| ~ think_believe_consider(X1,X3)
| ~ forename(X1,X4)
| ~ vincent_forename(X1,X4)
| ~ of(X1,X4,X5)
| ~ man(X1,X5)
| ~ agent(X1,X3,X5)
| ~ state(X1,X6)
| ~ be(X1,X6,X7,X7)
| ~ man(X1,X7)
| ~ of(X1,X8,X7)
| ~ jules_forename(X1,X8)
| ~ forename(X1,X8)
| ~ proposition(X1,X9)
| ~ accessible_world(X1,X9)
| ~ forename(X1,X10)
| ~ vincent_forename(X1,X10)
| ~ of(X1,X10,X11)
| ~ man(X1,X11)
| ~ agent(X1,X12,X11)
| ~ smoke(X9,X13)
| ~ present(X9,X13)
| ~ agent(X9,X13,X11)
| ~ event(X9,X13)
| ~ forename(X1,X14)
| ~ jules_forename(X1,X14)
| ~ of(X1,X14,X11)
| ~ think_believe_consider(X1,X12)
| ~ present(X1,X12)
| ~ event(X1,X12)
| ~ theme(X1,X12,X9)
| ~ actual_world(X1) ),
clause82,
[final] ).
cnf(c_0_152,negated_conjecture,
actual_world(skc46),
clause1,
[final] ).
cnf(c_0_155,negated_conjecture,
~ ssSkC0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_113]),c_0_114]),c_0_115]),c_0_116]),
[final] ).
cnf(c_0_160,negated_conjecture,
be(skc46,skc54,skc55,skc55),
inference(sr,[status(thm)],[c_0_151,c_0_155]),
[final] ).
cnf(c_0_161,negated_conjecture,
state(skc46,skc54),
inference(sr,[status(thm)],[c_0_154,c_0_155]),
[final] ).
cnf(c_0_162,negated_conjecture,
man(skc46,skc55),
inference(sr,[status(thm)],[c_0_153,c_0_155]),
[final] ).
cnf(c_0_175,negated_conjecture,
of(skc46,skc56,skc55),
inference(sr,[status(thm)],[c_0_157,c_0_155]),
[final] ).
cnf(c_0_176,negated_conjecture,
jules_forename(skc46,skc56),
inference(sr,[status(thm)],[c_0_159,c_0_155]),
[final] ).
cnf(c_0_177,negated_conjecture,
forename(skc46,skc56),
inference(sr,[status(thm)],[c_0_158,c_0_155]),
[final] ).
cnf(c_0_178,negated_conjecture,
of(skc46,skc51,skc52),
inference(sr,[status(thm)],[c_0_163,c_0_155]),
[final] ).
cnf(c_0_179,negated_conjecture,
jules_forename(skc46,skc51),
inference(sr,[status(thm)],[c_0_164,c_0_155]),
[final] ).
cnf(c_0_180,negated_conjecture,
man(skc46,skc52),
inference(sr,[status(thm)],[c_0_165,c_0_155]),
[final] ).
cnf(c_0_181,negated_conjecture,
forename(skc46,skc51),
inference(sr,[status(thm)],[c_0_166,c_0_155]),
[final] ).
cnf(c_0_182,negated_conjecture,
of(skc46,skc49,skc50),
inference(sr,[status(thm)],[c_0_167,c_0_155]),
[final] ).
cnf(c_0_183,negated_conjecture,
man(skc46,skc50),
inference(sr,[status(thm)],[c_0_168,c_0_155]),
[final] ).
cnf(c_0_184,negated_conjecture,
forename(skc46,skc49),
inference(sr,[status(thm)],[c_0_169,c_0_155]),
[final] ).
cnf(c_0_185,negated_conjecture,
of(skc46,skc59,skc60),
inference(sr,[status(thm)],[c_0_170,c_0_155]),
[final] ).
cnf(c_0_186,negated_conjecture,
man(skc46,skc60),
inference(sr,[status(thm)],[c_0_171,c_0_155]),
[final] ).
cnf(c_0_187,negated_conjecture,
forename(skc46,skc59),
inference(sr,[status(thm)],[c_0_172,c_0_155]),
[final] ).
cnf(c_0_190,negated_conjecture,
( ssSkC0
| ~ smoke(X1,X2)
| ~ present(X1,X2)
| ~ agent(X1,X2,skf11(X1))
| ~ event(X1,X2)
| ~ accessible_world(X3,X1)
| ~ proposition(X3,X1)
| ~ theme(X3,X4,X1)
| ~ event(X3,X4)
| ~ present(X3,X4)
| ~ think_believe_consider(X3,X4)
| ~ forename(X3,X5)
| ~ vincent_forename(X3,X5)
| ~ of(X3,X5,X6)
| ~ man(X3,X6)
| ~ agent(X3,X4,X6)
| ~ state(X3,X7)
| ~ be(X3,X7,X8,X8)
| ~ man(X3,X8)
| ~ of(X3,X9,X8)
| ~ jules_forename(X3,X9)
| ~ forename(X3,X9)
| ~ proposition(X3,X10)
| ~ accessible_world(X3,X10)
| ~ forename(X3,X11)
| ~ vincent_forename(X3,X11)
| ~ of(X3,X11,X12)
| ~ man(X3,X12)
| ~ agent(X3,X13,X12)
| ~ smoke(X10,X14)
| ~ present(X10,X14)
| ~ agent(X10,X14,X12)
| ~ event(X10,X14)
| ~ forename(X3,X15)
| ~ jules_forename(X3,X15)
| ~ of(X3,X15,X12)
| ~ think_believe_consider(X3,X13)
| ~ present(X3,X13)
| ~ event(X3,X13)
| ~ theme(X3,X13,X10)
| ~ actual_world(X3) ),
clause84,
[final] ).
cnf(c_0_191,negated_conjecture,
( ssSkC0
| agent(skc57,skf9(X1),X1)
| ~ man(skc57,X1) ),
clause80,
[final] ).
cnf(c_0_192,negated_conjecture,
( ssSkC0
| present(skc57,skf9(X2))
| ~ man(skc57,X1) ),
clause75,
[final] ).
cnf(c_0_193,negated_conjecture,
( ssSkC0
| event(skc57,skf9(X2))
| ~ man(skc57,X1) ),
clause74,
[final] ).
cnf(c_0_214,negated_conjecture,
( man(X1,skf11(X1))
| ~ of(skc46,X2,X3)
| ~ of(skc46,X4,X3)
| ~ of(skc46,X5,X6)
| ~ agent(skc46,X7,X3)
| ~ agent(skc46,X8,X6)
| ~ agent(X9,X10,X3)
| ~ theme(skc46,X7,X9)
| ~ theme(skc46,X8,X1)
| ~ smoke(X9,X10)
| ~ jules_forename(skc46,X2)
| ~ man(skc46,X3)
| ~ man(skc46,X6)
| ~ forename(skc46,X2)
| ~ forename(skc46,X4)
| ~ forename(skc46,X5)
| ~ vincent_forename(skc46,X4)
| ~ vincent_forename(skc46,X5)
| ~ event(skc46,X7)
| ~ event(skc46,X8)
| ~ event(X9,X10)
| ~ present(skc46,X7)
| ~ present(skc46,X8)
| ~ present(X9,X10)
| ~ think_believe_consider(skc46,X7)
| ~ think_believe_consider(skc46,X8)
| ~ accessible_world(skc46,X9)
| ~ accessible_world(skc46,X1)
| ~ proposition(skc46,X9)
| ~ proposition(skc46,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_175]),c_0_176]),c_0_177])]),
[final] ).
cnf(c_0_215,negated_conjecture,
( man(X1,skf11(X1))
| ~ of(skc46,X2,skc52)
| ~ of(skc46,X3,X4)
| ~ agent(skc46,X5,skc52)
| ~ agent(skc46,X6,X4)
| ~ agent(X7,X8,skc52)
| ~ theme(skc46,X5,X7)
| ~ theme(skc46,X6,X1)
| ~ smoke(X7,X8)
| ~ man(skc46,X4)
| ~ forename(skc46,X2)
| ~ forename(skc46,X3)
| ~ vincent_forename(skc46,X2)
| ~ vincent_forename(skc46,X3)
| ~ event(skc46,X5)
| ~ event(skc46,X6)
| ~ event(X7,X8)
| ~ present(skc46,X5)
| ~ present(skc46,X6)
| ~ present(X7,X8)
| ~ think_believe_consider(skc46,X5)
| ~ think_believe_consider(skc46,X6)
| ~ accessible_world(skc46,X7)
| ~ accessible_world(skc46,X1)
| ~ proposition(skc46,X7)
| ~ proposition(skc46,X1) ),
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_173,c_0_178]),c_0_179]),c_0_180]),c_0_181])]),c_0_155]),
[final] ).
cnf(c_0_216,negated_conjecture,
( man(X1,skf11(X1))
| ~ of(skc46,X2,skc55)
| ~ of(skc46,X3,X4)
| ~ agent(skc46,X5,skc55)
| ~ agent(skc46,X6,X4)
| ~ agent(X7,X8,skc55)
| ~ theme(skc46,X5,X7)
| ~ theme(skc46,X6,X1)
| ~ smoke(X7,X8)
| ~ man(skc46,X4)
| ~ forename(skc46,X2)
| ~ forename(skc46,X3)
| ~ vincent_forename(skc46,X2)
| ~ vincent_forename(skc46,X3)
| ~ event(skc46,X5)
| ~ event(skc46,X6)
| ~ event(X7,X8)
| ~ present(skc46,X5)
| ~ present(skc46,X6)
| ~ present(X7,X8)
| ~ think_believe_consider(skc46,X5)
| ~ think_believe_consider(skc46,X6)
| ~ accessible_world(skc46,X7)
| ~ accessible_world(skc46,X1)
| ~ proposition(skc46,X7)
| ~ proposition(skc46,X1) ),
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_173,c_0_175]),c_0_176]),c_0_162]),c_0_177])]),c_0_155]),
[final] ).
cnf(c_0_217,negated_conjecture,
( man(X1,skf11(X1))
| ~ of(skc46,X2,skc50)
| ~ of(skc46,X3,X4)
| ~ agent(skc46,X5,skc50)
| ~ agent(skc46,X6,X4)
| ~ agent(X7,X8,skc50)
| ~ theme(skc46,X5,X7)
| ~ theme(skc46,X6,X1)
| ~ smoke(X7,X8)
| ~ jules_forename(skc46,skc49)
| ~ man(skc46,X4)
| ~ forename(skc46,X2)
| ~ forename(skc46,X3)
| ~ vincent_forename(skc46,X2)
| ~ vincent_forename(skc46,X3)
| ~ event(skc46,X5)
| ~ event(skc46,X6)
| ~ event(X7,X8)
| ~ present(skc46,X5)
| ~ present(skc46,X6)
| ~ present(X7,X8)
| ~ think_believe_consider(skc46,X5)
| ~ think_believe_consider(skc46,X6)
| ~ accessible_world(skc46,X7)
| ~ accessible_world(skc46,X1)
| ~ proposition(skc46,X7)
| ~ proposition(skc46,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_173,c_0_182]),c_0_183]),c_0_184])]),c_0_155]),
[final] ).
cnf(c_0_218,negated_conjecture,
( man(X1,skf11(X1))
| ~ of(skc46,X2,skc60)
| ~ of(skc46,X3,X4)
| ~ agent(skc46,X5,skc60)
| ~ agent(skc46,X6,X4)
| ~ agent(X7,X8,skc60)
| ~ theme(skc46,X5,X7)
| ~ theme(skc46,X6,X1)
| ~ smoke(X7,X8)
| ~ jules_forename(skc46,skc59)
| ~ man(skc46,X4)
| ~ forename(skc46,X2)
| ~ forename(skc46,X3)
| ~ vincent_forename(skc46,X2)
| ~ vincent_forename(skc46,X3)
| ~ event(skc46,X5)
| ~ event(skc46,X6)
| ~ event(X7,X8)
| ~ present(skc46,X5)
| ~ present(skc46,X6)
| ~ present(X7,X8)
| ~ think_believe_consider(skc46,X5)
| ~ think_believe_consider(skc46,X6)
| ~ accessible_world(skc46,X7)
| ~ accessible_world(skc46,X1)
| ~ proposition(skc46,X7)
| ~ proposition(skc46,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_173,c_0_185]),c_0_186]),c_0_187])]),c_0_155]),
[final] ).
cnf(c_0_219,negated_conjecture,
( man(X1,skf11(X1))
| ~ of(skc46,X2,X3)
| ~ agent(skc46,X4,skc52)
| ~ agent(skc46,X5,X3)
| ~ agent(X6,X7,skc52)
| ~ theme(skc46,X4,X6)
| ~ theme(skc46,X5,X1)
| ~ smoke(X6,X7)
| ~ man(skc46,X3)
| ~ forename(skc46,X2)
| ~ vincent_forename(skc46,skc51)
| ~ vincent_forename(skc46,X2)
| ~ event(skc46,X4)
| ~ event(skc46,X5)
| ~ event(X6,X7)
| ~ present(skc46,X4)
| ~ present(skc46,X5)
| ~ present(X6,X7)
| ~ think_believe_consider(skc46,X4)
| ~ think_believe_consider(skc46,X5)
| ~ accessible_world(skc46,X6)
| ~ accessible_world(skc46,X1)
| ~ proposition(skc46,X6)
| ~ proposition(skc46,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_188,c_0_178]),c_0_181])]),c_0_155]),
[final] ).
cnf(c_0_220,negated_conjecture,
( man(X1,skf11(X1))
| ~ of(skc46,X2,X3)
| ~ agent(skc46,X4,skc55)
| ~ agent(skc46,X5,X3)
| ~ agent(X6,X7,skc55)
| ~ theme(skc46,X4,X6)
| ~ theme(skc46,X5,X1)
| ~ smoke(X6,X7)
| ~ man(skc46,X3)
| ~ forename(skc46,X2)
| ~ vincent_forename(skc46,skc56)
| ~ vincent_forename(skc46,X2)
| ~ event(skc46,X4)
| ~ event(skc46,X5)
| ~ event(X6,X7)
| ~ present(skc46,X4)
| ~ present(skc46,X5)
| ~ present(X6,X7)
| ~ think_believe_consider(skc46,X4)
| ~ think_believe_consider(skc46,X5)
| ~ accessible_world(skc46,X6)
| ~ accessible_world(skc46,X1)
| ~ proposition(skc46,X6)
| ~ proposition(skc46,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_189,c_0_175]),c_0_177])]),c_0_155]),
[final] ).
cnf(c_0_221,negated_conjecture,
( ssSkC0
| ~ be(X1,X2,X3,X3)
| ~ of(X1,X4,X5)
| ~ of(X1,X6,X5)
| ~ of(X1,X7,X3)
| ~ of(X1,X8,X9)
| ~ agent(X10,X11,X5)
| ~ agent(X1,X12,X5)
| ~ agent(X1,X13,X9)
| ~ theme(X1,X13,skc57)
| ~ theme(X1,X12,X10)
| ~ smoke(skc57,skf9(skf11(skc57)))
| ~ smoke(X10,X11)
| ~ jules_forename(X1,X4)
| ~ jules_forename(X1,X7)
| ~ state(X1,X2)
| ~ man(X1,X5)
| ~ man(X1,X3)
| ~ man(X1,X9)
| ~ forename(X1,X4)
| ~ forename(X1,X6)
| ~ forename(X1,X7)
| ~ forename(X1,X8)
| ~ vincent_forename(X1,X6)
| ~ vincent_forename(X1,X8)
| ~ event(X10,X11)
| ~ event(X1,X12)
| ~ event(X1,X13)
| ~ present(X10,X11)
| ~ present(X1,X12)
| ~ present(X1,X13)
| ~ think_believe_consider(X1,X12)
| ~ think_believe_consider(X1,X13)
| ~ accessible_world(X1,skc57)
| ~ accessible_world(X1,X10)
| ~ proposition(X1,skc57)
| ~ proposition(X1,X10)
| ~ actual_world(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_190,c_0_191]),c_0_192]),c_0_193]),c_0_150]),
[final] ).
cnf(c_0_222,negated_conjecture,
( ssSkC0
| smoke(skc57,skf9(X2))
| ~ man(skc57,X1) ),
clause76,
[final] ).
cnf(c_0_223,negated_conjecture,
agent(skc47,skc53,skc52),
inference(sr,[status(thm)],[c_0_194,c_0_155]),
[final] ).
cnf(c_0_224,negated_conjecture,
agent(skc46,skc48,skc50),
inference(sr,[status(thm)],[c_0_195,c_0_155]),
[final] ).
cnf(c_0_225,negated_conjecture,
agent(skc46,skc58,skc60),
inference(sr,[status(thm)],[c_0_196,c_0_155]),
[final] ).
cnf(c_0_226,negated_conjecture,
theme(skc46,skc48,skc47),
inference(sr,[status(thm)],[c_0_197,c_0_155]),
[final] ).
cnf(c_0_227,negated_conjecture,
theme(skc46,skc58,skc57),
inference(sr,[status(thm)],[c_0_198,c_0_155]),
[final] ).
cnf(c_0_228,negated_conjecture,
smoke(skc47,skc53),
inference(sr,[status(thm)],[c_0_199,c_0_155]),
[final] ).
cnf(c_0_229,negated_conjecture,
vincent_forename(skc46,skc49),
inference(sr,[status(thm)],[c_0_200,c_0_155]),
[final] ).
cnf(c_0_230,negated_conjecture,
vincent_forename(skc46,skc59),
inference(sr,[status(thm)],[c_0_201,c_0_155]),
[final] ).
cnf(c_0_231,negated_conjecture,
event(skc47,skc53),
inference(sr,[status(thm)],[c_0_202,c_0_155]),
[final] ).
cnf(c_0_232,negated_conjecture,
event(skc46,skc48),
inference(sr,[status(thm)],[c_0_203,c_0_155]),
[final] ).
cnf(c_0_233,negated_conjecture,
event(skc46,skc58),
inference(sr,[status(thm)],[c_0_204,c_0_155]),
[final] ).
cnf(c_0_234,negated_conjecture,
present(skc47,skc53),
inference(sr,[status(thm)],[c_0_205,c_0_155]),
[final] ).
cnf(c_0_235,negated_conjecture,
present(skc46,skc48),
inference(sr,[status(thm)],[c_0_206,c_0_155]),
[final] ).
cnf(c_0_236,negated_conjecture,
present(skc46,skc58),
inference(sr,[status(thm)],[c_0_207,c_0_155]),
[final] ).
cnf(c_0_237,negated_conjecture,
think_believe_consider(skc46,skc48),
inference(sr,[status(thm)],[c_0_208,c_0_155]),
[final] ).
cnf(c_0_238,negated_conjecture,
think_believe_consider(skc46,skc58),
inference(sr,[status(thm)],[c_0_209,c_0_155]),
[final] ).
cnf(c_0_239,negated_conjecture,
accessible_world(skc46,skc47),
inference(sr,[status(thm)],[c_0_210,c_0_155]),
[final] ).
cnf(c_0_240,negated_conjecture,
accessible_world(skc46,skc57),
inference(sr,[status(thm)],[c_0_211,c_0_155]),
[final] ).
cnf(c_0_241,negated_conjecture,
proposition(skc46,skc47),
inference(sr,[status(thm)],[c_0_212,c_0_155]),
[final] ).
cnf(c_0_242,negated_conjecture,
proposition(skc46,skc57),
inference(sr,[status(thm)],[c_0_213,c_0_155]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NLP230-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 11:50:21 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.18/0.46 Running first-order model finding
% 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.ppRWZbnJZz/E---3.1_3110.p
% 0.18/0.53 # Version: 3.1pre001
% 0.18/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.53 # Starting sh5l with 300s (1) cores
% 0.18/0.53 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3189 completed with status 1
% 0.18/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.53 # No SInE strategy applied
% 0.18/0.53 # Search class: FGHNF-FFMM11-SFFFFFNN
% 0.18/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.18/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.18/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.18/0.53 # Starting sh5l with 136s (1) cores
% 0.18/0.53 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3194 completed with status 1
% 0.18/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.53 # No SInE strategy applied
% 0.18/0.53 # Search class: FGHNF-FFMM11-SFFFFFNN
% 0.18/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.18/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.53 # Preprocessing time : 0.003 s
% 0.18/0.53 # Presaturation interreduction done
% 0.18/0.53
% 0.18/0.53 # No proof found!
% 0.18/0.53 # SZS status Satisfiable
% 0.18/0.53 # SZS output start Saturation
% See solution above
% 0.18/0.53 # Parsed axioms : 85
% 0.18/0.53 # Removed by relevancy pruning/SinE : 0
% 0.18/0.53 # Initial clauses : 85
% 0.18/0.53 # Removed in clause preprocessing : 0
% 0.18/0.53 # Initial clauses in saturation : 85
% 0.18/0.53 # Processed clauses : 266
% 0.18/0.53 # ...of these trivial : 5
% 0.18/0.53 # ...subsumed : 6
% 0.18/0.53 # ...remaining for further processing : 255
% 0.18/0.53 # Other redundant clauses eliminated : 0
% 0.18/0.53 # Clauses deleted for lack of memory : 0
% 0.18/0.53 # Backward-subsumed : 81
% 0.18/0.53 # Backward-rewritten : 0
% 0.18/0.53 # Generated clauses : 105
% 0.18/0.53 # ...of the previous two non-redundant : 105
% 0.18/0.53 # ...aggressively subsumed : 0
% 0.18/0.53 # Contextual simplify-reflections : 93
% 0.18/0.53 # Paramodulations : 69
% 0.18/0.53 # Factorizations : 0
% 0.18/0.53 # NegExts : 0
% 0.18/0.53 # Equation resolutions : 0
% 0.18/0.53 # Total rewrite steps : 35
% 0.18/0.53 # Propositional unsat checks : 0
% 0.18/0.53 # Propositional check models : 0
% 0.18/0.53 # Propositional check unsatisfiable : 0
% 0.18/0.53 # Propositional clauses : 0
% 0.18/0.53 # Propositional clauses after purity: 0
% 0.18/0.53 # Propositional unsat core size : 0
% 0.18/0.53 # Propositional preprocessing time : 0.000
% 0.18/0.53 # Propositional encoding time : 0.000
% 0.18/0.53 # Propositional solver time : 0.000
% 0.18/0.53 # Success case prop preproc time : 0.000
% 0.18/0.53 # Success case prop encoding time : 0.000
% 0.18/0.53 # Success case prop solver time : 0.000
% 0.18/0.53 # Current number of processed clauses : 53
% 0.18/0.53 # Positive orientable unit clauses : 38
% 0.18/0.53 # Positive unorientable unit clauses: 0
% 0.18/0.53 # Negative unit clauses : 1
% 0.18/0.53 # Non-unit-clauses : 14
% 0.18/0.53 # Current number of unprocessed clauses: 0
% 0.18/0.53 # ...number of literals in the above : 0
% 0.18/0.53 # Current number of archived formulas : 0
% 0.18/0.53 # Current number of archived clauses : 202
% 0.18/0.53 # Clause-clause subsumption calls (NU) : 17843
% 0.18/0.53 # Rec. Clause-clause subsumption calls : 2072
% 0.18/0.53 # Non-unit clause-clause subsumptions : 124
% 0.18/0.53 # Unit Clause-clause subsumption calls : 105
% 0.18/0.53 # Rewrite failures with RHS unbound : 0
% 0.18/0.53 # BW rewrite match attempts : 0
% 0.18/0.53 # BW rewrite match successes : 0
% 0.18/0.53 # Condensation attempts : 0
% 0.18/0.53 # Condensation successes : 0
% 0.18/0.53 # Termbank termtop insertions : 12026
% 0.18/0.53
% 0.18/0.53 # -------------------------------------------------
% 0.18/0.53 # User time : 0.049 s
% 0.18/0.53 # System time : 0.005 s
% 0.18/0.53 # Total time : 0.054 s
% 0.18/0.53 # Maximum resident set size: 1832 pages
% 0.18/0.53
% 0.18/0.53 # -------------------------------------------------
% 0.18/0.53 # User time : 0.253 s
% 0.18/0.53 # System time : 0.009 s
% 0.18/0.53 # Total time : 0.263 s
% 0.18/0.53 # Maximum resident set size: 1800 pages
% 0.18/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------