TSTP Solution File: GRA004+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRA004+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 : art01.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:35 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP31633/GRA004+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31633/GRA004+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31633/GRA004+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 31729
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:((shortest_path(X1,X2,X5)&precedes(X3,X4,X5))=>(~(?[X6]:(tail_of(X6)=tail_of(X3)&head_of(X6)=head_of(X4)))&~(precedes(X4,X3,X5)))),file('/tmp/SRASS.s.p', shortest_path_properties)).
% fof(2, axiom,![X7]:(edge(X7)=>~(head_of(X7)=tail_of(X7))),file('/tmp/SRASS.s.p', no_loops)).
% fof(3, axiom,![X3]:![X4]:(sequential(X3,X4)<=>(((edge(X3)&edge(X4))&~(X3=X4))&head_of(X3)=tail_of(X4))),file('/tmp/SRASS.s.p', sequential_defn)).
% fof(5, axiom,![X1]:![X2]:![X8]:(shortest_path(X1,X2,X8)<=>((path(X1,X2,X8)&~(X1=X2))&![X5]:(path(X1,X2,X5)=>less_or_equal(length_of(X8),length_of(X5))))),file('/tmp/SRASS.s.p', shortest_path_defn)).
% fof(8, axiom,![X5]:![X1]:![X2]:(path(X1,X2,X5)=>![X3]:![X4]:(precedes(X3,X4,X5)<=((on_path(X3,X5)&on_path(X4,X5))&(sequential(X3,X4)|?[X6]:(sequential(X3,X6)&precedes(X6,X4,X5)))))),file('/tmp/SRASS.s.p', precedes_defn)).
% fof(9, axiom,![X5]:![X1]:![X2]:(path(X1,X2,X5)=>![X3]:![X4]:(precedes(X3,X4,X5)=>((on_path(X3,X5)&on_path(X4,X5))&(sequential(X3,X4)<~>?[X6]:(sequential(X3,X6)&precedes(X6,X4,X5)))))),file('/tmp/SRASS.s.p', precedes_properties)).
% fof(14, axiom,![X1]:![X2]:![X5]:![X7]:((path(X1,X2,X5)&on_path(X7,X5))=>((edge(X7)&in_path(head_of(X7),X5))&in_path(tail_of(X7),X5))),file('/tmp/SRASS.s.p', on_path_properties)).
% fof(18, conjecture,![X1]:![X2]:![X3]:![X4]:![X5]:((shortest_path(X1,X2,X5)&precedes(X3,X4,X5))=>((~(?[X6]:(tail_of(X6)=tail_of(X3)&head_of(X6)=head_of(X4)))&~(head_of(X4)=tail_of(X3)))&~(head_of(X4)=head_of(X3)))),file('/tmp/SRASS.s.p', shortest_path_properties_lemma)).
% fof(19, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:![X5]:((shortest_path(X1,X2,X5)&precedes(X3,X4,X5))=>((~(?[X6]:(tail_of(X6)=tail_of(X3)&head_of(X6)=head_of(X4)))&~(head_of(X4)=tail_of(X3)))&~(head_of(X4)=head_of(X3))))),inference(assume_negation,[status(cth)],[18])).
% fof(20, plain,![X1]:![X2]:![X3]:![X4]:![X5]:((shortest_path(X1,X2,X5)&precedes(X3,X4,X5))=>(~(?[X6]:(tail_of(X6)=tail_of(X3)&head_of(X6)=head_of(X4)))&~(precedes(X4,X3,X5)))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(22, plain,![X5]:![X1]:![X2]:(path(X1,X2,X5)=>![X3]:![X4]:(((on_path(X3,X5)&on_path(X4,X5))&(sequential(X3,X4)|?[X6]:(sequential(X3,X6)&precedes(X6,X4,X5))))=>precedes(X3,X4,X5))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(23, plain,![X5]:![X1]:![X2]:(path(X1,X2,X5)=>![X3]:![X4]:(precedes(X3,X4,X5)=>((on_path(X3,X5)&on_path(X4,X5))&~((sequential(X3,X4)<=>?[X6]:(sequential(X3,X6)&precedes(X6,X4,X5))))))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(26, plain,![X1]:![X2]:![X3]:![X4]:![X5]:((~(shortest_path(X1,X2,X5))|~(precedes(X3,X4,X5)))|(![X6]:(~(tail_of(X6)=tail_of(X3))|~(head_of(X6)=head_of(X4)))&~(precedes(X4,X3,X5)))),inference(fof_nnf,[status(thm)],[20])).
% fof(27, 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)],[26])).
% fof(28, 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)],[27])).
% fof(29, 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)],[28])).
% cnf(30,plain,(~precedes(X1,X2,X3)|~shortest_path(X4,X5,X3)|~precedes(X2,X1,X3)),inference(split_conjunct,[status(thm)],[29])).
% cnf(31,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)],[29])).
% fof(32, plain,![X7]:(~(edge(X7))|~(head_of(X7)=tail_of(X7))),inference(fof_nnf,[status(thm)],[2])).
% fof(33, plain,![X8]:(~(edge(X8))|~(head_of(X8)=tail_of(X8))),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(head_of(X1)!=tail_of(X1)|~edge(X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, 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(fof_nnf,[status(thm)],[3])).
% fof(36, plain,![X5]:![X6]:((~(sequential(X5,X6))|(((edge(X5)&edge(X6))&~(X5=X6))&head_of(X5)=tail_of(X6)))&((((~(edge(X5))|~(edge(X6)))|X5=X6)|~(head_of(X5)=tail_of(X6)))|sequential(X5,X6))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X5]:![X6]:(((((edge(X5)|~(sequential(X5,X6)))&(edge(X6)|~(sequential(X5,X6))))&(~(X5=X6)|~(sequential(X5,X6))))&(head_of(X5)=tail_of(X6)|~(sequential(X5,X6))))&((((~(edge(X5))|~(edge(X6)))|X5=X6)|~(head_of(X5)=tail_of(X6)))|sequential(X5,X6))),inference(distribute,[status(thm)],[36])).
% cnf(38,plain,(sequential(X1,X2)|X1=X2|head_of(X1)!=tail_of(X2)|~edge(X2)|~edge(X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(54, plain,![X1]:![X2]:![X8]:((~(shortest_path(X1,X2,X8))|((path(X1,X2,X8)&~(X1=X2))&![X5]:(~(path(X1,X2,X5))|less_or_equal(length_of(X8),length_of(X5)))))&(((~(path(X1,X2,X8))|X1=X2)|?[X5]:(path(X1,X2,X5)&~(less_or_equal(length_of(X8),length_of(X5)))))|shortest_path(X1,X2,X8))),inference(fof_nnf,[status(thm)],[5])).
% fof(55, plain,![X9]:![X10]:![X11]:((~(shortest_path(X9,X10,X11))|((path(X9,X10,X11)&~(X9=X10))&![X12]:(~(path(X9,X10,X12))|less_or_equal(length_of(X11),length_of(X12)))))&(((~(path(X9,X10,X11))|X9=X10)|?[X13]:(path(X9,X10,X13)&~(less_or_equal(length_of(X11),length_of(X13)))))|shortest_path(X9,X10,X11))),inference(variable_rename,[status(thm)],[54])).
% fof(56, plain,![X9]:![X10]:![X11]:((~(shortest_path(X9,X10,X11))|((path(X9,X10,X11)&~(X9=X10))&![X12]:(~(path(X9,X10,X12))|less_or_equal(length_of(X11),length_of(X12)))))&(((~(path(X9,X10,X11))|X9=X10)|(path(X9,X10,esk2_3(X9,X10,X11))&~(less_or_equal(length_of(X11),length_of(esk2_3(X9,X10,X11))))))|shortest_path(X9,X10,X11))),inference(skolemize,[status(esa)],[55])).
% fof(57, plain,![X9]:![X10]:![X11]:![X12]:((((~(path(X9,X10,X12))|less_or_equal(length_of(X11),length_of(X12)))&(path(X9,X10,X11)&~(X9=X10)))|~(shortest_path(X9,X10,X11)))&(((~(path(X9,X10,X11))|X9=X10)|(path(X9,X10,esk2_3(X9,X10,X11))&~(less_or_equal(length_of(X11),length_of(esk2_3(X9,X10,X11))))))|shortest_path(X9,X10,X11))),inference(shift_quantors,[status(thm)],[56])).
% fof(58, plain,![X9]:![X10]:![X11]:![X12]:((((~(path(X9,X10,X12))|less_or_equal(length_of(X11),length_of(X12)))|~(shortest_path(X9,X10,X11)))&((path(X9,X10,X11)|~(shortest_path(X9,X10,X11)))&(~(X9=X10)|~(shortest_path(X9,X10,X11)))))&(((path(X9,X10,esk2_3(X9,X10,X11))|(~(path(X9,X10,X11))|X9=X10))|shortest_path(X9,X10,X11))&((~(less_or_equal(length_of(X11),length_of(esk2_3(X9,X10,X11))))|(~(path(X9,X10,X11))|X9=X10))|shortest_path(X9,X10,X11)))),inference(distribute,[status(thm)],[57])).
% cnf(62,plain,(path(X1,X2,X3)|~shortest_path(X1,X2,X3)),inference(split_conjunct,[status(thm)],[58])).
% fof(76, plain,![X5]:![X1]:![X2]:(~(path(X1,X2,X5))|![X3]:![X4]:(((~(on_path(X3,X5))|~(on_path(X4,X5)))|(~(sequential(X3,X4))&![X6]:(~(sequential(X3,X6))|~(precedes(X6,X4,X5)))))|precedes(X3,X4,X5))),inference(fof_nnf,[status(thm)],[22])).
% fof(77, plain,![X7]:![X8]:![X9]:(~(path(X8,X9,X7))|![X10]:![X11]:(((~(on_path(X10,X7))|~(on_path(X11,X7)))|(~(sequential(X10,X11))&![X12]:(~(sequential(X10,X12))|~(precedes(X12,X11,X7)))))|precedes(X10,X11,X7))),inference(variable_rename,[status(thm)],[76])).
% fof(78, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:(((((~(sequential(X10,X12))|~(precedes(X12,X11,X7)))&~(sequential(X10,X11)))|(~(on_path(X10,X7))|~(on_path(X11,X7))))|precedes(X10,X11,X7))|~(path(X8,X9,X7))),inference(shift_quantors,[status(thm)],[77])).
% fof(79, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:(((((~(sequential(X10,X12))|~(precedes(X12,X11,X7)))|(~(on_path(X10,X7))|~(on_path(X11,X7))))|precedes(X10,X11,X7))|~(path(X8,X9,X7)))&(((~(sequential(X10,X11))|(~(on_path(X10,X7))|~(on_path(X11,X7))))|precedes(X10,X11,X7))|~(path(X8,X9,X7)))),inference(distribute,[status(thm)],[78])).
% cnf(80,plain,(precedes(X4,X5,X3)|~path(X1,X2,X3)|~on_path(X5,X3)|~on_path(X4,X3)|~sequential(X4,X5)),inference(split_conjunct,[status(thm)],[79])).
% fof(82, plain,![X5]:![X1]:![X2]:(~(path(X1,X2,X5))|![X3]:![X4]:(~(precedes(X3,X4,X5))|((on_path(X3,X5)&on_path(X4,X5))&((~(sequential(X3,X4))|![X6]:(~(sequential(X3,X6))|~(precedes(X6,X4,X5))))&(sequential(X3,X4)|?[X6]:(sequential(X3,X6)&precedes(X6,X4,X5))))))),inference(fof_nnf,[status(thm)],[23])).
% fof(83, plain,![X7]:![X8]:![X9]:(~(path(X8,X9,X7))|![X10]:![X11]:(~(precedes(X10,X11,X7))|((on_path(X10,X7)&on_path(X11,X7))&((~(sequential(X10,X11))|![X12]:(~(sequential(X10,X12))|~(precedes(X12,X11,X7))))&(sequential(X10,X11)|?[X13]:(sequential(X10,X13)&precedes(X13,X11,X7))))))),inference(variable_rename,[status(thm)],[82])).
% fof(84, plain,![X7]:![X8]:![X9]:(~(path(X8,X9,X7))|![X10]:![X11]:(~(precedes(X10,X11,X7))|((on_path(X10,X7)&on_path(X11,X7))&((~(sequential(X10,X11))|![X12]:(~(sequential(X10,X12))|~(precedes(X12,X11,X7))))&(sequential(X10,X11)|(sequential(X10,esk4_5(X7,X8,X9,X10,X11))&precedes(esk4_5(X7,X8,X9,X10,X11),X11,X7))))))),inference(skolemize,[status(esa)],[83])).
% fof(85, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((~(sequential(X10,X12))|~(precedes(X12,X11,X7)))|~(sequential(X10,X11)))&(sequential(X10,X11)|(sequential(X10,esk4_5(X7,X8,X9,X10,X11))&precedes(esk4_5(X7,X8,X9,X10,X11),X11,X7))))&(on_path(X10,X7)&on_path(X11,X7)))|~(precedes(X10,X11,X7)))|~(path(X8,X9,X7))),inference(shift_quantors,[status(thm)],[84])).
% fof(86, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((~(sequential(X10,X12))|~(precedes(X12,X11,X7)))|~(sequential(X10,X11)))|~(precedes(X10,X11,X7)))|~(path(X8,X9,X7)))&((((sequential(X10,esk4_5(X7,X8,X9,X10,X11))|sequential(X10,X11))|~(precedes(X10,X11,X7)))|~(path(X8,X9,X7)))&(((precedes(esk4_5(X7,X8,X9,X10,X11),X11,X7)|sequential(X10,X11))|~(precedes(X10,X11,X7)))|~(path(X8,X9,X7)))))&(((on_path(X10,X7)|~(precedes(X10,X11,X7)))|~(path(X8,X9,X7)))&((on_path(X11,X7)|~(precedes(X10,X11,X7)))|~(path(X8,X9,X7))))),inference(distribute,[status(thm)],[85])).
% cnf(87,plain,(on_path(X5,X3)|~path(X1,X2,X3)|~precedes(X4,X5,X3)),inference(split_conjunct,[status(thm)],[86])).
% cnf(88,plain,(on_path(X4,X3)|~path(X1,X2,X3)|~precedes(X4,X5,X3)),inference(split_conjunct,[status(thm)],[86])).
% fof(125, plain,![X1]:![X2]:![X5]:![X7]:((~(path(X1,X2,X5))|~(on_path(X7,X5)))|((edge(X7)&in_path(head_of(X7),X5))&in_path(tail_of(X7),X5))),inference(fof_nnf,[status(thm)],[14])).
% fof(126, plain,![X8]:![X9]:![X10]:![X11]:((~(path(X8,X9,X10))|~(on_path(X11,X10)))|((edge(X11)&in_path(head_of(X11),X10))&in_path(tail_of(X11),X10))),inference(variable_rename,[status(thm)],[125])).
% fof(127, plain,![X8]:![X9]:![X10]:![X11]:(((edge(X11)|(~(path(X8,X9,X10))|~(on_path(X11,X10))))&(in_path(head_of(X11),X10)|(~(path(X8,X9,X10))|~(on_path(X11,X10)))))&(in_path(tail_of(X11),X10)|(~(path(X8,X9,X10))|~(on_path(X11,X10))))),inference(distribute,[status(thm)],[126])).
% cnf(130,plain,(edge(X1)|~on_path(X1,X2)|~path(X3,X4,X2)),inference(split_conjunct,[status(thm)],[127])).
% fof(145, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:?[X5]:((shortest_path(X1,X2,X5)&precedes(X3,X4,X5))&((?[X6]:(tail_of(X6)=tail_of(X3)&head_of(X6)=head_of(X4))|head_of(X4)=tail_of(X3))|head_of(X4)=head_of(X3))),inference(fof_nnf,[status(thm)],[19])).
% fof(146, negated_conjecture,?[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))|head_of(X10)=tail_of(X9))|head_of(X10)=head_of(X9))),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))&(((tail_of(esk14_0)=tail_of(esk11_0)&head_of(esk14_0)=head_of(esk12_0))|head_of(esk12_0)=tail_of(esk11_0))|head_of(esk12_0)=head_of(esk11_0))),inference(skolemize,[status(esa)],[146])).
% fof(148, negated_conjecture,((shortest_path(esk9_0,esk10_0,esk13_0)&precedes(esk11_0,esk12_0,esk13_0))&(((tail_of(esk14_0)=tail_of(esk11_0)|head_of(esk12_0)=tail_of(esk11_0))|head_of(esk12_0)=head_of(esk11_0))&((head_of(esk14_0)=head_of(esk12_0)|head_of(esk12_0)=tail_of(esk11_0))|head_of(esk12_0)=head_of(esk11_0)))),inference(distribute,[status(thm)],[147])).
% cnf(149,negated_conjecture,(head_of(esk12_0)=head_of(esk11_0)|head_of(esk12_0)=tail_of(esk11_0)|head_of(esk14_0)=head_of(esk12_0)),inference(split_conjunct,[status(thm)],[148])).
% cnf(150,negated_conjecture,(head_of(esk12_0)=head_of(esk11_0)|head_of(esk12_0)=tail_of(esk11_0)|tail_of(esk14_0)=tail_of(esk11_0)),inference(split_conjunct,[status(thm)],[148])).
% cnf(151,negated_conjecture,(precedes(esk11_0,esk12_0,esk13_0)),inference(split_conjunct,[status(thm)],[148])).
% cnf(152,negated_conjecture,(shortest_path(esk9_0,esk10_0,esk13_0)),inference(split_conjunct,[status(thm)],[148])).
% cnf(162,negated_conjecture,(path(esk9_0,esk10_0,esk13_0)),inference(spm,[status(thm)],[62,152,theory(equality)])).
% cnf(166,negated_conjecture,(~precedes(esk12_0,esk11_0,esk13_0)|~shortest_path(X1,X2,esk13_0)),inference(spm,[status(thm)],[30,151,theory(equality)])).
% cnf(169,negated_conjecture,(tail_of(esk11_0)!=tail_of(X1)|head_of(esk12_0)!=head_of(X1)|~shortest_path(X2,X3,esk13_0)),inference(spm,[status(thm)],[31,151,theory(equality)])).
% cnf(238,negated_conjecture,(~precedes(esk12_0,esk11_0,esk13_0)),inference(spm,[status(thm)],[166,152,theory(equality)])).
% fof(239, plain,(~(epred1_0)<=>![X1]:(~(head_of(esk12_0)=head_of(X1))|~(tail_of(esk11_0)=tail_of(X1)))),introduced(definition),['split']).
% cnf(240,plain,(epred1_0|head_of(esk12_0)!=head_of(X1)|tail_of(esk11_0)!=tail_of(X1)),inference(split_equiv,[status(thm)],[239])).
% fof(241, plain,(~(epred2_0)<=>![X3]:![X2]:~(shortest_path(X2,X3,esk13_0))),introduced(definition),['split']).
% cnf(242,plain,(epred2_0|~shortest_path(X2,X3,esk13_0)),inference(split_equiv,[status(thm)],[241])).
% cnf(243,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[169,239,theory(equality)]),241,theory(equality)]),['split']).
% cnf(248,negated_conjecture,(edge(X1)|~on_path(X1,esk13_0)),inference(spm,[status(thm)],[130,162,theory(equality)])).
% cnf(252,negated_conjecture,(on_path(X1,esk13_0)|~precedes(X2,X1,esk13_0)),inference(spm,[status(thm)],[87,162,theory(equality)])).
% cnf(253,negated_conjecture,(on_path(X1,esk13_0)|~precedes(X1,X2,esk13_0)),inference(spm,[status(thm)],[88,162,theory(equality)])).
% cnf(256,negated_conjecture,(precedes(X1,X2,esk13_0)|~on_path(X2,esk13_0)|~on_path(X1,esk13_0)|~sequential(X1,X2)),inference(spm,[status(thm)],[80,162,theory(equality)])).
% cnf(258,negated_conjecture,(epred2_0),inference(spm,[status(thm)],[242,152,theory(equality)])).
% cnf(259,negated_conjecture,($false|~epred1_0),inference(rw,[status(thm)],[243,258,theory(equality)])).
% cnf(260,negated_conjecture,(~epred1_0),inference(cn,[status(thm)],[259,theory(equality)])).
% cnf(262,negated_conjecture,(head_of(esk12_0)!=head_of(X1)|tail_of(esk11_0)!=tail_of(X1)),inference(sr,[status(thm)],[240,260,theory(equality)])).
% cnf(263,negated_conjecture,(head_of(esk12_0)!=head_of(esk11_0)),inference(er,[status(thm)],[262,theory(equality)])).
% cnf(271,negated_conjecture,(tail_of(esk14_0)=tail_of(esk11_0)|tail_of(esk11_0)=head_of(esk12_0)),inference(sr,[status(thm)],[150,263,theory(equality)])).
% cnf(272,negated_conjecture,(tail_of(esk11_0)=head_of(esk12_0)|head_of(esk14_0)=head_of(esk12_0)),inference(sr,[status(thm)],[149,263,theory(equality)])).
% cnf(274,negated_conjecture,(tail_of(esk11_0)=head_of(esk12_0)|head_of(esk12_0)!=head_of(esk14_0)),inference(spm,[status(thm)],[262,271,theory(equality)])).
% cnf(278,negated_conjecture,(tail_of(esk11_0)=head_of(esk12_0)),inference(csr,[status(thm)],[274,272])).
% cnf(293,negated_conjecture,(on_path(esk12_0,esk13_0)),inference(spm,[status(thm)],[252,151,theory(equality)])).
% cnf(295,negated_conjecture,(edge(esk12_0)),inference(spm,[status(thm)],[248,293,theory(equality)])).
% cnf(306,negated_conjecture,(tail_of(esk12_0)!=head_of(esk12_0)),inference(spm,[status(thm)],[34,295,theory(equality)])).
% cnf(308,negated_conjecture,(on_path(esk11_0,esk13_0)),inference(spm,[status(thm)],[253,151,theory(equality)])).
% cnf(310,negated_conjecture,(edge(esk11_0)),inference(spm,[status(thm)],[248,308,theory(equality)])).
% cnf(312,negated_conjecture,(X1=esk11_0|sequential(X1,esk11_0)|head_of(X1)!=tail_of(esk11_0)|~edge(X1)),inference(spm,[status(thm)],[38,310,theory(equality)])).
% cnf(316,negated_conjecture,(X1=esk11_0|sequential(X1,esk11_0)|head_of(X1)!=head_of(esk12_0)|~edge(X1)),inference(rw,[status(thm)],[312,278,theory(equality)])).
% cnf(317,negated_conjecture,(esk12_0=esk11_0|sequential(esk12_0,esk11_0)),inference(spm,[status(thm)],[316,295,theory(equality)])).
% cnf(399,negated_conjecture,(~on_path(esk11_0,esk13_0)|~on_path(esk12_0,esk13_0)|~sequential(esk12_0,esk11_0)),inference(spm,[status(thm)],[238,256,theory(equality)])).
% cnf(407,negated_conjecture,($false|~on_path(esk12_0,esk13_0)|~sequential(esk12_0,esk11_0)),inference(rw,[status(thm)],[399,308,theory(equality)])).
% cnf(408,negated_conjecture,($false|$false|~sequential(esk12_0,esk11_0)),inference(rw,[status(thm)],[407,293,theory(equality)])).
% cnf(409,negated_conjecture,(~sequential(esk12_0,esk11_0)),inference(cn,[status(thm)],[408,theory(equality)])).
% cnf(423,negated_conjecture,(esk12_0=esk11_0),inference(sr,[status(thm)],[317,409,theory(equality)])).
% cnf(443,negated_conjecture,(head_of(esk11_0)!=head_of(esk12_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[306,423,theory(equality)]),278,theory(equality)]),423,theory(equality)])).
% cnf(444,negated_conjecture,($false),inference(rw,[status(thm)],[443,423,theory(equality)])).
% cnf(445,negated_conjecture,($false),inference(cn,[status(thm)],[444,theory(equality)])).
% cnf(446,negated_conjecture,($false),445,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 207
% # ...of these trivial : 3
% # ...subsumed : 11
% # ...remaining for further processing: 193
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 28
% # Generated clauses : 213
% # ...of the previous two non-trivial : 191
% # Contextual simplify-reflections : 19
% # Paramodulations : 201
% # Factorizations : 0
% # Equation resolutions : 6
% # Current number of processed clauses: 96
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 80
% # Current number of unprocessed clauses: 89
% # ...number of literals in the above : 424
% # Clause-clause subsumption calls (NU) : 317
% # Rec. Clause-clause subsumption calls : 158
% # Unit Clause-clause subsumption calls : 121
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 96 leaves, 1.78+/-2.450 terms/leaf
% # Paramod-from index: 36 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 77 leaves, 1.35+/-1.078 terms/leaf
% # -------------------------------------------------
% # User time : 0.038 s
% # System time : 0.002 s
% # Total time : 0.040 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.25 WC
% FINAL PrfWatch: 0.15 CPU 0.25 WC
% SZS output end Solution for /tmp/SystemOnTPTP31633/GRA004+1.tptp
%
%------------------------------------------------------------------------------