%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRA005+1 : TPTP v5.0.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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 05:40:41 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP28221/GRA005+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28221/GRA005+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28221/GRA005+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 28317
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X2]:![X3]:![X4]:![X5]:![X6]:((shortest_path(X2,X3,X6)&precedes(X4,X5,X6))=>(~(?[X7]:(tail_of(X7)=tail_of(X4)&head_of(X7)=head_of(X5)))&~(precedes(X5,X4,X6)))),file('/tmp/SRASS.s.p', shortest_path_properties)).
% fof(18, conjecture,![X2]:![X3]:![X4]:![X5]:![X6]:((shortest_path(X2,X3,X6)&precedes(X4,X5,X6))=>~(?[X7]:((edge(X7)&tail_of(X7)=tail_of(X4))&head_of(X7)=head_of(X5)))),file('/tmp/SRASS.s.p', no_short_cut_edge)).
% fof(19, negated_conjecture,~(![X2]:![X3]:![X4]:![X5]:![X6]:((shortest_path(X2,X3,X6)&precedes(X4,X5,X6))=>~(?[X7]:((edge(X7)&tail_of(X7)=tail_of(X4))&head_of(X7)=head_of(X5))))),inference(assume_negation,[status(cth)],[18])).
% fof(20, plain,![X2]:![X3]:![X4]:![X5]:![X6]:((shortest_path(X2,X3,X6)&precedes(X4,X5,X6))=>(~(?[X7]:(tail_of(X7)=tail_of(X4)&head_of(X7)=head_of(X5)))&~(precedes(X5,X4,X6)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(29, plain,![X2]:![X3]:![X4]:![X5]:![X6]:((~(shortest_path(X2,X3,X6))|~(precedes(X4,X5,X6)))|(![X7]:(~(tail_of(X7)=tail_of(X4))|~(head_of(X7)=head_of(X5)))&~(precedes(X5,X4,X6)))),inference(fof_nnf,[status(thm)],[20])).
% fof(30, plain,![X8]:![X9]:![X10]:![X11]:![X12]:((~(shortest_path(X8,X9,X12))|~(precedes(X10,X11,X12)))|(![X13]:(~(tail_of(X13)=tail_of(X10))|~(head_of(X13)=head_of(X11)))&~(precedes(X11,X10,X12)))),inference(variable_rename,[status(thm)],[29])).
% fof(31, plain,![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:(((~(tail_of(X13)=tail_of(X10))|~(head_of(X13)=head_of(X11)))&~(precedes(X11,X10,X12)))|(~(shortest_path(X8,X9,X12))|~(precedes(X10,X11,X12)))),inference(shift_quantors,[status(thm)],[30])).
% fof(32, plain,![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:(((~(tail_of(X13)=tail_of(X10))|~(head_of(X13)=head_of(X11)))|(~(shortest_path(X8,X9,X12))|~(precedes(X10,X11,X12))))&(~(precedes(X11,X10,X12))|(~(shortest_path(X8,X9,X12))|~(precedes(X10,X11,X12))))),inference(distribute,[status(thm)],[31])).
% cnf(34,plain,(~precedes(X1,X2,X3)|~shortest_path(X4,X5,X3)|head_of(X6)!=head_of(X2)|tail_of(X6)!=tail_of(X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(145, negated_conjecture,?[X2]:?[X3]:?[X4]:?[X5]:?[X6]:((shortest_path(X2,X3,X6)&precedes(X4,X5,X6))&?[X7]:((edge(X7)&tail_of(X7)=tail_of(X4))&head_of(X7)=head_of(X5))),inference(fof_nnf,[status(thm)],[19])).
% fof(146, negated_conjecture,?[X8]:?[X9]:?[X10]:?[X11]:?[X12]:((shortest_path(X8,X9,X12)&precedes(X10,X11,X12))&?[X13]:((edge(X13)&tail_of(X13)=tail_of(X10))&head_of(X13)=head_of(X11))),inference(variable_rename,[status(thm)],[145])).
% fof(147, negated_conjecture,((shortest_path(esk9_0,esk10_0,esk13_0)&precedes(esk11_0,esk12_0,esk13_0))&((edge(esk14_0)&tail_of(esk14_0)=tail_of(esk11_0))&head_of(esk14_0)=head_of(esk12_0))),inference(skolemize,[status(esa)],[146])).
% cnf(148,negated_conjecture,(head_of(esk14_0)=head_of(esk12_0)),inference(split_conjunct,[status(thm)],[147])).
% cnf(149,negated_conjecture,(tail_of(esk14_0)=tail_of(esk11_0)),inference(split_conjunct,[status(thm)],[147])).
% cnf(151,negated_conjecture,(precedes(esk11_0,esk12_0,esk13_0)),inference(split_conjunct,[status(thm)],[147])).
% cnf(152,negated_conjecture,(shortest_path(esk9_0,esk10_0,esk13_0)),inference(split_conjunct,[status(thm)],[147])).
% cnf(169,negated_conjecture,(head_of(esk12_0)!=head_of(X1)|tail_of(esk11_0)!=tail_of(X1)|~shortest_path(X2,X3,esk13_0)),inference(spm,[status(thm)],[34,151,theory(equality)])).
% cnf(170,negated_conjecture,(head_of(esk14_0)!=head_of(X1)|tail_of(esk11_0)!=tail_of(X1)|~shortest_path(X2,X3,esk13_0)),inference(rw,[status(thm)],[169,148,theory(equality)])).
% cnf(171,negated_conjecture,(head_of(esk14_0)!=head_of(X1)|tail_of(esk14_0)!=tail_of(X1)|~shortest_path(X2,X3,esk13_0)),inference(rw,[status(thm)],[170,149,theory(equality)])).
% fof(262, plain,(~(epred1_0)<=>![X1]:(~(tail_of(esk14_0)=tail_of(X1))|~(head_of(esk14_0)=head_of(X1)))),introduced(definition),['split']).
% cnf(263,plain,(epred1_0|tail_of(esk14_0)!=tail_of(X1)|head_of(esk14_0)!=head_of(X1)),inference(split_equiv,[status(thm)],[262])).
% fof(264, plain,(~(epred2_0)<=>![X3]:![X2]:~(shortest_path(X2,X3,esk13_0))),introduced(definition),['split']).
% cnf(265,plain,(epred2_0|~shortest_path(X2,X3,esk13_0)),inference(split_equiv,[status(thm)],[264])).
% cnf(266,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[171,262,theory(equality)]),264,theory(equality)]),['split']).
% cnf(267,negated_conjecture,(epred2_0),inference(spm,[status(thm)],[265,152,theory(equality)])).
% cnf(268,negated_conjecture,($false|~epred1_0),inference(rw,[status(thm)],[266,267,theory(equality)])).
% cnf(269,negated_conjecture,(~epred1_0),inference(cn,[status(thm)],[268,theory(equality)])).
% cnf(275,negated_conjecture,(tail_of(esk14_0)!=tail_of(X1)|head_of(esk14_0)!=head_of(X1)),inference(sr,[status(thm)],[263,269,theory(equality)])).
% cnf(276,negated_conjecture,($false),inference(er,[status(thm)],[275,theory(equality)])).
% cnf(282,negated_conjecture,($false),276,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 145
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 145
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 116
% # ...of the previous two non-trivial : 100
% # Contextual simplify-reflections : 5
% # Paramodulations : 109
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 77
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 62
% # Current number of unprocessed clauses: 81
% # ...number of literals in the above : 360
% # Clause-clause subsumption calls (NU) : 153
% # Rec. Clause-clause subsumption calls : 88
% # Unit Clause-clause subsumption calls : 94
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 92 leaves, 1.47+/-1.402 terms/leaf
% # Paramod-from index: 30 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 66 leaves, 1.26+/-0.804 terms/leaf
% # -------------------------------------------------
% # User time : 0.030 s
% # System time : 0.002 s
% # Total time : 0.032 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/SystemOnTPTP28221/GRA005+1.tptp
%
%------------------------------------------------------------------------------