TSTP Solution File: GRA008+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRA008+2 : 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:41:00 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP28739/GRA008+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28739/GRA008+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28739/GRA008+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 28835
% 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(1, axiom,![X1]:![X2]:![X3]:(triangle(X1,X2,X3)<=>(((((edge(X1)&edge(X2))&edge(X3))&sequential(X1,X2))&sequential(X2,X3))&sequential(X3,X1))),file('/tmp/SRASS.s.p', triangle_defn)).
% fof(2, axiom,(complete=>![X4]:![X5]:![X1]:![X2]:![X6]:((shortest_path(X4,X5,X6)&precedes(X1,X2,X6))=>?[X3]:((edge(X3)&tail_of(X3)=head_of(X2))&head_of(X3)=tail_of(X1)))),file('/tmp/SRASS.s.p', back_edge)).
% fof(3, axiom,![X4]:![X5]:![X1]:![X2]:![X6]:((shortest_path(X4,X5,X6)&precedes(X1,X2,X6))=>(~(?[X3]:(tail_of(X3)=tail_of(X1)&head_of(X3)=head_of(X2)))&~(precedes(X2,X1,X6)))),file('/tmp/SRASS.s.p', shortest_path_properties)).
% fof(6, axiom,![X7]:(edge(X7)=>~(head_of(X7)=tail_of(X7))),file('/tmp/SRASS.s.p', no_loops)).
% fof(8, axiom,![X1]:![X2]:(sequential(X1,X2)<=>(((edge(X1)&edge(X2))&~(X1=X2))&head_of(X1)=tail_of(X2))),file('/tmp/SRASS.s.p', sequential_defn)).
% fof(19, conjecture,(complete=>![X4]:![X5]:![X1]:![X2]:![X6]:(((shortest_path(X4,X5,X6)&precedes(X1,X2,X6))&sequential(X1,X2))=>?[X3]:triangle(X1,X2,X3))),file('/tmp/SRASS.s.p', sequential_is_triangle)).
% fof(20, negated_conjecture,~((complete=>![X4]:![X5]:![X1]:![X2]:![X6]:(((shortest_path(X4,X5,X6)&precedes(X1,X2,X6))&sequential(X1,X2))=>?[X3]:triangle(X1,X2,X3)))),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X4]:![X5]:![X1]:![X2]:![X6]:((shortest_path(X4,X5,X6)&precedes(X1,X2,X6))=>(~(?[X3]:(tail_of(X3)=tail_of(X1)&head_of(X3)=head_of(X2)))&~(precedes(X2,X1,X6)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(27, plain,![X1]:![X2]:![X3]:((~(triangle(X1,X2,X3))|(((((edge(X1)&edge(X2))&edge(X3))&sequential(X1,X2))&sequential(X2,X3))&sequential(X3,X1)))&((((((~(edge(X1))|~(edge(X2)))|~(edge(X3)))|~(sequential(X1,X2)))|~(sequential(X2,X3)))|~(sequential(X3,X1)))|triangle(X1,X2,X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(28, plain,![X4]:![X5]:![X6]:((~(triangle(X4,X5,X6))|(((((edge(X4)&edge(X5))&edge(X6))&sequential(X4,X5))&sequential(X5,X6))&sequential(X6,X4)))&((((((~(edge(X4))|~(edge(X5)))|~(edge(X6)))|~(sequential(X4,X5)))|~(sequential(X5,X6)))|~(sequential(X6,X4)))|triangle(X4,X5,X6))),inference(variable_rename,[status(thm)],[27])).
% fof(29, plain,![X4]:![X5]:![X6]:(((((((edge(X4)|~(triangle(X4,X5,X6)))&(edge(X5)|~(triangle(X4,X5,X6))))&(edge(X6)|~(triangle(X4,X5,X6))))&(sequential(X4,X5)|~(triangle(X4,X5,X6))))&(sequential(X5,X6)|~(triangle(X4,X5,X6))))&(sequential(X6,X4)|~(triangle(X4,X5,X6))))&((((((~(edge(X4))|~(edge(X5)))|~(edge(X6)))|~(sequential(X4,X5)))|~(sequential(X5,X6)))|~(sequential(X6,X4)))|triangle(X4,X5,X6))),inference(distribute,[status(thm)],[28])).
% cnf(30,plain,(triangle(X1,X2,X3)|~sequential(X3,X1)|~sequential(X2,X3)|~sequential(X1,X2)|~edge(X3)|~edge(X2)|~edge(X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(37, plain,(~(complete)|![X4]:![X5]:![X1]:![X2]:![X6]:((~(shortest_path(X4,X5,X6))|~(precedes(X1,X2,X6)))|?[X3]:((edge(X3)&tail_of(X3)=head_of(X2))&head_of(X3)=tail_of(X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(38, plain,(~(complete)|![X7]:![X8]:![X9]:![X10]:![X11]:((~(shortest_path(X7,X8,X11))|~(precedes(X9,X10,X11)))|?[X12]:((edge(X12)&tail_of(X12)=head_of(X10))&head_of(X12)=tail_of(X9)))),inference(variable_rename,[status(thm)],[37])).
% fof(39, plain,(~(complete)|![X7]:![X8]:![X9]:![X10]:![X11]:((~(shortest_path(X7,X8,X11))|~(precedes(X9,X10,X11)))|((edge(esk1_5(X7,X8,X9,X10,X11))&tail_of(esk1_5(X7,X8,X9,X10,X11))=head_of(X10))&head_of(esk1_5(X7,X8,X9,X10,X11))=tail_of(X9)))),inference(skolemize,[status(esa)],[38])).
% fof(40, plain,![X7]:![X8]:![X9]:![X10]:![X11]:(((~(shortest_path(X7,X8,X11))|~(precedes(X9,X10,X11)))|((edge(esk1_5(X7,X8,X9,X10,X11))&tail_of(esk1_5(X7,X8,X9,X10,X11))=head_of(X10))&head_of(esk1_5(X7,X8,X9,X10,X11))=tail_of(X9)))|~(complete)),inference(shift_quantors,[status(thm)],[39])).
% fof(41, plain,![X7]:![X8]:![X9]:![X10]:![X11]:((((edge(esk1_5(X7,X8,X9,X10,X11))|(~(shortest_path(X7,X8,X11))|~(precedes(X9,X10,X11))))|~(complete))&((tail_of(esk1_5(X7,X8,X9,X10,X11))=head_of(X10)|(~(shortest_path(X7,X8,X11))|~(precedes(X9,X10,X11))))|~(complete)))&((head_of(esk1_5(X7,X8,X9,X10,X11))=tail_of(X9)|(~(shortest_path(X7,X8,X11))|~(precedes(X9,X10,X11))))|~(complete))),inference(distribute,[status(thm)],[40])).
% cnf(42,plain,(head_of(esk1_5(X4,X5,X1,X2,X3))=tail_of(X1)|~complete|~precedes(X1,X2,X3)|~shortest_path(X4,X5,X3)),inference(split_conjunct,[status(thm)],[41])).
% cnf(43,plain,(tail_of(esk1_5(X4,X5,X1,X2,X3))=head_of(X2)|~complete|~precedes(X1,X2,X3)|~shortest_path(X4,X5,X3)),inference(split_conjunct,[status(thm)],[41])).
% cnf(44,plain,(edge(esk1_5(X4,X5,X1,X2,X3))|~complete|~precedes(X1,X2,X3)|~shortest_path(X4,X5,X3)),inference(split_conjunct,[status(thm)],[41])).
% fof(45, plain,![X4]:![X5]:![X1]:![X2]:![X6]:((~(shortest_path(X4,X5,X6))|~(precedes(X1,X2,X6)))|(![X3]:(~(tail_of(X3)=tail_of(X1))|~(head_of(X3)=head_of(X2)))&~(precedes(X2,X1,X6)))),inference(fof_nnf,[status(thm)],[21])).
% fof(46, plain,![X7]:![X8]:![X9]:![X10]:![X11]:((~(shortest_path(X7,X8,X11))|~(precedes(X9,X10,X11)))|(![X12]:(~(tail_of(X12)=tail_of(X9))|~(head_of(X12)=head_of(X10)))&~(precedes(X10,X9,X11)))),inference(variable_rename,[status(thm)],[45])).
% fof(47, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:(((~(tail_of(X12)=tail_of(X9))|~(head_of(X12)=head_of(X10)))&~(precedes(X10,X9,X11)))|(~(shortest_path(X7,X8,X11))|~(precedes(X9,X10,X11)))),inference(shift_quantors,[status(thm)],[46])).
% fof(48, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:(((~(tail_of(X12)=tail_of(X9))|~(head_of(X12)=head_of(X10)))|(~(shortest_path(X7,X8,X11))|~(precedes(X9,X10,X11))))&(~(precedes(X10,X9,X11))|(~(shortest_path(X7,X8,X11))|~(precedes(X9,X10,X11))))),inference(distribute,[status(thm)],[47])).
% cnf(50,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)],[48])).
% fof(67, plain,![X7]:(~(edge(X7))|~(head_of(X7)=tail_of(X7))),inference(fof_nnf,[status(thm)],[6])).
% fof(68, plain,![X8]:(~(edge(X8))|~(head_of(X8)=tail_of(X8))),inference(variable_rename,[status(thm)],[67])).
% cnf(69,plain,(head_of(X1)!=tail_of(X1)|~edge(X1)),inference(split_conjunct,[status(thm)],[68])).
% fof(81, plain,![X1]:![X2]:((~(sequential(X1,X2))|(((edge(X1)&edge(X2))&~(X1=X2))&head_of(X1)=tail_of(X2)))&((((~(edge(X1))|~(edge(X2)))|X1=X2)|~(head_of(X1)=tail_of(X2)))|sequential(X1,X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(82, plain,![X3]:![X4]:((~(sequential(X3,X4))|(((edge(X3)&edge(X4))&~(X3=X4))&head_of(X3)=tail_of(X4)))&((((~(edge(X3))|~(edge(X4)))|X3=X4)|~(head_of(X3)=tail_of(X4)))|sequential(X3,X4))),inference(variable_rename,[status(thm)],[81])).
% fof(83, plain,![X3]:![X4]:(((((edge(X3)|~(sequential(X3,X4)))&(edge(X4)|~(sequential(X3,X4))))&(~(X3=X4)|~(sequential(X3,X4))))&(head_of(X3)=tail_of(X4)|~(sequential(X3,X4))))&((((~(edge(X3))|~(edge(X4)))|X3=X4)|~(head_of(X3)=tail_of(X4)))|sequential(X3,X4))),inference(distribute,[status(thm)],[82])).
% cnf(84,plain,(sequential(X1,X2)|X1=X2|head_of(X1)!=tail_of(X2)|~edge(X2)|~edge(X1)),inference(split_conjunct,[status(thm)],[83])).
% cnf(85,plain,(head_of(X1)=tail_of(X2)|~sequential(X1,X2)),inference(split_conjunct,[status(thm)],[83])).
% cnf(87,plain,(edge(X2)|~sequential(X1,X2)),inference(split_conjunct,[status(thm)],[83])).
% cnf(88,plain,(edge(X1)|~sequential(X1,X2)),inference(split_conjunct,[status(thm)],[83])).
% fof(154, negated_conjecture,(complete&?[X4]:?[X5]:?[X1]:?[X2]:?[X6]:(((shortest_path(X4,X5,X6)&precedes(X1,X2,X6))&sequential(X1,X2))&![X3]:~(triangle(X1,X2,X3)))),inference(fof_nnf,[status(thm)],[20])).
% fof(155, negated_conjecture,(complete&?[X7]:?[X8]:?[X9]:?[X10]:?[X11]:(((shortest_path(X7,X8,X11)&precedes(X9,X10,X11))&sequential(X9,X10))&![X12]:~(triangle(X9,X10,X12)))),inference(variable_rename,[status(thm)],[154])).
% fof(156, negated_conjecture,(complete&(((shortest_path(esk10_0,esk11_0,esk14_0)&precedes(esk12_0,esk13_0,esk14_0))&sequential(esk12_0,esk13_0))&![X12]:~(triangle(esk12_0,esk13_0,X12)))),inference(skolemize,[status(esa)],[155])).
% fof(157, negated_conjecture,![X12]:((~(triangle(esk12_0,esk13_0,X12))&((shortest_path(esk10_0,esk11_0,esk14_0)&precedes(esk12_0,esk13_0,esk14_0))&sequential(esk12_0,esk13_0)))&complete),inference(shift_quantors,[status(thm)],[156])).
% cnf(158,negated_conjecture,(complete),inference(split_conjunct,[status(thm)],[157])).
% cnf(159,negated_conjecture,(sequential(esk12_0,esk13_0)),inference(split_conjunct,[status(thm)],[157])).
% cnf(160,negated_conjecture,(precedes(esk12_0,esk13_0,esk14_0)),inference(split_conjunct,[status(thm)],[157])).
% cnf(161,negated_conjecture,(shortest_path(esk10_0,esk11_0,esk14_0)),inference(split_conjunct,[status(thm)],[157])).
% cnf(162,negated_conjecture,(~triangle(esk12_0,esk13_0,X1)),inference(split_conjunct,[status(thm)],[157])).
% cnf(169,plain,(edge(esk1_5(X4,X5,X1,X2,X3))|$false|~shortest_path(X4,X5,X3)|~precedes(X1,X2,X3)),inference(rw,[status(thm)],[44,158,theory(equality)])).
% cnf(170,plain,(edge(esk1_5(X4,X5,X1,X2,X3))|~shortest_path(X4,X5,X3)|~precedes(X1,X2,X3)),inference(cn,[status(thm)],[169,theory(equality)])).
% cnf(171,plain,(tail_of(esk1_5(X4,X5,X1,X2,X3))=head_of(X2)|$false|~shortest_path(X4,X5,X3)|~precedes(X1,X2,X3)),inference(rw,[status(thm)],[43,158,theory(equality)])).
% cnf(172,plain,(tail_of(esk1_5(X4,X5,X1,X2,X3))=head_of(X2)|~shortest_path(X4,X5,X3)|~precedes(X1,X2,X3)),inference(cn,[status(thm)],[171,theory(equality)])).
% cnf(173,plain,(head_of(esk1_5(X4,X5,X1,X2,X3))=tail_of(X1)|$false|~shortest_path(X4,X5,X3)|~precedes(X1,X2,X3)),inference(rw,[status(thm)],[42,158,theory(equality)])).
% cnf(174,plain,(head_of(esk1_5(X4,X5,X1,X2,X3))=tail_of(X1)|~shortest_path(X4,X5,X3)|~precedes(X1,X2,X3)),inference(cn,[status(thm)],[173,theory(equality)])).
% cnf(177,plain,(triangle(X1,X2,X3)|~sequential(X3,X1)|~sequential(X2,X3)|~sequential(X1,X2)|~edge(X3)|~edge(X2)),inference(csr,[status(thm)],[30,88])).
% cnf(178,plain,(triangle(X1,X2,X3)|~sequential(X3,X1)|~sequential(X2,X3)|~sequential(X1,X2)|~edge(X3)),inference(csr,[status(thm)],[177,88])).
% cnf(179,plain,(triangle(X1,X2,X3)|~sequential(X3,X1)|~sequential(X2,X3)|~sequential(X1,X2)),inference(csr,[status(thm)],[178,88])).
% cnf(186,negated_conjecture,(edge(esk13_0)),inference(spm,[status(thm)],[87,159,theory(equality)])).
% cnf(187,negated_conjecture,(edge(esk12_0)),inference(spm,[status(thm)],[88,159,theory(equality)])).
% cnf(189,negated_conjecture,(~sequential(X1,esk12_0)|~sequential(esk13_0,X1)|~sequential(esk12_0,esk13_0)),inference(spm,[status(thm)],[162,179,theory(equality)])).
% cnf(196,negated_conjecture,(~sequential(X1,esk12_0)|~sequential(esk13_0,X1)|$false),inference(rw,[status(thm)],[189,159,theory(equality)])).
% cnf(197,negated_conjecture,(~sequential(X1,esk12_0)|~sequential(esk13_0,X1)),inference(cn,[status(thm)],[196,theory(equality)])).
% cnf(198,negated_conjecture,(head_of(esk12_0)=tail_of(esk13_0)),inference(spm,[status(thm)],[85,159,theory(equality)])).
% cnf(220,plain,(head_of(X4)!=head_of(esk1_5(X1,X2,X3,X4,X5))|~edge(esk1_5(X1,X2,X3,X4,X5))|~precedes(X3,X4,X5)|~shortest_path(X1,X2,X5)),inference(spm,[status(thm)],[69,172,theory(equality)])).
% cnf(221,plain,(X1=esk1_5(X2,X3,X4,X5,X6)|sequential(X1,esk1_5(X2,X3,X4,X5,X6))|head_of(X1)!=head_of(X5)|~edge(esk1_5(X2,X3,X4,X5,X6))|~edge(X1)|~precedes(X4,X5,X6)|~shortest_path(X2,X3,X6)),inference(spm,[status(thm)],[84,172,theory(equality)])).
% cnf(223,plain,(esk1_5(X1,X2,X3,X4,X5)=X6|sequential(esk1_5(X1,X2,X3,X4,X5),X6)|tail_of(X3)!=tail_of(X6)|~edge(X6)|~edge(esk1_5(X1,X2,X3,X4,X5))|~precedes(X3,X4,X5)|~shortest_path(X1,X2,X5)),inference(spm,[status(thm)],[84,174,theory(equality)])).
% cnf(225,negated_conjecture,(tail_of(esk12_0)!=tail_of(X1)|head_of(esk13_0)!=head_of(X1)|~shortest_path(X2,X3,esk14_0)),inference(spm,[status(thm)],[50,160,theory(equality)])).
% fof(283, plain,(~(epred1_0)<=>![X1]:(~(head_of(esk13_0)=head_of(X1))|~(tail_of(esk12_0)=tail_of(X1)))),introduced(definition),['split']).
% cnf(284,plain,(epred1_0|head_of(esk13_0)!=head_of(X1)|tail_of(esk12_0)!=tail_of(X1)),inference(split_equiv,[status(thm)],[283])).
% fof(285, plain,(~(epred2_0)<=>![X3]:![X2]:~(shortest_path(X2,X3,esk14_0))),introduced(definition),['split']).
% cnf(286,plain,(epred2_0|~shortest_path(X2,X3,esk14_0)),inference(split_equiv,[status(thm)],[285])).
% cnf(287,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[225,283,theory(equality)]),285,theory(equality)]),['split']).
% cnf(306,negated_conjecture,(epred2_0),inference(spm,[status(thm)],[286,161,theory(equality)])).
% cnf(307,negated_conjecture,($false|~epred1_0),inference(rw,[status(thm)],[287,306,theory(equality)])).
% cnf(308,negated_conjecture,(~epred1_0),inference(cn,[status(thm)],[307,theory(equality)])).
% cnf(310,negated_conjecture,(head_of(esk13_0)!=head_of(X1)|tail_of(esk12_0)!=tail_of(X1)),inference(sr,[status(thm)],[284,308,theory(equality)])).
% cnf(321,negated_conjecture,(tail_of(esk12_0)!=head_of(esk12_0)),inference(spm,[status(thm)],[310,198,theory(equality)])).
% cnf(414,plain,(head_of(esk1_5(X1,X2,X3,X4,X5))!=head_of(X4)|~precedes(X3,X4,X5)|~shortest_path(X1,X2,X5)),inference(csr,[status(thm)],[220,170])).
% cnf(839,plain,(X1=esk1_5(X2,X3,X4,X5,X6)|sequential(X1,esk1_5(X2,X3,X4,X5,X6))|head_of(X1)!=head_of(X5)|~precedes(X4,X5,X6)|~shortest_path(X2,X3,X6)|~edge(X1)),inference(csr,[status(thm)],[221,170])).
% cnf(895,plain,(esk1_5(X1,X2,X3,X4,X5)=X6|sequential(esk1_5(X1,X2,X3,X4,X5),X6)|tail_of(X3)!=tail_of(X6)|~precedes(X3,X4,X5)|~shortest_path(X1,X2,X5)|~edge(X6)),inference(csr,[status(thm)],[223,170])).
% cnf(896,negated_conjecture,(esk1_5(X1,X2,X3,X4,X5)=esk12_0|~sequential(esk13_0,esk1_5(X1,X2,X3,X4,X5))|tail_of(X3)!=tail_of(esk12_0)|~precedes(X3,X4,X5)|~shortest_path(X1,X2,X5)|~edge(esk12_0)),inference(spm,[status(thm)],[197,895,theory(equality)])).
% cnf(904,negated_conjecture,(esk1_5(X1,X2,X3,X4,X5)=esk12_0|~sequential(esk13_0,esk1_5(X1,X2,X3,X4,X5))|tail_of(X3)!=tail_of(esk12_0)|~precedes(X3,X4,X5)|~shortest_path(X1,X2,X5)|$false),inference(rw,[status(thm)],[896,187,theory(equality)])).
% cnf(905,negated_conjecture,(esk1_5(X1,X2,X3,X4,X5)=esk12_0|~sequential(esk13_0,esk1_5(X1,X2,X3,X4,X5))|tail_of(X3)!=tail_of(esk12_0)|~precedes(X3,X4,X5)|~shortest_path(X1,X2,X5)),inference(cn,[status(thm)],[904,theory(equality)])).
% cnf(1933,negated_conjecture,(esk1_5(X1,X2,X3,X4,X5)=esk12_0|esk13_0=esk1_5(X1,X2,X3,X4,X5)|tail_of(X3)!=tail_of(esk12_0)|~precedes(X3,X4,X5)|~shortest_path(X1,X2,X5)|head_of(esk13_0)!=head_of(X4)|~edge(esk13_0)),inference(spm,[status(thm)],[905,839,theory(equality)])).
% cnf(1934,negated_conjecture,(esk1_5(X1,X2,X3,X4,X5)=esk12_0|esk13_0=esk1_5(X1,X2,X3,X4,X5)|tail_of(X3)!=tail_of(esk12_0)|~precedes(X3,X4,X5)|~shortest_path(X1,X2,X5)|head_of(esk13_0)!=head_of(X4)|$false),inference(rw,[status(thm)],[1933,186,theory(equality)])).
% cnf(1935,negated_conjecture,(esk1_5(X1,X2,X3,X4,X5)=esk12_0|esk13_0=esk1_5(X1,X2,X3,X4,X5)|tail_of(X3)!=tail_of(esk12_0)|~precedes(X3,X4,X5)|~shortest_path(X1,X2,X5)|head_of(esk13_0)!=head_of(X4)),inference(cn,[status(thm)],[1934,theory(equality)])).
% cnf(2061,negated_conjecture,(esk1_5(X1,X2,X3,X4,X5)=esk12_0|head_of(esk13_0)!=head_of(X4)|~precedes(X3,X4,X5)|~shortest_path(X1,X2,X5)|tail_of(X3)!=tail_of(esk12_0)),inference(spm,[status(thm)],[414,1935,theory(equality)])).
% cnf(2330,negated_conjecture,(head_of(esk12_0)=tail_of(X3)|~precedes(X3,X4,X5)|~shortest_path(X1,X2,X5)|head_of(esk13_0)!=head_of(X4)|tail_of(X3)!=tail_of(esk12_0)),inference(spm,[status(thm)],[174,2061,theory(equality)])).
% cnf(2346,negated_conjecture,(tail_of(esk12_0)=head_of(esk12_0)|~shortest_path(X1,X2,esk14_0)),inference(spm,[status(thm)],[2330,160,theory(equality)])).
% cnf(2359,negated_conjecture,(~shortest_path(X1,X2,esk14_0)),inference(sr,[status(thm)],[2346,321,theory(equality)])).
% cnf(2389,negated_conjecture,($false),inference(sr,[status(thm)],[161,2359,theory(equality)])).
% cnf(2390,negated_conjecture,($false),2389,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 602
% # ...of these trivial : 24
% # ...subsumed : 119
% # ...remaining for further processing: 459
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 23
% # Backward-rewritten : 3
% # Generated clauses : 1495
% # ...of the previous two non-trivial : 1210
% # Contextual simplify-reflections : 104
% # Paramodulations : 1451
% # Factorizations : 27
% # Equation resolutions : 13
% # Current number of processed clauses: 363
% # Positive orientable unit clauses: 20
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 333
% # Current number of unprocessed clauses: 667
% # ...number of literals in the above : 4237
% # Clause-clause subsumption calls (NU) : 3947
% # Rec. Clause-clause subsumption calls : 1305
% # Unit Clause-clause subsumption calls : 67
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 264 leaves, 1.72+/-3.163 terms/leaf
% # Paramod-from index: 106 leaves, 1.05+/-0.212 terms/leaf
% # Paramod-into index: 209 leaves, 1.38+/-1.297 terms/leaf
% # -------------------------------------------------
% # User time : 0.131 s
% # System time : 0.007 s
% # Total time : 0.138 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.27 CPU 0.35 WC
% FINAL PrfWatch: 0.27 CPU 0.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP28739/GRA008+2.tptp
%
%------------------------------------------------------------------------------