TSTP Solution File: PRO009+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PRO009+3 : 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:25 EST 2010
% Result : Theorem 1.39s
% Output : Solution 1.39s
% 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/SystemOnTPTP13034/PRO009+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13034/PRO009+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13034/PRO009+3.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 13130
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.023 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X9]:![X10]:![X11]:![X12]:((((occurrence_of(X9,X12)&leaf_occ(X10,X9))&root_occ(X11,X9))&~(X10=X11))=>min_precedes(X11,X10,X12)),file('/tmp/SRASS.s.p', sos_41)).
% fof(4, axiom,![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))),file('/tmp/SRASS.s.p', sos_49)).
% fof(17, axiom,![X39]:![X40]:![X41]:((occurrence_of(X39,X40)&occurrence_of(X39,X41))=>X40=X41),file('/tmp/SRASS.s.p', sos_02)).
% fof(25, axiom,![X63]:![X64]:(leaf_occ(X63,X64)<=>?[X65]:((occurrence_of(X64,X65)&subactivity_occurrence(X63,X64))&leaf(X63,X65))),file('/tmp/SRASS.s.p', sos_34)).
% fof(33, axiom,![X90]:![X91]:![X92]:(next_subocc(X90,X91,X92)<=>(min_precedes(X90,X91,X92)&~(?[X93]:(min_precedes(X90,X93,X92)&min_precedes(X93,X91,X92))))),file('/tmp/SRASS.s.p', sos_22)).
% fof(43, axiom,![X114]:![X115]:(leaf(X114,X115)<=>((root(X114,X115)|?[X116]:min_precedes(X116,X114,X115))&~(?[X117]:min_precedes(X114,X117,X115)))),file('/tmp/SRASS.s.p', sos_21)).
% fof(63, conjecture,![X166]:(occurrence_of(X166,tptp0)=>?[X167]:?[X168]:((((occurrence_of(X167,tptp3)&root_occ(X167,X166))&(occurrence_of(X168,tptp2)|occurrence_of(X168,tptp1)))&min_precedes(X167,X168,tptp0))&leaf_occ(X168,X166))),file('/tmp/SRASS.s.p', goals)).
% fof(64, negated_conjecture,~(![X166]:(occurrence_of(X166,tptp0)=>?[X167]:?[X168]:((((occurrence_of(X167,tptp3)&root_occ(X167,X166))&(occurrence_of(X168,tptp2)|occurrence_of(X168,tptp1)))&min_precedes(X167,X168,tptp0))&leaf_occ(X168,X166)))),inference(assume_negation,[status(cth)],[63])).
% fof(85, plain,![X9]:![X10]:![X11]:![X12]:((((~(occurrence_of(X9,X12))|~(leaf_occ(X10,X9)))|~(root_occ(X11,X9)))|X10=X11)|min_precedes(X11,X10,X12)),inference(fof_nnf,[status(thm)],[3])).
% fof(86, plain,![X13]:![X14]:![X15]:![X16]:((((~(occurrence_of(X13,X16))|~(leaf_occ(X14,X13)))|~(root_occ(X15,X13)))|X14=X15)|min_precedes(X15,X14,X16)),inference(variable_rename,[status(thm)],[85])).
% cnf(87,plain,(min_precedes(X1,X2,X3)|X2=X1|~root_occ(X1,X4)|~leaf_occ(X2,X4)|~occurrence_of(X4,X3)),inference(split_conjunct,[status(thm)],[86])).
% fof(88, 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(fof_nnf,[status(thm)],[4])).
% fof(89, plain,![X17]:(~(occurrence_of(X17,tptp0))|?[X18]:?[X19]:?[X20]:((((((occurrence_of(X18,tptp3)&root_occ(X18,X17))&occurrence_of(X19,tptp4))&next_subocc(X18,X19,tptp0))&(occurrence_of(X20,tptp2)|occurrence_of(X20,tptp1)))&next_subocc(X19,X20,tptp0))&leaf_occ(X20,X17))),inference(variable_rename,[status(thm)],[88])).
% fof(90, plain,![X17]:(~(occurrence_of(X17,tptp0))|((((((occurrence_of(esk1_1(X17),tptp3)&root_occ(esk1_1(X17),X17))&occurrence_of(esk2_1(X17),tptp4))&next_subocc(esk1_1(X17),esk2_1(X17),tptp0))&(occurrence_of(esk3_1(X17),tptp2)|occurrence_of(esk3_1(X17),tptp1)))&next_subocc(esk2_1(X17),esk3_1(X17),tptp0))&leaf_occ(esk3_1(X17),X17))),inference(skolemize,[status(esa)],[89])).
% fof(91, plain,![X17]:(((((((occurrence_of(esk1_1(X17),tptp3)|~(occurrence_of(X17,tptp0)))&(root_occ(esk1_1(X17),X17)|~(occurrence_of(X17,tptp0))))&(occurrence_of(esk2_1(X17),tptp4)|~(occurrence_of(X17,tptp0))))&(next_subocc(esk1_1(X17),esk2_1(X17),tptp0)|~(occurrence_of(X17,tptp0))))&((occurrence_of(esk3_1(X17),tptp2)|occurrence_of(esk3_1(X17),tptp1))|~(occurrence_of(X17,tptp0))))&(next_subocc(esk2_1(X17),esk3_1(X17),tptp0)|~(occurrence_of(X17,tptp0))))&(leaf_occ(esk3_1(X17),X17)|~(occurrence_of(X17,tptp0)))),inference(distribute,[status(thm)],[90])).
% cnf(92,plain,(leaf_occ(esk3_1(X1),X1)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[91])).
% cnf(94,plain,(occurrence_of(esk3_1(X1),tptp1)|occurrence_of(esk3_1(X1),tptp2)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[91])).
% cnf(95,plain,(next_subocc(esk1_1(X1),esk2_1(X1),tptp0)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[91])).
% cnf(97,plain,(root_occ(esk1_1(X1),X1)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[91])).
% cnf(98,plain,(occurrence_of(esk1_1(X1),tptp3)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[91])).
% fof(125, plain,![X39]:![X40]:![X41]:((~(occurrence_of(X39,X40))|~(occurrence_of(X39,X41)))|X40=X41),inference(fof_nnf,[status(thm)],[17])).
% fof(126, plain,![X42]:![X43]:![X44]:((~(occurrence_of(X42,X43))|~(occurrence_of(X42,X44)))|X43=X44),inference(variable_rename,[status(thm)],[125])).
% cnf(127,plain,(X1=X2|~occurrence_of(X3,X2)|~occurrence_of(X3,X1)),inference(split_conjunct,[status(thm)],[126])).
% fof(153, plain,![X63]:![X64]:((~(leaf_occ(X63,X64))|?[X65]:((occurrence_of(X64,X65)&subactivity_occurrence(X63,X64))&leaf(X63,X65)))&(![X65]:((~(occurrence_of(X64,X65))|~(subactivity_occurrence(X63,X64)))|~(leaf(X63,X65)))|leaf_occ(X63,X64))),inference(fof_nnf,[status(thm)],[25])).
% fof(154, plain,![X66]:![X67]:((~(leaf_occ(X66,X67))|?[X68]:((occurrence_of(X67,X68)&subactivity_occurrence(X66,X67))&leaf(X66,X68)))&(![X69]:((~(occurrence_of(X67,X69))|~(subactivity_occurrence(X66,X67)))|~(leaf(X66,X69)))|leaf_occ(X66,X67))),inference(variable_rename,[status(thm)],[153])).
% fof(155, plain,![X66]:![X67]:((~(leaf_occ(X66,X67))|((occurrence_of(X67,esk6_2(X66,X67))&subactivity_occurrence(X66,X67))&leaf(X66,esk6_2(X66,X67))))&(![X69]:((~(occurrence_of(X67,X69))|~(subactivity_occurrence(X66,X67)))|~(leaf(X66,X69)))|leaf_occ(X66,X67))),inference(skolemize,[status(esa)],[154])).
% fof(156, plain,![X66]:![X67]:![X69]:((((~(occurrence_of(X67,X69))|~(subactivity_occurrence(X66,X67)))|~(leaf(X66,X69)))|leaf_occ(X66,X67))&(~(leaf_occ(X66,X67))|((occurrence_of(X67,esk6_2(X66,X67))&subactivity_occurrence(X66,X67))&leaf(X66,esk6_2(X66,X67))))),inference(shift_quantors,[status(thm)],[155])).
% fof(157, plain,![X66]:![X67]:![X69]:((((~(occurrence_of(X67,X69))|~(subactivity_occurrence(X66,X67)))|~(leaf(X66,X69)))|leaf_occ(X66,X67))&(((occurrence_of(X67,esk6_2(X66,X67))|~(leaf_occ(X66,X67)))&(subactivity_occurrence(X66,X67)|~(leaf_occ(X66,X67))))&(leaf(X66,esk6_2(X66,X67))|~(leaf_occ(X66,X67))))),inference(distribute,[status(thm)],[156])).
% cnf(158,plain,(leaf(X1,esk6_2(X1,X2))|~leaf_occ(X1,X2)),inference(split_conjunct,[status(thm)],[157])).
% cnf(160,plain,(occurrence_of(X2,esk6_2(X1,X2))|~leaf_occ(X1,X2)),inference(split_conjunct,[status(thm)],[157])).
% fof(189, plain,![X90]:![X91]:![X92]:((~(next_subocc(X90,X91,X92))|(min_precedes(X90,X91,X92)&![X93]:(~(min_precedes(X90,X93,X92))|~(min_precedes(X93,X91,X92)))))&((~(min_precedes(X90,X91,X92))|?[X93]:(min_precedes(X90,X93,X92)&min_precedes(X93,X91,X92)))|next_subocc(X90,X91,X92))),inference(fof_nnf,[status(thm)],[33])).
% fof(190, plain,![X94]:![X95]:![X96]:((~(next_subocc(X94,X95,X96))|(min_precedes(X94,X95,X96)&![X97]:(~(min_precedes(X94,X97,X96))|~(min_precedes(X97,X95,X96)))))&((~(min_precedes(X94,X95,X96))|?[X98]:(min_precedes(X94,X98,X96)&min_precedes(X98,X95,X96)))|next_subocc(X94,X95,X96))),inference(variable_rename,[status(thm)],[189])).
% fof(191, plain,![X94]:![X95]:![X96]:((~(next_subocc(X94,X95,X96))|(min_precedes(X94,X95,X96)&![X97]:(~(min_precedes(X94,X97,X96))|~(min_precedes(X97,X95,X96)))))&((~(min_precedes(X94,X95,X96))|(min_precedes(X94,esk9_3(X94,X95,X96),X96)&min_precedes(esk9_3(X94,X95,X96),X95,X96)))|next_subocc(X94,X95,X96))),inference(skolemize,[status(esa)],[190])).
% fof(192, plain,![X94]:![X95]:![X96]:![X97]:((((~(min_precedes(X94,X97,X96))|~(min_precedes(X97,X95,X96)))&min_precedes(X94,X95,X96))|~(next_subocc(X94,X95,X96)))&((~(min_precedes(X94,X95,X96))|(min_precedes(X94,esk9_3(X94,X95,X96),X96)&min_precedes(esk9_3(X94,X95,X96),X95,X96)))|next_subocc(X94,X95,X96))),inference(shift_quantors,[status(thm)],[191])).
% fof(193, plain,![X94]:![X95]:![X96]:![X97]:((((~(min_precedes(X94,X97,X96))|~(min_precedes(X97,X95,X96)))|~(next_subocc(X94,X95,X96)))&(min_precedes(X94,X95,X96)|~(next_subocc(X94,X95,X96))))&(((min_precedes(X94,esk9_3(X94,X95,X96),X96)|~(min_precedes(X94,X95,X96)))|next_subocc(X94,X95,X96))&((min_precedes(esk9_3(X94,X95,X96),X95,X96)|~(min_precedes(X94,X95,X96)))|next_subocc(X94,X95,X96)))),inference(distribute,[status(thm)],[192])).
% cnf(196,plain,(min_precedes(X1,X2,X3)|~next_subocc(X1,X2,X3)),inference(split_conjunct,[status(thm)],[193])).
% fof(225, plain,![X114]:![X115]:((~(leaf(X114,X115))|((root(X114,X115)|?[X116]:min_precedes(X116,X114,X115))&![X117]:~(min_precedes(X114,X117,X115))))&(((~(root(X114,X115))&![X116]:~(min_precedes(X116,X114,X115)))|?[X117]:min_precedes(X114,X117,X115))|leaf(X114,X115))),inference(fof_nnf,[status(thm)],[43])).
% fof(226, plain,![X118]:![X119]:((~(leaf(X118,X119))|((root(X118,X119)|?[X120]:min_precedes(X120,X118,X119))&![X121]:~(min_precedes(X118,X121,X119))))&(((~(root(X118,X119))&![X122]:~(min_precedes(X122,X118,X119)))|?[X123]:min_precedes(X118,X123,X119))|leaf(X118,X119))),inference(variable_rename,[status(thm)],[225])).
% fof(227, plain,![X118]:![X119]:((~(leaf(X118,X119))|((root(X118,X119)|min_precedes(esk12_2(X118,X119),X118,X119))&![X121]:~(min_precedes(X118,X121,X119))))&(((~(root(X118,X119))&![X122]:~(min_precedes(X122,X118,X119)))|min_precedes(X118,esk13_2(X118,X119),X119))|leaf(X118,X119))),inference(skolemize,[status(esa)],[226])).
% fof(228, plain,![X118]:![X119]:![X121]:![X122]:((((~(min_precedes(X122,X118,X119))&~(root(X118,X119)))|min_precedes(X118,esk13_2(X118,X119),X119))|leaf(X118,X119))&((~(min_precedes(X118,X121,X119))&(root(X118,X119)|min_precedes(esk12_2(X118,X119),X118,X119)))|~(leaf(X118,X119)))),inference(shift_quantors,[status(thm)],[227])).
% fof(229, plain,![X118]:![X119]:![X121]:![X122]:((((~(min_precedes(X122,X118,X119))|min_precedes(X118,esk13_2(X118,X119),X119))|leaf(X118,X119))&((~(root(X118,X119))|min_precedes(X118,esk13_2(X118,X119),X119))|leaf(X118,X119)))&((~(min_precedes(X118,X121,X119))|~(leaf(X118,X119)))&((root(X118,X119)|min_precedes(esk12_2(X118,X119),X118,X119))|~(leaf(X118,X119))))),inference(distribute,[status(thm)],[228])).
% cnf(231,plain,(~leaf(X1,X2)|~min_precedes(X1,X3,X2)),inference(split_conjunct,[status(thm)],[229])).
% fof(320, negated_conjecture,?[X166]:(occurrence_of(X166,tptp0)&![X167]:![X168]:((((~(occurrence_of(X167,tptp3))|~(root_occ(X167,X166)))|(~(occurrence_of(X168,tptp2))&~(occurrence_of(X168,tptp1))))|~(min_precedes(X167,X168,tptp0)))|~(leaf_occ(X168,X166)))),inference(fof_nnf,[status(thm)],[64])).
% fof(321, negated_conjecture,?[X169]:(occurrence_of(X169,tptp0)&![X170]:![X171]:((((~(occurrence_of(X170,tptp3))|~(root_occ(X170,X169)))|(~(occurrence_of(X171,tptp2))&~(occurrence_of(X171,tptp1))))|~(min_precedes(X170,X171,tptp0)))|~(leaf_occ(X171,X169)))),inference(variable_rename,[status(thm)],[320])).
% fof(322, negated_conjecture,(occurrence_of(esk20_0,tptp0)&![X170]:![X171]:((((~(occurrence_of(X170,tptp3))|~(root_occ(X170,esk20_0)))|(~(occurrence_of(X171,tptp2))&~(occurrence_of(X171,tptp1))))|~(min_precedes(X170,X171,tptp0)))|~(leaf_occ(X171,esk20_0)))),inference(skolemize,[status(esa)],[321])).
% fof(323, negated_conjecture,![X170]:![X171]:(((((~(occurrence_of(X170,tptp3))|~(root_occ(X170,esk20_0)))|(~(occurrence_of(X171,tptp2))&~(occurrence_of(X171,tptp1))))|~(min_precedes(X170,X171,tptp0)))|~(leaf_occ(X171,esk20_0)))&occurrence_of(esk20_0,tptp0)),inference(shift_quantors,[status(thm)],[322])).
% fof(324, negated_conjecture,![X170]:![X171]:(((((~(occurrence_of(X171,tptp2))|(~(occurrence_of(X170,tptp3))|~(root_occ(X170,esk20_0))))|~(min_precedes(X170,X171,tptp0)))|~(leaf_occ(X171,esk20_0)))&(((~(occurrence_of(X171,tptp1))|(~(occurrence_of(X170,tptp3))|~(root_occ(X170,esk20_0))))|~(min_precedes(X170,X171,tptp0)))|~(leaf_occ(X171,esk20_0))))&occurrence_of(esk20_0,tptp0)),inference(distribute,[status(thm)],[323])).
% cnf(325,negated_conjecture,(occurrence_of(esk20_0,tptp0)),inference(split_conjunct,[status(thm)],[324])).
% cnf(326,negated_conjecture,(~leaf_occ(X1,esk20_0)|~min_precedes(X2,X1,tptp0)|~root_occ(X2,esk20_0)|~occurrence_of(X2,tptp3)|~occurrence_of(X1,tptp1)),inference(split_conjunct,[status(thm)],[324])).
% cnf(327,negated_conjecture,(~leaf_occ(X1,esk20_0)|~min_precedes(X2,X1,tptp0)|~root_occ(X2,esk20_0)|~occurrence_of(X2,tptp3)|~occurrence_of(X1,tptp2)),inference(split_conjunct,[status(thm)],[324])).
% cnf(328,negated_conjecture,(X1=tptp0|~occurrence_of(esk20_0,X1)),inference(spm,[status(thm)],[127,325,theory(equality)])).
% cnf(400,plain,(esk1_1(X1)=X2|min_precedes(esk1_1(X1),X2,X3)|~leaf_occ(X2,X1)|~occurrence_of(X1,X3)|~occurrence_of(X1,tptp0)),inference(spm,[status(thm)],[87,97,theory(equality)])).
% cnf(422,plain,(min_precedes(esk1_1(X1),esk2_1(X1),tptp0)|~occurrence_of(X1,tptp0)),inference(spm,[status(thm)],[196,95,theory(equality)])).
% cnf(544,negated_conjecture,(esk6_2(X1,esk20_0)=tptp0|~leaf_occ(X1,esk20_0)),inference(spm,[status(thm)],[328,160,theory(equality)])).
% cnf(599,negated_conjecture,(leaf(X1,tptp0)|~leaf_occ(X1,esk20_0)),inference(spm,[status(thm)],[158,544,theory(equality)])).
% cnf(970,negated_conjecture,(esk1_1(X1)=X2|~root_occ(esk1_1(X1),esk20_0)|~leaf_occ(X2,esk20_0)|~occurrence_of(esk1_1(X1),tptp3)|~occurrence_of(X2,tptp2)|~leaf_occ(X2,X1)|~occurrence_of(X1,tptp0)),inference(spm,[status(thm)],[327,400,theory(equality)])).
% cnf(971,negated_conjecture,(esk1_1(X1)=X2|~root_occ(esk1_1(X1),esk20_0)|~leaf_occ(X2,esk20_0)|~occurrence_of(esk1_1(X1),tptp3)|~occurrence_of(X2,tptp1)|~leaf_occ(X2,X1)|~occurrence_of(X1,tptp0)),inference(spm,[status(thm)],[326,400,theory(equality)])).
% cnf(1394,plain,(~leaf(esk1_1(X1),tptp0)|~occurrence_of(X1,tptp0)),inference(spm,[status(thm)],[231,422,theory(equality)])).
% cnf(1412,negated_conjecture,(~occurrence_of(X1,tptp0)|~leaf_occ(esk1_1(X1),esk20_0)),inference(spm,[status(thm)],[1394,599,theory(equality)])).
% cnf(5809,negated_conjecture,(esk1_1(X1)=X2|~root_occ(esk1_1(X1),esk20_0)|~leaf_occ(X2,esk20_0)|~leaf_occ(X2,X1)|~occurrence_of(X2,tptp2)|~occurrence_of(X1,tptp0)),inference(csr,[status(thm)],[970,98])).
% cnf(5812,negated_conjecture,(esk1_1(esk20_0)=X1|~leaf_occ(X1,esk20_0)|~occurrence_of(X1,tptp2)|~occurrence_of(esk20_0,tptp0)),inference(spm,[status(thm)],[5809,97,theory(equality)])).
% cnf(5815,negated_conjecture,(esk1_1(esk20_0)=X1|~leaf_occ(X1,esk20_0)|~occurrence_of(X1,tptp2)|$false),inference(rw,[status(thm)],[5812,325,theory(equality)])).
% cnf(5816,negated_conjecture,(esk1_1(esk20_0)=X1|~leaf_occ(X1,esk20_0)|~occurrence_of(X1,tptp2)),inference(cn,[status(thm)],[5815,theory(equality)])).
% cnf(5818,negated_conjecture,(esk1_1(esk20_0)=esk3_1(esk20_0)|~occurrence_of(esk3_1(esk20_0),tptp2)|~occurrence_of(esk20_0,tptp0)),inference(spm,[status(thm)],[5816,92,theory(equality)])).
% cnf(5821,negated_conjecture,(esk1_1(esk20_0)=esk3_1(esk20_0)|~occurrence_of(esk3_1(esk20_0),tptp2)|$false),inference(rw,[status(thm)],[5818,325,theory(equality)])).
% cnf(5822,negated_conjecture,(esk1_1(esk20_0)=esk3_1(esk20_0)|~occurrence_of(esk3_1(esk20_0),tptp2)),inference(cn,[status(thm)],[5821,theory(equality)])).
% cnf(5948,negated_conjecture,(esk1_1(X1)=X2|~root_occ(esk1_1(X1),esk20_0)|~leaf_occ(X2,esk20_0)|~leaf_occ(X2,X1)|~occurrence_of(X2,tptp1)|~occurrence_of(X1,tptp0)),inference(csr,[status(thm)],[971,98])).
% cnf(5952,negated_conjecture,(esk1_1(esk20_0)=X1|~leaf_occ(X1,esk20_0)|~occurrence_of(X1,tptp1)|~occurrence_of(esk20_0,tptp0)),inference(spm,[status(thm)],[5948,97,theory(equality)])).
% cnf(5957,negated_conjecture,(esk1_1(esk20_0)=X1|~leaf_occ(X1,esk20_0)|~occurrence_of(X1,tptp1)|$false),inference(rw,[status(thm)],[5952,325,theory(equality)])).
% cnf(5958,negated_conjecture,(esk1_1(esk20_0)=X1|~leaf_occ(X1,esk20_0)|~occurrence_of(X1,tptp1)),inference(cn,[status(thm)],[5957,theory(equality)])).
% cnf(6310,negated_conjecture,(esk1_1(esk20_0)=esk3_1(esk20_0)|~occurrence_of(esk3_1(esk20_0),tptp1)|~occurrence_of(esk20_0,tptp0)),inference(spm,[status(thm)],[5958,92,theory(equality)])).
% cnf(6313,negated_conjecture,(esk1_1(esk20_0)=esk3_1(esk20_0)|~occurrence_of(esk3_1(esk20_0),tptp1)|$false),inference(rw,[status(thm)],[6310,325,theory(equality)])).
% cnf(6314,negated_conjecture,(esk1_1(esk20_0)=esk3_1(esk20_0)|~occurrence_of(esk3_1(esk20_0),tptp1)),inference(cn,[status(thm)],[6313,theory(equality)])).
% cnf(6414,negated_conjecture,(esk1_1(esk20_0)=esk3_1(esk20_0)|occurrence_of(esk3_1(esk20_0),tptp2)|~occurrence_of(esk20_0,tptp0)),inference(spm,[status(thm)],[6314,94,theory(equality)])).
% cnf(6415,negated_conjecture,(esk1_1(esk20_0)=esk3_1(esk20_0)|occurrence_of(esk3_1(esk20_0),tptp2)|$false),inference(rw,[status(thm)],[6414,325,theory(equality)])).
% cnf(6416,negated_conjecture,(esk1_1(esk20_0)=esk3_1(esk20_0)|occurrence_of(esk3_1(esk20_0),tptp2)),inference(cn,[status(thm)],[6415,theory(equality)])).
% cnf(6417,negated_conjecture,(esk1_1(esk20_0)=esk3_1(esk20_0)),inference(csr,[status(thm)],[6416,5822])).
% cnf(6440,negated_conjecture,(~leaf_occ(esk3_1(esk20_0),esk20_0)|~occurrence_of(esk20_0,tptp0)),inference(spm,[status(thm)],[1412,6417,theory(equality)])).
% cnf(6511,negated_conjecture,(~leaf_occ(esk3_1(esk20_0),esk20_0)|$false),inference(rw,[status(thm)],[6440,325,theory(equality)])).
% cnf(6512,negated_conjecture,(~leaf_occ(esk3_1(esk20_0),esk20_0)),inference(cn,[status(thm)],[6511,theory(equality)])).
% cnf(6549,negated_conjecture,(~occurrence_of(esk20_0,tptp0)),inference(spm,[status(thm)],[6512,92,theory(equality)])).
% cnf(6551,negated_conjecture,($false),inference(rw,[status(thm)],[6549,325,theory(equality)])).
% cnf(6552,negated_conjecture,($false),inference(cn,[status(thm)],[6551,theory(equality)])).
% cnf(6553,negated_conjecture,($false),6552,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1688
% # ...of these trivial : 1
% # ...subsumed : 954
% # ...remaining for further processing: 733
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 93
% # Backward-rewritten : 15
% # Generated clauses : 4697
% # ...of the previous two non-trivial : 4363
% # Contextual simplify-reflections : 660
% # Paramodulations : 4697
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 625
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 23
% # Non-unit-clauses : 585
% # Current number of unprocessed clauses: 2228
% # ...number of literals in the above : 11168
% # Clause-clause subsumption calls (NU) : 14312
% # Rec. Clause-clause subsumption calls : 7696
% # Unit Clause-clause subsumption calls : 194
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 402 leaves, 1.81+/-2.832 terms/leaf
% # Paramod-from index: 185 leaves, 1.06+/-0.305 terms/leaf
% # Paramod-into index: 366 leaves, 1.52+/-1.600 terms/leaf
% # -------------------------------------------------
% # User time : 0.287 s
% # System time : 0.006 s
% # Total time : 0.293 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.45 CPU 0.55 WC
% FINAL PrfWatch: 0.45 CPU 0.55 WC
% SZS output end Solution for /tmp/SystemOnTPTP13034/PRO009+3.tptp
%
%------------------------------------------------------------------------------