TSTP Solution File: PRO014+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PRO014+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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:13:28 EST 2010
% Result : Theorem 3.08s
% Output : Solution 3.08s
% 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/SystemOnTPTP20142/PRO014+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20142/PRO014+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20142/PRO014+2.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 20238
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.92 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:((min_precedes(X1,X2,X4)&min_precedes(X2,X3,X4))=>min_precedes(X1,X3,X4)),file('/tmp/SRASS.s.p', sos)).
% fof(2, axiom,![X5]:![X6]:![X7]:(next_subocc(X5,X6,X7)<=>(min_precedes(X5,X6,X7)&~(?[X8]:(min_precedes(X5,X8,X7)&min_precedes(X8,X6,X7))))),file('/tmp/SRASS.s.p', sos_04)).
% fof(7, axiom,![X23]:![X24]:((((occurrence_of(X24,tptp0)&subactivity_occurrence(X23,X24))&arboreal(X23))&~(leaf_occ(X23,X24)))=>?[X25]:?[X26]:?[X27]:((((((occurrence_of(X25,tptp3)&next_subocc(X23,X25,tptp0))&occurrence_of(X26,tptp4))&next_subocc(X25,X26,tptp0))&(occurrence_of(X27,tptp2)|occurrence_of(X27,tptp1)))&next_subocc(X26,X27,tptp0))&leaf(X27,tptp0))),file('/tmp/SRASS.s.p', sos_32)).
% fof(46, conjecture,![X101]:![X102]:((((occurrence_of(X102,tptp0)&subactivity_occurrence(X101,X102))&arboreal(X101))&~(leaf_occ(X101,X102)))=>?[X103]:?[X104]:((((occurrence_of(X103,tptp3)&next_subocc(X101,X103,tptp0))&(occurrence_of(X104,tptp2)|occurrence_of(X104,tptp1)))&min_precedes(X103,X104,tptp0))&leaf(X104,tptp0))),file('/tmp/SRASS.s.p', goals)).
% fof(47, negated_conjecture,~(![X101]:![X102]:((((occurrence_of(X102,tptp0)&subactivity_occurrence(X101,X102))&arboreal(X101))&~(leaf_occ(X101,X102)))=>?[X103]:?[X104]:((((occurrence_of(X103,tptp3)&next_subocc(X101,X103,tptp0))&(occurrence_of(X104,tptp2)|occurrence_of(X104,tptp1)))&min_precedes(X103,X104,tptp0))&leaf(X104,tptp0)))),inference(assume_negation,[status(cth)],[46])).
% fof(48, plain,![X23]:![X24]:((((occurrence_of(X24,tptp0)&subactivity_occurrence(X23,X24))&arboreal(X23))&~(leaf_occ(X23,X24)))=>?[X25]:?[X26]:?[X27]:((((((occurrence_of(X25,tptp3)&next_subocc(X23,X25,tptp0))&occurrence_of(X26,tptp4))&next_subocc(X25,X26,tptp0))&(occurrence_of(X27,tptp2)|occurrence_of(X27,tptp1)))&next_subocc(X26,X27,tptp0))&leaf(X27,tptp0))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(56, negated_conjecture,~(![X101]:![X102]:((((occurrence_of(X102,tptp0)&subactivity_occurrence(X101,X102))&arboreal(X101))&~(leaf_occ(X101,X102)))=>?[X103]:?[X104]:((((occurrence_of(X103,tptp3)&next_subocc(X101,X103,tptp0))&(occurrence_of(X104,tptp2)|occurrence_of(X104,tptp1)))&min_precedes(X103,X104,tptp0))&leaf(X104,tptp0)))),inference(fof_simplification,[status(thm)],[47,theory(equality)])).
% fof(57, plain,![X1]:![X2]:![X3]:![X4]:((~(min_precedes(X1,X2,X4))|~(min_precedes(X2,X3,X4)))|min_precedes(X1,X3,X4)),inference(fof_nnf,[status(thm)],[1])).
% fof(58, plain,![X5]:![X6]:![X7]:![X8]:((~(min_precedes(X5,X6,X8))|~(min_precedes(X6,X7,X8)))|min_precedes(X5,X7,X8)),inference(variable_rename,[status(thm)],[57])).
% cnf(59,plain,(min_precedes(X1,X2,X3)|~min_precedes(X4,X2,X3)|~min_precedes(X1,X4,X3)),inference(split_conjunct,[status(thm)],[58])).
% fof(60, plain,![X5]:![X6]:![X7]:((~(next_subocc(X5,X6,X7))|(min_precedes(X5,X6,X7)&![X8]:(~(min_precedes(X5,X8,X7))|~(min_precedes(X8,X6,X7)))))&((~(min_precedes(X5,X6,X7))|?[X8]:(min_precedes(X5,X8,X7)&min_precedes(X8,X6,X7)))|next_subocc(X5,X6,X7))),inference(fof_nnf,[status(thm)],[2])).
% fof(61, plain,![X9]:![X10]:![X11]:((~(next_subocc(X9,X10,X11))|(min_precedes(X9,X10,X11)&![X12]:(~(min_precedes(X9,X12,X11))|~(min_precedes(X12,X10,X11)))))&((~(min_precedes(X9,X10,X11))|?[X13]:(min_precedes(X9,X13,X11)&min_precedes(X13,X10,X11)))|next_subocc(X9,X10,X11))),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,![X9]:![X10]:![X11]:((~(next_subocc(X9,X10,X11))|(min_precedes(X9,X10,X11)&![X12]:(~(min_precedes(X9,X12,X11))|~(min_precedes(X12,X10,X11)))))&((~(min_precedes(X9,X10,X11))|(min_precedes(X9,esk1_3(X9,X10,X11),X11)&min_precedes(esk1_3(X9,X10,X11),X10,X11)))|next_subocc(X9,X10,X11))),inference(skolemize,[status(esa)],[61])).
% fof(63, plain,![X9]:![X10]:![X11]:![X12]:((((~(min_precedes(X9,X12,X11))|~(min_precedes(X12,X10,X11)))&min_precedes(X9,X10,X11))|~(next_subocc(X9,X10,X11)))&((~(min_precedes(X9,X10,X11))|(min_precedes(X9,esk1_3(X9,X10,X11),X11)&min_precedes(esk1_3(X9,X10,X11),X10,X11)))|next_subocc(X9,X10,X11))),inference(shift_quantors,[status(thm)],[62])).
% fof(64, plain,![X9]:![X10]:![X11]:![X12]:((((~(min_precedes(X9,X12,X11))|~(min_precedes(X12,X10,X11)))|~(next_subocc(X9,X10,X11)))&(min_precedes(X9,X10,X11)|~(next_subocc(X9,X10,X11))))&(((min_precedes(X9,esk1_3(X9,X10,X11),X11)|~(min_precedes(X9,X10,X11)))|next_subocc(X9,X10,X11))&((min_precedes(esk1_3(X9,X10,X11),X10,X11)|~(min_precedes(X9,X10,X11)))|next_subocc(X9,X10,X11)))),inference(distribute,[status(thm)],[63])).
% cnf(67,plain,(min_precedes(X1,X2,X3)|~next_subocc(X1,X2,X3)),inference(split_conjunct,[status(thm)],[64])).
% fof(94, plain,![X23]:![X24]:((((~(occurrence_of(X24,tptp0))|~(subactivity_occurrence(X23,X24)))|~(arboreal(X23)))|leaf_occ(X23,X24))|?[X25]:?[X26]:?[X27]:((((((occurrence_of(X25,tptp3)&next_subocc(X23,X25,tptp0))&occurrence_of(X26,tptp4))&next_subocc(X25,X26,tptp0))&(occurrence_of(X27,tptp2)|occurrence_of(X27,tptp1)))&next_subocc(X26,X27,tptp0))&leaf(X27,tptp0))),inference(fof_nnf,[status(thm)],[48])).
% fof(95, plain,![X28]:![X29]:((((~(occurrence_of(X29,tptp0))|~(subactivity_occurrence(X28,X29)))|~(arboreal(X28)))|leaf_occ(X28,X29))|?[X30]:?[X31]:?[X32]:((((((occurrence_of(X30,tptp3)&next_subocc(X28,X30,tptp0))&occurrence_of(X31,tptp4))&next_subocc(X30,X31,tptp0))&(occurrence_of(X32,tptp2)|occurrence_of(X32,tptp1)))&next_subocc(X31,X32,tptp0))&leaf(X32,tptp0))),inference(variable_rename,[status(thm)],[94])).
% fof(96, plain,![X28]:![X29]:((((~(occurrence_of(X29,tptp0))|~(subactivity_occurrence(X28,X29)))|~(arboreal(X28)))|leaf_occ(X28,X29))|((((((occurrence_of(esk4_2(X28,X29),tptp3)&next_subocc(X28,esk4_2(X28,X29),tptp0))&occurrence_of(esk5_2(X28,X29),tptp4))&next_subocc(esk4_2(X28,X29),esk5_2(X28,X29),tptp0))&(occurrence_of(esk6_2(X28,X29),tptp2)|occurrence_of(esk6_2(X28,X29),tptp1)))&next_subocc(esk5_2(X28,X29),esk6_2(X28,X29),tptp0))&leaf(esk6_2(X28,X29),tptp0))),inference(skolemize,[status(esa)],[95])).
% fof(97, plain,![X28]:![X29]:(((((((occurrence_of(esk4_2(X28,X29),tptp3)|(((~(occurrence_of(X29,tptp0))|~(subactivity_occurrence(X28,X29)))|~(arboreal(X28)))|leaf_occ(X28,X29)))&(next_subocc(X28,esk4_2(X28,X29),tptp0)|(((~(occurrence_of(X29,tptp0))|~(subactivity_occurrence(X28,X29)))|~(arboreal(X28)))|leaf_occ(X28,X29))))&(occurrence_of(esk5_2(X28,X29),tptp4)|(((~(occurrence_of(X29,tptp0))|~(subactivity_occurrence(X28,X29)))|~(arboreal(X28)))|leaf_occ(X28,X29))))&(next_subocc(esk4_2(X28,X29),esk5_2(X28,X29),tptp0)|(((~(occurrence_of(X29,tptp0))|~(subactivity_occurrence(X28,X29)))|~(arboreal(X28)))|leaf_occ(X28,X29))))&((occurrence_of(esk6_2(X28,X29),tptp2)|occurrence_of(esk6_2(X28,X29),tptp1))|(((~(occurrence_of(X29,tptp0))|~(subactivity_occurrence(X28,X29)))|~(arboreal(X28)))|leaf_occ(X28,X29))))&(next_subocc(esk5_2(X28,X29),esk6_2(X28,X29),tptp0)|(((~(occurrence_of(X29,tptp0))|~(subactivity_occurrence(X28,X29)))|~(arboreal(X28)))|leaf_occ(X28,X29))))&(leaf(esk6_2(X28,X29),tptp0)|(((~(occurrence_of(X29,tptp0))|~(subactivity_occurrence(X28,X29)))|~(arboreal(X28)))|leaf_occ(X28,X29)))),inference(distribute,[status(thm)],[96])).
% cnf(98,plain,(leaf_occ(X1,X2)|leaf(esk6_2(X1,X2),tptp0)|~arboreal(X1)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)),inference(split_conjunct,[status(thm)],[97])).
% cnf(99,plain,(leaf_occ(X1,X2)|next_subocc(esk5_2(X1,X2),esk6_2(X1,X2),tptp0)|~arboreal(X1)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)),inference(split_conjunct,[status(thm)],[97])).
% cnf(100,plain,(leaf_occ(X1,X2)|occurrence_of(esk6_2(X1,X2),tptp1)|occurrence_of(esk6_2(X1,X2),tptp2)|~arboreal(X1)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)),inference(split_conjunct,[status(thm)],[97])).
% cnf(101,plain,(leaf_occ(X1,X2)|next_subocc(esk4_2(X1,X2),esk5_2(X1,X2),tptp0)|~arboreal(X1)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)),inference(split_conjunct,[status(thm)],[97])).
% cnf(103,plain,(leaf_occ(X1,X2)|next_subocc(X1,esk4_2(X1,X2),tptp0)|~arboreal(X1)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)),inference(split_conjunct,[status(thm)],[97])).
% cnf(104,plain,(leaf_occ(X1,X2)|occurrence_of(esk4_2(X1,X2),tptp3)|~arboreal(X1)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)),inference(split_conjunct,[status(thm)],[97])).
% fof(243, negated_conjecture,?[X101]:?[X102]:((((occurrence_of(X102,tptp0)&subactivity_occurrence(X101,X102))&arboreal(X101))&~(leaf_occ(X101,X102)))&![X103]:![X104]:((((~(occurrence_of(X103,tptp3))|~(next_subocc(X101,X103,tptp0)))|(~(occurrence_of(X104,tptp2))&~(occurrence_of(X104,tptp1))))|~(min_precedes(X103,X104,tptp0)))|~(leaf(X104,tptp0)))),inference(fof_nnf,[status(thm)],[56])).
% fof(244, negated_conjecture,?[X105]:?[X106]:((((occurrence_of(X106,tptp0)&subactivity_occurrence(X105,X106))&arboreal(X105))&~(leaf_occ(X105,X106)))&![X107]:![X108]:((((~(occurrence_of(X107,tptp3))|~(next_subocc(X105,X107,tptp0)))|(~(occurrence_of(X108,tptp2))&~(occurrence_of(X108,tptp1))))|~(min_precedes(X107,X108,tptp0)))|~(leaf(X108,tptp0)))),inference(variable_rename,[status(thm)],[243])).
% fof(245, negated_conjecture,((((occurrence_of(esk19_0,tptp0)&subactivity_occurrence(esk18_0,esk19_0))&arboreal(esk18_0))&~(leaf_occ(esk18_0,esk19_0)))&![X107]:![X108]:((((~(occurrence_of(X107,tptp3))|~(next_subocc(esk18_0,X107,tptp0)))|(~(occurrence_of(X108,tptp2))&~(occurrence_of(X108,tptp1))))|~(min_precedes(X107,X108,tptp0)))|~(leaf(X108,tptp0)))),inference(skolemize,[status(esa)],[244])).
% fof(246, negated_conjecture,![X107]:![X108]:(((((~(occurrence_of(X107,tptp3))|~(next_subocc(esk18_0,X107,tptp0)))|(~(occurrence_of(X108,tptp2))&~(occurrence_of(X108,tptp1))))|~(min_precedes(X107,X108,tptp0)))|~(leaf(X108,tptp0)))&(((occurrence_of(esk19_0,tptp0)&subactivity_occurrence(esk18_0,esk19_0))&arboreal(esk18_0))&~(leaf_occ(esk18_0,esk19_0)))),inference(shift_quantors,[status(thm)],[245])).
% fof(247, negated_conjecture,![X107]:![X108]:(((((~(occurrence_of(X108,tptp2))|(~(occurrence_of(X107,tptp3))|~(next_subocc(esk18_0,X107,tptp0))))|~(min_precedes(X107,X108,tptp0)))|~(leaf(X108,tptp0)))&(((~(occurrence_of(X108,tptp1))|(~(occurrence_of(X107,tptp3))|~(next_subocc(esk18_0,X107,tptp0))))|~(min_precedes(X107,X108,tptp0)))|~(leaf(X108,tptp0))))&(((occurrence_of(esk19_0,tptp0)&subactivity_occurrence(esk18_0,esk19_0))&arboreal(esk18_0))&~(leaf_occ(esk18_0,esk19_0)))),inference(distribute,[status(thm)],[246])).
% cnf(248,negated_conjecture,(~leaf_occ(esk18_0,esk19_0)),inference(split_conjunct,[status(thm)],[247])).
% cnf(249,negated_conjecture,(arboreal(esk18_0)),inference(split_conjunct,[status(thm)],[247])).
% cnf(250,negated_conjecture,(subactivity_occurrence(esk18_0,esk19_0)),inference(split_conjunct,[status(thm)],[247])).
% cnf(251,negated_conjecture,(occurrence_of(esk19_0,tptp0)),inference(split_conjunct,[status(thm)],[247])).
% cnf(252,negated_conjecture,(~leaf(X1,tptp0)|~min_precedes(X2,X1,tptp0)|~next_subocc(esk18_0,X2,tptp0)|~occurrence_of(X2,tptp3)|~occurrence_of(X1,tptp1)),inference(split_conjunct,[status(thm)],[247])).
% cnf(253,negated_conjecture,(~leaf(X1,tptp0)|~min_precedes(X2,X1,tptp0)|~next_subocc(esk18_0,X2,tptp0)|~occurrence_of(X2,tptp3)|~occurrence_of(X1,tptp2)),inference(split_conjunct,[status(thm)],[247])).
% cnf(370,negated_conjecture,(leaf_occ(esk18_0,X2)|~leaf(X1,tptp0)|~occurrence_of(esk4_2(esk18_0,X2),tptp3)|~occurrence_of(X1,tptp2)|~min_precedes(esk4_2(esk18_0,X2),X1,tptp0)|~subactivity_occurrence(esk18_0,X2)|~occurrence_of(X2,tptp0)|~arboreal(esk18_0)),inference(spm,[status(thm)],[253,103,theory(equality)])).
% cnf(371,negated_conjecture,(leaf_occ(esk18_0,X2)|~leaf(X1,tptp0)|~occurrence_of(esk4_2(esk18_0,X2),tptp3)|~occurrence_of(X1,tptp1)|~min_precedes(esk4_2(esk18_0,X2),X1,tptp0)|~subactivity_occurrence(esk18_0,X2)|~occurrence_of(X2,tptp0)|~arboreal(esk18_0)),inference(spm,[status(thm)],[252,103,theory(equality)])).
% cnf(376,negated_conjecture,(leaf_occ(esk18_0,X2)|~leaf(X1,tptp0)|~occurrence_of(esk4_2(esk18_0,X2),tptp3)|~occurrence_of(X1,tptp2)|~min_precedes(esk4_2(esk18_0,X2),X1,tptp0)|~subactivity_occurrence(esk18_0,X2)|~occurrence_of(X2,tptp0)|$false),inference(rw,[status(thm)],[370,249,theory(equality)])).
% cnf(377,negated_conjecture,(leaf_occ(esk18_0,X2)|~leaf(X1,tptp0)|~occurrence_of(esk4_2(esk18_0,X2),tptp3)|~occurrence_of(X1,tptp2)|~min_precedes(esk4_2(esk18_0,X2),X1,tptp0)|~subactivity_occurrence(esk18_0,X2)|~occurrence_of(X2,tptp0)),inference(cn,[status(thm)],[376,theory(equality)])).
% cnf(378,negated_conjecture,(leaf_occ(esk18_0,X2)|~leaf(X1,tptp0)|~occurrence_of(esk4_2(esk18_0,X2),tptp3)|~occurrence_of(X1,tptp1)|~min_precedes(esk4_2(esk18_0,X2),X1,tptp0)|~subactivity_occurrence(esk18_0,X2)|~occurrence_of(X2,tptp0)|$false),inference(rw,[status(thm)],[371,249,theory(equality)])).
% cnf(379,negated_conjecture,(leaf_occ(esk18_0,X2)|~leaf(X1,tptp0)|~occurrence_of(esk4_2(esk18_0,X2),tptp3)|~occurrence_of(X1,tptp1)|~min_precedes(esk4_2(esk18_0,X2),X1,tptp0)|~subactivity_occurrence(esk18_0,X2)|~occurrence_of(X2,tptp0)),inference(cn,[status(thm)],[378,theory(equality)])).
% cnf(397,plain,(min_precedes(esk4_2(X1,X2),esk5_2(X1,X2),tptp0)|leaf_occ(X1,X2)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)|~arboreal(X1)),inference(spm,[status(thm)],[67,101,theory(equality)])).
% cnf(401,plain,(min_precedes(esk5_2(X1,X2),esk6_2(X1,X2),tptp0)|leaf_occ(X1,X2)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)|~arboreal(X1)),inference(spm,[status(thm)],[67,99,theory(equality)])).
% cnf(1613,plain,(min_precedes(X1,esk6_2(X2,X3),tptp0)|leaf_occ(X2,X3)|~min_precedes(X1,esk5_2(X2,X3),tptp0)|~subactivity_occurrence(X2,X3)|~occurrence_of(X3,tptp0)|~arboreal(X2)),inference(spm,[status(thm)],[59,401,theory(equality)])).
% cnf(8593,plain,(leaf_occ(X1,X2)|min_precedes(esk4_2(X1,X2),esk6_2(X1,X2),tptp0)|~subactivity_occurrence(X1,X2)|~occurrence_of(X2,tptp0)|~arboreal(X1)),inference(spm,[status(thm)],[1613,397,theory(equality)])).
% cnf(24227,negated_conjecture,(leaf_occ(esk18_0,X1)|~leaf(esk6_2(esk18_0,X1),tptp0)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk4_2(esk18_0,X1),tptp3)|~occurrence_of(esk6_2(esk18_0,X1),tptp2)|~occurrence_of(X1,tptp0)|~arboreal(esk18_0)),inference(spm,[status(thm)],[377,8593,theory(equality)])).
% cnf(24228,negated_conjecture,(leaf_occ(esk18_0,X1)|~leaf(esk6_2(esk18_0,X1),tptp0)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk4_2(esk18_0,X1),tptp3)|~occurrence_of(esk6_2(esk18_0,X1),tptp1)|~occurrence_of(X1,tptp0)|~arboreal(esk18_0)),inference(spm,[status(thm)],[379,8593,theory(equality)])).
% cnf(24234,negated_conjecture,(leaf_occ(esk18_0,X1)|~leaf(esk6_2(esk18_0,X1),tptp0)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk4_2(esk18_0,X1),tptp3)|~occurrence_of(esk6_2(esk18_0,X1),tptp2)|~occurrence_of(X1,tptp0)|$false),inference(rw,[status(thm)],[24227,249,theory(equality)])).
% cnf(24235,negated_conjecture,(leaf_occ(esk18_0,X1)|~leaf(esk6_2(esk18_0,X1),tptp0)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk4_2(esk18_0,X1),tptp3)|~occurrence_of(esk6_2(esk18_0,X1),tptp2)|~occurrence_of(X1,tptp0)),inference(cn,[status(thm)],[24234,theory(equality)])).
% cnf(24236,negated_conjecture,(leaf_occ(esk18_0,X1)|~leaf(esk6_2(esk18_0,X1),tptp0)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk4_2(esk18_0,X1),tptp3)|~occurrence_of(esk6_2(esk18_0,X1),tptp1)|~occurrence_of(X1,tptp0)|$false),inference(rw,[status(thm)],[24228,249,theory(equality)])).
% cnf(24237,negated_conjecture,(leaf_occ(esk18_0,X1)|~leaf(esk6_2(esk18_0,X1),tptp0)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk4_2(esk18_0,X1),tptp3)|~occurrence_of(esk6_2(esk18_0,X1),tptp1)|~occurrence_of(X1,tptp0)),inference(cn,[status(thm)],[24236,theory(equality)])).
% cnf(24255,negated_conjecture,(leaf_occ(esk18_0,X1)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk4_2(esk18_0,X1),tptp3)|~occurrence_of(esk6_2(esk18_0,X1),tptp2)|~occurrence_of(X1,tptp0)|~arboreal(esk18_0)),inference(spm,[status(thm)],[24235,98,theory(equality)])).
% cnf(24256,negated_conjecture,(leaf_occ(esk18_0,X1)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk4_2(esk18_0,X1),tptp3)|~occurrence_of(esk6_2(esk18_0,X1),tptp2)|~occurrence_of(X1,tptp0)|$false),inference(rw,[status(thm)],[24255,249,theory(equality)])).
% cnf(24257,negated_conjecture,(leaf_occ(esk18_0,X1)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk4_2(esk18_0,X1),tptp3)|~occurrence_of(esk6_2(esk18_0,X1),tptp2)|~occurrence_of(X1,tptp0)),inference(cn,[status(thm)],[24256,theory(equality)])).
% cnf(24258,negated_conjecture,(leaf_occ(esk18_0,X1)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk6_2(esk18_0,X1),tptp2)|~occurrence_of(X1,tptp0)|~arboreal(esk18_0)),inference(spm,[status(thm)],[24257,104,theory(equality)])).
% cnf(24259,negated_conjecture,(leaf_occ(esk18_0,X1)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk6_2(esk18_0,X1),tptp2)|~occurrence_of(X1,tptp0)|$false),inference(rw,[status(thm)],[24258,249,theory(equality)])).
% cnf(24260,negated_conjecture,(leaf_occ(esk18_0,X1)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk6_2(esk18_0,X1),tptp2)|~occurrence_of(X1,tptp0)),inference(cn,[status(thm)],[24259,theory(equality)])).
% cnf(28257,negated_conjecture,(leaf_occ(esk18_0,X1)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk4_2(esk18_0,X1),tptp3)|~occurrence_of(esk6_2(esk18_0,X1),tptp1)|~occurrence_of(X1,tptp0)|~arboreal(esk18_0)),inference(spm,[status(thm)],[24237,98,theory(equality)])).
% cnf(28258,negated_conjecture,(leaf_occ(esk18_0,X1)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk4_2(esk18_0,X1),tptp3)|~occurrence_of(esk6_2(esk18_0,X1),tptp1)|~occurrence_of(X1,tptp0)|$false),inference(rw,[status(thm)],[28257,249,theory(equality)])).
% cnf(28259,negated_conjecture,(leaf_occ(esk18_0,X1)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk4_2(esk18_0,X1),tptp3)|~occurrence_of(esk6_2(esk18_0,X1),tptp1)|~occurrence_of(X1,tptp0)),inference(cn,[status(thm)],[28258,theory(equality)])).
% cnf(28260,negated_conjecture,(leaf_occ(esk18_0,X1)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk6_2(esk18_0,X1),tptp1)|~occurrence_of(X1,tptp0)|~arboreal(esk18_0)),inference(spm,[status(thm)],[28259,104,theory(equality)])).
% cnf(28261,negated_conjecture,(leaf_occ(esk18_0,X1)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk6_2(esk18_0,X1),tptp1)|~occurrence_of(X1,tptp0)|$false),inference(rw,[status(thm)],[28260,249,theory(equality)])).
% cnf(28262,negated_conjecture,(leaf_occ(esk18_0,X1)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(esk6_2(esk18_0,X1),tptp1)|~occurrence_of(X1,tptp0)),inference(cn,[status(thm)],[28261,theory(equality)])).
% cnf(28263,negated_conjecture,(leaf_occ(esk18_0,X1)|occurrence_of(esk6_2(esk18_0,X1),tptp2)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(X1,tptp0)|~arboreal(esk18_0)),inference(spm,[status(thm)],[28262,100,theory(equality)])).
% cnf(28264,negated_conjecture,(leaf_occ(esk18_0,X1)|occurrence_of(esk6_2(esk18_0,X1),tptp2)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(X1,tptp0)|$false),inference(rw,[status(thm)],[28263,249,theory(equality)])).
% cnf(28265,negated_conjecture,(leaf_occ(esk18_0,X1)|occurrence_of(esk6_2(esk18_0,X1),tptp2)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(X1,tptp0)),inference(cn,[status(thm)],[28264,theory(equality)])).
% cnf(28268,negated_conjecture,(leaf_occ(esk18_0,X1)|~subactivity_occurrence(esk18_0,X1)|~occurrence_of(X1,tptp0)),inference(csr,[status(thm)],[28265,24260])).
% cnf(28337,negated_conjecture,(~subactivity_occurrence(esk18_0,esk19_0)|~occurrence_of(esk19_0,tptp0)),inference(spm,[status(thm)],[248,28268,theory(equality)])).
% cnf(28356,negated_conjecture,($false|~occurrence_of(esk19_0,tptp0)),inference(rw,[status(thm)],[28337,250,theory(equality)])).
% cnf(28357,negated_conjecture,($false|$false),inference(rw,[status(thm)],[28356,251,theory(equality)])).
% cnf(28358,negated_conjecture,($false),inference(cn,[status(thm)],[28357,theory(equality)])).
% cnf(28359,negated_conjecture,($false),28358,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 7153
% # ...of these trivial : 17
% # ...subsumed : 5300
% # ...remaining for further processing: 1836
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 156
% # Backward-rewritten : 22
% # Generated clauses : 20519
% # ...of the previous two non-trivial : 19481
% # Contextual simplify-reflections : 5590
% # Paramodulations : 20504
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 1653
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 22
% # Non-unit-clauses : 1607
% # Current number of unprocessed clauses: 10898
% # ...number of literals in the above : 71559
% # Clause-clause subsumption calls (NU) : 160069
% # Rec. Clause-clause subsumption calls : 59586
% # Unit Clause-clause subsumption calls : 897
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 988 leaves, 1.92+/-3.328 terms/leaf
% # Paramod-from index: 317 leaves, 1.14+/-0.394 terms/leaf
% # Paramod-into index: 811 leaves, 1.67+/-1.830 terms/leaf
% # -------------------------------------------------
% # User time : 1.699 s
% # System time : 0.041 s
% # Total time : 1.740 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.21 CPU 2.30 WC
% FINAL PrfWatch: 2.21 CPU 2.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP20142/PRO014+2.tptp
%
%------------------------------------------------------------------------------