%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PRO012+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:11:52 EST 2010
% Result : Theorem 1.18s
% Output : Solution 1.18s
% 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/SystemOnTPTP14330/PRO012+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14330/PRO012+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14330/PRO012+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 14426
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.019 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(3, axiom,![X9]:(occurrence_of(X9,tptp0)=>?[X10]:?[X11]:?[X12]:((((((occurrence_of(X10,tptp3)&root_occ(X10,X9))&occurrence_of(X11,tptp4))&min_precedes(X10,X11,tptp0))&(occurrence_of(X12,tptp2)|occurrence_of(X12,tptp1)))&min_precedes(X11,X12,tptp0))&![X13]:(min_precedes(X10,X13,tptp0)=>(X13=X11|X13=X12)))),file('/tmp/SRASS.s.p', sos_32)).
% fof(46, conjecture,![X101]:(occurrence_of(X101,tptp0)=>?[X102]:?[X103]:(((occurrence_of(X102,tptp3)&root_occ(X102,X101))&(occurrence_of(X103,tptp2)|occurrence_of(X103,tptp1)))&min_precedes(X102,X103,tptp0))),file('/tmp/SRASS.s.p', goals)).
% fof(47, negated_conjecture,~(![X101]:(occurrence_of(X101,tptp0)=>?[X102]:?[X103]:(((occurrence_of(X102,tptp3)&root_occ(X102,X101))&(occurrence_of(X103,tptp2)|occurrence_of(X103,tptp1)))&min_precedes(X102,X103,tptp0)))),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(62, plain,![X9]:(~(occurrence_of(X9,tptp0))|?[X10]:?[X11]:?[X12]:((((((occurrence_of(X10,tptp3)&root_occ(X10,X9))&occurrence_of(X11,tptp4))&min_precedes(X10,X11,tptp0))&(occurrence_of(X12,tptp2)|occurrence_of(X12,tptp1)))&min_precedes(X11,X12,tptp0))&![X13]:(~(min_precedes(X10,X13,tptp0))|(X13=X11|X13=X12)))),inference(fof_nnf,[status(thm)],[3])).
% fof(63, plain,![X14]:(~(occurrence_of(X14,tptp0))|?[X15]:?[X16]:?[X17]:((((((occurrence_of(X15,tptp3)&root_occ(X15,X14))&occurrence_of(X16,tptp4))&min_precedes(X15,X16,tptp0))&(occurrence_of(X17,tptp2)|occurrence_of(X17,tptp1)))&min_precedes(X16,X17,tptp0))&![X18]:(~(min_precedes(X15,X18,tptp0))|(X18=X16|X18=X17)))),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X14]:(~(occurrence_of(X14,tptp0))|((((((occurrence_of(esk1_1(X14),tptp3)&root_occ(esk1_1(X14),X14))&occurrence_of(esk2_1(X14),tptp4))&min_precedes(esk1_1(X14),esk2_1(X14),tptp0))&(occurrence_of(esk3_1(X14),tptp2)|occurrence_of(esk3_1(X14),tptp1)))&min_precedes(esk2_1(X14),esk3_1(X14),tptp0))&![X18]:(~(min_precedes(esk1_1(X14),X18,tptp0))|(X18=esk2_1(X14)|X18=esk3_1(X14))))),inference(skolemize,[status(esa)],[63])).
% fof(65, plain,![X14]:![X18]:(((~(min_precedes(esk1_1(X14),X18,tptp0))|(X18=esk2_1(X14)|X18=esk3_1(X14)))&(((((occurrence_of(esk1_1(X14),tptp3)&root_occ(esk1_1(X14),X14))&occurrence_of(esk2_1(X14),tptp4))&min_precedes(esk1_1(X14),esk2_1(X14),tptp0))&(occurrence_of(esk3_1(X14),tptp2)|occurrence_of(esk3_1(X14),tptp1)))&min_precedes(esk2_1(X14),esk3_1(X14),tptp0)))|~(occurrence_of(X14,tptp0))),inference(shift_quantors,[status(thm)],[64])).
% fof(66, plain,![X14]:![X18]:(((~(min_precedes(esk1_1(X14),X18,tptp0))|(X18=esk2_1(X14)|X18=esk3_1(X14)))|~(occurrence_of(X14,tptp0)))&((((((occurrence_of(esk1_1(X14),tptp3)|~(occurrence_of(X14,tptp0)))&(root_occ(esk1_1(X14),X14)|~(occurrence_of(X14,tptp0))))&(occurrence_of(esk2_1(X14),tptp4)|~(occurrence_of(X14,tptp0))))&(min_precedes(esk1_1(X14),esk2_1(X14),tptp0)|~(occurrence_of(X14,tptp0))))&((occurrence_of(esk3_1(X14),tptp2)|occurrence_of(esk3_1(X14),tptp1))|~(occurrence_of(X14,tptp0))))&(min_precedes(esk2_1(X14),esk3_1(X14),tptp0)|~(occurrence_of(X14,tptp0))))),inference(distribute,[status(thm)],[65])).
% cnf(67,plain,(min_precedes(esk2_1(X1),esk3_1(X1),tptp0)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,plain,(occurrence_of(esk3_1(X1),tptp1)|occurrence_of(esk3_1(X1),tptp2)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(69,plain,(min_precedes(esk1_1(X1),esk2_1(X1),tptp0)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(71,plain,(root_occ(esk1_1(X1),X1)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[66])).
% cnf(72,plain,(occurrence_of(esk1_1(X1),tptp3)|~occurrence_of(X1,tptp0)),inference(split_conjunct,[status(thm)],[66])).
% fof(242, negated_conjecture,?[X101]:(occurrence_of(X101,tptp0)&![X102]:![X103]:(((~(occurrence_of(X102,tptp3))|~(root_occ(X102,X101)))|(~(occurrence_of(X103,tptp2))&~(occurrence_of(X103,tptp1))))|~(min_precedes(X102,X103,tptp0)))),inference(fof_nnf,[status(thm)],[47])).
% fof(243, negated_conjecture,?[X104]:(occurrence_of(X104,tptp0)&![X105]:![X106]:(((~(occurrence_of(X105,tptp3))|~(root_occ(X105,X104)))|(~(occurrence_of(X106,tptp2))&~(occurrence_of(X106,tptp1))))|~(min_precedes(X105,X106,tptp0)))),inference(variable_rename,[status(thm)],[242])).
% fof(244, negated_conjecture,(occurrence_of(esk18_0,tptp0)&![X105]:![X106]:(((~(occurrence_of(X105,tptp3))|~(root_occ(X105,esk18_0)))|(~(occurrence_of(X106,tptp2))&~(occurrence_of(X106,tptp1))))|~(min_precedes(X105,X106,tptp0)))),inference(skolemize,[status(esa)],[243])).
% fof(245, negated_conjecture,![X105]:![X106]:((((~(occurrence_of(X105,tptp3))|~(root_occ(X105,esk18_0)))|(~(occurrence_of(X106,tptp2))&~(occurrence_of(X106,tptp1))))|~(min_precedes(X105,X106,tptp0)))&occurrence_of(esk18_0,tptp0)),inference(shift_quantors,[status(thm)],[244])).
% fof(246, negated_conjecture,![X105]:![X106]:((((~(occurrence_of(X106,tptp2))|(~(occurrence_of(X105,tptp3))|~(root_occ(X105,esk18_0))))|~(min_precedes(X105,X106,tptp0)))&((~(occurrence_of(X106,tptp1))|(~(occurrence_of(X105,tptp3))|~(root_occ(X105,esk18_0))))|~(min_precedes(X105,X106,tptp0))))&occurrence_of(esk18_0,tptp0)),inference(distribute,[status(thm)],[245])).
% cnf(247,negated_conjecture,(occurrence_of(esk18_0,tptp0)),inference(split_conjunct,[status(thm)],[246])).
% cnf(248,negated_conjecture,(~min_precedes(X1,X2,tptp0)|~root_occ(X1,esk18_0)|~occurrence_of(X1,tptp3)|~occurrence_of(X2,tptp1)),inference(split_conjunct,[status(thm)],[246])).
% cnf(249,negated_conjecture,(~min_precedes(X1,X2,tptp0)|~root_occ(X1,esk18_0)|~occurrence_of(X1,tptp3)|~occurrence_of(X2,tptp2)),inference(split_conjunct,[status(thm)],[246])).
% cnf(327,plain,(min_precedes(X1,esk3_1(X2),tptp0)|~min_precedes(X1,esk2_1(X2),tptp0)|~occurrence_of(X2,tptp0)),inference(spm,[status(thm)],[57,67,theory(equality)])).
% cnf(1045,negated_conjecture,(~root_occ(X1,esk18_0)|~occurrence_of(esk3_1(X2),tptp2)|~occurrence_of(X1,tptp3)|~occurrence_of(X2,tptp0)|~min_precedes(X1,esk2_1(X2),tptp0)),inference(spm,[status(thm)],[249,327,theory(equality)])).
% cnf(1046,negated_conjecture,(~root_occ(X1,esk18_0)|~occurrence_of(esk3_1(X2),tptp1)|~occurrence_of(X1,tptp3)|~occurrence_of(X2,tptp0)|~min_precedes(X1,esk2_1(X2),tptp0)),inference(spm,[status(thm)],[248,327,theory(equality)])).
% cnf(4106,negated_conjecture,(~root_occ(esk1_1(X1),esk18_0)|~occurrence_of(esk3_1(X1),tptp2)|~occurrence_of(esk1_1(X1),tptp3)|~occurrence_of(X1,tptp0)),inference(spm,[status(thm)],[1045,69,theory(equality)])).
% cnf(4108,negated_conjecture,(~root_occ(esk1_1(X1),esk18_0)|~occurrence_of(esk3_1(X1),tptp2)|~occurrence_of(X1,tptp0)),inference(csr,[status(thm)],[4106,72])).
% cnf(4111,negated_conjecture,(~occurrence_of(esk3_1(esk18_0),tptp2)|~occurrence_of(esk18_0,tptp0)),inference(spm,[status(thm)],[4108,71,theory(equality)])).
% cnf(4116,negated_conjecture,(~occurrence_of(esk3_1(esk18_0),tptp2)|$false),inference(rw,[status(thm)],[4111,247,theory(equality)])).
% cnf(4117,negated_conjecture,(~occurrence_of(esk3_1(esk18_0),tptp2)),inference(cn,[status(thm)],[4116,theory(equality)])).
% cnf(4475,negated_conjecture,(~root_occ(esk1_1(X1),esk18_0)|~occurrence_of(esk3_1(X1),tptp1)|~occurrence_of(esk1_1(X1),tptp3)|~occurrence_of(X1,tptp0)),inference(spm,[status(thm)],[1046,69,theory(equality)])).
% cnf(4477,negated_conjecture,(~root_occ(esk1_1(X1),esk18_0)|~occurrence_of(esk3_1(X1),tptp1)|~occurrence_of(X1,tptp0)),inference(csr,[status(thm)],[4475,72])).
% cnf(4480,negated_conjecture,(~occurrence_of(esk3_1(esk18_0),tptp1)|~occurrence_of(esk18_0,tptp0)),inference(spm,[status(thm)],[4477,71,theory(equality)])).
% cnf(4485,negated_conjecture,(~occurrence_of(esk3_1(esk18_0),tptp1)|$false),inference(rw,[status(thm)],[4480,247,theory(equality)])).
% cnf(4486,negated_conjecture,(~occurrence_of(esk3_1(esk18_0),tptp1)),inference(cn,[status(thm)],[4485,theory(equality)])).
% cnf(4489,negated_conjecture,(occurrence_of(esk3_1(esk18_0),tptp2)|~occurrence_of(esk18_0,tptp0)),inference(spm,[status(thm)],[4486,68,theory(equality)])).
% cnf(4490,negated_conjecture,(occurrence_of(esk3_1(esk18_0),tptp2)|$false),inference(rw,[status(thm)],[4489,247,theory(equality)])).
% cnf(4491,negated_conjecture,(occurrence_of(esk3_1(esk18_0),tptp2)),inference(cn,[status(thm)],[4490,theory(equality)])).
% cnf(4492,negated_conjecture,($false),inference(sr,[status(thm)],[4491,4117,theory(equality)])).
% cnf(4493,negated_conjecture,($false),4492,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1321
% # ...of these trivial : 5
% # ...subsumed : 774
% # ...remaining for further processing: 542
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 34
% # Backward-rewritten : 8
% # Generated clauses : 3014
% # ...of the previous two non-trivial : 2624
% # Contextual simplify-reflections : 488
% # Paramodulations : 3012
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 500
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 22
% # Non-unit-clauses : 456
% # Current number of unprocessed clauses: 1256
% # ...number of literals in the above : 5249
% # Clause-clause subsumption calls (NU) : 11844
% # Rec. Clause-clause subsumption calls : 8641
% # Unit Clause-clause subsumption calls : 152
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 403 leaves, 1.38+/-1.174 terms/leaf
% # Paramod-from index: 182 leaves, 1.06+/-0.281 terms/leaf
% # Paramod-into index: 355 leaves, 1.26+/-0.860 terms/leaf
% # -------------------------------------------------
% # User time : 0.184 s
% # System time : 0.006 s
% # Total time : 0.190 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.32 CPU 0.41 WC
% FINAL PrfWatch: 0.32 CPU 0.41 WC
% SZS output end Solution for /tmp/SystemOnTPTP14330/PRO012+2.tptp
%
%------------------------------------------------------------------------------