TSTP Solution File: PRO009+4 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : PRO009+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 00:36:32 EST 2010
% Result : Theorem 0.31s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 10
% Syntax : Number of formulae : 106 ( 23 unt; 0 def)
% Number of atoms : 416 ( 18 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 508 ( 198 ~; 193 |; 104 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 195 ( 6 sgn 121 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X4,X5,X6] :
( next_subocc(X4,X5,X6)
=> ( arboreal(X4)
& arboreal(X5) ) ),
file('/tmp/tmpBflOAQ/sel_PRO009+4.p_1',sos_25) ).
fof(3,axiom,
! [X7,X8] :
( ( occurrence_of(X8,X7)
& ~ atomic(X7) )
=> ? [X9] :
( root(X9,X7)
& subactivity_occurrence(X9,X8) ) ),
file('/tmp/tmpBflOAQ/sel_PRO009+4.p_1',sos) ).
fof(7,axiom,
! [X18,X19,X20] :
( min_precedes(X18,X19,X20)
=> ~ root(X19,X20) ),
file('/tmp/tmpBflOAQ/sel_PRO009+4.p_1',sos_22) ).
fof(10,axiom,
! [X29,X30,X31,X32] :
( ( occurrence_of(X31,X32)
& root_occ(X29,X31)
& root_occ(X30,X31) )
=> X29 = X30 ),
file('/tmp/tmpBflOAQ/sel_PRO009+4.p_1',sos_29) ).
fof(17,axiom,
! [X40,X41,X42,X43] :
( ( occurrence_of(X41,X40)
& subactivity_occurrence(X42,X41)
& leaf_occ(X43,X41)
& arboreal(X42)
& ~ min_precedes(X42,X43,X40) )
=> X43 = X42 ),
file('/tmp/tmpBflOAQ/sel_PRO009+4.p_1',sos_02) ).
fof(26,axiom,
! [X65] :
( occurrence_of(X65,tptp0)
=> ? [X66,X67,X68] :
( occurrence_of(X66,tptp3)
& root_occ(X66,X65)
& occurrence_of(X67,tptp4)
& next_subocc(X66,X67,tptp0)
& ( occurrence_of(X68,tptp2)
| occurrence_of(X68,tptp1) )
& next_subocc(X67,X68,tptp0)
& leaf_occ(X68,X65) ) ),
file('/tmp/tmpBflOAQ/sel_PRO009+4.p_1',sos_32) ).
fof(32,axiom,
~ atomic(tptp0),
file('/tmp/tmpBflOAQ/sel_PRO009+4.p_1',sos_34) ).
fof(35,axiom,
! [X76,X77,X78] :
( next_subocc(X76,X77,X78)
<=> ( min_precedes(X76,X77,X78)
& ~ ? [X79] :
( min_precedes(X76,X79,X78)
& min_precedes(X79,X77,X78) ) ) ),
file('/tmp/tmpBflOAQ/sel_PRO009+4.p_1',sos_26) ).
fof(36,axiom,
! [X80,X81] :
( root_occ(X80,X81)
<=> ? [X82] :
( occurrence_of(X81,X82)
& subactivity_occurrence(X80,X81)
& root(X80,X82) ) ),
file('/tmp/tmpBflOAQ/sel_PRO009+4.p_1',sos_19) ).
fof(46,conjecture,
! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108] :
( occurrence_of(X107,tptp3)
& root_occ(X107,X106)
& ( occurrence_of(X108,tptp2)
| occurrence_of(X108,tptp1) )
& min_precedes(X107,X108,tptp0)
& leaf_occ(X108,X106) ) ),
file('/tmp/tmpBflOAQ/sel_PRO009+4.p_1',goals) ).
fof(47,negated_conjecture,
~ ! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108] :
( occurrence_of(X107,tptp3)
& root_occ(X107,X106)
& ( occurrence_of(X108,tptp2)
| occurrence_of(X108,tptp1) )
& min_precedes(X107,X108,tptp0)
& leaf_occ(X108,X106) ) ),
inference(assume_negation,[status(cth)],[46]) ).
fof(48,plain,
! [X7,X8] :
( ( occurrence_of(X8,X7)
& ~ atomic(X7) )
=> ? [X9] :
( root(X9,X7)
& subactivity_occurrence(X9,X8) ) ),
inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).
fof(50,plain,
! [X18,X19,X20] :
( min_precedes(X18,X19,X20)
=> ~ root(X19,X20) ),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
fof(52,plain,
! [X40,X41,X42,X43] :
( ( occurrence_of(X41,X40)
& subactivity_occurrence(X42,X41)
& leaf_occ(X43,X41)
& arboreal(X42)
& ~ min_precedes(X42,X43,X40) )
=> X43 = X42 ),
inference(fof_simplification,[status(thm)],[17,theory(equality)]) ).
fof(54,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[32,theory(equality)]) ).
fof(58,plain,
! [X4,X5,X6] :
( ~ next_subocc(X4,X5,X6)
| ( arboreal(X4)
& arboreal(X5) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(59,plain,
! [X7,X8,X9] :
( ~ next_subocc(X7,X8,X9)
| ( arboreal(X7)
& arboreal(X8) ) ),
inference(variable_rename,[status(thm)],[58]) ).
fof(60,plain,
! [X7,X8,X9] :
( ( arboreal(X7)
| ~ next_subocc(X7,X8,X9) )
& ( arboreal(X8)
| ~ next_subocc(X7,X8,X9) ) ),
inference(distribute,[status(thm)],[59]) ).
cnf(62,plain,
( arboreal(X1)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[60]) ).
fof(63,plain,
! [X7,X8] :
( ~ occurrence_of(X8,X7)
| atomic(X7)
| ? [X9] :
( root(X9,X7)
& subactivity_occurrence(X9,X8) ) ),
inference(fof_nnf,[status(thm)],[48]) ).
fof(64,plain,
! [X10,X11] :
( ~ occurrence_of(X11,X10)
| atomic(X10)
| ? [X12] :
( root(X12,X10)
& subactivity_occurrence(X12,X11) ) ),
inference(variable_rename,[status(thm)],[63]) ).
fof(65,plain,
! [X10,X11] :
( ~ occurrence_of(X11,X10)
| atomic(X10)
| ( root(esk1_2(X10,X11),X10)
& subactivity_occurrence(esk1_2(X10,X11),X11) ) ),
inference(skolemize,[status(esa)],[64]) ).
fof(66,plain,
! [X10,X11] :
( ( root(esk1_2(X10,X11),X10)
| ~ occurrence_of(X11,X10)
| atomic(X10) )
& ( subactivity_occurrence(esk1_2(X10,X11),X11)
| ~ occurrence_of(X11,X10)
| atomic(X10) ) ),
inference(distribute,[status(thm)],[65]) ).
cnf(67,plain,
( atomic(X1)
| subactivity_occurrence(esk1_2(X1,X2),X2)
| ~ occurrence_of(X2,X1) ),
inference(split_conjunct,[status(thm)],[66]) ).
cnf(68,plain,
( atomic(X1)
| root(esk1_2(X1,X2),X1)
| ~ occurrence_of(X2,X1) ),
inference(split_conjunct,[status(thm)],[66]) ).
fof(81,plain,
! [X18,X19,X20] :
( ~ min_precedes(X18,X19,X20)
| ~ root(X19,X20) ),
inference(fof_nnf,[status(thm)],[50]) ).
fof(82,plain,
! [X21,X22,X23] :
( ~ min_precedes(X21,X22,X23)
| ~ root(X22,X23) ),
inference(variable_rename,[status(thm)],[81]) ).
cnf(83,plain,
( ~ root(X1,X2)
| ~ min_precedes(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[82]) ).
fof(93,plain,
! [X29,X30,X31,X32] :
( ~ occurrence_of(X31,X32)
| ~ root_occ(X29,X31)
| ~ root_occ(X30,X31)
| X29 = X30 ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(94,plain,
! [X33,X34,X35,X36] :
( ~ occurrence_of(X35,X36)
| ~ root_occ(X33,X35)
| ~ root_occ(X34,X35)
| X33 = X34 ),
inference(variable_rename,[status(thm)],[93]) ).
cnf(95,plain,
( X1 = X2
| ~ root_occ(X2,X3)
| ~ root_occ(X1,X3)
| ~ occurrence_of(X3,X4) ),
inference(split_conjunct,[status(thm)],[94]) ).
fof(107,plain,
! [X40,X41,X42,X43] :
( ~ occurrence_of(X41,X40)
| ~ subactivity_occurrence(X42,X41)
| ~ leaf_occ(X43,X41)
| ~ arboreal(X42)
| min_precedes(X42,X43,X40)
| X43 = X42 ),
inference(fof_nnf,[status(thm)],[52]) ).
fof(108,plain,
! [X44,X45,X46,X47] :
( ~ occurrence_of(X45,X44)
| ~ subactivity_occurrence(X46,X45)
| ~ leaf_occ(X47,X45)
| ~ arboreal(X46)
| min_precedes(X46,X47,X44)
| X47 = X46 ),
inference(variable_rename,[status(thm)],[107]) ).
cnf(109,plain,
( X1 = X2
| min_precedes(X2,X1,X3)
| ~ arboreal(X2)
| ~ leaf_occ(X1,X4)
| ~ subactivity_occurrence(X2,X4)
| ~ occurrence_of(X4,X3) ),
inference(split_conjunct,[status(thm)],[108]) ).
fof(142,plain,
! [X65] :
( ~ occurrence_of(X65,tptp0)
| ? [X66,X67,X68] :
( occurrence_of(X66,tptp3)
& root_occ(X66,X65)
& occurrence_of(X67,tptp4)
& next_subocc(X66,X67,tptp0)
& ( occurrence_of(X68,tptp2)
| occurrence_of(X68,tptp1) )
& next_subocc(X67,X68,tptp0)
& leaf_occ(X68,X65) ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(143,plain,
! [X69] :
( ~ occurrence_of(X69,tptp0)
| ? [X70,X71,X72] :
( occurrence_of(X70,tptp3)
& root_occ(X70,X69)
& occurrence_of(X71,tptp4)
& next_subocc(X70,X71,tptp0)
& ( occurrence_of(X72,tptp2)
| occurrence_of(X72,tptp1) )
& next_subocc(X71,X72,tptp0)
& leaf_occ(X72,X69) ) ),
inference(variable_rename,[status(thm)],[142]) ).
fof(144,plain,
! [X69] :
( ~ occurrence_of(X69,tptp0)
| ( occurrence_of(esk6_1(X69),tptp3)
& root_occ(esk6_1(X69),X69)
& occurrence_of(esk7_1(X69),tptp4)
& next_subocc(esk6_1(X69),esk7_1(X69),tptp0)
& ( occurrence_of(esk8_1(X69),tptp2)
| occurrence_of(esk8_1(X69),tptp1) )
& next_subocc(esk7_1(X69),esk8_1(X69),tptp0)
& leaf_occ(esk8_1(X69),X69) ) ),
inference(skolemize,[status(esa)],[143]) ).
fof(145,plain,
! [X69] :
( ( occurrence_of(esk6_1(X69),tptp3)
| ~ occurrence_of(X69,tptp0) )
& ( root_occ(esk6_1(X69),X69)
| ~ occurrence_of(X69,tptp0) )
& ( occurrence_of(esk7_1(X69),tptp4)
| ~ occurrence_of(X69,tptp0) )
& ( next_subocc(esk6_1(X69),esk7_1(X69),tptp0)
| ~ occurrence_of(X69,tptp0) )
& ( occurrence_of(esk8_1(X69),tptp2)
| occurrence_of(esk8_1(X69),tptp1)
| ~ occurrence_of(X69,tptp0) )
& ( next_subocc(esk7_1(X69),esk8_1(X69),tptp0)
| ~ occurrence_of(X69,tptp0) )
& ( leaf_occ(esk8_1(X69),X69)
| ~ occurrence_of(X69,tptp0) ) ),
inference(distribute,[status(thm)],[144]) ).
cnf(146,plain,
( leaf_occ(esk8_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(147,plain,
( next_subocc(esk7_1(X1),esk8_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(148,plain,
( occurrence_of(esk8_1(X1),tptp1)
| occurrence_of(esk8_1(X1),tptp2)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(149,plain,
( next_subocc(esk6_1(X1),esk7_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(151,plain,
( root_occ(esk6_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(152,plain,
( occurrence_of(esk6_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[145]) ).
cnf(162,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[54]) ).
fof(165,plain,
! [X76,X77,X78] :
( ( ~ next_subocc(X76,X77,X78)
| ( min_precedes(X76,X77,X78)
& ! [X79] :
( ~ min_precedes(X76,X79,X78)
| ~ min_precedes(X79,X77,X78) ) ) )
& ( ~ min_precedes(X76,X77,X78)
| ? [X79] :
( min_precedes(X76,X79,X78)
& min_precedes(X79,X77,X78) )
| next_subocc(X76,X77,X78) ) ),
inference(fof_nnf,[status(thm)],[35]) ).
fof(166,plain,
! [X80,X81,X82] :
( ( ~ next_subocc(X80,X81,X82)
| ( min_precedes(X80,X81,X82)
& ! [X83] :
( ~ min_precedes(X80,X83,X82)
| ~ min_precedes(X83,X81,X82) ) ) )
& ( ~ min_precedes(X80,X81,X82)
| ? [X84] :
( min_precedes(X80,X84,X82)
& min_precedes(X84,X81,X82) )
| next_subocc(X80,X81,X82) ) ),
inference(variable_rename,[status(thm)],[165]) ).
fof(167,plain,
! [X80,X81,X82] :
( ( ~ next_subocc(X80,X81,X82)
| ( min_precedes(X80,X81,X82)
& ! [X83] :
( ~ min_precedes(X80,X83,X82)
| ~ min_precedes(X83,X81,X82) ) ) )
& ( ~ min_precedes(X80,X81,X82)
| ( min_precedes(X80,esk9_3(X80,X81,X82),X82)
& min_precedes(esk9_3(X80,X81,X82),X81,X82) )
| next_subocc(X80,X81,X82) ) ),
inference(skolemize,[status(esa)],[166]) ).
fof(168,plain,
! [X80,X81,X82,X83] :
( ( ( ( ~ min_precedes(X80,X83,X82)
| ~ min_precedes(X83,X81,X82) )
& min_precedes(X80,X81,X82) )
| ~ next_subocc(X80,X81,X82) )
& ( ~ min_precedes(X80,X81,X82)
| ( min_precedes(X80,esk9_3(X80,X81,X82),X82)
& min_precedes(esk9_3(X80,X81,X82),X81,X82) )
| next_subocc(X80,X81,X82) ) ),
inference(shift_quantors,[status(thm)],[167]) ).
fof(169,plain,
! [X80,X81,X82,X83] :
( ( ~ min_precedes(X80,X83,X82)
| ~ min_precedes(X83,X81,X82)
| ~ next_subocc(X80,X81,X82) )
& ( min_precedes(X80,X81,X82)
| ~ next_subocc(X80,X81,X82) )
& ( min_precedes(X80,esk9_3(X80,X81,X82),X82)
| ~ min_precedes(X80,X81,X82)
| next_subocc(X80,X81,X82) )
& ( min_precedes(esk9_3(X80,X81,X82),X81,X82)
| ~ min_precedes(X80,X81,X82)
| next_subocc(X80,X81,X82) ) ),
inference(distribute,[status(thm)],[168]) ).
cnf(172,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[169]) ).
fof(174,plain,
! [X80,X81] :
( ( ~ root_occ(X80,X81)
| ? [X82] :
( occurrence_of(X81,X82)
& subactivity_occurrence(X80,X81)
& root(X80,X82) ) )
& ( ! [X82] :
( ~ occurrence_of(X81,X82)
| ~ subactivity_occurrence(X80,X81)
| ~ root(X80,X82) )
| root_occ(X80,X81) ) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(175,plain,
! [X83,X84] :
( ( ~ root_occ(X83,X84)
| ? [X85] :
( occurrence_of(X84,X85)
& subactivity_occurrence(X83,X84)
& root(X83,X85) ) )
& ( ! [X86] :
( ~ occurrence_of(X84,X86)
| ~ subactivity_occurrence(X83,X84)
| ~ root(X83,X86) )
| root_occ(X83,X84) ) ),
inference(variable_rename,[status(thm)],[174]) ).
fof(176,plain,
! [X83,X84] :
( ( ~ root_occ(X83,X84)
| ( occurrence_of(X84,esk10_2(X83,X84))
& subactivity_occurrence(X83,X84)
& root(X83,esk10_2(X83,X84)) ) )
& ( ! [X86] :
( ~ occurrence_of(X84,X86)
| ~ subactivity_occurrence(X83,X84)
| ~ root(X83,X86) )
| root_occ(X83,X84) ) ),
inference(skolemize,[status(esa)],[175]) ).
fof(177,plain,
! [X83,X84,X86] :
( ( ~ occurrence_of(X84,X86)
| ~ subactivity_occurrence(X83,X84)
| ~ root(X83,X86)
| root_occ(X83,X84) )
& ( ~ root_occ(X83,X84)
| ( occurrence_of(X84,esk10_2(X83,X84))
& subactivity_occurrence(X83,X84)
& root(X83,esk10_2(X83,X84)) ) ) ),
inference(shift_quantors,[status(thm)],[176]) ).
fof(178,plain,
! [X83,X84,X86] :
( ( ~ occurrence_of(X84,X86)
| ~ subactivity_occurrence(X83,X84)
| ~ root(X83,X86)
| root_occ(X83,X84) )
& ( occurrence_of(X84,esk10_2(X83,X84))
| ~ root_occ(X83,X84) )
& ( subactivity_occurrence(X83,X84)
| ~ root_occ(X83,X84) )
& ( root(X83,esk10_2(X83,X84))
| ~ root_occ(X83,X84) ) ),
inference(distribute,[status(thm)],[177]) ).
cnf(182,plain,
( root_occ(X1,X2)
| ~ root(X1,X3)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,X3) ),
inference(split_conjunct,[status(thm)],[178]) ).
fof(236,negated_conjecture,
? [X106] :
( occurrence_of(X106,tptp0)
& ! [X107,X108] :
( ~ occurrence_of(X107,tptp3)
| ~ root_occ(X107,X106)
| ( ~ occurrence_of(X108,tptp2)
& ~ occurrence_of(X108,tptp1) )
| ~ min_precedes(X107,X108,tptp0)
| ~ leaf_occ(X108,X106) ) ),
inference(fof_nnf,[status(thm)],[47]) ).
fof(237,negated_conjecture,
? [X109] :
( occurrence_of(X109,tptp0)
& ! [X110,X111] :
( ~ occurrence_of(X110,tptp3)
| ~ root_occ(X110,X109)
| ( ~ occurrence_of(X111,tptp2)
& ~ occurrence_of(X111,tptp1) )
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,X109) ) ),
inference(variable_rename,[status(thm)],[236]) ).
fof(238,negated_conjecture,
( occurrence_of(esk16_0,tptp0)
& ! [X110,X111] :
( ~ occurrence_of(X110,tptp3)
| ~ root_occ(X110,esk16_0)
| ( ~ occurrence_of(X111,tptp2)
& ~ occurrence_of(X111,tptp1) )
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk16_0) ) ),
inference(skolemize,[status(esa)],[237]) ).
fof(239,negated_conjecture,
! [X110,X111] :
( ( ~ occurrence_of(X110,tptp3)
| ~ root_occ(X110,esk16_0)
| ( ~ occurrence_of(X111,tptp2)
& ~ occurrence_of(X111,tptp1) )
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk16_0) )
& occurrence_of(esk16_0,tptp0) ),
inference(shift_quantors,[status(thm)],[238]) ).
fof(240,negated_conjecture,
! [X110,X111] :
( ( ~ occurrence_of(X111,tptp2)
| ~ occurrence_of(X110,tptp3)
| ~ root_occ(X110,esk16_0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk16_0) )
& ( ~ occurrence_of(X111,tptp1)
| ~ occurrence_of(X110,tptp3)
| ~ root_occ(X110,esk16_0)
| ~ min_precedes(X110,X111,tptp0)
| ~ leaf_occ(X111,esk16_0) )
& occurrence_of(esk16_0,tptp0) ),
inference(distribute,[status(thm)],[239]) ).
cnf(241,negated_conjecture,
occurrence_of(esk16_0,tptp0),
inference(split_conjunct,[status(thm)],[240]) ).
cnf(242,negated_conjecture,
( ~ leaf_occ(X1,esk16_0)
| ~ min_precedes(X2,X1,tptp0)
| ~ root_occ(X2,esk16_0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp1) ),
inference(split_conjunct,[status(thm)],[240]) ).
cnf(243,negated_conjecture,
( ~ leaf_occ(X1,esk16_0)
| ~ min_precedes(X2,X1,tptp0)
| ~ root_occ(X2,esk16_0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[240]) ).
cnf(251,negated_conjecture,
occurrence_of(esk6_1(esk16_0),tptp3),
inference(spm,[status(thm)],[152,241,theory(equality)]) ).
cnf(252,negated_conjecture,
leaf_occ(esk8_1(esk16_0),esk16_0),
inference(spm,[status(thm)],[146,241,theory(equality)]) ).
cnf(253,negated_conjecture,
root_occ(esk6_1(esk16_0),esk16_0),
inference(spm,[status(thm)],[151,241,theory(equality)]) ).
cnf(260,negated_conjecture,
next_subocc(esk6_1(esk16_0),esk7_1(esk16_0),tptp0),
inference(spm,[status(thm)],[149,241,theory(equality)]) ).
cnf(261,negated_conjecture,
next_subocc(esk7_1(esk16_0),esk8_1(esk16_0),tptp0),
inference(spm,[status(thm)],[147,241,theory(equality)]) ).
cnf(262,negated_conjecture,
( occurrence_of(esk8_1(esk16_0),tptp1)
| occurrence_of(esk8_1(esk16_0),tptp2) ),
inference(spm,[status(thm)],[148,241,theory(equality)]) ).
cnf(263,negated_conjecture,
( root(esk1_2(tptp0,esk16_0),tptp0)
| atomic(tptp0) ),
inference(spm,[status(thm)],[68,241,theory(equality)]) ).
cnf(265,negated_conjecture,
root(esk1_2(tptp0,esk16_0),tptp0),
inference(sr,[status(thm)],[263,162,theory(equality)]) ).
cnf(266,negated_conjecture,
( subactivity_occurrence(esk1_2(tptp0,esk16_0),esk16_0)
| atomic(tptp0) ),
inference(spm,[status(thm)],[67,241,theory(equality)]) ).
cnf(268,negated_conjecture,
subactivity_occurrence(esk1_2(tptp0,esk16_0),esk16_0),
inference(sr,[status(thm)],[266,162,theory(equality)]) ).
cnf(276,negated_conjecture,
( root_occ(esk1_2(tptp0,esk16_0),esk16_0)
| ~ root(esk1_2(tptp0,esk16_0),X1)
| ~ occurrence_of(esk16_0,X1) ),
inference(spm,[status(thm)],[182,268,theory(equality)]) ).
cnf(287,negated_conjecture,
arboreal(esk6_1(esk16_0)),
inference(spm,[status(thm)],[62,260,theory(equality)]) ).
cnf(339,negated_conjecture,
min_precedes(esk7_1(esk16_0),esk8_1(esk16_0),tptp0),
inference(spm,[status(thm)],[172,261,theory(equality)]) ).
cnf(346,negated_conjecture,
( esk8_1(esk16_0) = X1
| min_precedes(X1,esk8_1(esk16_0),X2)
| ~ subactivity_occurrence(X1,esk16_0)
| ~ occurrence_of(esk16_0,X2)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[109,252,theory(equality)]) ).
cnf(365,negated_conjecture,
( ~ leaf_occ(X1,esk16_0)
| ~ occurrence_of(esk6_1(esk16_0),tptp3)
| ~ occurrence_of(X1,tptp2)
| ~ min_precedes(esk6_1(esk16_0),X1,tptp0) ),
inference(spm,[status(thm)],[243,253,theory(equality)]) ).
cnf(366,negated_conjecture,
( ~ leaf_occ(X1,esk16_0)
| ~ occurrence_of(esk6_1(esk16_0),tptp3)
| ~ occurrence_of(X1,tptp1)
| ~ min_precedes(esk6_1(esk16_0),X1,tptp0) ),
inference(spm,[status(thm)],[242,253,theory(equality)]) ).
cnf(367,negated_conjecture,
( ~ leaf_occ(X1,esk16_0)
| $false
| ~ occurrence_of(X1,tptp2)
| ~ min_precedes(esk6_1(esk16_0),X1,tptp0) ),
inference(rw,[status(thm)],[365,251,theory(equality)]) ).
cnf(368,negated_conjecture,
( ~ leaf_occ(X1,esk16_0)
| ~ occurrence_of(X1,tptp2)
| ~ min_precedes(esk6_1(esk16_0),X1,tptp0) ),
inference(cn,[status(thm)],[367,theory(equality)]) ).
cnf(369,negated_conjecture,
( ~ leaf_occ(X1,esk16_0)
| $false
| ~ occurrence_of(X1,tptp1)
| ~ min_precedes(esk6_1(esk16_0),X1,tptp0) ),
inference(rw,[status(thm)],[366,251,theory(equality)]) ).
cnf(370,negated_conjecture,
( ~ leaf_occ(X1,esk16_0)
| ~ occurrence_of(X1,tptp1)
| ~ min_precedes(esk6_1(esk16_0),X1,tptp0) ),
inference(cn,[status(thm)],[369,theory(equality)]) ).
cnf(372,negated_conjecture,
( ~ occurrence_of(esk8_1(esk16_0),tptp2)
| ~ min_precedes(esk6_1(esk16_0),esk8_1(esk16_0),tptp0) ),
inference(spm,[status(thm)],[368,252,theory(equality)]) ).
cnf(373,negated_conjecture,
( ~ occurrence_of(esk8_1(esk16_0),tptp1)
| ~ min_precedes(esk6_1(esk16_0),esk8_1(esk16_0),tptp0) ),
inference(spm,[status(thm)],[370,252,theory(equality)]) ).
cnf(410,negated_conjecture,
( root_occ(esk1_2(tptp0,esk16_0),esk16_0)
| ~ root(esk1_2(tptp0,esk16_0),tptp0) ),
inference(spm,[status(thm)],[276,241,theory(equality)]) ).
cnf(412,negated_conjecture,
( root_occ(esk1_2(tptp0,esk16_0),esk16_0)
| $false ),
inference(rw,[status(thm)],[410,265,theory(equality)]) ).
cnf(413,negated_conjecture,
root_occ(esk1_2(tptp0,esk16_0),esk16_0),
inference(cn,[status(thm)],[412,theory(equality)]) ).
cnf(419,negated_conjecture,
( X1 = esk1_2(tptp0,esk16_0)
| ~ root_occ(X1,esk16_0)
| ~ occurrence_of(esk16_0,X2) ),
inference(spm,[status(thm)],[95,413,theory(equality)]) ).
cnf(512,negated_conjecture,
( esk6_1(esk16_0) = esk1_2(tptp0,esk16_0)
| ~ occurrence_of(esk16_0,X1) ),
inference(spm,[status(thm)],[419,253,theory(equality)]) ).
cnf(513,negated_conjecture,
esk1_2(tptp0,esk16_0) = esk6_1(esk16_0),
inference(spm,[status(thm)],[512,241,theory(equality)]) ).
cnf(532,negated_conjecture,
subactivity_occurrence(esk6_1(esk16_0),esk16_0),
inference(rw,[status(thm)],[268,513,theory(equality)]) ).
cnf(536,negated_conjecture,
root(esk6_1(esk16_0),tptp0),
inference(rw,[status(thm)],[265,513,theory(equality)]) ).
cnf(673,negated_conjecture,
( occurrence_of(esk8_1(esk16_0),tptp2)
| ~ min_precedes(esk6_1(esk16_0),esk8_1(esk16_0),tptp0) ),
inference(spm,[status(thm)],[373,262,theory(equality)]) ).
cnf(726,negated_conjecture,
~ root(esk8_1(esk16_0),tptp0),
inference(spm,[status(thm)],[83,339,theory(equality)]) ).
cnf(955,negated_conjecture,
( esk8_1(esk16_0) = esk6_1(esk16_0)
| min_precedes(esk6_1(esk16_0),esk8_1(esk16_0),X1)
| ~ occurrence_of(esk16_0,X1)
| ~ arboreal(esk6_1(esk16_0)) ),
inference(spm,[status(thm)],[346,532,theory(equality)]) ).
cnf(957,negated_conjecture,
( esk8_1(esk16_0) = esk6_1(esk16_0)
| min_precedes(esk6_1(esk16_0),esk8_1(esk16_0),X1)
| ~ occurrence_of(esk16_0,X1)
| $false ),
inference(rw,[status(thm)],[955,287,theory(equality)]) ).
cnf(958,negated_conjecture,
( esk8_1(esk16_0) = esk6_1(esk16_0)
| min_precedes(esk6_1(esk16_0),esk8_1(esk16_0),X1)
| ~ occurrence_of(esk16_0,X1) ),
inference(cn,[status(thm)],[957,theory(equality)]) ).
cnf(1702,negated_conjecture,
~ min_precedes(esk6_1(esk16_0),esk8_1(esk16_0),tptp0),
inference(csr,[status(thm)],[673,372]) ).
cnf(2312,negated_conjecture,
( esk6_1(esk16_0) = esk8_1(esk16_0)
| min_precedes(esk6_1(esk16_0),esk8_1(esk16_0),tptp0) ),
inference(spm,[status(thm)],[958,241,theory(equality)]) ).
cnf(2314,negated_conjecture,
esk6_1(esk16_0) = esk8_1(esk16_0),
inference(sr,[status(thm)],[2312,1702,theory(equality)]) ).
cnf(2399,negated_conjecture,
root(esk8_1(esk16_0),tptp0),
inference(rw,[status(thm)],[536,2314,theory(equality)]) ).
cnf(2400,negated_conjecture,
$false,
inference(sr,[status(thm)],[2399,726,theory(equality)]) ).
cnf(2401,negated_conjecture,
$false,
2400,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/PRO/PRO009+4.p
% --creating new selector for []
% -running prover on /tmp/tmpBflOAQ/sel_PRO009+4.p_1 with time limit 29
% -prover status Theorem
% Problem PRO009+4.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/PRO/PRO009+4.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/PRO/PRO009+4.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------