TSTP Solution File: NLP137-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NLP137-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:42:27 EDT 2023
% Result : Satisfiable 0.21s 0.51s
% Output : Saturation 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause58)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_60,negated_conjecture,
( member(X1,skf9(X1,X7),X7)
| ~ agent(X1,X2,X3)
| ~ old(X1,X3)
| ~ dirty(X1,X3)
| ~ white(X1,X3)
| ~ chevy(X1,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X2,X5)
| ~ city(X1,X5)
| ~ of(X1,X4,X5)
| ~ street(X1,X6)
| ~ lonely(X1,X6)
| ~ down(X1,X2,X6)
| ~ ssSkP0(X7,X1)
| ~ two(X1,X7)
| ~ group(X1,X7)
| ~ actual_world(X1)
| ~ ssSkC0 ),
clause58,
[final] ).
cnf(c_0_61,negated_conjecture,
( down(skc13,skc15,skc16)
| ~ ssSkC0 ),
clause39,
[final] ).
cnf(c_0_62,negated_conjecture,
actual_world(skc13),
clause2,
[final] ).
cnf(c_0_63,negated_conjecture,
( barrel(skc13,skc15)
| ~ ssSkC0 ),
clause20,
[final] ).
cnf(c_0_64,negated_conjecture,
( present(skc13,skc15)
| ~ ssSkC0 ),
clause19,
[final] ).
cnf(c_0_65,negated_conjecture,
( event(skc13,skc15)
| ~ ssSkC0 ),
clause18,
[final] ).
cnf(c_0_66,negated_conjecture,
( street(skc13,skc16)
| ~ ssSkC0 ),
clause26,
[final] ).
cnf(c_0_67,negated_conjecture,
( lonely(skc13,skc16)
| ~ ssSkC0 ),
clause25,
[final] ).
cnf(c_0_69,negated_conjecture,
( agent(skc13,skc15,skc18)
| ~ ssSkC0 ),
clause37,
[final] ).
cnf(c_0_70,negated_conjecture,
( old(skc13,skc18)
| ~ ssSkC0 ),
clause21,
[final] ).
cnf(c_0_71,negated_conjecture,
( dirty(skc13,skc18)
| ~ ssSkC0 ),
clause22,
[final] ).
cnf(c_0_72,negated_conjecture,
( white(skc13,skc18)
| ~ ssSkC0 ),
clause23,
[final] ).
cnf(c_0_73,negated_conjecture,
( chevy(skc13,skc18)
| ~ ssSkC0 ),
clause24,
[final] ).
cnf(c_0_74,negated_conjecture,
( ~ agent(X1,X2,X3)
| ~ old(X1,X3)
| ~ dirty(X1,X3)
| ~ white(X1,X3)
| ~ chevy(X1,X3)
| ~ barrel(X1,X2)
| ~ present(X1,X2)
| ~ event(X1,X2)
| ~ hollywood_placename(X1,X4)
| ~ placename(X1,X4)
| ~ in(X1,X2,X5)
| ~ city(X1,X5)
| ~ of(X1,X4,X5)
| ~ street(X1,X6)
| ~ lonely(X1,X6)
| ~ down(X1,X2,X6)
| ~ ssSkP0(X7,X1)
| ~ two(X1,X7)
| ~ group(X1,X7)
| ~ young(X1,skf9(X1,X8))
| ~ fellow(X1,skf9(X1,X8))
| ~ actual_world(X1)
| ~ ssSkC0 ),
clause60,
[final] ).
cnf(c_0_75,negated_conjecture,
( young(skc13,X1)
| ~ member(skc13,X1,skc14)
| ~ ssSkC0 ),
clause47,
[final] ).
cnf(c_0_76,negated_conjecture,
( fellow(skc13,X1)
| ~ member(skc13,X1,skc14)
| ~ ssSkC0 ),
clause46,
[final] ).
cnf(c_0_78,negated_conjecture,
( of(skc13,skc17,skc16)
| ~ ssSkC0 ),
clause40,
[final] ).
cnf(c_0_79,negated_conjecture,
( hollywood_placename(skc13,skc17)
| ~ ssSkC0 ),
clause28,
[final] ).
cnf(c_0_80,negated_conjecture,
( placename(skc13,skc17)
| ~ ssSkC0 ),
clause29,
[final] ).
cnf(c_0_81,negated_conjecture,
( city(skc13,skc16)
| ~ ssSkC0 ),
clause27,
[final] ).
cnf(c_0_82,negated_conjecture,
( in(skc13,skc15,skc16)
| ~ ssSkC0 ),
clause38,
[final] ).
cnf(c_0_83,negated_conjecture,
( ~ member(skc13,skf9(skc13,X1),skc14)
| ~ down(skc13,X2,X3)
| ~ of(skc13,X4,X5)
| ~ in(skc13,X2,X5)
| ~ agent(skc13,X2,X6)
| ~ group(skc13,X7)
| ~ two(skc13,X7)
| ~ ssSkP0(X7,skc13)
| ~ lonely(skc13,X3)
| ~ street(skc13,X3)
| ~ city(skc13,X5)
| ~ placename(skc13,X4)
| ~ hollywood_placename(skc13,X4)
| ~ event(skc13,X2)
| ~ present(skc13,X2)
| ~ barrel(skc13,X2)
| ~ chevy(skc13,X6)
| ~ white(skc13,X6)
| ~ dirty(skc13,X6)
| ~ old(skc13,X6)
| ~ ssSkC0 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_62])]),c_0_76]),
[final] ).
cnf(c_0_84,negated_conjecture,
( member(skc13,skf9(skc13,X1),X1)
| ~ group(skc13,X1)
| ~ two(skc13,X1)
| ~ ssSkP0(X1,skc13)
| ~ ssSkC0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]),c_0_80]),c_0_81]),c_0_82]),
[final] ).
cnf(c_0_85,negated_conjecture,
( two(skc13,skc14)
| ~ ssSkC0 ),
clause31,
[final] ).
cnf(c_0_86,negated_conjecture,
( group(skc13,skc14)
| ~ ssSkC0 ),
clause30,
[final] ).
cnf(c_0_88,negated_conjecture,
( in(X1,skf15(X1,X4),skf15(X1,X4))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X3,X1) ),
clause50,
[final] ).
cnf(c_0_89,negated_conjecture,
( ssSkP0(X1,X2)
| member(X2,skf14(X2,X1),X1) ),
clause42,
[final] ).
cnf(c_0_90,negated_conjecture,
( state(X1,skf16(X1,X4))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X3,X1) ),
clause48,
[final] ).
cnf(c_0_92,negated_conjecture,
( frontseat(X1,skf15(X1,X4))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X3,X1) ),
clause49,
[final] ).
cnf(c_0_93,negated_conjecture,
( be(X1,skf11(X1,X2),X2,skf10(X2,X1))
| ~ member(X1,X2,X3)
| ~ frontseat(X1,X2)
| ~ ssSkP0(X3,X1) ),
clause54,
[final] ).
cnf(c_0_94,negated_conjecture,
( ssSkP1(X1,X2)
| member(X2,skf19(X2,X1),X1) ),
clause43,
[final] ).
cnf(c_0_95,negated_conjecture,
( state(X1,skf11(X1,X4))
| ~ member(X1,X2,X3)
| ~ frontseat(X1,X2)
| ~ ssSkP0(X3,X1) ),
clause51,
[final] ).
cnf(c_0_96,negated_conjecture,
( in(X1,skf15(X1,X2),skf15(X1,X2))
| ssSkP0(X3,X1)
| ~ ssSkP1(X3,X1) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]),
[final] ).
cnf(c_0_97,negated_conjecture,
( state(X1,skf16(X1,X2))
| ssSkP0(X3,X1)
| ~ ssSkP1(X3,X1) ),
inference(spm,[status(thm)],[c_0_90,c_0_89]),
[final] ).
cnf(c_0_99,negated_conjecture,
( frontseat(X1,skf15(X1,X2))
| ssSkP0(X3,X1)
| ~ ssSkP1(X3,X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_89]),
[final] ).
cnf(c_0_100,negated_conjecture,
( be(X1,skf16(X1,X2),X2,skf15(X1,X2))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X3,X1) ),
clause52,
[final] ).
cnf(c_0_101,negated_conjecture,
( in(X1,skf10(X2,X1),X2)
| ~ member(X1,X2,X3)
| ~ frontseat(X1,X2)
| ~ ssSkP0(X3,X1) ),
clause53,
[final] ).
cnf(c_0_102,negated_conjecture,
( ssSkP1(X5,X1)
| ~ frontseat(X1,X2)
| ~ in(X1,X2,X2)
| ~ be(X1,X3,skf19(X1,X4),X2)
| ~ state(X1,X3) ),
clause56,
[final] ).
cnf(c_0_103,negated_conjecture,
( be(X1,skf11(X1,skf19(X1,X2)),skf19(X1,X2),skf10(skf19(X1,X2),X1))
| ssSkP1(X2,X1)
| ~ frontseat(X1,skf19(X1,X2))
| ~ ssSkP0(X2,X1) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]),
[final] ).
cnf(c_0_104,negated_conjecture,
( state(X1,skf11(X1,X2))
| ssSkP1(X3,X1)
| ~ frontseat(X1,skf19(X1,X3))
| ~ ssSkP0(X3,X1) ),
inference(spm,[status(thm)],[c_0_95,c_0_94]),
[final] ).
cnf(c_0_106,negated_conjecture,
( ssSkP1(skc14,skc13)
| ~ ssSkC0 ),
clause32,
[final] ).
cnf(c_0_107,negated_conjecture,
( ssSkC0
| ~ event(X1,X2)
| ~ present(X1,X2)
| ~ barrel(X1,X2)
| ~ agent(X1,X2,X3)
| ~ old(X1,X3)
| ~ dirty(X1,X3)
| ~ white(X1,X3)
| ~ chevy(X1,X3)
| ~ in(X1,X2,X4)
| ~ down(X1,X2,X4)
| ~ lonely(X1,X4)
| ~ street(X1,X4)
| ~ city(X1,X4)
| ~ of(X1,X5,X4)
| ~ hollywood_placename(X1,X5)
| ~ placename(X1,X5)
| ~ young(X1,skf21(X1,X6))
| ~ fellow(X1,skf21(X1,X6))
| ~ group(X1,X7)
| ~ two(X1,X7)
| ~ ssSkP1(X7,X1)
| ~ actual_world(X1) ),
clause59,
[final] ).
cnf(c_0_108,negated_conjecture,
( ssSkC0
| young(skc43,X1)
| ~ member(skc43,X1,skc44) ),
clause45,
[final] ).
cnf(c_0_109,negated_conjecture,
actual_world(skc43),
clause1,
[final] ).
cnf(c_0_110,negated_conjecture,
( ssSkC0
| fellow(skc43,X1)
| ~ member(skc43,X1,skc44) ),
clause44,
[final] ).
cnf(c_0_114,negated_conjecture,
( ssSkP0(X5,X1)
| ~ in(X1,X2,skf14(X1,X3))
| ~ be(X1,X4,skf14(X1,X3),X2)
| ~ state(X1,X4) ),
clause55,
[final] ).
cnf(c_0_115,negated_conjecture,
( be(X1,skf16(X1,skf14(X1,X2)),skf14(X1,X2),skf15(X1,skf14(X1,X2)))
| ssSkP0(X2,X1)
| ~ ssSkP1(X2,X1) ),
inference(spm,[status(thm)],[c_0_100,c_0_89]),
[final] ).
cnf(c_0_116,negated_conjecture,
( ssSkC0
| member(X1,skf21(X1,X6),X6)
| ~ event(X1,X2)
| ~ present(X1,X2)
| ~ barrel(X1,X2)
| ~ agent(X1,X2,X3)
| ~ old(X1,X3)
| ~ dirty(X1,X3)
| ~ white(X1,X3)
| ~ chevy(X1,X3)
| ~ in(X1,X2,X4)
| ~ down(X1,X2,X4)
| ~ lonely(X1,X4)
| ~ street(X1,X4)
| ~ city(X1,X4)
| ~ of(X1,X5,X4)
| ~ hollywood_placename(X1,X5)
| ~ placename(X1,X5)
| ~ group(X1,X6)
| ~ two(X1,X6)
| ~ ssSkP1(X6,X1)
| ~ actual_world(X1) ),
clause57,
[final] ).
cnf(c_0_117,negated_conjecture,
( ssSkC0
| down(skc43,skc45,skc46) ),
clause36,
[final] ).
cnf(c_0_118,negated_conjecture,
( ssSkC0
| barrel(skc43,skc45) ),
clause7,
[final] ).
cnf(c_0_119,negated_conjecture,
( ssSkC0
| present(skc43,skc45) ),
clause8,
[final] ).
cnf(c_0_120,negated_conjecture,
( ssSkC0
| event(skc43,skc45) ),
clause9,
[final] ).
cnf(c_0_121,negated_conjecture,
( ssSkC0
| street(skc43,skc46) ),
clause13,
[final] ).
cnf(c_0_122,negated_conjecture,
( ssSkC0
| lonely(skc43,skc46) ),
clause14,
[final] ).
cnf(c_0_123,negated_conjecture,
( be(skc13,skf11(skc13,skf9(skc13,X1)),skf9(skc13,X1),skf10(skf9(skc13,X1),skc13))
| ~ frontseat(skc13,skf9(skc13,X1))
| ~ group(skc13,X1)
| ~ two(skc13,X1)
| ~ ssSkP0(X1,skc13)
| ~ ssSkC0 ),
inference(spm,[status(thm)],[c_0_93,c_0_84]),
[final] ).
cnf(c_0_124,negated_conjecture,
( be(skc13,skf16(skc13,skf9(skc13,X1)),skf9(skc13,X1),skf15(skc13,skf9(skc13,X1)))
| ~ ssSkP1(X1,skc13)
| ~ group(skc13,X1)
| ~ two(skc13,X1)
| ~ ssSkP0(X1,skc13)
| ~ ssSkC0 ),
inference(spm,[status(thm)],[c_0_100,c_0_84]),
[final] ).
cnf(c_0_125,negated_conjecture,
( in(skc13,skf10(skf9(skc13,X1),skc13),skf9(skc13,X1))
| ~ frontseat(skc13,skf9(skc13,X1))
| ~ group(skc13,X1)
| ~ two(skc13,X1)
| ~ ssSkP0(X1,skc13)
| ~ ssSkC0 ),
inference(spm,[status(thm)],[c_0_101,c_0_84]),
[final] ).
cnf(c_0_126,negated_conjecture,
( ssSkP1(X1,X2)
| ssSkP1(X3,X2)
| ~ frontseat(X2,skf10(skf19(X2,X1),X2))
| ~ frontseat(X2,skf19(X2,X1))
| ~ in(X2,skf10(skf19(X2,X1),X2),skf10(skf19(X2,X1),X2))
| ~ ssSkP0(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]),
[final] ).
cnf(c_0_127,negated_conjecture,
( in(skc13,skf15(skc13,X1),skf15(skc13,X1))
| ~ ssSkC0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_86]),c_0_85]),c_0_106]),
[final] ).
cnf(c_0_128,negated_conjecture,
( ssSkC0
| ~ member(skc43,skf21(skc43,X1),skc44)
| ~ down(skc43,X2,X3)
| ~ of(skc43,X4,X3)
| ~ in(skc43,X2,X3)
| ~ agent(skc43,X2,X5)
| ~ ssSkP1(X6,skc43)
| ~ group(skc43,X6)
| ~ two(skc43,X6)
| ~ lonely(skc43,X3)
| ~ street(skc43,X3)
| ~ city(skc43,X3)
| ~ placename(skc43,X4)
| ~ hollywood_placename(skc43,X4)
| ~ event(skc43,X2)
| ~ present(skc43,X2)
| ~ barrel(skc43,X2)
| ~ chevy(skc43,X5)
| ~ white(skc43,X5)
| ~ dirty(skc43,X5)
| ~ old(skc43,X5) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109])]),c_0_110]),
[final] ).
cnf(c_0_129,negated_conjecture,
( state(skc13,skf11(skc13,X1))
| ~ frontseat(skc13,skf9(skc13,X2))
| ~ group(skc13,X2)
| ~ two(skc13,X2)
| ~ ssSkP0(X2,skc13)
| ~ ssSkC0 ),
inference(spm,[status(thm)],[c_0_95,c_0_84]),
[final] ).
cnf(c_0_130,negated_conjecture,
( state(skc13,skf16(skc13,X1))
| ~ ssSkC0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_86]),c_0_85]),c_0_106]),
[final] ).
cnf(c_0_131,negated_conjecture,
( ~ ssSkP0(skc14,skc13)
| ~ ssSkC0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_86]),c_0_85]),
[final] ).
cnf(c_0_132,negated_conjecture,
( frontseat(skc13,skf15(skc13,X1))
| ~ ssSkC0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_86]),c_0_85]),c_0_106]),
[final] ).
cnf(c_0_133,negated_conjecture,
( ssSkP0(X1,X2)
| ssSkP0(X3,X2)
| ~ in(X2,skf15(X2,skf14(X2,X1)),skf14(X2,X1))
| ~ ssSkP1(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_97]),
[final] ).
cnf(c_0_134,negated_conjecture,
( in(X1,skf10(skf19(X1,X2),X1),skf19(X1,X2))
| ssSkP1(X2,X1)
| ~ frontseat(X1,skf19(X1,X2))
| ~ ssSkP0(X2,X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_94]),
[final] ).
cnf(c_0_135,negated_conjecture,
( member(skc43,skf21(skc43,X1),X1)
| ssSkC0
| ~ of(skc43,X2,skc46)
| ~ in(skc43,skc45,skc46)
| ~ agent(skc43,skc45,X3)
| ~ ssSkP1(X1,skc43)
| ~ group(skc43,X1)
| ~ two(skc43,X1)
| ~ city(skc43,skc46)
| ~ placename(skc43,X2)
| ~ hollywood_placename(skc43,X2)
| ~ chevy(skc43,X3)
| ~ white(skc43,X3)
| ~ dirty(skc43,X3)
| ~ old(skc43,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_109])]),c_0_118]),c_0_119]),c_0_120]),c_0_121]),c_0_122]),
[final] ).
cnf(c_0_136,negated_conjecture,
( ssSkP0(X1,X2)
| frontseat(X2,skf14(X2,X3)) ),
clause41,
[final] ).
cnf(c_0_137,negated_conjecture,
( ssSkC0
| of(skc43,skc47,skc48) ),
clause35,
[final] ).
cnf(c_0_138,negated_conjecture,
( ssSkC0
| in(skc43,skc45,skc48) ),
clause34,
[final] ).
cnf(c_0_139,negated_conjecture,
( ssSkC0
| agent(skc43,skc45,skc49) ),
clause33,
[final] ).
cnf(c_0_140,negated_conjecture,
( ssSkC0
| group(skc43,skc44) ),
clause17,
[final] ).
cnf(c_0_141,negated_conjecture,
( ssSkC0
| two(skc43,skc44) ),
clause16,
[final] ).
cnf(c_0_142,negated_conjecture,
( ssSkC0
| ssSkP0(skc44,skc43) ),
clause15,
[final] ).
cnf(c_0_143,negated_conjecture,
( ssSkC0
| city(skc43,skc48) ),
clause12,
[final] ).
cnf(c_0_144,negated_conjecture,
( ssSkC0
| placename(skc43,skc47) ),
clause11,
[final] ).
cnf(c_0_145,negated_conjecture,
( ssSkC0
| hollywood_placename(skc43,skc47) ),
clause10,
[final] ).
cnf(c_0_146,negated_conjecture,
( ssSkC0
| chevy(skc43,skc49) ),
clause6,
[final] ).
cnf(c_0_147,negated_conjecture,
( ssSkC0
| white(skc43,skc49) ),
clause5,
[final] ).
cnf(c_0_148,negated_conjecture,
( ssSkC0
| dirty(skc43,skc49) ),
clause4,
[final] ).
cnf(c_0_149,negated_conjecture,
( ssSkC0
| old(skc43,skc49) ),
clause3,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NLP137-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 11:28:36 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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/tmp/tmp.UTnoAuUII4/E---3.1_6864.p
% 0.21/0.51 # Version: 3.1pre001
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # new_bool_3 with pid 6943 completed with status 1
% 0.21/0.51 # Result found by new_bool_3
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGHNF-FFMM22-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51 # SAT001_MinMin_p005000_rr_RG with pid 6949 completed with status 1
% 0.21/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGHNF-FFMM22-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51 # Preprocessing time : 0.004 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # No proof found!
% 0.21/0.51 # SZS status Satisfiable
% 0.21/0.51 # SZS output start Saturation
% See solution above
% 0.21/0.51 # Parsed axioms : 60
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 60
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 60
% 0.21/0.51 # Processed clauses : 155
% 0.21/0.51 # ...of these trivial : 2
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 153
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 12
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 44
% 0.21/0.51 # ...of the previous two non-redundant : 35
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 47
% 0.21/0.51 # Paramodulations : 44
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Total rewrite steps : 8
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 81
% 0.21/0.51 # Positive orientable unit clauses : 2
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 0
% 0.21/0.51 # Non-unit-clauses : 79
% 0.21/0.51 # Current number of unprocessed clauses: 0
% 0.21/0.51 # ...number of literals in the above : 0
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 72
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 6164
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 1168
% 0.21/0.51 # Non-unit clause-clause subsumptions : 59
% 0.21/0.51 # Unit Clause-clause subsumption calls : 0
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 0
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 4684
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.019 s
% 0.21/0.51 # System time : 0.002 s
% 0.21/0.51 # Total time : 0.021 s
% 0.21/0.51 # Maximum resident set size: 1788 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.022 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.025 s
% 0.21/0.51 # Maximum resident set size: 1736 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------