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