TSTP Solution File: PRO009+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PRO009+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 : Wed Dec 29 21:09:42 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP13293/PRO009+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13293/PRO009+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13293/PRO009+4.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 13389
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X9]:(occurrence_of(X9,tptp0)=>?[X10]:?[X11]:?[X12]:((((((occurrence_of(X10,tptp3)&root_occ(X10,X9))&occurrence_of(X11,tptp4))&next_subocc(X10,X11,tptp0))&(occurrence_of(X12,tptp2)|occurrence_of(X12,tptp1)))&next_subocc(X11,X12,tptp0))&leaf_occ(X12,X9))),file('/tmp/SRASS.s.p', sos_32)).
% fof(14, axiom,atomic(tptp3),file('/tmp/SRASS.s.p', sos_38)).
% fof(15, axiom,![X30]:![X31]:![X32]:((occurrence_of(X30,X31)&occurrence_of(X30,X32))=>X31=X32),file('/tmp/SRASS.s.p', sos_08)).
% fof(18, axiom,![X37]:![X38]:![X39]:![X40]:(((((occurrence_of(X38,X37)&subactivity_occurrence(X39,X38))&leaf_occ(X40,X38))&arboreal(X39))&~(min_precedes(X39,X40,X37)))=>X40=X39),file('/tmp/SRASS.s.p', sos_02)).
% fof(19, axiom,![X41]:![X42]:(root_occ(X41,X42)<=>?[X43]:((occurrence_of(X42,X43)&subactivity_occurrence(X41,X42))&root(X41,X43))),file('/tmp/SRASS.s.p', sos_19)).
% fof(24, axiom,![X57]:![X58]:![X59]:(min_precedes(X57,X58,X59)=>precedes(X57,X58)),file('/tmp/SRASS.s.p', sos_24)).
% fof(25, axiom,![X60]:![X61]:![X62]:(next_subocc(X60,X61,X62)<=>(min_precedes(X60,X61,X62)&~(?[X63]:(min_precedes(X60,X63,X62)&min_precedes(X63,X61,X62))))),file('/tmp/SRASS.s.p', sos_26)).
% fof(26, axiom,![X64]:![X65]:![X66]:![X67]:(((min_precedes(X64,X65,X67)&min_precedes(X64,X66,X67))&precedes(X65,X66))=>min_precedes(X65,X66,X67)),file('/tmp/SRASS.s.p', sos_31)).
% fof(33, axiom,![X77]:![X78]:![X79]:((earlier(X77,X78)&earlier(X78,X79))=>earlier(X77,X79)),file('/tmp/SRASS.s.p', sos_30)).
% fof(41, axiom,![X95]:![X96]:(occurrence_of(X95,X96)=>(arboreal(X95)<=>atomic(X96))),file('/tmp/SRASS.s.p', sos_16)).
% fof(43, axiom,![X100]:![X101]:(occurrence_of(X101,X100)=>(activity(X100)&activity_occurrence(X101))),file('/tmp/SRASS.s.p', sos_03)).
% fof(44, axiom,![X102]:(activity_occurrence(X102)=>?[X103]:(activity(X103)&occurrence_of(X102,X103))),file('/tmp/SRASS.s.p', sos_12)).
% fof(45, axiom,![X104]:![X105]:(precedes(X104,X105)<=>(earlier(X104,X105)&legal(X105))),file('/tmp/SRASS.s.p', sos_21)).
% 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/SRASS.s.p', 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(50, plain,![X37]:![X38]:![X39]:![X40]:(((((occurrence_of(X38,X37)&subactivity_occurrence(X39,X38))&leaf_occ(X40,X38))&arboreal(X39))&~(min_precedes(X39,X40,X37)))=>X40=X39),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% fof(63, plain,![X9]:(~(occurrence_of(X9,tptp0))|?[X10]:?[X11]:?[X12]:((((((occurrence_of(X10,tptp3)&root_occ(X10,X9))&occurrence_of(X11,tptp4))&next_subocc(X10,X11,tptp0))&(occurrence_of(X12,tptp2)|occurrence_of(X12,tptp1)))&next_subocc(X11,X12,tptp0))&leaf_occ(X12,X9))),inference(fof_nnf,[status(thm)],[3])).
% fof(64, plain,![X13]:(~(occurrence_of(X13,tptp0))|?[X14]:?[X15]:?[X16]:((((((occurrence_of(X14,tptp3)&root_occ(X14,X13))&occurrence_of(X15,tptp4))&next_subocc(X14,X15,tptp0))&(occurrence_of(X16,tptp2)|occurrence_of(X16,tptp1)))&next_subocc(X15,X16,tptp0))&leaf_occ(X16,X13))),inference(variable_rename,[status(thm)],[63])).
% fof(65, plain,![X13]:(~(occurrence_of(X13,tptp0))|((((((occurrence_of(esk1_1(X13),tptp3)&root_occ(esk1_1(X13),X13))&occurrence_of(esk2_1(X13),tptp4))&next_subocc(esk1_1(X13),esk2_1(X13),tptp0))&(occurrence_of(esk3_1(X13),tptp2)|occurrence_of(esk3_1(X13),tptp1)))&next_subocc(esk2_1(X13),esk3_1(X13),tptp0))&leaf_occ(esk3_1(X13),X13))),inference(skolemize,[status(esa)],[64])).
% fof(66, plain,![X13]:(((((((occurrence_of(esk1_1(X13),tptp3)|~(occurrence_of(X13,tptp0)))&(root_occ(esk1_1(X13),X13)|~(occurrence_of(X13,tptp0))))&(occurrence_of(esk2_1(X13),tptp4)|~(occurrence_of(X13,tptp0))))&(next_subocc(esk1_1(X13),esk2_1(X13),tptp0)|~(occurrence_of(X13,tptp0))))&((occurrence_of(esk3_1(X13),tptp2)|occurrence_of(esk3_1(X13),tptp1))|~(occurrence_of(X13,tptp0))))&(next_subocc(esk2_1(X13),esk3_1(X13),tptp0)|~(occurrence_of(X13,tptp0))))&(leaf_occ(esk3_1(X13),X13)|~(occurrence_of(X13,tptp0)))),inference(distribute,[status(thm)],[65])).
% cnf(67,plain,(leaf_occ(esk3_1(X1),X1)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,plain,(next_subocc(esk2_1(X1),esk3_1(X1),tptp0)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(69,plain,(occurrence_of(esk3_1(X1),tptp1)|occurrence_of(esk3_1(X1),tptp2)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(70,plain,(next_subocc(esk1_1(X1),esk2_1(X1),tptp0)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(72,plain,(root_occ(esk1_1(X1),X1)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(73,plain,(occurrence_of(esk1_1(X1),tptp3)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(96,plain,(atomic(tptp3)),inference(split_conjunct,[status(thm)],[14])).
% fof(97, plain,![X30]:![X31]:![X32]:((~(occurrence_of(X30,X31))|~(occurrence_of(X30,X32)))|X31=X32),inference(fof_nnf,[status(thm)],[15])).
% fof(98, plain,![X33]:![X34]:![X35]:((~(occurrence_of(X33,X34))|~(occurrence_of(X33,X35)))|X34=X35),inference(variable_rename,[status(thm)],[97])).
% cnf(99,plain,(X1=X2|~occurrence_of(X3,X2)|~occurrence_of(X3,X1)),inference(split_conjunct,[status(thm)],[98])).
% fof(104, plain,![X37]:![X38]:![X39]:![X40]:(((((~(occurrence_of(X38,X37))|~(subactivity_occurrence(X39,X38)))|~(leaf_occ(X40,X38)))|~(arboreal(X39)))|min_precedes(X39,X40,X37))|X40=X39),inference(fof_nnf,[status(thm)],[50])).
% fof(105, plain,![X41]:![X42]:![X43]:![X44]:(((((~(occurrence_of(X42,X41))|~(subactivity_occurrence(X43,X42)))|~(leaf_occ(X44,X42)))|~(arboreal(X43)))|min_precedes(X43,X44,X41))|X44=X43),inference(variable_rename,[status(thm)],[104])).
% cnf(106,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)],[105])).
% fof(107, plain,![X41]:![X42]:((~(root_occ(X41,X42))|?[X43]:((occurrence_of(X42,X43)&subactivity_occurrence(X41,X42))&root(X41,X43)))&(![X43]:((~(occurrence_of(X42,X43))|~(subactivity_occurrence(X41,X42)))|~(root(X41,X43)))|root_occ(X41,X42))),inference(fof_nnf,[status(thm)],[19])).
% fof(108, plain,![X44]:![X45]:((~(root_occ(X44,X45))|?[X46]:((occurrence_of(X45,X46)&subactivity_occurrence(X44,X45))&root(X44,X46)))&(![X47]:((~(occurrence_of(X45,X47))|~(subactivity_occurrence(X44,X45)))|~(root(X44,X47)))|root_occ(X44,X45))),inference(variable_rename,[status(thm)],[107])).
% fof(109, plain,![X44]:![X45]:((~(root_occ(X44,X45))|((occurrence_of(X45,esk5_2(X44,X45))&subactivity_occurrence(X44,X45))&root(X44,esk5_2(X44,X45))))&(![X47]:((~(occurrence_of(X45,X47))|~(subactivity_occurrence(X44,X45)))|~(root(X44,X47)))|root_occ(X44,X45))),inference(skolemize,[status(esa)],[108])).
% fof(110, plain,![X44]:![X45]:![X47]:((((~(occurrence_of(X45,X47))|~(subactivity_occurrence(X44,X45)))|~(root(X44,X47)))|root_occ(X44,X45))&(~(root_occ(X44,X45))|((occurrence_of(X45,esk5_2(X44,X45))&subactivity_occurrence(X44,X45))&root(X44,esk5_2(X44,X45))))),inference(shift_quantors,[status(thm)],[109])).
% fof(111, plain,![X44]:![X45]:![X47]:((((~(occurrence_of(X45,X47))|~(subactivity_occurrence(X44,X45)))|~(root(X44,X47)))|root_occ(X44,X45))&(((occurrence_of(X45,esk5_2(X44,X45))|~(root_occ(X44,X45)))&(subactivity_occurrence(X44,X45)|~(root_occ(X44,X45))))&(root(X44,esk5_2(X44,X45))|~(root_occ(X44,X45))))),inference(distribute,[status(thm)],[110])).
% cnf(113,plain,(subactivity_occurrence(X1,X2)|~root_occ(X1,X2)),inference(split_conjunct,[status(thm)],[111])).
% fof(140, plain,![X57]:![X58]:![X59]:(~(min_precedes(X57,X58,X59))|precedes(X57,X58)),inference(fof_nnf,[status(thm)],[24])).
% fof(141, plain,![X60]:![X61]:![X62]:(~(min_precedes(X60,X61,X62))|precedes(X60,X61)),inference(variable_rename,[status(thm)],[140])).
% cnf(142,plain,(precedes(X1,X2)|~min_precedes(X1,X2,X3)),inference(split_conjunct,[status(thm)],[141])).
% fof(143, plain,![X60]:![X61]:![X62]:((~(next_subocc(X60,X61,X62))|(min_precedes(X60,X61,X62)&![X63]:(~(min_precedes(X60,X63,X62))|~(min_precedes(X63,X61,X62)))))&((~(min_precedes(X60,X61,X62))|?[X63]:(min_precedes(X60,X63,X62)&min_precedes(X63,X61,X62)))|next_subocc(X60,X61,X62))),inference(fof_nnf,[status(thm)],[25])).
% fof(144, plain,![X64]:![X65]:![X66]:((~(next_subocc(X64,X65,X66))|(min_precedes(X64,X65,X66)&![X67]:(~(min_precedes(X64,X67,X66))|~(min_precedes(X67,X65,X66)))))&((~(min_precedes(X64,X65,X66))|?[X68]:(min_precedes(X64,X68,X66)&min_precedes(X68,X65,X66)))|next_subocc(X64,X65,X66))),inference(variable_rename,[status(thm)],[143])).
% fof(145, plain,![X64]:![X65]:![X66]:((~(next_subocc(X64,X65,X66))|(min_precedes(X64,X65,X66)&![X67]:(~(min_precedes(X64,X67,X66))|~(min_precedes(X67,X65,X66)))))&((~(min_precedes(X64,X65,X66))|(min_precedes(X64,esk9_3(X64,X65,X66),X66)&min_precedes(esk9_3(X64,X65,X66),X65,X66)))|next_subocc(X64,X65,X66))),inference(skolemize,[status(esa)],[144])).
% fof(146, plain,![X64]:![X65]:![X66]:![X67]:((((~(min_precedes(X64,X67,X66))|~(min_precedes(X67,X65,X66)))&min_precedes(X64,X65,X66))|~(next_subocc(X64,X65,X66)))&((~(min_precedes(X64,X65,X66))|(min_precedes(X64,esk9_3(X64,X65,X66),X66)&min_precedes(esk9_3(X64,X65,X66),X65,X66)))|next_subocc(X64,X65,X66))),inference(shift_quantors,[status(thm)],[145])).
% fof(147, plain,![X64]:![X65]:![X66]:![X67]:((((~(min_precedes(X64,X67,X66))|~(min_precedes(X67,X65,X66)))|~(next_subocc(X64,X65,X66)))&(min_precedes(X64,X65,X66)|~(next_subocc(X64,X65,X66))))&(((min_precedes(X64,esk9_3(X64,X65,X66),X66)|~(min_precedes(X64,X65,X66)))|next_subocc(X64,X65,X66))&((min_precedes(esk9_3(X64,X65,X66),X65,X66)|~(min_precedes(X64,X65,X66)))|next_subocc(X64,X65,X66)))),inference(distribute,[status(thm)],[146])).
% cnf(150,plain,(min_precedes(X1,X2,X3)|~next_subocc(X1,X2,X3)),inference(split_conjunct,[status(thm)],[147])).
% cnf(151,plain,(~next_subocc(X1,X2,X3)|~min_precedes(X4,X2,X3)|~min_precedes(X1,X4,X3)),inference(split_conjunct,[status(thm)],[147])).
% fof(152, plain,![X64]:![X65]:![X66]:![X67]:(((~(min_precedes(X64,X65,X67))|~(min_precedes(X64,X66,X67)))|~(precedes(X65,X66)))|min_precedes(X65,X66,X67)),inference(fof_nnf,[status(thm)],[26])).
% fof(153, plain,![X68]:![X69]:![X70]:![X71]:(((~(min_precedes(X68,X69,X71))|~(min_precedes(X68,X70,X71)))|~(precedes(X69,X70)))|min_precedes(X69,X70,X71)),inference(variable_rename,[status(thm)],[152])).
% cnf(154,plain,(min_precedes(X1,X2,X3)|~precedes(X1,X2)|~min_precedes(X4,X2,X3)|~min_precedes(X4,X1,X3)),inference(split_conjunct,[status(thm)],[153])).
% fof(170, plain,![X77]:![X78]:![X79]:((~(earlier(X77,X78))|~(earlier(X78,X79)))|earlier(X77,X79)),inference(fof_nnf,[status(thm)],[33])).
% fof(171, plain,![X80]:![X81]:![X82]:((~(earlier(X80,X81))|~(earlier(X81,X82)))|earlier(X80,X82)),inference(variable_rename,[status(thm)],[170])).
% cnf(172,plain,(earlier(X1,X2)|~earlier(X3,X2)|~earlier(X1,X3)),inference(split_conjunct,[status(thm)],[171])).
% fof(205, plain,![X95]:![X96]:(~(occurrence_of(X95,X96))|((~(arboreal(X95))|atomic(X96))&(~(atomic(X96))|arboreal(X95)))),inference(fof_nnf,[status(thm)],[41])).
% fof(206, plain,![X97]:![X98]:(~(occurrence_of(X97,X98))|((~(arboreal(X97))|atomic(X98))&(~(atomic(X98))|arboreal(X97)))),inference(variable_rename,[status(thm)],[205])).
% fof(207, plain,![X97]:![X98]:(((~(arboreal(X97))|atomic(X98))|~(occurrence_of(X97,X98)))&((~(atomic(X98))|arboreal(X97))|~(occurrence_of(X97,X98)))),inference(distribute,[status(thm)],[206])).
% cnf(208,plain,(arboreal(X1)|~occurrence_of(X1,X2)|~atomic(X2)),inference(split_conjunct,[status(thm)],[207])).
% fof(219, plain,![X100]:![X101]:(~(occurrence_of(X101,X100))|(activity(X100)&activity_occurrence(X101))),inference(fof_nnf,[status(thm)],[43])).
% fof(220, plain,![X102]:![X103]:(~(occurrence_of(X103,X102))|(activity(X102)&activity_occurrence(X103))),inference(variable_rename,[status(thm)],[219])).
% fof(221, plain,![X102]:![X103]:((activity(X102)|~(occurrence_of(X103,X102)))&(activity_occurrence(X103)|~(occurrence_of(X103,X102)))),inference(distribute,[status(thm)],[220])).
% cnf(222,plain,(activity_occurrence(X1)|~occurrence_of(X1,X2)),inference(split_conjunct,[status(thm)],[221])).
% fof(224, plain,![X102]:(~(activity_occurrence(X102))|?[X103]:(activity(X103)&occurrence_of(X102,X103))),inference(fof_nnf,[status(thm)],[44])).
% fof(225, plain,![X104]:(~(activity_occurrence(X104))|?[X105]:(activity(X105)&occurrence_of(X104,X105))),inference(variable_rename,[status(thm)],[224])).
% fof(226, plain,![X104]:(~(activity_occurrence(X104))|(activity(esk15_1(X104))&occurrence_of(X104,esk15_1(X104)))),inference(skolemize,[status(esa)],[225])).
% fof(227, plain,![X104]:((activity(esk15_1(X104))|~(activity_occurrence(X104)))&(occurrence_of(X104,esk15_1(X104))|~(activity_occurrence(X104)))),inference(distribute,[status(thm)],[226])).
% cnf(228,plain,(occurrence_of(X1,esk15_1(X1))|~activity_occurrence(X1)),inference(split_conjunct,[status(thm)],[227])).
% fof(230, plain,![X104]:![X105]:((~(precedes(X104,X105))|(earlier(X104,X105)&legal(X105)))&((~(earlier(X104,X105))|~(legal(X105)))|precedes(X104,X105))),inference(fof_nnf,[status(thm)],[45])).
% fof(231, plain,![X106]:![X107]:((~(precedes(X106,X107))|(earlier(X106,X107)&legal(X107)))&((~(earlier(X106,X107))|~(legal(X107)))|precedes(X106,X107))),inference(variable_rename,[status(thm)],[230])).
% fof(232, plain,![X106]:![X107]:(((earlier(X106,X107)|~(precedes(X106,X107)))&(legal(X107)|~(precedes(X106,X107))))&((~(earlier(X106,X107))|~(legal(X107)))|precedes(X106,X107))),inference(distribute,[status(thm)],[231])).
% cnf(233,plain,(precedes(X1,X2)|~legal(X2)|~earlier(X1,X2)),inference(split_conjunct,[status(thm)],[232])).
% cnf(234,plain,(legal(X2)|~precedes(X1,X2)),inference(split_conjunct,[status(thm)],[232])).
% cnf(235,plain,(earlier(X1,X2)|~precedes(X1,X2)),inference(split_conjunct,[status(thm)],[232])).
% 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(247,negated_conjecture,(occurrence_of(esk1_1(esk16_0),tptp3)),inference(spm,[status(thm)],[73,241,theory(equality)])).
% cnf(249,negated_conjecture,(leaf_occ(esk3_1(esk16_0),esk16_0)),inference(spm,[status(thm)],[67,241,theory(equality)])).
% cnf(250,negated_conjecture,(root_occ(esk1_1(esk16_0),esk16_0)),inference(spm,[status(thm)],[72,241,theory(equality)])).
% cnf(251,negated_conjecture,(activity_occurrence(esk16_0)),inference(spm,[status(thm)],[222,241,theory(equality)])).
% cnf(258,negated_conjecture,(X1=tptp0|~occurrence_of(esk16_0,X1)),inference(spm,[status(thm)],[99,241,theory(equality)])).
% cnf(260,negated_conjecture,(next_subocc(esk1_1(esk16_0),esk2_1(esk16_0),tptp0)),inference(spm,[status(thm)],[70,241,theory(equality)])).
% cnf(261,negated_conjecture,(next_subocc(esk2_1(esk16_0),esk3_1(esk16_0),tptp0)),inference(spm,[status(thm)],[68,241,theory(equality)])).
% cnf(262,negated_conjecture,(occurrence_of(esk3_1(esk16_0),tptp1)|occurrence_of(esk3_1(esk16_0),tptp2)),inference(spm,[status(thm)],[69,241,theory(equality)])).
% cnf(270,negated_conjecture,(arboreal(esk1_1(esk16_0))|~atomic(tptp3)),inference(spm,[status(thm)],[208,247,theory(equality)])).
% cnf(276,negated_conjecture,(arboreal(esk1_1(esk16_0))|$false),inference(rw,[status(thm)],[270,96,theory(equality)])).
% cnf(277,negated_conjecture,(arboreal(esk1_1(esk16_0))),inference(cn,[status(thm)],[276,theory(equality)])).
% cnf(282,negated_conjecture,(esk15_1(esk16_0)=tptp0|~activity_occurrence(esk16_0)),inference(spm,[status(thm)],[258,228,theory(equality)])).
% cnf(283,negated_conjecture,(esk15_1(esk16_0)=tptp0|$false),inference(rw,[status(thm)],[282,251,theory(equality)])).
% cnf(284,negated_conjecture,(esk15_1(esk16_0)=tptp0),inference(cn,[status(thm)],[283,theory(equality)])).
% cnf(345,negated_conjecture,(subactivity_occurrence(esk1_1(esk16_0),esk16_0)),inference(spm,[status(thm)],[113,250,theory(equality)])).
% cnf(349,negated_conjecture,(~min_precedes(esk1_1(esk16_0),X1,tptp0)|~leaf_occ(X1,esk16_0)|~occurrence_of(esk1_1(esk16_0),tptp3)|~occurrence_of(X1,tptp2)),inference(spm,[status(thm)],[243,250,theory(equality)])).
% cnf(350,negated_conjecture,(~min_precedes(esk1_1(esk16_0),X1,tptp0)|~leaf_occ(X1,esk16_0)|~occurrence_of(esk1_1(esk16_0),tptp3)|~occurrence_of(X1,tptp1)),inference(spm,[status(thm)],[242,250,theory(equality)])).
% cnf(351,negated_conjecture,(~min_precedes(esk1_1(esk16_0),X1,tptp0)|~leaf_occ(X1,esk16_0)|$false|~occurrence_of(X1,tptp2)),inference(rw,[status(thm)],[349,247,theory(equality)])).
% cnf(352,negated_conjecture,(~min_precedes(esk1_1(esk16_0),X1,tptp0)|~leaf_occ(X1,esk16_0)|~occurrence_of(X1,tptp2)),inference(cn,[status(thm)],[351,theory(equality)])).
% cnf(353,negated_conjecture,(~min_precedes(esk1_1(esk16_0),X1,tptp0)|~leaf_occ(X1,esk16_0)|$false|~occurrence_of(X1,tptp1)),inference(rw,[status(thm)],[350,247,theory(equality)])).
% cnf(354,negated_conjecture,(~min_precedes(esk1_1(esk16_0),X1,tptp0)|~leaf_occ(X1,esk16_0)|~occurrence_of(X1,tptp1)),inference(cn,[status(thm)],[353,theory(equality)])).
% cnf(355,negated_conjecture,(~min_precedes(esk1_1(esk16_0),esk3_1(esk16_0),tptp0)|~occurrence_of(esk3_1(esk16_0),tptp2)),inference(spm,[status(thm)],[352,249,theory(equality)])).
% cnf(356,negated_conjecture,(~min_precedes(esk1_1(esk16_0),esk3_1(esk16_0),tptp0)|~occurrence_of(esk3_1(esk16_0),tptp1)),inference(spm,[status(thm)],[354,249,theory(equality)])).
% cnf(385,negated_conjecture,(X1=esk1_1(esk16_0)|min_precedes(esk1_1(esk16_0),X1,X2)|~arboreal(esk1_1(esk16_0))|~leaf_occ(X1,esk16_0)|~occurrence_of(esk16_0,X2)),inference(spm,[status(thm)],[106,345,theory(equality)])).
% cnf(389,negated_conjecture,(X1=esk1_1(esk16_0)|min_precedes(esk1_1(esk16_0),X1,X2)|$false|~leaf_occ(X1,esk16_0)|~occurrence_of(esk16_0,X2)),inference(rw,[status(thm)],[385,277,theory(equality)])).
% cnf(390,negated_conjecture,(X1=esk1_1(esk16_0)|min_precedes(esk1_1(esk16_0),X1,X2)|~leaf_occ(X1,esk16_0)|~occurrence_of(esk16_0,X2)),inference(cn,[status(thm)],[389,theory(equality)])).
% cnf(394,negated_conjecture,(esk3_1(esk16_0)=esk1_1(esk16_0)|min_precedes(esk1_1(esk16_0),esk3_1(esk16_0),X1)|~occurrence_of(esk16_0,X1)),inference(spm,[status(thm)],[390,249,theory(equality)])).
% cnf(418,negated_conjecture,(min_precedes(esk1_1(esk16_0),esk2_1(esk16_0),tptp0)),inference(spm,[status(thm)],[150,260,theory(equality)])).
% cnf(424,negated_conjecture,(min_precedes(esk2_1(esk16_0),esk3_1(esk16_0),tptp0)),inference(spm,[status(thm)],[150,261,theory(equality)])).
% cnf(425,negated_conjecture,(~min_precedes(X1,esk3_1(esk16_0),tptp0)|~min_precedes(esk2_1(esk16_0),X1,tptp0)),inference(spm,[status(thm)],[151,261,theory(equality)])).
% cnf(436,negated_conjecture,(occurrence_of(esk3_1(esk16_0),tptp2)|~min_precedes(esk1_1(esk16_0),esk3_1(esk16_0),tptp0)),inference(spm,[status(thm)],[356,262,theory(equality)])).
% cnf(508,negated_conjecture,(~min_precedes(esk1_1(esk16_0),esk3_1(esk16_0),tptp0)),inference(csr,[status(thm)],[436,355])).
% cnf(575,negated_conjecture,(precedes(esk1_1(esk16_0),esk2_1(esk16_0))),inference(spm,[status(thm)],[142,418,theory(equality)])).
% cnf(603,negated_conjecture,(earlier(esk1_1(esk16_0),esk2_1(esk16_0))),inference(spm,[status(thm)],[235,575,theory(equality)])).
% cnf(614,negated_conjecture,(precedes(esk2_1(esk16_0),esk3_1(esk16_0))),inference(spm,[status(thm)],[142,424,theory(equality)])).
% cnf(626,negated_conjecture,(min_precedes(X1,esk3_1(esk16_0),tptp0)|~precedes(X1,esk3_1(esk16_0))|~min_precedes(esk2_1(esk16_0),X1,tptp0)),inference(spm,[status(thm)],[154,424,theory(equality)])).
% cnf(677,negated_conjecture,(~precedes(X1,esk3_1(esk16_0))|~min_precedes(esk2_1(esk16_0),X1,tptp0)),inference(csr,[status(thm)],[626,425])).
% cnf(689,negated_conjecture,(earlier(esk2_1(esk16_0),esk3_1(esk16_0))),inference(spm,[status(thm)],[235,614,theory(equality)])).
% cnf(690,negated_conjecture,(legal(esk3_1(esk16_0))),inference(spm,[status(thm)],[234,614,theory(equality)])).
% cnf(696,negated_conjecture,(earlier(X1,esk3_1(esk16_0))|~earlier(X1,esk2_1(esk16_0))),inference(spm,[status(thm)],[172,689,theory(equality)])).
% cnf(700,negated_conjecture,(earlier(esk1_1(esk16_0),esk3_1(esk16_0))),inference(spm,[status(thm)],[696,603,theory(equality)])).
% cnf(701,negated_conjecture,(precedes(esk1_1(esk16_0),esk3_1(esk16_0))|~legal(esk3_1(esk16_0))),inference(spm,[status(thm)],[233,700,theory(equality)])).
% cnf(704,negated_conjecture,(precedes(esk1_1(esk16_0),esk3_1(esk16_0))|$false),inference(rw,[status(thm)],[701,690,theory(equality)])).
% cnf(705,negated_conjecture,(precedes(esk1_1(esk16_0),esk3_1(esk16_0))),inference(cn,[status(thm)],[704,theory(equality)])).
% cnf(708,negated_conjecture,(~min_precedes(esk2_1(esk16_0),esk1_1(esk16_0),tptp0)),inference(spm,[status(thm)],[677,705,theory(equality)])).
% cnf(781,negated_conjecture,(esk1_1(esk16_0)=esk3_1(esk16_0)|min_precedes(esk1_1(esk16_0),esk3_1(esk16_0),esk15_1(esk16_0))|~activity_occurrence(esk16_0)),inference(spm,[status(thm)],[394,228,theory(equality)])).
% cnf(783,negated_conjecture,(esk1_1(esk16_0)=esk3_1(esk16_0)|min_precedes(esk1_1(esk16_0),esk3_1(esk16_0),tptp0)|~activity_occurrence(esk16_0)),inference(rw,[status(thm)],[781,284,theory(equality)])).
% cnf(784,negated_conjecture,(esk1_1(esk16_0)=esk3_1(esk16_0)|min_precedes(esk1_1(esk16_0),esk3_1(esk16_0),tptp0)|$false),inference(rw,[status(thm)],[783,251,theory(equality)])).
% cnf(785,negated_conjecture,(esk1_1(esk16_0)=esk3_1(esk16_0)|min_precedes(esk1_1(esk16_0),esk3_1(esk16_0),tptp0)),inference(cn,[status(thm)],[784,theory(equality)])).
% cnf(786,negated_conjecture,(esk1_1(esk16_0)=esk3_1(esk16_0)),inference(sr,[status(thm)],[785,508,theory(equality)])).
% cnf(788,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[708,786,theory(equality)]),424,theory(equality)])).
% cnf(789,negated_conjecture,($false),inference(cn,[status(thm)],[788,theory(equality)])).
% cnf(790,negated_conjecture,($false),789,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 227
% # ...of these trivial : 2
% # ...subsumed : 24
% # ...remaining for further processing: 201
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 57
% # Generated clauses : 284
% # ...of the previous two non-trivial : 216
% # Contextual simplify-reflections : 4
% # Paramodulations : 284
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 144
% # Positive orientable unit clauses: 30
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 19
% # Non-unit-clauses : 95
% # Current number of unprocessed clauses: 35
% # ...number of literals in the above : 87
% # Clause-clause subsumption calls (NU) : 279
% # Rec. Clause-clause subsumption calls : 205
% # Unit Clause-clause subsumption calls : 81
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 147 leaves, 1.37+/-1.289 terms/leaf
% # Paramod-from index: 39 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 86 leaves, 1.27+/-0.908 terms/leaf
% # -------------------------------------------------
% # User time : 0.035 s
% # System time : 0.003 s
% # Total time : 0.038 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP13293/PRO009+4.tptp
%
%------------------------------------------------------------------------------