%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PRO009+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 : 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:02 EST 2010
% Result : Theorem 1.55s
% Output : Solution 1.55s
% 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/SystemOnTPTP12775/PRO009+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12775/PRO009+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12775/PRO009+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 12871
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # 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(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_32)).
% fof(21, axiom,![X44]:![X45]:![X46]:(next_subocc(X44,X45,X46)<=>(min_precedes(X44,X45,X46)&~(?[X47]:(min_precedes(X44,X47,X46)&min_precedes(X47,X45,X46))))),file('/tmp/SRASS.s.p', sos_04)).
% fof(46, conjecture,![X100]:(occurrence_of(X100,tptp0)=>?[X101]:?[X102]:((((occurrence_of(X101,tptp3)&root_occ(X101,X100))&(occurrence_of(X102,tptp2)|occurrence_of(X102,tptp1)))&min_precedes(X101,X102,tptp0))&leaf_occ(X102,X100))),file('/tmp/SRASS.s.p', goals)).
% fof(47, negated_conjecture,~(![X100]:(occurrence_of(X100,tptp0)=>?[X101]:?[X102]:((((occurrence_of(X101,tptp3)&root_occ(X101,X100))&(occurrence_of(X102,tptp2)|occurrence_of(X102,tptp1)))&min_precedes(X101,X102,tptp0))&leaf_occ(X102,X100)))),inference(assume_negation,[status(cth)],[46])).
% fof(55, 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(56, 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)],[55])).
% cnf(57,plain,(min_precedes(X1,X2,X3)|~min_precedes(X4,X2,X3)|~min_precedes(X1,X4,X3)),inference(split_conjunct,[status(thm)],[56])).
% fof(66, 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(67, 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)],[66])).
% fof(68, 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)],[67])).
% fof(69, 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)],[68])).
% cnf(70,plain,(leaf_occ(esk3_1(X1),X1)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(71,plain,(next_subocc(esk2_1(X1),esk3_1(X1),tptp0)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(72,plain,(occurrence_of(esk3_1(X1),tptp1)|occurrence_of(esk3_1(X1),tptp2)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(73,plain,(next_subocc(esk1_1(X1),esk2_1(X1),tptp0)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(75,plain,(root_occ(esk1_1(X1),X1)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(76,plain,(occurrence_of(esk1_1(X1),tptp3)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[69])).
% fof(131, plain,![X44]:![X45]:![X46]:((~(next_subocc(X44,X45,X46))|(min_precedes(X44,X45,X46)&![X47]:(~(min_precedes(X44,X47,X46))|~(min_precedes(X47,X45,X46)))))&((~(min_precedes(X44,X45,X46))|?[X47]:(min_precedes(X44,X47,X46)&min_precedes(X47,X45,X46)))|next_subocc(X44,X45,X46))),inference(fof_nnf,[status(thm)],[21])).
% fof(132, plain,![X48]:![X49]:![X50]:((~(next_subocc(X48,X49,X50))|(min_precedes(X48,X49,X50)&![X51]:(~(min_precedes(X48,X51,X50))|~(min_precedes(X51,X49,X50)))))&((~(min_precedes(X48,X49,X50))|?[X52]:(min_precedes(X48,X52,X50)&min_precedes(X52,X49,X50)))|next_subocc(X48,X49,X50))),inference(variable_rename,[status(thm)],[131])).
% fof(133, plain,![X48]:![X49]:![X50]:((~(next_subocc(X48,X49,X50))|(min_precedes(X48,X49,X50)&![X51]:(~(min_precedes(X48,X51,X50))|~(min_precedes(X51,X49,X50)))))&((~(min_precedes(X48,X49,X50))|(min_precedes(X48,esk9_3(X48,X49,X50),X50)&min_precedes(esk9_3(X48,X49,X50),X49,X50)))|next_subocc(X48,X49,X50))),inference(skolemize,[status(esa)],[132])).
% fof(134, plain,![X48]:![X49]:![X50]:![X51]:((((~(min_precedes(X48,X51,X50))|~(min_precedes(X51,X49,X50)))&min_precedes(X48,X49,X50))|~(next_subocc(X48,X49,X50)))&((~(min_precedes(X48,X49,X50))|(min_precedes(X48,esk9_3(X48,X49,X50),X50)&min_precedes(esk9_3(X48,X49,X50),X49,X50)))|next_subocc(X48,X49,X50))),inference(shift_quantors,[status(thm)],[133])).
% fof(135, plain,![X48]:![X49]:![X50]:![X51]:((((~(min_precedes(X48,X51,X50))|~(min_precedes(X51,X49,X50)))|~(next_subocc(X48,X49,X50)))&(min_precedes(X48,X49,X50)|~(next_subocc(X48,X49,X50))))&(((min_precedes(X48,esk9_3(X48,X49,X50),X50)|~(min_precedes(X48,X49,X50)))|next_subocc(X48,X49,X50))&((min_precedes(esk9_3(X48,X49,X50),X49,X50)|~(min_precedes(X48,X49,X50)))|next_subocc(X48,X49,X50)))),inference(distribute,[status(thm)],[134])).
% cnf(138,plain,(min_precedes(X1,X2,X3)|~next_subocc(X1,X2,X3)),inference(split_conjunct,[status(thm)],[135])).
% fof(241, negated_conjecture,?[X100]:(occurrence_of(X100,tptp0)&![X101]:![X102]:((((~(occurrence_of(X101,tptp3))|~(root_occ(X101,X100)))|(~(occurrence_of(X102,tptp2))&~(occurrence_of(X102,tptp1))))|~(min_precedes(X101,X102,tptp0)))|~(leaf_occ(X102,X100)))),inference(fof_nnf,[status(thm)],[47])).
% fof(242, negated_conjecture,?[X103]:(occurrence_of(X103,tptp0)&![X104]:![X105]:((((~(occurrence_of(X104,tptp3))|~(root_occ(X104,X103)))|(~(occurrence_of(X105,tptp2))&~(occurrence_of(X105,tptp1))))|~(min_precedes(X104,X105,tptp0)))|~(leaf_occ(X105,X103)))),inference(variable_rename,[status(thm)],[241])).
% fof(243, negated_conjecture,(occurrence_of(esk18_0,tptp0)&![X104]:![X105]:((((~(occurrence_of(X104,tptp3))|~(root_occ(X104,esk18_0)))|(~(occurrence_of(X105,tptp2))&~(occurrence_of(X105,tptp1))))|~(min_precedes(X104,X105,tptp0)))|~(leaf_occ(X105,esk18_0)))),inference(skolemize,[status(esa)],[242])).
% fof(244, negated_conjecture,![X104]:![X105]:(((((~(occurrence_of(X104,tptp3))|~(root_occ(X104,esk18_0)))|(~(occurrence_of(X105,tptp2))&~(occurrence_of(X105,tptp1))))|~(min_precedes(X104,X105,tptp0)))|~(leaf_occ(X105,esk18_0)))&occurrence_of(esk18_0,tptp0)),inference(shift_quantors,[status(thm)],[243])).
% fof(245, negated_conjecture,![X104]:![X105]:(((((~(occurrence_of(X105,tptp2))|(~(occurrence_of(X104,tptp3))|~(root_occ(X104,esk18_0))))|~(min_precedes(X104,X105,tptp0)))|~(leaf_occ(X105,esk18_0)))&(((~(occurrence_of(X105,tptp1))|(~(occurrence_of(X104,tptp3))|~(root_occ(X104,esk18_0))))|~(min_precedes(X104,X105,tptp0)))|~(leaf_occ(X105,esk18_0))))&occurrence_of(esk18_0,tptp0)),inference(distribute,[status(thm)],[244])).
% cnf(246,negated_conjecture,(occurrence_of(esk18_0,tptp0)),inference(split_conjunct,[status(thm)],[245])).
% cnf(247,negated_conjecture,(~leaf_occ(X1,esk18_0)|~min_precedes(X2,X1,tptp0)|~root_occ(X2,esk18_0)|~occurrence_of(X2,tptp3)|~occurrence_of(X1,tptp1)),inference(split_conjunct,[status(thm)],[245])).
% cnf(248,negated_conjecture,(~leaf_occ(X1,esk18_0)|~min_precedes(X2,X1,tptp0)|~root_occ(X2,esk18_0)|~occurrence_of(X2,tptp3)|~occurrence_of(X1,tptp2)),inference(split_conjunct,[status(thm)],[245])).
% cnf(327,plain,(min_precedes(esk1_1(X1),esk2_1(X1),tptp0)|~occurrence_of(X1,tptp0)),inference(spm,[status(thm)],[138,73,theory(equality)])).
% cnf(331,plain,(min_precedes(esk2_1(X1),esk3_1(X1),tptp0)|~occurrence_of(X1,tptp0)),inference(spm,[status(thm)],[138,71,theory(equality)])).
% cnf(1150,plain,(min_precedes(X1,esk3_1(X2),tptp0)|~min_precedes(X1,esk2_1(X2),tptp0)|~occurrence_of(X2,tptp0)),inference(spm,[status(thm)],[57,331,theory(equality)])).
% cnf(1625,plain,(min_precedes(esk1_1(X1),esk3_1(X1),tptp0)|~occurrence_of(X1,tptp0)),inference(spm,[status(thm)],[1150,327,theory(equality)])).
% cnf(2604,negated_conjecture,(~leaf_occ(esk3_1(X1),esk18_0)|~root_occ(esk1_1(X1),esk18_0)|~occurrence_of(esk1_1(X1),tptp3)|~occurrence_of(esk3_1(X1),tptp2)|~occurrence_of(X1,tptp0)),inference(spm,[status(thm)],[248,1625,theory(equality)])).
% cnf(2605,negated_conjecture,(~leaf_occ(esk3_1(X1),esk18_0)|~root_occ(esk1_1(X1),esk18_0)|~occurrence_of(esk1_1(X1),tptp3)|~occurrence_of(esk3_1(X1),tptp1)|~occurrence_of(X1,tptp0)),inference(spm,[status(thm)],[247,1625,theory(equality)])).
% cnf(8884,negated_conjecture,(~leaf_occ(esk3_1(X1),esk18_0)|~root_occ(esk1_1(X1),esk18_0)|~occurrence_of(esk3_1(X1),tptp2)|~occurrence_of(X1,tptp0)),inference(csr,[status(thm)],[2604,76])).
% cnf(8888,negated_conjecture,(~leaf_occ(esk3_1(esk18_0),esk18_0)|~occurrence_of(esk3_1(esk18_0),tptp2)|~occurrence_of(esk18_0,tptp0)),inference(spm,[status(thm)],[8884,75,theory(equality)])).
% cnf(8894,negated_conjecture,(~leaf_occ(esk3_1(esk18_0),esk18_0)|~occurrence_of(esk3_1(esk18_0),tptp2)|$false),inference(rw,[status(thm)],[8888,246,theory(equality)])).
% cnf(8895,negated_conjecture,(~leaf_occ(esk3_1(esk18_0),esk18_0)|~occurrence_of(esk3_1(esk18_0),tptp2)),inference(cn,[status(thm)],[8894,theory(equality)])).
% cnf(8896,negated_conjecture,(~occurrence_of(esk3_1(esk18_0),tptp2)|~occurrence_of(esk18_0,tptp0)),inference(spm,[status(thm)],[8895,70,theory(equality)])).
% cnf(8897,negated_conjecture,(~occurrence_of(esk3_1(esk18_0),tptp2)|$false),inference(rw,[status(thm)],[8896,246,theory(equality)])).
% cnf(8898,negated_conjecture,(~occurrence_of(esk3_1(esk18_0),tptp2)),inference(cn,[status(thm)],[8897,theory(equality)])).
% cnf(10540,negated_conjecture,(~leaf_occ(esk3_1(X1),esk18_0)|~root_occ(esk1_1(X1),esk18_0)|~occurrence_of(esk3_1(X1),tptp1)|~occurrence_of(X1,tptp0)),inference(csr,[status(thm)],[2605,76])).
% cnf(10544,negated_conjecture,(~leaf_occ(esk3_1(esk18_0),esk18_0)|~occurrence_of(esk3_1(esk18_0),tptp1)|~occurrence_of(esk18_0,tptp0)),inference(spm,[status(thm)],[10540,75,theory(equality)])).
% cnf(10550,negated_conjecture,(~leaf_occ(esk3_1(esk18_0),esk18_0)|~occurrence_of(esk3_1(esk18_0),tptp1)|$false),inference(rw,[status(thm)],[10544,246,theory(equality)])).
% cnf(10551,negated_conjecture,(~leaf_occ(esk3_1(esk18_0),esk18_0)|~occurrence_of(esk3_1(esk18_0),tptp1)),inference(cn,[status(thm)],[10550,theory(equality)])).
% cnf(10552,negated_conjecture,(~occurrence_of(esk3_1(esk18_0),tptp1)|~occurrence_of(esk18_0,tptp0)),inference(spm,[status(thm)],[10551,70,theory(equality)])).
% cnf(10553,negated_conjecture,(~occurrence_of(esk3_1(esk18_0),tptp1)|$false),inference(rw,[status(thm)],[10552,246,theory(equality)])).
% cnf(10554,negated_conjecture,(~occurrence_of(esk3_1(esk18_0),tptp1)),inference(cn,[status(thm)],[10553,theory(equality)])).
% cnf(10555,negated_conjecture,(occurrence_of(esk3_1(esk18_0),tptp2)|~occurrence_of(esk18_0,tptp0)),inference(spm,[status(thm)],[10554,72,theory(equality)])).
% cnf(10556,negated_conjecture,(occurrence_of(esk3_1(esk18_0),tptp2)|$false),inference(rw,[status(thm)],[10555,246,theory(equality)])).
% cnf(10557,negated_conjecture,(occurrence_of(esk3_1(esk18_0),tptp2)),inference(cn,[status(thm)],[10556,theory(equality)])).
% cnf(10558,negated_conjecture,($false),inference(sr,[status(thm)],[10557,8898,theory(equality)])).
% cnf(10559,negated_conjecture,($false),10558,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2937
% # ...of these trivial : 3
% # ...subsumed : 2015
% # ...remaining for further processing: 919
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 85
% # Backward-rewritten : 16
% # Generated clauses : 7169
% # ...of the previous two non-trivial : 6447
% # Contextual simplify-reflections : 1750
% # Paramodulations : 7169
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 818
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 20
% # Non-unit-clauses : 776
% # Current number of unprocessed clauses: 3094
% # ...number of literals in the above : 15768
% # Clause-clause subsumption calls (NU) : 33883
% # Rec. Clause-clause subsumption calls : 19241
% # Unit Clause-clause subsumption calls : 211
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 607 leaves, 1.55+/-1.791 terms/leaf
% # Paramod-from index: 258 leaves, 1.12+/-0.376 terms/leaf
% # Paramod-into index: 527 leaves, 1.40+/-1.214 terms/leaf
% # -------------------------------------------------
% # User time : 0.472 s
% # System time : 0.013 s
% # Total time : 0.485 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.70 CPU 0.78 WC
% FINAL PrfWatch: 0.70 CPU 0.78 WC
% SZS output end Solution for /tmp/SystemOnTPTP12775/PRO009+2.tptp
%
%------------------------------------------------------------------------------