TSTP Solution File: NLP165-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NLP165-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:37 EDT 2023
% Result : Satisfiable 0.38s 0.56s
% Output : Saturation 0.38s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named clause75)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_78,negated_conjecture,
( ssSkC0
| member(X2,skf23(X2,X8),X8)
| ~ ssSkP0(X1,X2)
| ~ group(X2,X1)
| ~ two(X2,X1)
| ~ chevy(X2,X3)
| ~ white(X2,X3)
| ~ dirty(X2,X3)
| ~ old(X2,X3)
| ~ agent(X2,X4,X3)
| ~ event(X2,X4)
| ~ present(X2,X4)
| ~ barrel(X2,X4)
| ~ placename(X2,X5)
| ~ hollywood_placename(X2,X5)
| ~ of(X2,X5,X6)
| ~ city(X2,X6)
| ~ in(X2,X4,X6)
| ~ ssSkP1(X7,X1,X2)
| ~ down(X2,X4,X7)
| ~ lonely(X2,X7)
| ~ street(X2,X7)
| ~ frontseat(X2,X7)
| ~ group(X2,X8)
| ~ ssSkP2(X9,X8,X2)
| ~ group(X2,X9)
| ~ actual_world(X2) ),
clause75,
[final] ).
cnf(c_0_79,negated_conjecture,
( ssSkP2(X1,X2,X3)
| member(X3,skf19(X1,X3,X2),X2) ),
clause60,
[final] ).
cnf(c_0_80,negated_conjecture,
( ssSkP2(X1,X2,X3)
| member(X3,skf21(X1,X3,X4),X1) ),
clause59,
[final] ).
cnf(c_0_81,negated_conjecture,
( ssSkC0
| ssSkP2(skc65,skc64,skc63) ),
clause44,
[final] ).
cnf(c_0_82,negated_conjecture,
actual_world(skc63),
clause1,
[final] ).
cnf(c_0_83,negated_conjecture,
( ssSkC0
| group(skc63,skc64) ),
clause20,
[final] ).
cnf(c_0_84,negated_conjecture,
( ssSkC0
| group(skc63,skc65) ),
clause19,
[final] ).
cnf(c_0_85,negated_conjecture,
( member(X1,skf19(X2,X1,X3),X3)
| member(X1,skf23(X1,X3),X3)
| ssSkC0
| ~ down(X1,X4,X5)
| ~ of(X1,X6,X7)
| ~ in(X1,X4,X7)
| ~ agent(X1,X4,X8)
| ~ ssSkP1(X5,X9,X1)
| ~ lonely(X1,X5)
| ~ street(X1,X5)
| ~ city(X1,X7)
| ~ placename(X1,X6)
| ~ hollywood_placename(X1,X6)
| ~ event(X1,X4)
| ~ present(X1,X4)
| ~ barrel(X1,X4)
| ~ chevy(X1,X8)
| ~ white(X1,X8)
| ~ dirty(X1,X8)
| ~ old(X1,X8)
| ~ ssSkP0(X9,X1)
| ~ group(X1,X2)
| ~ group(X1,X3)
| ~ group(X1,X9)
| ~ two(X1,X9)
| ~ frontseat(X1,X5)
| ~ actual_world(X1) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]),
[final] ).
cnf(c_0_86,negated_conjecture,
( ssSkC0
| down(skc63,skc66,skc67) ),
clause43,
[final] ).
cnf(c_0_87,negated_conjecture,
( ssSkC0
| barrel(skc63,skc66) ),
clause11,
[final] ).
cnf(c_0_88,negated_conjecture,
( ssSkC0
| present(skc63,skc66) ),
clause12,
[final] ).
cnf(c_0_89,negated_conjecture,
( ssSkC0
| event(skc63,skc66) ),
clause13,
[final] ).
cnf(c_0_90,negated_conjecture,
( ssSkC0
| street(skc63,skc67) ),
clause17,
[final] ).
cnf(c_0_91,negated_conjecture,
( ssSkC0
| lonely(skc63,skc67) ),
clause18,
[final] ).
cnf(c_0_92,negated_conjecture,
( member(X1,skf21(X2,X1,X3),X2)
| member(X1,skf23(X1,X4),X4)
| ssSkC0
| ~ down(X1,X5,X6)
| ~ of(X1,X7,X8)
| ~ in(X1,X5,X8)
| ~ agent(X1,X5,X9)
| ~ ssSkP1(X6,X10,X1)
| ~ lonely(X1,X6)
| ~ street(X1,X6)
| ~ city(X1,X8)
| ~ placename(X1,X7)
| ~ hollywood_placename(X1,X7)
| ~ event(X1,X5)
| ~ present(X1,X5)
| ~ barrel(X1,X5)
| ~ chevy(X1,X9)
| ~ white(X1,X9)
| ~ dirty(X1,X9)
| ~ old(X1,X9)
| ~ ssSkP0(X10,X1)
| ~ group(X1,X2)
| ~ group(X1,X4)
| ~ group(X1,X10)
| ~ two(X1,X10)
| ~ frontseat(X1,X6)
| ~ actual_world(X1) ),
inference(spm,[status(thm)],[c_0_78,c_0_80]),
[final] ).
cnf(c_0_93,negated_conjecture,
( member(skc63,skf23(skc63,skc64),skc64)
| ssSkC0
| ~ down(skc63,X1,X2)
| ~ of(skc63,X3,X4)
| ~ in(skc63,X1,X4)
| ~ agent(skc63,X1,X5)
| ~ ssSkP1(X2,X6,skc63)
| ~ lonely(skc63,X2)
| ~ street(skc63,X2)
| ~ city(skc63,X4)
| ~ placename(skc63,X3)
| ~ hollywood_placename(skc63,X3)
| ~ event(skc63,X1)
| ~ present(skc63,X1)
| ~ barrel(skc63,X1)
| ~ chevy(skc63,X5)
| ~ white(skc63,X5)
| ~ dirty(skc63,X5)
| ~ old(skc63,X5)
| ~ ssSkP0(X6,skc63)
| ~ group(skc63,X6)
| ~ two(skc63,X6)
| ~ frontseat(skc63,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_81]),c_0_82])]),c_0_83]),c_0_84]),
[final] ).
cnf(c_0_94,negated_conjecture,
( member(skc63,skf19(X1,skc63,X2),X2)
| member(skc63,skf23(skc63,X2),X2)
| ssSkC0
| ~ of(skc63,X3,X4)
| ~ in(skc63,skc66,X4)
| ~ agent(skc63,skc66,X5)
| ~ ssSkP1(skc67,X6,skc63)
| ~ city(skc63,X4)
| ~ placename(skc63,X3)
| ~ hollywood_placename(skc63,X3)
| ~ chevy(skc63,X5)
| ~ white(skc63,X5)
| ~ dirty(skc63,X5)
| ~ old(skc63,X5)
| ~ ssSkP0(X6,skc63)
| ~ group(skc63,X1)
| ~ group(skc63,X2)
| ~ group(skc63,X6)
| ~ two(skc63,X6)
| ~ frontseat(skc63,skc67) ),
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_85,c_0_86]),c_0_82])]),c_0_87]),c_0_88]),c_0_89]),c_0_90]),c_0_91]),
[final] ).
cnf(c_0_95,negated_conjecture,
( member(skc63,skf21(X1,skc63,X2),X1)
| member(skc63,skf23(skc63,X3),X3)
| ssSkC0
| ~ of(skc63,X4,X5)
| ~ in(skc63,skc66,X5)
| ~ agent(skc63,skc66,X6)
| ~ ssSkP1(skc67,X7,skc63)
| ~ city(skc63,X5)
| ~ placename(skc63,X4)
| ~ hollywood_placename(skc63,X4)
| ~ chevy(skc63,X6)
| ~ white(skc63,X6)
| ~ dirty(skc63,X6)
| ~ old(skc63,X6)
| ~ ssSkP0(X7,skc63)
| ~ group(skc63,X1)
| ~ group(skc63,X3)
| ~ group(skc63,X7)
| ~ two(skc63,X7)
| ~ frontseat(skc63,skc67) ),
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_92,c_0_86]),c_0_82])]),c_0_87]),c_0_88]),c_0_89]),c_0_90]),c_0_91]),
[final] ).
cnf(c_0_96,negated_conjecture,
( member(skc63,skf23(skc63,skc64),skc64)
| ssSkC0
| ~ down(skc63,X1,skc67)
| ~ of(skc63,X2,X3)
| ~ in(skc63,X1,X3)
| ~ agent(skc63,X1,X4)
| ~ ssSkP1(skc67,X5,skc63)
| ~ city(skc63,X3)
| ~ placename(skc63,X2)
| ~ hollywood_placename(skc63,X2)
| ~ event(skc63,X1)
| ~ present(skc63,X1)
| ~ barrel(skc63,X1)
| ~ chevy(skc63,X4)
| ~ white(skc63,X4)
| ~ dirty(skc63,X4)
| ~ old(skc63,X4)
| ~ ssSkP0(X5,skc63)
| ~ group(skc63,X5)
| ~ two(skc63,X5)
| ~ frontseat(skc63,skc67) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_91]),c_0_90]),
[final] ).
cnf(c_0_97,negated_conjecture,
( ssSkC0
| ~ ssSkP0(X1,X2)
| ~ group(X2,X1)
| ~ two(X2,X1)
| ~ chevy(X2,X3)
| ~ white(X2,X3)
| ~ dirty(X2,X3)
| ~ old(X2,X3)
| ~ agent(X2,X4,X3)
| ~ event(X2,X4)
| ~ present(X2,X4)
| ~ barrel(X2,X4)
| ~ placename(X2,X5)
| ~ hollywood_placename(X2,X5)
| ~ of(X2,X5,X6)
| ~ city(X2,X6)
| ~ in(X2,X4,X6)
| ~ ssSkP1(X7,X1,X2)
| ~ down(X2,X4,X7)
| ~ lonely(X2,X7)
| ~ street(X2,X7)
| ~ frontseat(X2,X7)
| ~ group(X2,X8)
| ~ cheap(X2,skf23(X2,X9))
| ~ black(X2,skf23(X2,X9))
| ~ coat(X2,skf23(X2,X9))
| ~ ssSkP2(X10,X8,X2)
| ~ group(X2,X10)
| ~ actual_world(X2) ),
clause77,
[final] ).
cnf(c_0_98,negated_conjecture,
( ~ frontseat(X1,X2)
| ~ ssSkP1(X2,X3,X1)
| ~ two(X1,X3)
| ~ group(X1,X3)
| ~ ssSkP0(X3,X1)
| ~ agent(X1,X4,X5)
| ~ old(X1,X5)
| ~ dirty(X1,X5)
| ~ white(X1,X5)
| ~ chevy(X1,X5)
| ~ barrel(X1,X4)
| ~ present(X1,X4)
| ~ event(X1,X4)
| ~ hollywood_placename(X1,X6)
| ~ placename(X1,X6)
| ~ in(X1,X4,X7)
| ~ city(X1,X7)
| ~ of(X1,X6,X7)
| ~ street(X1,X8)
| ~ lonely(X1,X8)
| ~ down(X1,X4,X8)
| ~ ssSkP2(X9,X10,X1)
| ~ group(X1,X9)
| ~ cheap(X1,skf10(X1,X11))
| ~ black(X1,skf10(X1,X11))
| ~ coat(X1,skf10(X1,X11))
| ~ group(X1,X10)
| ~ actual_world(X1)
| ~ ssSkC0 ),
clause78,
[final] ).
cnf(c_0_99,negated_conjecture,
( member(X1,skf10(X1,X10),X10)
| ~ frontseat(X1,X2)
| ~ ssSkP1(X2,X3,X1)
| ~ two(X1,X3)
| ~ group(X1,X3)
| ~ ssSkP0(X3,X1)
| ~ agent(X1,X4,X5)
| ~ old(X1,X5)
| ~ dirty(X1,X5)
| ~ white(X1,X5)
| ~ chevy(X1,X5)
| ~ barrel(X1,X4)
| ~ present(X1,X4)
| ~ event(X1,X4)
| ~ hollywood_placename(X1,X6)
| ~ placename(X1,X6)
| ~ in(X1,X4,X7)
| ~ city(X1,X7)
| ~ of(X1,X6,X7)
| ~ street(X1,X8)
| ~ lonely(X1,X8)
| ~ down(X1,X4,X8)
| ~ ssSkP2(X9,X10,X1)
| ~ group(X1,X9)
| ~ group(X1,X10)
| ~ actual_world(X1)
| ~ ssSkC0 ),
clause76,
[final] ).
cnf(c_0_100,negated_conjecture,
( be(X1,skf13(X1,X5,X2),X2,skf12(X2,X1,X5))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
clause66,
[final] ).
cnf(c_0_101,negated_conjecture,
( ssSkP2(X3,X5,X1)
| ~ wear(X1,X2)
| ~ nonreflexive(X1,X2)
| ~ present(X1,X2)
| ~ patient(X1,X2,skf19(X3,X1,X4))
| ~ agent(X1,X2,skf21(X3,X1,X4))
| ~ event(X1,X2) ),
clause74,
[final] ).
cnf(c_0_102,negated_conjecture,
( patient(X1,skf17(X1,X2,X4),X4)
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
clause73,
[final] ).
cnf(c_0_103,negated_conjecture,
( agent(X1,skf17(X1,X2,X6),X2)
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
clause71,
[final] ).
cnf(c_0_104,negated_conjecture,
( nonreflexive(X1,skf17(X1,X6,X7))
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
clause68,
[final] ).
cnf(c_0_105,negated_conjecture,
( wear(X1,skf17(X1,X6,X7))
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
clause67,
[final] ).
cnf(c_0_106,negated_conjecture,
( event(X1,skf17(X1,X6,X7))
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
clause70,
[final] ).
cnf(c_0_107,negated_conjecture,
( present(X1,skf17(X1,X6,X7))
| ~ member(X1,X2,X3)
| ~ member(X1,X4,X5)
| ~ ssSkP2(X3,X5,X1) ),
clause69,
[final] ).
cnf(c_0_108,negated_conjecture,
( in(X1,skf12(X2,X1,X4),X4)
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
clause65,
[final] ).
cnf(c_0_109,negated_conjecture,
( ssSkP1(X3,X6,X1)
| ~ in(X1,X2,X3)
| ~ be(X1,X4,skf16(X3,X1,X5),X2)
| ~ state(X1,X4) ),
clause72,
[final] ).
cnf(c_0_110,negated_conjecture,
( state(X1,skf13(X1,X5,X6))
| ~ member(X1,X2,X3)
| ~ ssSkP1(X4,X3,X1) ),
clause64,
[final] ).
cnf(c_0_111,negated_conjecture,
( ssSkP1(X1,X2,X3)
| member(X3,skf16(X1,X3,X2),X2) ),
clause58,
[final] ).
cnf(c_0_112,negated_conjecture,
( ssSkP0(X3,X1)
| ~ young(X1,skf11(X1,X2))
| ~ fellow(X1,skf11(X1,X2)) ),
clause63,
[final] ).
cnf(c_0_113,negated_conjecture,
( ssSkP0(X1,X2)
| member(X2,skf11(X2,X1),X1) ),
clause51,
[final] ).
cnf(c_0_114,negated_conjecture,
( young(X1,X2)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X3,X1) ),
clause62,
[final] ).
cnf(c_0_115,negated_conjecture,
( fellow(X1,X2)
| ~ member(X1,X2,X3)
| ~ ssSkP0(X3,X1) ),
clause61,
[final] ).
cnf(c_0_116,negated_conjecture,
( ssSkC0
| cheap(skc63,X1)
| ~ member(skc63,X1,skc64) ),
clause54,
[final] ).
cnf(c_0_117,negated_conjecture,
( ssSkC0
| black(skc63,X1)
| ~ member(skc63,X1,skc64) ),
clause53,
[final] ).
cnf(c_0_118,negated_conjecture,
( ssSkC0
| coat(skc63,X1)
| ~ member(skc63,X1,skc64) ),
clause52,
[final] ).
cnf(c_0_119,negated_conjecture,
( cheap(skc19,X1)
| ~ member(skc19,X1,skc20)
| ~ ssSkC0 ),
clause57,
[final] ).
cnf(c_0_120,negated_conjecture,
( black(skc19,X1)
| ~ member(skc19,X1,skc20)
| ~ ssSkC0 ),
clause56,
[final] ).
cnf(c_0_121,negated_conjecture,
( coat(skc19,X1)
| ~ member(skc19,X1,skc20)
| ~ ssSkC0 ),
clause55,
[final] ).
cnf(c_0_122,negated_conjecture,
( ssSkC0
| of(skc63,skc68,skc69) ),
clause42,
[final] ).
cnf(c_0_123,negated_conjecture,
( ssSkC0
| in(skc63,skc66,skc69) ),
clause41,
[final] ).
cnf(c_0_124,negated_conjecture,
( ssSkP2(skc21,skc20,skc19)
| ~ ssSkC0 ),
clause50,
[final] ).
cnf(c_0_125,negated_conjecture,
( down(skc19,skc23,skc24)
| ~ ssSkC0 ),
clause49,
[final] ).
cnf(c_0_126,negated_conjecture,
( ssSkC0
| agent(skc63,skc66,skc70) ),
clause40,
[final] ).
cnf(c_0_127,negated_conjecture,
( of(skc19,skc25,skc26)
| ~ ssSkC0 ),
clause46,
[final] ).
cnf(c_0_128,negated_conjecture,
( in(skc19,skc23,skc26)
| ~ ssSkC0 ),
clause47,
[final] ).
cnf(c_0_129,negated_conjecture,
( agent(skc19,skc23,skc27)
| ~ ssSkC0 ),
clause45,
[final] ).
cnf(c_0_130,negated_conjecture,
( ssSkP1(skc24,skc22,skc19)
| ~ ssSkC0 ),
clause48,
[final] ).
cnf(c_0_131,negated_conjecture,
( ssSkC0
| ssSkP1(skc72,skc71,skc63) ),
clause39,
[final] ).
cnf(c_0_132,negated_conjecture,
( ssSkC0
| city(skc63,skc69) ),
clause16,
[final] ).
cnf(c_0_133,negated_conjecture,
( ssSkC0
| placename(skc63,skc68) ),
clause15,
[final] ).
cnf(c_0_134,negated_conjecture,
( ssSkC0
| hollywood_placename(skc63,skc68) ),
clause14,
[final] ).
cnf(c_0_135,negated_conjecture,
( ssSkC0
| chevy(skc63,skc70) ),
clause10,
[final] ).
cnf(c_0_136,negated_conjecture,
( ssSkC0
| white(skc63,skc70) ),
clause9,
[final] ).
cnf(c_0_137,negated_conjecture,
( ssSkC0
| dirty(skc63,skc70) ),
clause8,
[final] ).
cnf(c_0_138,negated_conjecture,
( ssSkC0
| old(skc63,skc70) ),
clause7,
[final] ).
cnf(c_0_139,negated_conjecture,
( ssSkC0
| ssSkP0(skc71,skc63) ),
clause6,
[final] ).
cnf(c_0_140,negated_conjecture,
( lonely(skc19,skc24)
| ~ ssSkC0 ),
clause34,
[final] ).
cnf(c_0_141,negated_conjecture,
( street(skc19,skc24)
| ~ ssSkC0 ),
clause35,
[final] ).
cnf(c_0_142,negated_conjecture,
( city(skc19,skc26)
| ~ ssSkC0 ),
clause33,
[final] ).
cnf(c_0_143,negated_conjecture,
( placename(skc19,skc25)
| ~ ssSkC0 ),
clause31,
[final] ).
cnf(c_0_144,negated_conjecture,
( hollywood_placename(skc19,skc25)
| ~ ssSkC0 ),
clause32,
[final] ).
cnf(c_0_145,negated_conjecture,
( event(skc19,skc23)
| ~ ssSkC0 ),
clause28,
[final] ).
cnf(c_0_146,negated_conjecture,
( present(skc19,skc23)
| ~ ssSkC0 ),
clause29,
[final] ).
cnf(c_0_147,negated_conjecture,
( ssSkC0
| group(skc63,skc71) ),
clause5,
[final] ).
cnf(c_0_148,negated_conjecture,
( barrel(skc19,skc23)
| ~ ssSkC0 ),
clause30,
[final] ).
cnf(c_0_149,negated_conjecture,
( chevy(skc19,skc27)
| ~ ssSkC0 ),
clause24,
[final] ).
cnf(c_0_150,negated_conjecture,
( white(skc19,skc27)
| ~ ssSkC0 ),
clause25,
[final] ).
cnf(c_0_151,negated_conjecture,
( dirty(skc19,skc27)
| ~ ssSkC0 ),
clause26,
[final] ).
cnf(c_0_152,negated_conjecture,
( ssSkC0
| two(skc63,skc71) ),
clause4,
[final] ).
cnf(c_0_153,negated_conjecture,
( old(skc19,skc27)
| ~ ssSkC0 ),
clause27,
[final] ).
cnf(c_0_154,negated_conjecture,
( ssSkP0(skc22,skc19)
| ~ ssSkC0 ),
clause21,
[final] ).
cnf(c_0_155,negated_conjecture,
( group(skc19,skc21)
| ~ ssSkC0 ),
clause38,
[final] ).
cnf(c_0_156,negated_conjecture,
( group(skc19,skc20)
| ~ ssSkC0 ),
clause37,
[final] ).
cnf(c_0_157,negated_conjecture,
( ssSkC0
| frontseat(skc63,skc72) ),
clause3,
[final] ).
cnf(c_0_158,negated_conjecture,
( group(skc19,skc22)
| ~ ssSkC0 ),
clause22,
[final] ).
cnf(c_0_159,negated_conjecture,
( two(skc19,skc22)
| ~ ssSkC0 ),
clause23,
[final] ).
cnf(c_0_160,negated_conjecture,
( frontseat(skc19,skc24)
| ~ ssSkC0 ),
clause36,
[final] ).
cnf(c_0_161,negated_conjecture,
actual_world(skc19),
clause2,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : NLP165-1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.17/0.37 % Computer : n027.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 2400
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Mon Oct 2 11:35:15 EDT 2023
% 0.17/0.37 % CPUTime :
% 0.36/0.53 Running first-order theorem proving
% 0.36/0.53 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.u94v6q8baT/E---3.1_32162.p
% 0.38/0.56 # Version: 3.1pre001
% 0.38/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.38/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.38/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.56 # Starting sh5l with 300s (1) cores
% 0.38/0.56 # sh5l with pid 32243 completed with status 1
% 0.38/0.56 # Result found by sh5l
% 0.38/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.38/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.38/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.56 # Starting sh5l with 300s (1) cores
% 0.38/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.38/0.56 # Search class: FGHNF-FFMM32-SFFFFFNN
% 0.38/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 0.38/0.56 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 32248 completed with status 1
% 0.38/0.56 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.38/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.38/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.38/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.56 # Starting sh5l with 300s (1) cores
% 0.38/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.38/0.56 # Search class: FGHNF-FFMM32-SFFFFFNN
% 0.38/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 181s (1) cores
% 0.38/0.56 # Preprocessing time : 0.005 s
% 0.38/0.56 # Presaturation interreduction done
% 0.38/0.56
% 0.38/0.56 # No proof found!
% 0.38/0.56 # SZS status Satisfiable
% 0.38/0.56 # SZS output start Saturation
% See solution above
% 0.38/0.56 # Parsed axioms : 78
% 0.38/0.56 # Removed by relevancy pruning/SinE : 0
% 0.38/0.56 # Initial clauses : 78
% 0.38/0.56 # Removed in clause preprocessing : 0
% 0.38/0.56 # Initial clauses in saturation : 78
% 0.38/0.56 # Processed clauses : 162
% 0.38/0.56 # ...of these trivial : 0
% 0.38/0.56 # ...subsumed : 0
% 0.38/0.56 # ...remaining for further processing : 162
% 0.38/0.56 # Other redundant clauses eliminated : 0
% 0.38/0.56 # Clauses deleted for lack of memory : 0
% 0.38/0.56 # Backward-subsumed : 0
% 0.38/0.56 # Backward-rewritten : 0
% 0.38/0.56 # Generated clauses : 6
% 0.38/0.56 # ...of the previous two non-redundant : 6
% 0.38/0.56 # ...aggressively subsumed : 0
% 0.38/0.56 # Contextual simplify-reflections : 13
% 0.38/0.56 # Paramodulations : 6
% 0.38/0.56 # Factorizations : 0
% 0.38/0.56 # NegExts : 0
% 0.38/0.56 # Equation resolutions : 0
% 0.38/0.56 # Total rewrite steps : 3
% 0.38/0.56 # Propositional unsat checks : 0
% 0.38/0.56 # Propositional check models : 0
% 0.38/0.56 # Propositional check unsatisfiable : 0
% 0.38/0.56 # Propositional clauses : 0
% 0.38/0.56 # Propositional clauses after purity: 0
% 0.38/0.56 # Propositional unsat core size : 0
% 0.38/0.56 # Propositional preprocessing time : 0.000
% 0.38/0.56 # Propositional encoding time : 0.000
% 0.38/0.56 # Propositional solver time : 0.000
% 0.38/0.56 # Success case prop preproc time : 0.000
% 0.38/0.56 # Success case prop encoding time : 0.000
% 0.38/0.56 # Success case prop solver time : 0.000
% 0.38/0.56 # Current number of processed clauses : 84
% 0.38/0.56 # Positive orientable unit clauses : 2
% 0.38/0.56 # Positive unorientable unit clauses: 0
% 0.38/0.56 # Negative unit clauses : 0
% 0.38/0.56 # Non-unit-clauses : 82
% 0.38/0.56 # Current number of unprocessed clauses: 0
% 0.38/0.56 # ...number of literals in the above : 0
% 0.38/0.56 # Current number of archived formulas : 0
% 0.38/0.56 # Current number of archived clauses : 78
% 0.38/0.56 # Clause-clause subsumption calls (NU) : 5683
% 0.38/0.56 # Rec. Clause-clause subsumption calls : 1462
% 0.38/0.56 # Non-unit clause-clause subsumptions : 13
% 0.38/0.56 # Unit Clause-clause subsumption calls : 0
% 0.38/0.56 # Rewrite failures with RHS unbound : 0
% 0.38/0.56 # BW rewrite match attempts : 0
% 0.38/0.56 # BW rewrite match successes : 0
% 0.38/0.56 # Condensation attempts : 0
% 0.38/0.56 # Condensation successes : 0
% 0.38/0.56 # Termbank termtop insertions : 4140
% 0.38/0.56
% 0.38/0.56 # -------------------------------------------------
% 0.38/0.56 # User time : 0.013 s
% 0.38/0.56 # System time : 0.007 s
% 0.38/0.56 # Total time : 0.020 s
% 0.38/0.56 # Maximum resident set size: 1988 pages
% 0.38/0.56
% 0.38/0.56 # -------------------------------------------------
% 0.38/0.56 # User time : 0.016 s
% 0.38/0.56 # System time : 0.009 s
% 0.38/0.56 # Total time : 0.025 s
% 0.38/0.56 # Maximum resident set size: 1772 pages
% 0.38/0.56 % E---3.1 exiting
% 0.38/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------