TSTP Solution File: GRA009+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRA009+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 : art05.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:13 EST 2010
% Result : Theorem 4.86s
% Output : Solution 4.86s
% 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/SystemOnTPTP30355/GRA009+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30355/GRA009+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30355/GRA009+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 30451
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.90 CPU 4.01 WC
% # 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,![X4]:![X5]:![X6]:(path(X5,X6,X4)=>![X1]:![X2]:(precedes(X1,X2,X4)<=((on_path(X1,X4)&on_path(X2,X4))&(sequential(X1,X2)|?[X3]:(sequential(X1,X3)&precedes(X3,X2,X4)))))),file('/tmp/SRASS.s.p', precedes_defn)).
% fof(5, axiom,![X7]:(edge(X7)=>~(head_of(X7)=tail_of(X7))),file('/tmp/SRASS.s.p', no_loops)).
% fof(6, axiom,![X5]:![X6]:![X1]:![X2]:![X4]:((shortest_path(X5,X6,X4)&precedes(X1,X2,X4))=>(~(?[X3]:(tail_of(X3)=tail_of(X1)&head_of(X3)=head_of(X2)))&~(precedes(X2,X1,X4)))),file('/tmp/SRASS.s.p', shortest_path_properties)).
% fof(7, axiom,(complete=>![X5]:![X6]:(((vertex(X5)&vertex(X6))&~(X5=X6))=>?[X7]:(edge(X7)&((X5=head_of(X7)&X6=tail_of(X7))<~>(X6=head_of(X7)&X5=tail_of(X7)))))),file('/tmp/SRASS.s.p', complete_properties)).
% fof(8, axiom,![X5]:![X6]:![X8]:(shortest_path(X5,X6,X8)<=>((path(X5,X6,X8)&~(X5=X6))&![X4]:(path(X5,X6,X4)=>less_or_equal(length_of(X8),length_of(X4))))),file('/tmp/SRASS.s.p', shortest_path_defn)).
% fof(9, 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(11, axiom,![X7]:(edge(X7)=>(vertex(head_of(X7))&vertex(tail_of(X7)))),file('/tmp/SRASS.s.p', edge_ends_are_vertices)).
% fof(13, axiom,![X5]:![X6]:![X4]:![X9]:((path(X5,X6,X4)&in_path(X9,X4))=>(vertex(X9)&?[X7]:(on_path(X7,X4)&(X9=head_of(X7)|X9=tail_of(X7))))),file('/tmp/SRASS.s.p', in_path_properties)).
% fof(14, axiom,![X5]:![X6]:![X4]:![X7]:((path(X5,X6,X4)&on_path(X7,X4))=>((edge(X7)&in_path(head_of(X7),X4))&in_path(tail_of(X7),X4))),file('/tmp/SRASS.s.p', on_path_properties)).
% fof(18, conjecture,(complete=>![X4]:![X5]:![X6]:(shortest_path(X5,X6,X4)=>![X1]:![X2]:(((on_path(X1,X4)&on_path(X2,X4))&sequential(X1,X2))=>?[X3]:triangle(X1,X2,X3)))),file('/tmp/SRASS.s.p', complete_means_path_means_stuff_means_triangles)).
% fof(19, negated_conjecture,~((complete=>![X4]:![X5]:![X6]:(shortest_path(X5,X6,X4)=>![X1]:![X2]:(((on_path(X1,X4)&on_path(X2,X4))&sequential(X1,X2))=>?[X3]:triangle(X1,X2,X3))))),inference(assume_negation,[status(cth)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:(path(X5,X6,X4)=>![X1]:![X2]:(((on_path(X1,X4)&on_path(X2,X4))&(sequential(X1,X2)|?[X3]:(sequential(X1,X3)&precedes(X3,X2,X4))))=>precedes(X1,X2,X4))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(22, plain,![X5]:![X6]:![X1]:![X2]:![X4]:((shortest_path(X5,X6,X4)&precedes(X1,X2,X4))=>(~(?[X3]:(tail_of(X3)=tail_of(X1)&head_of(X3)=head_of(X2)))&~(precedes(X2,X1,X4)))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(23, plain,(complete=>![X5]:![X6]:(((vertex(X5)&vertex(X6))&~(X5=X6))=>?[X7]:(edge(X7)&~(((X5=head_of(X7)&X6=tail_of(X7))<=>(X6=head_of(X7)&X5=tail_of(X7))))))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(26, 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(27, 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)],[26])).
% fof(28, 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)],[27])).
% cnf(29,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)],[28])).
% fof(36, plain,![X4]:![X5]:![X6]:(~(path(X5,X6,X4))|![X1]:![X2]:(((~(on_path(X1,X4))|~(on_path(X2,X4)))|(~(sequential(X1,X2))&![X3]:(~(sequential(X1,X3))|~(precedes(X3,X2,X4)))))|precedes(X1,X2,X4))),inference(fof_nnf,[status(thm)],[20])).
% fof(37, 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)],[36])).
% fof(38, 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)],[37])).
% fof(39, 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)],[38])).
% cnf(40,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)],[39])).
% fof(61, plain,![X7]:(~(edge(X7))|~(head_of(X7)=tail_of(X7))),inference(fof_nnf,[status(thm)],[5])).
% fof(62, plain,![X8]:(~(edge(X8))|~(head_of(X8)=tail_of(X8))),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(head_of(X1)!=tail_of(X1)|~edge(X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(64, plain,![X5]:![X6]:![X1]:![X2]:![X4]:((~(shortest_path(X5,X6,X4))|~(precedes(X1,X2,X4)))|(![X3]:(~(tail_of(X3)=tail_of(X1))|~(head_of(X3)=head_of(X2)))&~(precedes(X2,X1,X4)))),inference(fof_nnf,[status(thm)],[22])).
% fof(65, 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)],[64])).
% fof(66, 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)],[65])).
% fof(67, 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)],[66])).
% cnf(68,plain,(~precedes(X1,X2,X3)|~shortest_path(X4,X5,X3)|~precedes(X2,X1,X3)),inference(split_conjunct,[status(thm)],[67])).
% cnf(69,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)],[67])).
% fof(70, plain,(~(complete)|![X5]:![X6]:(((~(vertex(X5))|~(vertex(X6)))|X5=X6)|?[X7]:(edge(X7)&(((~(X5=head_of(X7))|~(X6=tail_of(X7)))|(~(X6=head_of(X7))|~(X5=tail_of(X7))))&((X5=head_of(X7)&X6=tail_of(X7))|(X6=head_of(X7)&X5=tail_of(X7))))))),inference(fof_nnf,[status(thm)],[23])).
% fof(71, plain,(~(complete)|![X8]:![X9]:(((~(vertex(X8))|~(vertex(X9)))|X8=X9)|?[X10]:(edge(X10)&(((~(X8=head_of(X10))|~(X9=tail_of(X10)))|(~(X9=head_of(X10))|~(X8=tail_of(X10))))&((X8=head_of(X10)&X9=tail_of(X10))|(X9=head_of(X10)&X8=tail_of(X10))))))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,(~(complete)|![X8]:![X9]:(((~(vertex(X8))|~(vertex(X9)))|X8=X9)|(edge(esk4_2(X8,X9))&(((~(X8=head_of(esk4_2(X8,X9)))|~(X9=tail_of(esk4_2(X8,X9))))|(~(X9=head_of(esk4_2(X8,X9)))|~(X8=tail_of(esk4_2(X8,X9)))))&((X8=head_of(esk4_2(X8,X9))&X9=tail_of(esk4_2(X8,X9)))|(X9=head_of(esk4_2(X8,X9))&X8=tail_of(esk4_2(X8,X9)))))))),inference(skolemize,[status(esa)],[71])).
% fof(73, plain,![X8]:![X9]:((((~(vertex(X8))|~(vertex(X9)))|X8=X9)|(edge(esk4_2(X8,X9))&(((~(X8=head_of(esk4_2(X8,X9)))|~(X9=tail_of(esk4_2(X8,X9))))|(~(X9=head_of(esk4_2(X8,X9)))|~(X8=tail_of(esk4_2(X8,X9)))))&((X8=head_of(esk4_2(X8,X9))&X9=tail_of(esk4_2(X8,X9)))|(X9=head_of(esk4_2(X8,X9))&X8=tail_of(esk4_2(X8,X9)))))))|~(complete)),inference(shift_quantors,[status(thm)],[72])).
% fof(74, plain,![X8]:![X9]:(((edge(esk4_2(X8,X9))|((~(vertex(X8))|~(vertex(X9)))|X8=X9))|~(complete))&(((((~(X8=head_of(esk4_2(X8,X9)))|~(X9=tail_of(esk4_2(X8,X9))))|(~(X9=head_of(esk4_2(X8,X9)))|~(X8=tail_of(esk4_2(X8,X9)))))|((~(vertex(X8))|~(vertex(X9)))|X8=X9))|~(complete))&(((((X9=head_of(esk4_2(X8,X9))|X8=head_of(esk4_2(X8,X9)))|((~(vertex(X8))|~(vertex(X9)))|X8=X9))|~(complete))&(((X8=tail_of(esk4_2(X8,X9))|X8=head_of(esk4_2(X8,X9)))|((~(vertex(X8))|~(vertex(X9)))|X8=X9))|~(complete)))&((((X9=head_of(esk4_2(X8,X9))|X9=tail_of(esk4_2(X8,X9)))|((~(vertex(X8))|~(vertex(X9)))|X8=X9))|~(complete))&(((X8=tail_of(esk4_2(X8,X9))|X9=tail_of(esk4_2(X8,X9)))|((~(vertex(X8))|~(vertex(X9)))|X8=X9))|~(complete)))))),inference(distribute,[status(thm)],[73])).
% cnf(75,plain,(X1=X2|X2=tail_of(esk4_2(X1,X2))|X1=tail_of(esk4_2(X1,X2))|~complete|~vertex(X2)|~vertex(X1)),inference(split_conjunct,[status(thm)],[74])).
% cnf(76,plain,(X1=X2|X2=tail_of(esk4_2(X1,X2))|X2=head_of(esk4_2(X1,X2))|~complete|~vertex(X2)|~vertex(X1)),inference(split_conjunct,[status(thm)],[74])).
% cnf(77,plain,(X1=X2|X1=head_of(esk4_2(X1,X2))|X1=tail_of(esk4_2(X1,X2))|~complete|~vertex(X2)|~vertex(X1)),inference(split_conjunct,[status(thm)],[74])).
% cnf(78,plain,(X1=X2|X1=head_of(esk4_2(X1,X2))|X2=head_of(esk4_2(X1,X2))|~complete|~vertex(X2)|~vertex(X1)),inference(split_conjunct,[status(thm)],[74])).
% cnf(80,plain,(X1=X2|edge(esk4_2(X1,X2))|~complete|~vertex(X2)|~vertex(X1)),inference(split_conjunct,[status(thm)],[74])).
% fof(81, plain,![X5]:![X6]:![X8]:((~(shortest_path(X5,X6,X8))|((path(X5,X6,X8)&~(X5=X6))&![X4]:(~(path(X5,X6,X4))|less_or_equal(length_of(X8),length_of(X4)))))&(((~(path(X5,X6,X8))|X5=X6)|?[X4]:(path(X5,X6,X4)&~(less_or_equal(length_of(X8),length_of(X4)))))|shortest_path(X5,X6,X8))),inference(fof_nnf,[status(thm)],[8])).
% fof(82, 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)],[81])).
% fof(83, 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,esk5_3(X9,X10,X11))&~(less_or_equal(length_of(X11),length_of(esk5_3(X9,X10,X11))))))|shortest_path(X9,X10,X11))),inference(skolemize,[status(esa)],[82])).
% fof(84, 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,esk5_3(X9,X10,X11))&~(less_or_equal(length_of(X11),length_of(esk5_3(X9,X10,X11))))))|shortest_path(X9,X10,X11))),inference(shift_quantors,[status(thm)],[83])).
% fof(85, 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,esk5_3(X9,X10,X11))|(~(path(X9,X10,X11))|X9=X10))|shortest_path(X9,X10,X11))&((~(less_or_equal(length_of(X11),length_of(esk5_3(X9,X10,X11))))|(~(path(X9,X10,X11))|X9=X10))|shortest_path(X9,X10,X11)))),inference(distribute,[status(thm)],[84])).
% cnf(89,plain,(path(X1,X2,X3)|~shortest_path(X1,X2,X3)),inference(split_conjunct,[status(thm)],[85])).
% fof(91, 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)],[9])).
% fof(92, 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)],[91])).
% fof(93, 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)],[92])).
% cnf(94,plain,(sequential(X1,X2)|X1=X2|head_of(X1)!=tail_of(X2)|~edge(X2)|~edge(X1)),inference(split_conjunct,[status(thm)],[93])).
% cnf(95,plain,(head_of(X1)=tail_of(X2)|~sequential(X1,X2)),inference(split_conjunct,[status(thm)],[93])).
% cnf(97,plain,(edge(X2)|~sequential(X1,X2)),inference(split_conjunct,[status(thm)],[93])).
% cnf(98,plain,(edge(X1)|~sequential(X1,X2)),inference(split_conjunct,[status(thm)],[93])).
% fof(102, plain,![X7]:(~(edge(X7))|(vertex(head_of(X7))&vertex(tail_of(X7)))),inference(fof_nnf,[status(thm)],[11])).
% fof(103, plain,![X8]:(~(edge(X8))|(vertex(head_of(X8))&vertex(tail_of(X8)))),inference(variable_rename,[status(thm)],[102])).
% fof(104, plain,![X8]:((vertex(head_of(X8))|~(edge(X8)))&(vertex(tail_of(X8))|~(edge(X8)))),inference(distribute,[status(thm)],[103])).
% cnf(105,plain,(vertex(tail_of(X1))|~edge(X1)),inference(split_conjunct,[status(thm)],[104])).
% cnf(106,plain,(vertex(head_of(X1))|~edge(X1)),inference(split_conjunct,[status(thm)],[104])).
% fof(110, plain,![X5]:![X6]:![X4]:![X9]:((~(path(X5,X6,X4))|~(in_path(X9,X4)))|(vertex(X9)&?[X7]:(on_path(X7,X4)&(X9=head_of(X7)|X9=tail_of(X7))))),inference(fof_nnf,[status(thm)],[13])).
% fof(111, plain,![X10]:![X11]:![X12]:![X13]:((~(path(X10,X11,X12))|~(in_path(X13,X12)))|(vertex(X13)&?[X14]:(on_path(X14,X12)&(X13=head_of(X14)|X13=tail_of(X14))))),inference(variable_rename,[status(thm)],[110])).
% fof(112, plain,![X10]:![X11]:![X12]:![X13]:((~(path(X10,X11,X12))|~(in_path(X13,X12)))|(vertex(X13)&(on_path(esk6_4(X10,X11,X12,X13),X12)&(X13=head_of(esk6_4(X10,X11,X12,X13))|X13=tail_of(esk6_4(X10,X11,X12,X13)))))),inference(skolemize,[status(esa)],[111])).
% fof(113, plain,![X10]:![X11]:![X12]:![X13]:((vertex(X13)|(~(path(X10,X11,X12))|~(in_path(X13,X12))))&((on_path(esk6_4(X10,X11,X12,X13),X12)|(~(path(X10,X11,X12))|~(in_path(X13,X12))))&((X13=head_of(esk6_4(X10,X11,X12,X13))|X13=tail_of(esk6_4(X10,X11,X12,X13)))|(~(path(X10,X11,X12))|~(in_path(X13,X12)))))),inference(distribute,[status(thm)],[112])).
% cnf(116,plain,(vertex(X1)|~in_path(X1,X2)|~path(X3,X4,X2)),inference(split_conjunct,[status(thm)],[113])).
% fof(117, plain,![X5]:![X6]:![X4]:![X7]:((~(path(X5,X6,X4))|~(on_path(X7,X4)))|((edge(X7)&in_path(head_of(X7),X4))&in_path(tail_of(X7),X4))),inference(fof_nnf,[status(thm)],[14])).
% fof(118, 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)],[117])).
% fof(119, 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)],[118])).
% cnf(120,plain,(in_path(tail_of(X1),X2)|~on_path(X1,X2)|~path(X3,X4,X2)),inference(split_conjunct,[status(thm)],[119])).
% cnf(121,plain,(in_path(head_of(X1),X2)|~on_path(X1,X2)|~path(X3,X4,X2)),inference(split_conjunct,[status(thm)],[119])).
% fof(145, negated_conjecture,(complete&?[X4]:?[X5]:?[X6]:(shortest_path(X5,X6,X4)&?[X1]:?[X2]:(((on_path(X1,X4)&on_path(X2,X4))&sequential(X1,X2))&![X3]:~(triangle(X1,X2,X3))))),inference(fof_nnf,[status(thm)],[19])).
% fof(146, negated_conjecture,(complete&?[X7]:?[X8]:?[X9]:(shortest_path(X8,X9,X7)&?[X10]:?[X11]:(((on_path(X10,X7)&on_path(X11,X7))&sequential(X10,X11))&![X12]:~(triangle(X10,X11,X12))))),inference(variable_rename,[status(thm)],[145])).
% fof(147, negated_conjecture,(complete&(shortest_path(esk10_0,esk11_0,esk9_0)&(((on_path(esk12_0,esk9_0)&on_path(esk13_0,esk9_0))&sequential(esk12_0,esk13_0))&![X12]:~(triangle(esk12_0,esk13_0,X12))))),inference(skolemize,[status(esa)],[146])).
% fof(148, negated_conjecture,![X12]:(((~(triangle(esk12_0,esk13_0,X12))&((on_path(esk12_0,esk9_0)&on_path(esk13_0,esk9_0))&sequential(esk12_0,esk13_0)))&shortest_path(esk10_0,esk11_0,esk9_0))&complete),inference(shift_quantors,[status(thm)],[147])).
% cnf(149,negated_conjecture,(complete),inference(split_conjunct,[status(thm)],[148])).
% cnf(150,negated_conjecture,(shortest_path(esk10_0,esk11_0,esk9_0)),inference(split_conjunct,[status(thm)],[148])).
% cnf(151,negated_conjecture,(sequential(esk12_0,esk13_0)),inference(split_conjunct,[status(thm)],[148])).
% cnf(152,negated_conjecture,(on_path(esk13_0,esk9_0)),inference(split_conjunct,[status(thm)],[148])).
% cnf(153,negated_conjecture,(on_path(esk12_0,esk9_0)),inference(split_conjunct,[status(thm)],[148])).
% cnf(154,negated_conjecture,(~triangle(esk12_0,esk13_0,X1)),inference(split_conjunct,[status(thm)],[148])).
% cnf(157,plain,(X1=X2|edge(esk4_2(X1,X2))|$false|~vertex(X2)|~vertex(X1)),inference(rw,[status(thm)],[80,149,theory(equality)])).
% cnf(158,plain,(X1=X2|edge(esk4_2(X1,X2))|~vertex(X2)|~vertex(X1)),inference(cn,[status(thm)],[157,theory(equality)])).
% cnf(159,plain,(X1=X2|head_of(esk4_2(X1,X2))=X2|head_of(esk4_2(X1,X2))=X1|$false|~vertex(X2)|~vertex(X1)),inference(rw,[status(thm)],[78,149,theory(equality)])).
% cnf(160,plain,(X1=X2|head_of(esk4_2(X1,X2))=X2|head_of(esk4_2(X1,X2))=X1|~vertex(X2)|~vertex(X1)),inference(cn,[status(thm)],[159,theory(equality)])).
% cnf(161,plain,(triangle(X1,X2,X3)|~sequential(X3,X1)|~sequential(X2,X3)|~sequential(X1,X2)|~edge(X3)|~edge(X2)),inference(csr,[status(thm)],[29,98])).
% cnf(162,plain,(triangle(X1,X2,X3)|~sequential(X3,X1)|~sequential(X2,X3)|~sequential(X1,X2)|~edge(X3)),inference(csr,[status(thm)],[161,98])).
% cnf(163,plain,(triangle(X1,X2,X3)|~sequential(X3,X1)|~sequential(X2,X3)|~sequential(X1,X2)),inference(csr,[status(thm)],[162,98])).
% cnf(164,plain,(X1=X2|head_of(esk4_2(X1,X2))=X2|tail_of(esk4_2(X1,X2))=X2|$false|~vertex(X2)|~vertex(X1)),inference(rw,[status(thm)],[76,149,theory(equality)])).
% cnf(165,plain,(X1=X2|head_of(esk4_2(X1,X2))=X2|tail_of(esk4_2(X1,X2))=X2|~vertex(X2)|~vertex(X1)),inference(cn,[status(thm)],[164,theory(equality)])).
% cnf(167,plain,(X1=X2|head_of(esk4_2(X1,X2))=X1|tail_of(esk4_2(X1,X2))=X1|$false|~vertex(X2)|~vertex(X1)),inference(rw,[status(thm)],[77,149,theory(equality)])).
% cnf(168,plain,(X1=X2|head_of(esk4_2(X1,X2))=X1|tail_of(esk4_2(X1,X2))=X1|~vertex(X2)|~vertex(X1)),inference(cn,[status(thm)],[167,theory(equality)])).
% cnf(169,plain,(X1=X2|tail_of(esk4_2(X1,X2))=X2|tail_of(esk4_2(X1,X2))=X1|$false|~vertex(X2)|~vertex(X1)),inference(rw,[status(thm)],[75,149,theory(equality)])).
% cnf(170,plain,(X1=X2|tail_of(esk4_2(X1,X2))=X2|tail_of(esk4_2(X1,X2))=X1|~vertex(X2)|~vertex(X1)),inference(cn,[status(thm)],[169,theory(equality)])).
% cnf(172,negated_conjecture,(edge(esk13_0)),inference(spm,[status(thm)],[97,151,theory(equality)])).
% cnf(173,negated_conjecture,(edge(esk12_0)),inference(spm,[status(thm)],[98,151,theory(equality)])).
% cnf(174,negated_conjecture,(path(esk10_0,esk11_0,esk9_0)),inference(spm,[status(thm)],[89,150,theory(equality)])).
% cnf(175,negated_conjecture,(~sequential(X1,esk12_0)|~sequential(esk13_0,X1)|~sequential(esk12_0,esk13_0)),inference(spm,[status(thm)],[154,163,theory(equality)])).
% cnf(182,negated_conjecture,(~sequential(X1,esk12_0)|~sequential(esk13_0,X1)|$false),inference(rw,[status(thm)],[175,151,theory(equality)])).
% cnf(183,negated_conjecture,(~sequential(X1,esk12_0)|~sequential(esk13_0,X1)),inference(cn,[status(thm)],[182,theory(equality)])).
% cnf(184,negated_conjecture,(tail_of(esk13_0)=head_of(esk12_0)),inference(spm,[status(thm)],[95,151,theory(equality)])).
% cnf(188,plain,(esk4_2(X1,X2)=X3|sequential(esk4_2(X1,X2),X3)|X1=X2|tail_of(X3)!=head_of(esk4_2(X1,X2))|~edge(X3)|~vertex(X2)|~vertex(X1)),inference(spm,[status(thm)],[94,158,theory(equality)])).
% cnf(189,negated_conjecture,(~precedes(X1,X2,esk9_0)|~precedes(X2,X1,esk9_0)),inference(spm,[status(thm)],[68,150,theory(equality)])).
% cnf(213,negated_conjecture,(head_of(X1)!=head_of(X2)|tail_of(X3)!=tail_of(X2)|~precedes(X3,X1,esk9_0)),inference(spm,[status(thm)],[69,150,theory(equality)])).
% cnf(222,plain,(tail_of(esk4_2(X1,head_of(X2)))=head_of(X2)|tail_of(esk4_2(X1,head_of(X2)))=X1|X1=head_of(X2)|~vertex(X1)|~edge(X2)),inference(spm,[status(thm)],[170,106,theory(equality)])).
% cnf(250,negated_conjecture,(esk13_0=X1|sequential(esk13_0,X1)|tail_of(X1)!=head_of(esk13_0)|~edge(X1)),inference(spm,[status(thm)],[94,172,theory(equality)])).
% cnf(256,negated_conjecture,(vertex(X1)|~in_path(X1,esk9_0)),inference(spm,[status(thm)],[116,174,theory(equality)])).
% cnf(257,negated_conjecture,(in_path(head_of(X1),esk9_0)|~on_path(X1,esk9_0)),inference(spm,[status(thm)],[121,174,theory(equality)])).
% cnf(258,negated_conjecture,(in_path(tail_of(X1),esk9_0)|~on_path(X1,esk9_0)),inference(spm,[status(thm)],[120,174,theory(equality)])).
% cnf(260,negated_conjecture,(precedes(X1,X2,esk9_0)|~on_path(X2,esk9_0)|~on_path(X1,esk9_0)|~sequential(X1,X2)),inference(spm,[status(thm)],[40,174,theory(equality)])).
% cnf(270,negated_conjecture,(head_of(esk12_0)!=head_of(esk13_0)|~edge(esk13_0)),inference(spm,[status(thm)],[63,184,theory(equality)])).
% cnf(273,negated_conjecture,(head_of(esk12_0)!=head_of(esk13_0)|$false),inference(rw,[status(thm)],[270,172,theory(equality)])).
% cnf(274,negated_conjecture,(head_of(esk12_0)!=head_of(esk13_0)),inference(cn,[status(thm)],[273,theory(equality)])).
% cnf(294,negated_conjecture,(vertex(head_of(X1))|~on_path(X1,esk9_0)),inference(spm,[status(thm)],[256,257,theory(equality)])).
% cnf(300,negated_conjecture,(vertex(head_of(esk13_0))),inference(spm,[status(thm)],[294,152,theory(equality)])).
% cnf(306,negated_conjecture,(head_of(esk4_2(X1,head_of(esk13_0)))=head_of(esk13_0)|head_of(esk4_2(X1,head_of(esk13_0)))=X1|X1=head_of(esk13_0)|~vertex(X1)),inference(spm,[status(thm)],[160,300,theory(equality)])).
% cnf(308,negated_conjecture,(vertex(tail_of(X1))|~on_path(X1,esk9_0)),inference(spm,[status(thm)],[256,258,theory(equality)])).
% cnf(335,negated_conjecture,(~precedes(X2,X1,esk9_0)|~on_path(X2,esk9_0)|~on_path(X1,esk9_0)|~sequential(X1,X2)),inference(spm,[status(thm)],[189,260,theory(equality)])).
% cnf(336,negated_conjecture,(head_of(X1)!=head_of(X2)|tail_of(X3)!=tail_of(X2)|~on_path(X1,esk9_0)|~on_path(X3,esk9_0)|~sequential(X3,X1)),inference(spm,[status(thm)],[213,260,theory(equality)])).
% cnf(339,negated_conjecture,(esk13_0=esk4_2(X1,X2)|sequential(esk13_0,esk4_2(X1,X2))|head_of(esk4_2(X1,X2))=X2|X1=X2|X2!=head_of(esk13_0)|~edge(esk4_2(X1,X2))|~vertex(X2)|~vertex(X1)),inference(spm,[status(thm)],[250,165,theory(equality)])).
% cnf(347,negated_conjecture,(~on_path(X1,esk9_0)|~on_path(X2,esk9_0)|~sequential(X2,X1)|~sequential(X1,X2)),inference(spm,[status(thm)],[335,260,theory(equality)])).
% cnf(348,negated_conjecture,(~on_path(X1,esk9_0)|~sequential(X1,esk13_0)|~sequential(esk13_0,X1)),inference(spm,[status(thm)],[347,152,theory(equality)])).
% cnf(354,negated_conjecture,(~sequential(esk12_0,esk13_0)|~sequential(esk13_0,esk12_0)),inference(spm,[status(thm)],[348,153,theory(equality)])).
% cnf(358,negated_conjecture,($false|~sequential(esk13_0,esk12_0)),inference(rw,[status(thm)],[354,151,theory(equality)])).
% cnf(359,negated_conjecture,(~sequential(esk13_0,esk12_0)),inference(cn,[status(thm)],[358,theory(equality)])).
% cnf(390,negated_conjecture,(esk4_2(X1,X2)=esk12_0|X1=X2|~sequential(esk13_0,esk4_2(X1,X2))|tail_of(esk12_0)!=head_of(esk4_2(X1,X2))|~vertex(X2)|~vertex(X1)|~edge(esk12_0)),inference(spm,[status(thm)],[183,188,theory(equality)])).
% cnf(395,negated_conjecture,(esk4_2(X1,X2)=esk12_0|X1=X2|~sequential(esk13_0,esk4_2(X1,X2))|tail_of(esk12_0)!=head_of(esk4_2(X1,X2))|~vertex(X2)|~vertex(X1)|$false),inference(rw,[status(thm)],[390,173,theory(equality)])).
% cnf(396,negated_conjecture,(esk4_2(X1,X2)=esk12_0|X1=X2|~sequential(esk13_0,esk4_2(X1,X2))|tail_of(esk12_0)!=head_of(esk4_2(X1,X2))|~vertex(X2)|~vertex(X1)),inference(cn,[status(thm)],[395,theory(equality)])).
% cnf(415,negated_conjecture,(head_of(esk13_0)!=head_of(X1)|tail_of(X2)!=tail_of(X1)|~on_path(X2,esk9_0)|~sequential(X2,esk13_0)),inference(spm,[status(thm)],[336,152,theory(equality)])).
% cnf(421,negated_conjecture,(head_of(esk13_0)!=head_of(X1)|tail_of(esk12_0)!=tail_of(X1)|~sequential(esk12_0,esk13_0)),inference(spm,[status(thm)],[415,153,theory(equality)])).
% cnf(426,negated_conjecture,(head_of(esk13_0)!=head_of(X1)|tail_of(esk12_0)!=tail_of(X1)|$false),inference(rw,[status(thm)],[421,151,theory(equality)])).
% cnf(427,negated_conjecture,(head_of(esk13_0)!=head_of(X1)|tail_of(esk12_0)!=tail_of(X1)),inference(cn,[status(thm)],[426,theory(equality)])).
% cnf(451,negated_conjecture,(tail_of(esk12_0)!=head_of(esk12_0)),inference(spm,[status(thm)],[427,184,theory(equality)])).
% cnf(1101,negated_conjecture,(tail_of(esk4_2(tail_of(X1),head_of(X2)))=head_of(X2)|tail_of(esk4_2(tail_of(X1),head_of(X2)))=tail_of(X1)|tail_of(X1)=head_of(X2)|~edge(X2)|~on_path(X1,esk9_0)),inference(spm,[status(thm)],[222,308,theory(equality)])).
% cnf(2782,negated_conjecture,(head_of(esk4_2(X1,X2))=X2|esk4_2(X1,X2)=esk13_0|X1=X2|sequential(esk13_0,esk4_2(X1,X2))|X2!=head_of(esk13_0)|~vertex(X2)|~vertex(X1)),inference(csr,[status(thm)],[339,158])).
% cnf(2786,negated_conjecture,(esk4_2(X1,X2)=esk12_0|X1=X2|head_of(esk4_2(X1,X2))=X2|esk4_2(X1,X2)=esk13_0|head_of(esk4_2(X1,X2))!=tail_of(esk12_0)|~vertex(X2)|~vertex(X1)|X2!=head_of(esk13_0)),inference(spm,[status(thm)],[396,2782,theory(equality)])).
% cnf(21276,negated_conjecture,(tail_of(esk4_2(tail_of(esk12_0),head_of(X1)))=tail_of(esk12_0)|tail_of(esk4_2(tail_of(esk12_0),head_of(X1)))=head_of(X1)|tail_of(esk12_0)=head_of(X1)|~edge(X1)),inference(spm,[status(thm)],[1101,153,theory(equality)])).
% cnf(34167,negated_conjecture,(tail_of(esk4_2(tail_of(esk12_0),head_of(esk13_0)))=tail_of(esk12_0)|tail_of(esk4_2(tail_of(esk12_0),head_of(esk13_0)))=head_of(esk13_0)|tail_of(esk12_0)=head_of(esk13_0)),inference(spm,[status(thm)],[21276,172,theory(equality)])).
% cnf(34241,negated_conjecture,(tail_of(esk4_2(tail_of(esk12_0),head_of(esk13_0)))=head_of(esk13_0)|tail_of(esk12_0)=head_of(esk13_0)|head_of(esk13_0)!=head_of(esk4_2(tail_of(esk12_0),head_of(esk13_0)))),inference(spm,[status(thm)],[427,34167,theory(equality)])).
% cnf(34494,negated_conjecture,(head_of(esk4_2(tail_of(esk12_0),head_of(esk13_0)))=tail_of(esk12_0)|head_of(esk13_0)=tail_of(esk12_0)|~vertex(head_of(esk13_0))|~vertex(tail_of(esk12_0))|head_of(esk4_2(tail_of(esk12_0),head_of(esk13_0)))!=head_of(esk13_0)),inference(spm,[status(thm)],[168,34241,theory(equality)])).
% cnf(34501,negated_conjecture,(head_of(esk4_2(tail_of(esk12_0),head_of(esk13_0)))=tail_of(esk12_0)|head_of(esk13_0)=tail_of(esk12_0)|$false|~vertex(tail_of(esk12_0))|head_of(esk4_2(tail_of(esk12_0),head_of(esk13_0)))!=head_of(esk13_0)),inference(rw,[status(thm)],[34494,300,theory(equality)])).
% cnf(34502,negated_conjecture,(head_of(esk4_2(tail_of(esk12_0),head_of(esk13_0)))=tail_of(esk12_0)|head_of(esk13_0)=tail_of(esk12_0)|~vertex(tail_of(esk12_0))|head_of(esk4_2(tail_of(esk12_0),head_of(esk13_0)))!=head_of(esk13_0)),inference(cn,[status(thm)],[34501,theory(equality)])).
% cnf(44309,negated_conjecture,(head_of(esk4_2(tail_of(esk12_0),head_of(esk13_0)))=tail_of(esk12_0)|tail_of(esk12_0)=head_of(esk13_0)|~vertex(tail_of(esk12_0))),inference(csr,[status(thm)],[34502,306])).
% cnf(51192,negated_conjecture,(tail_of(esk12_0)=head_of(esk13_0)|esk4_2(tail_of(esk12_0),head_of(esk13_0))=esk13_0|esk4_2(tail_of(esk12_0),head_of(esk13_0))=esk12_0|~vertex(head_of(esk13_0))|~vertex(tail_of(esk12_0))),inference(spm,[status(thm)],[2786,44309,theory(equality)])).
% cnf(51260,negated_conjecture,(tail_of(esk12_0)=head_of(esk13_0)|esk4_2(tail_of(esk12_0),head_of(esk13_0))=esk13_0|esk4_2(tail_of(esk12_0),head_of(esk13_0))=esk12_0|$false|~vertex(tail_of(esk12_0))),inference(rw,[status(thm)],[51192,300,theory(equality)])).
% cnf(51261,negated_conjecture,(tail_of(esk12_0)=head_of(esk13_0)|esk4_2(tail_of(esk12_0),head_of(esk13_0))=esk13_0|esk4_2(tail_of(esk12_0),head_of(esk13_0))=esk12_0|~vertex(tail_of(esk12_0))),inference(cn,[status(thm)],[51260,theory(equality)])).
% cnf(51328,negated_conjecture,(head_of(esk13_0)=tail_of(esk12_0)|tail_of(esk13_0)=tail_of(esk12_0)|esk4_2(tail_of(esk12_0),head_of(esk13_0))=esk12_0|~vertex(head_of(esk13_0))|~vertex(tail_of(esk12_0))),inference(spm,[status(thm)],[168,51261,theory(equality)])).
% cnf(51362,negated_conjecture,(head_of(esk13_0)=tail_of(esk12_0)|head_of(esk12_0)=tail_of(esk12_0)|esk4_2(tail_of(esk12_0),head_of(esk13_0))=esk12_0|~vertex(head_of(esk13_0))|~vertex(tail_of(esk12_0))),inference(rw,[status(thm)],[51328,184,theory(equality)])).
% cnf(51363,negated_conjecture,(head_of(esk13_0)=tail_of(esk12_0)|head_of(esk12_0)=tail_of(esk12_0)|esk4_2(tail_of(esk12_0),head_of(esk13_0))=esk12_0|$false|~vertex(tail_of(esk12_0))),inference(rw,[status(thm)],[51362,300,theory(equality)])).
% cnf(51364,negated_conjecture,(head_of(esk13_0)=tail_of(esk12_0)|head_of(esk12_0)=tail_of(esk12_0)|esk4_2(tail_of(esk12_0),head_of(esk13_0))=esk12_0|~vertex(tail_of(esk12_0))),inference(cn,[status(thm)],[51363,theory(equality)])).
% cnf(51365,negated_conjecture,(tail_of(esk12_0)=head_of(esk13_0)|esk4_2(tail_of(esk12_0),head_of(esk13_0))=esk12_0|~vertex(tail_of(esk12_0))),inference(sr,[status(thm)],[51364,451,theory(equality)])).
% cnf(52226,negated_conjecture,(head_of(esk12_0)=head_of(esk13_0)|tail_of(esk12_0)=head_of(esk13_0)|~vertex(head_of(esk13_0))|~vertex(tail_of(esk12_0))),inference(spm,[status(thm)],[165,51365,theory(equality)])).
% cnf(52271,negated_conjecture,(head_of(esk12_0)=head_of(esk13_0)|tail_of(esk12_0)=head_of(esk13_0)|$false|~vertex(tail_of(esk12_0))),inference(rw,[status(thm)],[52226,300,theory(equality)])).
% cnf(52272,negated_conjecture,(head_of(esk12_0)=head_of(esk13_0)|tail_of(esk12_0)=head_of(esk13_0)|~vertex(tail_of(esk12_0))),inference(cn,[status(thm)],[52271,theory(equality)])).
% cnf(52273,negated_conjecture,(tail_of(esk12_0)=head_of(esk13_0)|~vertex(tail_of(esk12_0))),inference(sr,[status(thm)],[52272,274,theory(equality)])).
% cnf(52369,negated_conjecture,(tail_of(esk12_0)=head_of(esk13_0)|~edge(esk12_0)),inference(spm,[status(thm)],[52273,105,theory(equality)])).
% cnf(52371,negated_conjecture,(tail_of(esk12_0)=head_of(esk13_0)|$false),inference(rw,[status(thm)],[52369,173,theory(equality)])).
% cnf(52372,negated_conjecture,(tail_of(esk12_0)=head_of(esk13_0)),inference(cn,[status(thm)],[52371,theory(equality)])).
% cnf(52476,negated_conjecture,(esk13_0=esk12_0|sequential(esk13_0,esk12_0)|~edge(esk12_0)),inference(spm,[status(thm)],[250,52372,theory(equality)])).
% cnf(53273,negated_conjecture,(esk13_0=esk12_0|sequential(esk13_0,esk12_0)|$false),inference(rw,[status(thm)],[52476,173,theory(equality)])).
% cnf(53274,negated_conjecture,(esk13_0=esk12_0|sequential(esk13_0,esk12_0)),inference(cn,[status(thm)],[53273,theory(equality)])).
% cnf(53275,negated_conjecture,(esk13_0=esk12_0),inference(sr,[status(thm)],[53274,359,theory(equality)])).
% cnf(54716,negated_conjecture,($false),inference(rw,[status(thm)],[274,53275,theory(equality)])).
% cnf(54717,negated_conjecture,($false),inference(cn,[status(thm)],[54716,theory(equality)])).
% cnf(54718,negated_conjecture,($false),54717,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5843
% # ...of these trivial : 340
% # ...subsumed : 3489
% # ...remaining for further processing: 2014
% # Other redundant clauses eliminated : 38
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 276
% # Backward-rewritten : 882
% # Generated clauses : 35885
% # ...of the previous two non-trivial : 30984
% # Contextual simplify-reflections : 7815
% # Paramodulations : 35618
% # Factorizations : 116
% # Equation resolutions : 116
% # Current number of processed clauses: 778
% # Positive orientable unit clauses: 25
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 741
% # Current number of unprocessed clauses: 7044
% # ...number of literals in the above : 55362
% # Clause-clause subsumption calls (NU) : 259603
% # Rec. Clause-clause subsumption calls : 32640
% # Unit Clause-clause subsumption calls : 4007
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 14
% # Indexed BW rewrite successes : 14
% # Backwards rewriting index: 466 leaves, 1.98+/-3.313 terms/leaf
% # Paramod-from index: 138 leaves, 1.33+/-1.001 terms/leaf
% # Paramod-into index: 365 leaves, 1.60+/-1.796 terms/leaf
% # -------------------------------------------------
% # User time : 2.755 s
% # System time : 0.062 s
% # Total time : 2.817 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.02 CPU 4.15 WC
% FINAL PrfWatch: 4.02 CPU 4.15 WC
% SZS output end Solution for /tmp/SystemOnTPTP30355/GRA009+2.tptp
%
%------------------------------------------------------------------------------