%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PRO010+1 : 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:52 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/SystemOnTPTP13552/PRO010+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13552/PRO010+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13552/PRO010+1.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 13649
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,~(atomic(tptp0)),file('/tmp/SRASS.s.p', sos_37)).
% fof(5, 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,tptp1)|occurrence_of(X12,tptp2)))&next_subocc(X11,X12,tptp0))&leaf_occ(X12,X9))),file('/tmp/SRASS.s.p', sos_35)).
% fof(14, axiom,![X29]:![X30]:![X31]:((occurrence_of(X29,X30)&occurrence_of(X29,X31))=>X30=X31),file('/tmp/SRASS.s.p', sos_02)).
% fof(28, axiom,![X61]:![X62]:![X63]:(min_precedes(X62,X63,X61)=>?[X64]:?[X65]:(((subactivity(X64,X61)&subactivity(X65,X61))&atocc(X62,X64))&atocc(X63,X65))),file('/tmp/SRASS.s.p', sos_11)).
% fof(48, axiom,![X107]:![X108]:(atocc(X107,X108)<=>?[X109]:((subactivity(X108,X109)&atomic(X109))&occurrence_of(X107,X109))),file('/tmp/SRASS.s.p', sos_23)).
% fof(49, conjecture,![X110]:(occurrence_of(X110,tptp0)=>?[X111]:?[X112]:((leaf_occ(X112,X110)&(occurrence_of(X112,tptp1)=>~(?[X113]:(occurrence_of(X113,tptp2)&min_precedes(X111,X113,tptp0)))))&(occurrence_of(X112,tptp2)=>~(?[X114]:(occurrence_of(X114,tptp1)&min_precedes(X111,X114,tptp0)))))),file('/tmp/SRASS.s.p', goals)).
% fof(50, negated_conjecture,~(![X110]:(occurrence_of(X110,tptp0)=>?[X111]:?[X112]:((leaf_occ(X112,X110)&(occurrence_of(X112,tptp1)=>~(?[X113]:(occurrence_of(X113,tptp2)&min_precedes(X111,X113,tptp0)))))&(occurrence_of(X112,tptp2)=>~(?[X114]:(occurrence_of(X114,tptp1)&min_precedes(X111,X114,tptp0))))))),inference(assume_negation,[status(cth)],[49])).
% fof(51, plain,~(atomic(tptp0)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% cnf(70,plain,(~atomic(tptp0)),inference(split_conjunct,[status(thm)],[51])).
% fof(71, 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,tptp1)|occurrence_of(X12,tptp2)))&next_subocc(X11,X12,tptp0))&leaf_occ(X12,X9))),inference(fof_nnf,[status(thm)],[5])).
% fof(72, 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,tptp1)|occurrence_of(X16,tptp2)))&next_subocc(X15,X16,tptp0))&leaf_occ(X16,X13))),inference(variable_rename,[status(thm)],[71])).
% fof(73, plain,![X13]:(~(occurrence_of(X13,tptp0))|((((((occurrence_of(esk2_1(X13),tptp3)&root_occ(esk2_1(X13),X13))&occurrence_of(esk3_1(X13),tptp4))&next_subocc(esk2_1(X13),esk3_1(X13),tptp0))&(occurrence_of(esk4_1(X13),tptp1)|occurrence_of(esk4_1(X13),tptp2)))&next_subocc(esk3_1(X13),esk4_1(X13),tptp0))&leaf_occ(esk4_1(X13),X13))),inference(skolemize,[status(esa)],[72])).
% fof(74, plain,![X13]:(((((((occurrence_of(esk2_1(X13),tptp3)|~(occurrence_of(X13,tptp0)))&(root_occ(esk2_1(X13),X13)|~(occurrence_of(X13,tptp0))))&(occurrence_of(esk3_1(X13),tptp4)|~(occurrence_of(X13,tptp0))))&(next_subocc(esk2_1(X13),esk3_1(X13),tptp0)|~(occurrence_of(X13,tptp0))))&((occurrence_of(esk4_1(X13),tptp1)|occurrence_of(esk4_1(X13),tptp2))|~(occurrence_of(X13,tptp0))))&(next_subocc(esk3_1(X13),esk4_1(X13),tptp0)|~(occurrence_of(X13,tptp0))))&(leaf_occ(esk4_1(X13),X13)|~(occurrence_of(X13,tptp0)))),inference(distribute,[status(thm)],[73])).
% cnf(75,plain,(leaf_occ(esk4_1(X1),X1)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[74])).
% fof(109, plain,![X29]:![X30]:![X31]:((~(occurrence_of(X29,X30))|~(occurrence_of(X29,X31)))|X30=X31),inference(fof_nnf,[status(thm)],[14])).
% fof(110, plain,![X32]:![X33]:![X34]:((~(occurrence_of(X32,X33))|~(occurrence_of(X32,X34)))|X33=X34),inference(variable_rename,[status(thm)],[109])).
% cnf(111,plain,(X1=X2|~occurrence_of(X3,X2)|~occurrence_of(X3,X1)),inference(split_conjunct,[status(thm)],[110])).
% fof(156, plain,![X61]:![X62]:![X63]:(~(min_precedes(X62,X63,X61))|?[X64]:?[X65]:(((subactivity(X64,X61)&subactivity(X65,X61))&atocc(X62,X64))&atocc(X63,X65))),inference(fof_nnf,[status(thm)],[28])).
% fof(157, plain,![X66]:![X67]:![X68]:(~(min_precedes(X67,X68,X66))|?[X69]:?[X70]:(((subactivity(X69,X66)&subactivity(X70,X66))&atocc(X67,X69))&atocc(X68,X70))),inference(variable_rename,[status(thm)],[156])).
% fof(158, plain,![X66]:![X67]:![X68]:(~(min_precedes(X67,X68,X66))|(((subactivity(esk11_3(X66,X67,X68),X66)&subactivity(esk12_3(X66,X67,X68),X66))&atocc(X67,esk11_3(X66,X67,X68)))&atocc(X68,esk12_3(X66,X67,X68)))),inference(skolemize,[status(esa)],[157])).
% fof(159, plain,![X66]:![X67]:![X68]:((((subactivity(esk11_3(X66,X67,X68),X66)|~(min_precedes(X67,X68,X66)))&(subactivity(esk12_3(X66,X67,X68),X66)|~(min_precedes(X67,X68,X66))))&(atocc(X67,esk11_3(X66,X67,X68))|~(min_precedes(X67,X68,X66))))&(atocc(X68,esk12_3(X66,X67,X68))|~(min_precedes(X67,X68,X66)))),inference(distribute,[status(thm)],[158])).
% cnf(161,plain,(atocc(X1,esk11_3(X3,X1,X2))|~min_precedes(X1,X2,X3)),inference(split_conjunct,[status(thm)],[159])).
% fof(244, plain,![X107]:![X108]:((~(atocc(X107,X108))|?[X109]:((subactivity(X108,X109)&atomic(X109))&occurrence_of(X107,X109)))&(![X109]:((~(subactivity(X108,X109))|~(atomic(X109)))|~(occurrence_of(X107,X109)))|atocc(X107,X108))),inference(fof_nnf,[status(thm)],[48])).
% fof(245, plain,![X110]:![X111]:((~(atocc(X110,X111))|?[X112]:((subactivity(X111,X112)&atomic(X112))&occurrence_of(X110,X112)))&(![X113]:((~(subactivity(X111,X113))|~(atomic(X113)))|~(occurrence_of(X110,X113)))|atocc(X110,X111))),inference(variable_rename,[status(thm)],[244])).
% fof(246, plain,![X110]:![X111]:((~(atocc(X110,X111))|((subactivity(X111,esk18_2(X110,X111))&atomic(esk18_2(X110,X111)))&occurrence_of(X110,esk18_2(X110,X111))))&(![X113]:((~(subactivity(X111,X113))|~(atomic(X113)))|~(occurrence_of(X110,X113)))|atocc(X110,X111))),inference(skolemize,[status(esa)],[245])).
% fof(247, plain,![X110]:![X111]:![X113]:((((~(subactivity(X111,X113))|~(atomic(X113)))|~(occurrence_of(X110,X113)))|atocc(X110,X111))&(~(atocc(X110,X111))|((subactivity(X111,esk18_2(X110,X111))&atomic(esk18_2(X110,X111)))&occurrence_of(X110,esk18_2(X110,X111))))),inference(shift_quantors,[status(thm)],[246])).
% fof(248, plain,![X110]:![X111]:![X113]:((((~(subactivity(X111,X113))|~(atomic(X113)))|~(occurrence_of(X110,X113)))|atocc(X110,X111))&(((subactivity(X111,esk18_2(X110,X111))|~(atocc(X110,X111)))&(atomic(esk18_2(X110,X111))|~(atocc(X110,X111))))&(occurrence_of(X110,esk18_2(X110,X111))|~(atocc(X110,X111))))),inference(distribute,[status(thm)],[247])).
% cnf(249,plain,(occurrence_of(X1,esk18_2(X1,X2))|~atocc(X1,X2)),inference(split_conjunct,[status(thm)],[248])).
% cnf(250,plain,(atomic(esk18_2(X1,X2))|~atocc(X1,X2)),inference(split_conjunct,[status(thm)],[248])).
% fof(253, negated_conjecture,?[X110]:(occurrence_of(X110,tptp0)&![X111]:![X112]:((~(leaf_occ(X112,X110))|(occurrence_of(X112,tptp1)&?[X113]:(occurrence_of(X113,tptp2)&min_precedes(X111,X113,tptp0))))|(occurrence_of(X112,tptp2)&?[X114]:(occurrence_of(X114,tptp1)&min_precedes(X111,X114,tptp0))))),inference(fof_nnf,[status(thm)],[50])).
% fof(254, negated_conjecture,?[X115]:(occurrence_of(X115,tptp0)&![X116]:![X117]:((~(leaf_occ(X117,X115))|(occurrence_of(X117,tptp1)&?[X118]:(occurrence_of(X118,tptp2)&min_precedes(X116,X118,tptp0))))|(occurrence_of(X117,tptp2)&?[X119]:(occurrence_of(X119,tptp1)&min_precedes(X116,X119,tptp0))))),inference(variable_rename,[status(thm)],[253])).
% fof(255, negated_conjecture,(occurrence_of(esk19_0,tptp0)&![X116]:![X117]:((~(leaf_occ(X117,esk19_0))|(occurrence_of(X117,tptp1)&(occurrence_of(esk20_2(X116,X117),tptp2)&min_precedes(X116,esk20_2(X116,X117),tptp0))))|(occurrence_of(X117,tptp2)&(occurrence_of(esk21_2(X116,X117),tptp1)&min_precedes(X116,esk21_2(X116,X117),tptp0))))),inference(skolemize,[status(esa)],[254])).
% fof(256, negated_conjecture,![X116]:![X117]:(((~(leaf_occ(X117,esk19_0))|(occurrence_of(X117,tptp1)&(occurrence_of(esk20_2(X116,X117),tptp2)&min_precedes(X116,esk20_2(X116,X117),tptp0))))|(occurrence_of(X117,tptp2)&(occurrence_of(esk21_2(X116,X117),tptp1)&min_precedes(X116,esk21_2(X116,X117),tptp0))))&occurrence_of(esk19_0,tptp0)),inference(shift_quantors,[status(thm)],[255])).
% fof(257, negated_conjecture,![X116]:![X117]:((((occurrence_of(X117,tptp2)|(occurrence_of(X117,tptp1)|~(leaf_occ(X117,esk19_0))))&((occurrence_of(esk21_2(X116,X117),tptp1)|(occurrence_of(X117,tptp1)|~(leaf_occ(X117,esk19_0))))&(min_precedes(X116,esk21_2(X116,X117),tptp0)|(occurrence_of(X117,tptp1)|~(leaf_occ(X117,esk19_0))))))&(((occurrence_of(X117,tptp2)|(occurrence_of(esk20_2(X116,X117),tptp2)|~(leaf_occ(X117,esk19_0))))&((occurrence_of(esk21_2(X116,X117),tptp1)|(occurrence_of(esk20_2(X116,X117),tptp2)|~(leaf_occ(X117,esk19_0))))&(min_precedes(X116,esk21_2(X116,X117),tptp0)|(occurrence_of(esk20_2(X116,X117),tptp2)|~(leaf_occ(X117,esk19_0))))))&((occurrence_of(X117,tptp2)|(min_precedes(X116,esk20_2(X116,X117),tptp0)|~(leaf_occ(X117,esk19_0))))&((occurrence_of(esk21_2(X116,X117),tptp1)|(min_precedes(X116,esk20_2(X116,X117),tptp0)|~(leaf_occ(X117,esk19_0))))&(min_precedes(X116,esk21_2(X116,X117),tptp0)|(min_precedes(X116,esk20_2(X116,X117),tptp0)|~(leaf_occ(X117,esk19_0))))))))&occurrence_of(esk19_0,tptp0)),inference(distribute,[status(thm)],[256])).
% cnf(258,negated_conjecture,(occurrence_of(esk19_0,tptp0)),inference(split_conjunct,[status(thm)],[257])).
% cnf(259,negated_conjecture,(min_precedes(X2,esk20_2(X2,X1),tptp0)|min_precedes(X2,esk21_2(X2,X1),tptp0)|~leaf_occ(X1,esk19_0)),inference(split_conjunct,[status(thm)],[257])).
% cnf(268,negated_conjecture,(X1=tptp0|~occurrence_of(esk19_0,X1)),inference(spm,[status(thm)],[111,258,theory(equality)])).
% cnf(486,negated_conjecture,(esk18_2(esk19_0,X1)=tptp0|~atocc(esk19_0,X1)),inference(spm,[status(thm)],[268,249,theory(equality)])).
% cnf(595,negated_conjecture,(atomic(tptp0)|~atocc(esk19_0,X1)),inference(spm,[status(thm)],[250,486,theory(equality)])).
% cnf(598,negated_conjecture,(~atocc(esk19_0,X1)),inference(sr,[status(thm)],[595,70,theory(equality)])).
% cnf(602,negated_conjecture,(~min_precedes(esk19_0,X2,X1)),inference(spm,[status(thm)],[598,161,theory(equality)])).
% cnf(610,negated_conjecture,(min_precedes(esk19_0,esk21_2(esk19_0,X1),tptp0)|~leaf_occ(X1,esk19_0)),inference(spm,[status(thm)],[602,259,theory(equality)])).
% cnf(613,negated_conjecture,(~leaf_occ(X1,esk19_0)),inference(sr,[status(thm)],[610,602,theory(equality)])).
% cnf(614,negated_conjecture,(~occurrence_of(esk19_0,tptp0)),inference(spm,[status(thm)],[613,75,theory(equality)])).
% cnf(615,negated_conjecture,($false),inference(rw,[status(thm)],[614,258,theory(equality)])).
% cnf(616,negated_conjecture,($false),inference(cn,[status(thm)],[615,theory(equality)])).
% cnf(617,negated_conjecture,($false),616,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 136
% # ...of these trivial : 0
% # ...subsumed : 14
% # ...remaining for further processing: 122
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 301
% # ...of the previous two non-trivial : 274
% # Contextual simplify-reflections : 1
% # Paramodulations : 301
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 122
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 13
% # Non-unit-clauses : 100
% # Current number of unprocessed clauses: 233
% # ...number of literals in the above : 803
% # Clause-clause subsumption calls (NU) : 201
% # Rec. Clause-clause subsumption calls : 158
% # Unit Clause-clause subsumption calls : 16
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 110 leaves, 1.59+/-1.460 terms/leaf
% # Paramod-from index: 56 leaves, 1.05+/-0.225 terms/leaf
% # Paramod-into index: 102 leaves, 1.36+/-0.948 terms/leaf
% # -------------------------------------------------
% # User time : 0.027 s
% # System time : 0.006 s
% # Total time : 0.033 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP13552/PRO010+1.tptp
%
%------------------------------------------------------------------------------