TSTP Solution File: PRO011+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PRO011+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 : art03.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:11:16 EST 2010
% Result : Theorem 1.00s
% Output : Solution 1.00s
% 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/SystemOnTPTP19044/PRO011+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19044/PRO011+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19044/PRO011+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 19140
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,~(tptp1=tptp2),file('/tmp/SRASS.s.p', sos_44)).
% fof(5, axiom,![X13]:![X14]:(leaf_occ(X13,X14)<=>?[X15]:((occurrence_of(X14,X15)&subactivity_occurrence(X13,X14))&leaf(X13,X15))),file('/tmp/SRASS.s.p', sos_18)).
% fof(11, axiom,![X33]:(occurrence_of(X33,tptp0)=>?[X34]:?[X35]:?[X36]:((((((occurrence_of(X34,tptp3)&root_occ(X34,X33))&occurrence_of(X35,tptp4))&next_subocc(X34,X35,tptp0))&(occurrence_of(X36,tptp1)|occurrence_of(X36,tptp2)))&next_subocc(X35,X36,tptp0))&leaf_occ(X36,X33))),file('/tmp/SRASS.s.p', sos_32)).
% fof(21, axiom,![X57]:![X58]:![X59]:((occurrence_of(X57,X58)&occurrence_of(X57,X59))=>X58=X59),file('/tmp/SRASS.s.p', sos_08)).
% fof(35, axiom,![X84]:![X85]:(leaf(X84,X85)<=>((root(X84,X85)|?[X86]:min_precedes(X86,X84,X85))&~(?[X87]:min_precedes(X84,X87,X85)))),file('/tmp/SRASS.s.p', sos_15)).
% 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(46, conjecture,![X106]:(occurrence_of(X106,tptp0)=>?[X107]:?[X108]:((leaf_occ(X108,X106)&(occurrence_of(X108,tptp1)=>~(?[X109]:((occurrence_of(X109,tptp2)&subactivity_occurrence(X109,X106))&min_precedes(X107,X109,tptp0)))))&(occurrence_of(X108,tptp2)=>~(?[X110]:((occurrence_of(X110,tptp1)&subactivity_occurrence(X110,X106))&min_precedes(X107,X110,tptp0)))))),file('/tmp/SRASS.s.p', goals)).
% fof(47, negated_conjecture,~(![X106]:(occurrence_of(X106,tptp0)=>?[X107]:?[X108]:((leaf_occ(X108,X106)&(occurrence_of(X108,tptp1)=>~(?[X109]:((occurrence_of(X109,tptp2)&subactivity_occurrence(X109,X106))&min_precedes(X107,X109,tptp0)))))&(occurrence_of(X108,tptp2)=>~(?[X110]:((occurrence_of(X110,tptp1)&subactivity_occurrence(X110,X106))&min_precedes(X107,X110,tptp0))))))),inference(assume_negation,[status(cth)],[46])).
% cnf(69,plain,(tptp1!=tptp2),inference(split_conjunct,[status(thm)],[4])).
% fof(70, plain,![X13]:![X14]:((~(leaf_occ(X13,X14))|?[X15]:((occurrence_of(X14,X15)&subactivity_occurrence(X13,X14))&leaf(X13,X15)))&(![X15]:((~(occurrence_of(X14,X15))|~(subactivity_occurrence(X13,X14)))|~(leaf(X13,X15)))|leaf_occ(X13,X14))),inference(fof_nnf,[status(thm)],[5])).
% fof(71, plain,![X16]:![X17]:((~(leaf_occ(X16,X17))|?[X18]:((occurrence_of(X17,X18)&subactivity_occurrence(X16,X17))&leaf(X16,X18)))&(![X19]:((~(occurrence_of(X17,X19))|~(subactivity_occurrence(X16,X17)))|~(leaf(X16,X19)))|leaf_occ(X16,X17))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,![X16]:![X17]:((~(leaf_occ(X16,X17))|((occurrence_of(X17,esk2_2(X16,X17))&subactivity_occurrence(X16,X17))&leaf(X16,esk2_2(X16,X17))))&(![X19]:((~(occurrence_of(X17,X19))|~(subactivity_occurrence(X16,X17)))|~(leaf(X16,X19)))|leaf_occ(X16,X17))),inference(skolemize,[status(esa)],[71])).
% fof(73, plain,![X16]:![X17]:![X19]:((((~(occurrence_of(X17,X19))|~(subactivity_occurrence(X16,X17)))|~(leaf(X16,X19)))|leaf_occ(X16,X17))&(~(leaf_occ(X16,X17))|((occurrence_of(X17,esk2_2(X16,X17))&subactivity_occurrence(X16,X17))&leaf(X16,esk2_2(X16,X17))))),inference(shift_quantors,[status(thm)],[72])).
% fof(74, plain,![X16]:![X17]:![X19]:((((~(occurrence_of(X17,X19))|~(subactivity_occurrence(X16,X17)))|~(leaf(X16,X19)))|leaf_occ(X16,X17))&(((occurrence_of(X17,esk2_2(X16,X17))|~(leaf_occ(X16,X17)))&(subactivity_occurrence(X16,X17)|~(leaf_occ(X16,X17))))&(leaf(X16,esk2_2(X16,X17))|~(leaf_occ(X16,X17))))),inference(distribute,[status(thm)],[73])).
% cnf(75,plain,(leaf(X1,esk2_2(X1,X2))|~leaf_occ(X1,X2)),inference(split_conjunct,[status(thm)],[74])).
% cnf(77,plain,(occurrence_of(X2,esk2_2(X1,X2))|~leaf_occ(X1,X2)),inference(split_conjunct,[status(thm)],[74])).
% fof(93, plain,![X33]:(~(occurrence_of(X33,tptp0))|?[X34]:?[X35]:?[X36]:((((((occurrence_of(X34,tptp3)&root_occ(X34,X33))&occurrence_of(X35,tptp4))&next_subocc(X34,X35,tptp0))&(occurrence_of(X36,tptp1)|occurrence_of(X36,tptp2)))&next_subocc(X35,X36,tptp0))&leaf_occ(X36,X33))),inference(fof_nnf,[status(thm)],[11])).
% fof(94, plain,![X37]:(~(occurrence_of(X37,tptp0))|?[X38]:?[X39]:?[X40]:((((((occurrence_of(X38,tptp3)&root_occ(X38,X37))&occurrence_of(X39,tptp4))&next_subocc(X38,X39,tptp0))&(occurrence_of(X40,tptp1)|occurrence_of(X40,tptp2)))&next_subocc(X39,X40,tptp0))&leaf_occ(X40,X37))),inference(variable_rename,[status(thm)],[93])).
% fof(95, plain,![X37]:(~(occurrence_of(X37,tptp0))|((((((occurrence_of(esk3_1(X37),tptp3)&root_occ(esk3_1(X37),X37))&occurrence_of(esk4_1(X37),tptp4))&next_subocc(esk3_1(X37),esk4_1(X37),tptp0))&(occurrence_of(esk5_1(X37),tptp1)|occurrence_of(esk5_1(X37),tptp2)))&next_subocc(esk4_1(X37),esk5_1(X37),tptp0))&leaf_occ(esk5_1(X37),X37))),inference(skolemize,[status(esa)],[94])).
% fof(96, plain,![X37]:(((((((occurrence_of(esk3_1(X37),tptp3)|~(occurrence_of(X37,tptp0)))&(root_occ(esk3_1(X37),X37)|~(occurrence_of(X37,tptp0))))&(occurrence_of(esk4_1(X37),tptp4)|~(occurrence_of(X37,tptp0))))&(next_subocc(esk3_1(X37),esk4_1(X37),tptp0)|~(occurrence_of(X37,tptp0))))&((occurrence_of(esk5_1(X37),tptp1)|occurrence_of(esk5_1(X37),tptp2))|~(occurrence_of(X37,tptp0))))&(next_subocc(esk4_1(X37),esk5_1(X37),tptp0)|~(occurrence_of(X37,tptp0))))&(leaf_occ(esk5_1(X37),X37)|~(occurrence_of(X37,tptp0)))),inference(distribute,[status(thm)],[95])).
% cnf(97,plain,(leaf_occ(esk5_1(X1),X1)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[96])).
% fof(133, plain,![X57]:![X58]:![X59]:((~(occurrence_of(X57,X58))|~(occurrence_of(X57,X59)))|X58=X59),inference(fof_nnf,[status(thm)],[21])).
% fof(134, plain,![X60]:![X61]:![X62]:((~(occurrence_of(X60,X61))|~(occurrence_of(X60,X62)))|X61=X62),inference(variable_rename,[status(thm)],[133])).
% cnf(135,plain,(X1=X2|~occurrence_of(X3,X2)|~occurrence_of(X3,X1)),inference(split_conjunct,[status(thm)],[134])).
% fof(182, plain,![X84]:![X85]:((~(leaf(X84,X85))|((root(X84,X85)|?[X86]:min_precedes(X86,X84,X85))&![X87]:~(min_precedes(X84,X87,X85))))&(((~(root(X84,X85))&![X86]:~(min_precedes(X86,X84,X85)))|?[X87]:min_precedes(X84,X87,X85))|leaf(X84,X85))),inference(fof_nnf,[status(thm)],[35])).
% fof(183, plain,![X88]:![X89]:((~(leaf(X88,X89))|((root(X88,X89)|?[X90]:min_precedes(X90,X88,X89))&![X91]:~(min_precedes(X88,X91,X89))))&(((~(root(X88,X89))&![X92]:~(min_precedes(X92,X88,X89)))|?[X93]:min_precedes(X88,X93,X89))|leaf(X88,X89))),inference(variable_rename,[status(thm)],[182])).
% fof(184, plain,![X88]:![X89]:((~(leaf(X88,X89))|((root(X88,X89)|min_precedes(esk11_2(X88,X89),X88,X89))&![X91]:~(min_precedes(X88,X91,X89))))&(((~(root(X88,X89))&![X92]:~(min_precedes(X92,X88,X89)))|min_precedes(X88,esk12_2(X88,X89),X89))|leaf(X88,X89))),inference(skolemize,[status(esa)],[183])).
% fof(185, plain,![X88]:![X89]:![X91]:![X92]:((((~(min_precedes(X92,X88,X89))&~(root(X88,X89)))|min_precedes(X88,esk12_2(X88,X89),X89))|leaf(X88,X89))&((~(min_precedes(X88,X91,X89))&(root(X88,X89)|min_precedes(esk11_2(X88,X89),X88,X89)))|~(leaf(X88,X89)))),inference(shift_quantors,[status(thm)],[184])).
% fof(186, plain,![X88]:![X89]:![X91]:![X92]:((((~(min_precedes(X92,X88,X89))|min_precedes(X88,esk12_2(X88,X89),X89))|leaf(X88,X89))&((~(root(X88,X89))|min_precedes(X88,esk12_2(X88,X89),X89))|leaf(X88,X89)))&((~(min_precedes(X88,X91,X89))|~(leaf(X88,X89)))&((root(X88,X89)|min_precedes(esk11_2(X88,X89),X88,X89))|~(leaf(X88,X89))))),inference(distribute,[status(thm)],[185])).
% cnf(188,plain,(~leaf(X1,X2)|~min_precedes(X1,X3,X2)),inference(split_conjunct,[status(thm)],[186])).
% 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(236, negated_conjecture,?[X106]:(occurrence_of(X106,tptp0)&![X107]:![X108]:((~(leaf_occ(X108,X106))|(occurrence_of(X108,tptp1)&?[X109]:((occurrence_of(X109,tptp2)&subactivity_occurrence(X109,X106))&min_precedes(X107,X109,tptp0))))|(occurrence_of(X108,tptp2)&?[X110]:((occurrence_of(X110,tptp1)&subactivity_occurrence(X110,X106))&min_precedes(X107,X110,tptp0))))),inference(fof_nnf,[status(thm)],[47])).
% fof(237, negated_conjecture,?[X111]:(occurrence_of(X111,tptp0)&![X112]:![X113]:((~(leaf_occ(X113,X111))|(occurrence_of(X113,tptp1)&?[X114]:((occurrence_of(X114,tptp2)&subactivity_occurrence(X114,X111))&min_precedes(X112,X114,tptp0))))|(occurrence_of(X113,tptp2)&?[X115]:((occurrence_of(X115,tptp1)&subactivity_occurrence(X115,X111))&min_precedes(X112,X115,tptp0))))),inference(variable_rename,[status(thm)],[236])).
% fof(238, negated_conjecture,(occurrence_of(esk16_0,tptp0)&![X112]:![X113]:((~(leaf_occ(X113,esk16_0))|(occurrence_of(X113,tptp1)&((occurrence_of(esk17_2(X112,X113),tptp2)&subactivity_occurrence(esk17_2(X112,X113),esk16_0))&min_precedes(X112,esk17_2(X112,X113),tptp0))))|(occurrence_of(X113,tptp2)&((occurrence_of(esk18_2(X112,X113),tptp1)&subactivity_occurrence(esk18_2(X112,X113),esk16_0))&min_precedes(X112,esk18_2(X112,X113),tptp0))))),inference(skolemize,[status(esa)],[237])).
% fof(239, negated_conjecture,![X112]:![X113]:(((~(leaf_occ(X113,esk16_0))|(occurrence_of(X113,tptp1)&((occurrence_of(esk17_2(X112,X113),tptp2)&subactivity_occurrence(esk17_2(X112,X113),esk16_0))&min_precedes(X112,esk17_2(X112,X113),tptp0))))|(occurrence_of(X113,tptp2)&((occurrence_of(esk18_2(X112,X113),tptp1)&subactivity_occurrence(esk18_2(X112,X113),esk16_0))&min_precedes(X112,esk18_2(X112,X113),tptp0))))&occurrence_of(esk16_0,tptp0)),inference(shift_quantors,[status(thm)],[238])).
% fof(240, negated_conjecture,![X112]:![X113]:((((occurrence_of(X113,tptp2)|(occurrence_of(X113,tptp1)|~(leaf_occ(X113,esk16_0))))&(((occurrence_of(esk18_2(X112,X113),tptp1)|(occurrence_of(X113,tptp1)|~(leaf_occ(X113,esk16_0))))&(subactivity_occurrence(esk18_2(X112,X113),esk16_0)|(occurrence_of(X113,tptp1)|~(leaf_occ(X113,esk16_0)))))&(min_precedes(X112,esk18_2(X112,X113),tptp0)|(occurrence_of(X113,tptp1)|~(leaf_occ(X113,esk16_0))))))&((((occurrence_of(X113,tptp2)|(occurrence_of(esk17_2(X112,X113),tptp2)|~(leaf_occ(X113,esk16_0))))&(((occurrence_of(esk18_2(X112,X113),tptp1)|(occurrence_of(esk17_2(X112,X113),tptp2)|~(leaf_occ(X113,esk16_0))))&(subactivity_occurrence(esk18_2(X112,X113),esk16_0)|(occurrence_of(esk17_2(X112,X113),tptp2)|~(leaf_occ(X113,esk16_0)))))&(min_precedes(X112,esk18_2(X112,X113),tptp0)|(occurrence_of(esk17_2(X112,X113),tptp2)|~(leaf_occ(X113,esk16_0))))))&((occurrence_of(X113,tptp2)|(subactivity_occurrence(esk17_2(X112,X113),esk16_0)|~(leaf_occ(X113,esk16_0))))&(((occurrence_of(esk18_2(X112,X113),tptp1)|(subactivity_occurrence(esk17_2(X112,X113),esk16_0)|~(leaf_occ(X113,esk16_0))))&(subactivity_occurrence(esk18_2(X112,X113),esk16_0)|(subactivity_occurrence(esk17_2(X112,X113),esk16_0)|~(leaf_occ(X113,esk16_0)))))&(min_precedes(X112,esk18_2(X112,X113),tptp0)|(subactivity_occurrence(esk17_2(X112,X113),esk16_0)|~(leaf_occ(X113,esk16_0)))))))&((occurrence_of(X113,tptp2)|(min_precedes(X112,esk17_2(X112,X113),tptp0)|~(leaf_occ(X113,esk16_0))))&(((occurrence_of(esk18_2(X112,X113),tptp1)|(min_precedes(X112,esk17_2(X112,X113),tptp0)|~(leaf_occ(X113,esk16_0))))&(subactivity_occurrence(esk18_2(X112,X113),esk16_0)|(min_precedes(X112,esk17_2(X112,X113),tptp0)|~(leaf_occ(X113,esk16_0)))))&(min_precedes(X112,esk18_2(X112,X113),tptp0)|(min_precedes(X112,esk17_2(X112,X113),tptp0)|~(leaf_occ(X113,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(245,negated_conjecture,(min_precedes(X2,esk17_2(X2,X1),tptp0)|occurrence_of(X1,tptp2)|~leaf_occ(X1,esk16_0)),inference(split_conjunct,[status(thm)],[240])).
% cnf(254,negated_conjecture,(occurrence_of(X1,tptp1)|min_precedes(X2,esk18_2(X2,X1),tptp0)|~leaf_occ(X1,esk16_0)),inference(split_conjunct,[status(thm)],[240])).
% cnf(260,negated_conjecture,(activity_occurrence(esk16_0)),inference(spm,[status(thm)],[222,241,theory(equality)])).
% cnf(265,negated_conjecture,(leaf_occ(esk5_1(esk16_0),esk16_0)),inference(spm,[status(thm)],[97,241,theory(equality)])).
% cnf(272,negated_conjecture,(X1=tptp0|~occurrence_of(esk16_0,X1)),inference(spm,[status(thm)],[135,241,theory(equality)])).
% cnf(273,plain,(X1=esk15_1(X2)|~occurrence_of(X2,X1)|~activity_occurrence(X2)),inference(spm,[status(thm)],[135,228,theory(equality)])).
% cnf(308,negated_conjecture,(leaf(esk5_1(esk16_0),esk2_2(esk5_1(esk16_0),esk16_0))),inference(spm,[status(thm)],[75,265,theory(equality)])).
% cnf(310,negated_conjecture,(occurrence_of(esk16_0,esk2_2(esk5_1(esk16_0),esk16_0))),inference(spm,[status(thm)],[77,265,theory(equality)])).
% cnf(313,negated_conjecture,(occurrence_of(esk5_1(esk16_0),tptp1)|min_precedes(X1,esk18_2(X1,esk5_1(esk16_0)),tptp0)),inference(spm,[status(thm)],[254,265,theory(equality)])).
% cnf(314,negated_conjecture,(occurrence_of(esk5_1(esk16_0),tptp2)|min_precedes(X1,esk17_2(X1,esk5_1(esk16_0)),tptp0)),inference(spm,[status(thm)],[245,265,theory(equality)])).
% cnf(343,negated_conjecture,(esk15_1(esk16_0)=tptp0|~activity_occurrence(esk16_0)),inference(spm,[status(thm)],[272,228,theory(equality)])).
% cnf(344,negated_conjecture,(esk15_1(esk16_0)=tptp0|$false),inference(rw,[status(thm)],[343,260,theory(equality)])).
% cnf(345,negated_conjecture,(esk15_1(esk16_0)=tptp0),inference(cn,[status(thm)],[344,theory(equality)])).
% cnf(352,plain,(X1=esk15_1(X2)|~occurrence_of(X2,X1)),inference(csr,[status(thm)],[273,222])).
% cnf(565,negated_conjecture,(esk2_2(esk5_1(esk16_0),esk16_0)=esk15_1(esk16_0)),inference(spm,[status(thm)],[352,310,theory(equality)])).
% cnf(569,negated_conjecture,(esk2_2(esk5_1(esk16_0),esk16_0)=tptp0),inference(rw,[status(thm)],[565,345,theory(equality)])).
% cnf(736,negated_conjecture,(leaf(esk5_1(esk16_0),tptp0)),inference(rw,[status(thm)],[308,569,theory(equality)])).
% cnf(855,negated_conjecture,(occurrence_of(esk5_1(esk16_0),tptp1)|~leaf(X1,tptp0)),inference(spm,[status(thm)],[188,313,theory(equality)])).
% cnf(875,negated_conjecture,(occurrence_of(esk5_1(esk16_0),tptp1)),inference(spm,[status(thm)],[855,736,theory(equality)])).
% cnf(889,negated_conjecture,(tptp1=esk15_1(esk5_1(esk16_0))),inference(spm,[status(thm)],[352,875,theory(equality)])).
% cnf(967,negated_conjecture,(occurrence_of(esk5_1(esk16_0),tptp2)|~leaf(X1,tptp0)),inference(spm,[status(thm)],[188,314,theory(equality)])).
% cnf(1083,negated_conjecture,(occurrence_of(esk5_1(esk16_0),tptp2)),inference(spm,[status(thm)],[967,736,theory(equality)])).
% cnf(1100,negated_conjecture,(tptp2=esk15_1(esk5_1(esk16_0))),inference(spm,[status(thm)],[352,1083,theory(equality)])).
% cnf(1115,negated_conjecture,(tptp2=tptp1),inference(rw,[status(thm)],[1100,889,theory(equality)])).
% cnf(1116,negated_conjecture,($false),inference(sr,[status(thm)],[1115,69,theory(equality)])).
% cnf(1117,negated_conjecture,($false),1116,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 281
% # ...of these trivial : 7
% # ...subsumed : 33
% # ...remaining for further processing: 241
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 31
% # Generated clauses : 432
% # ...of the previous two non-trivial : 309
% # Contextual simplify-reflections : 5
% # Paramodulations : 432
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 206
% # Positive orientable unit clauses: 63
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 27
% # Non-unit-clauses : 116
% # Current number of unprocessed clauses: 71
% # ...number of literals in the above : 174
% # Clause-clause subsumption calls (NU) : 288
% # Rec. Clause-clause subsumption calls : 254
% # Unit Clause-clause subsumption calls : 40
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 207 leaves, 1.30+/-1.053 terms/leaf
% # Paramod-from index: 70 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 137 leaves, 1.18+/-0.757 terms/leaf
% # -------------------------------------------------
% # User time : 0.039 s
% # System time : 0.007 s
% # Total time : 0.046 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.23 WC
% FINAL PrfWatch: 0.15 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP19044/PRO011+4.tptp
%
%------------------------------------------------------------------------------