%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GRA006+1 : TPTP v9.3.1. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:23:34 PM UTC 2026
% Result : Theorem 8.24s 1.51s
% Output : CNFRefutation 8.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 181 ( 18 unt; 0 def)
% Number of atoms : 838 ( 342 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 1077 ( 420 ~; 472 |; 156 &)
% ( 5 <=>; 16 =>; 0 <=; 8 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 5 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 427 ( 0 sgn 371 !; 56 ?; 175 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] :
( edge(X0)
=> ( vertex(tail_of(X0))
& vertex(head_of(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',edge_ends_are_vertices) ).
fof(f3,axiom,
( complete
=> ! [X0,X1] :
( ( X0 != X1
& vertex(X1)
& vertex(X0) )
=> ? [X2] :
( ( ( X1 = tail_of(X2)
& X0 = head_of(X2) )
<~> ( X0 = tail_of(X2)
& X1 = head_of(X2) ) )
& edge(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',complete_properties) ).
fof(f6,axiom,
! [X0,X1,X2,X3] :
( ( on_path(X3,X2)
& path(X0,X1,X2) )
=> ( in_path(tail_of(X3),X2)
& in_path(head_of(X3),X2)
& edge(X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',on_path_properties) ).
fof(f8,axiom,
! [X0,X1] :
( sequential(X0,X1)
<=> ( head_of(X0) = tail_of(X1)
& X0 != X1
& edge(X1)
& edge(X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',sequential_defn) ).
fof(f9,axiom,
! [X0,X1,X2] :
( path(X1,X2,X0)
=> ! [X3,X4] :
( ( ( ? [X5] :
( precedes(X5,X4,X0)
& sequential(X3,X5) )
| sequential(X3,X4) )
& on_path(X4,X0)
& on_path(X3,X0) )
=> precedes(X3,X4,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',precedes_defn) ).
fof(f10,axiom,
! [X0,X1,X2] :
( path(X1,X2,X0)
=> ! [X3,X4] :
( precedes(X3,X4,X0)
=> ( ( sequential(X3,X4)
<~> ? [X5] :
( precedes(X5,X4,X0)
& sequential(X3,X5) ) )
& on_path(X4,X0)
& on_path(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',precedes_properties) ).
fof(f11,axiom,
! [X0,X1,X2] :
( shortest_path(X0,X1,X2)
<=> ( ! [X3] :
( path(X0,X1,X3)
=> less_or_equal(length_of(X2),length_of(X3)) )
& X0 != X1
& path(X0,X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).
fof(f12,axiom,
! [X0,X1,X2,X3,X4] :
( ( precedes(X2,X3,X4)
& shortest_path(X0,X1,X4) )
=> ( ~ precedes(X3,X2,X4)
& ~ ? [X5] :
( head_of(X5) = head_of(X3)
& tail_of(X5) = tail_of(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',shortest_path_properties) ).
fof(f18,conjecture,
( complete
=> ! [X0,X1,X2,X3,X4] :
( ( precedes(X2,X3,X4)
& shortest_path(X0,X1,X4) )
=> ( ? [X5] :
( head_of(X5) = head_of(X3)
& tail_of(X5) = tail_of(X2)
& edge(X5) )
<~> ? [X5] :
( head_of(X5) = tail_of(X2)
& tail_of(X5) = head_of(X3)
& edge(X5) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',edge_some_way) ).
fof(f19,negated_conjecture,
~ ( complete
=> ! [X0,X1,X2,X3,X4] :
( ( precedes(X2,X3,X4)
& shortest_path(X0,X1,X4) )
=> ( ? [X5] :
( head_of(X5) = head_of(X3)
& tail_of(X5) = tail_of(X2)
& edge(X5) )
<~> ? [X5] :
( head_of(X5) = tail_of(X2)
& tail_of(X5) = head_of(X3)
& edge(X5) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f20,plain,
~ ( complete
=> ! [X0,X1,X2,X3,X4] :
( ( precedes(X2,X3,X4)
& shortest_path(X0,X1,X4) )
=> ( ? [X5] :
( head_of(X5) = head_of(X3)
& tail_of(X5) = tail_of(X2)
& edge(X5) )
<~> ? [X6] :
( tail_of(X2) = head_of(X6)
& head_of(X3) = tail_of(X6)
& edge(X6) ) ) ) ),
inference(rectify,[],[f19]) ).
fof(f23,plain,
! [X0] :
( ~ edge(X0)
| ( vertex(tail_of(X0))
& vertex(head_of(X0)) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f24,plain,
( ~ complete
| ! [X0,X1] :
( X0 = X1
| ~ vertex(X1)
| ~ vertex(X0)
| ? [X2] :
( ( ( X1 = tail_of(X2)
& X0 = head_of(X2) )
<~> ( X0 = tail_of(X2)
& X1 = head_of(X2) ) )
& edge(X2) ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f25,plain,
( ~ complete
| ! [X0,X1] :
( X0 = X1
| ~ vertex(X1)
| ~ vertex(X0)
| ? [X2] :
( ( ( X1 = tail_of(X2)
& X0 = head_of(X2) )
<~> ( X0 = tail_of(X2)
& X1 = head_of(X2) ) )
& edge(X2) ) ) ),
inference(flattening,[],[f24]) ).
fof(f29,plain,
! [X0,X1,X2,X3] :
( ~ on_path(X3,X2)
| ~ path(X0,X1,X2)
| ( in_path(tail_of(X3),X2)
& in_path(head_of(X3),X2)
& edge(X3) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f30,plain,
! [X0,X1,X2,X3] :
( ~ on_path(X3,X2)
| ~ path(X0,X1,X2)
| ( in_path(tail_of(X3),X2)
& in_path(head_of(X3),X2)
& edge(X3) ) ),
inference(flattening,[],[f29]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ~ path(X1,X2,X0)
| ! [X3,X4] :
( ( ! [X5] :
( ~ precedes(X5,X4,X0)
| ~ sequential(X3,X5) )
& ~ sequential(X3,X4) )
| ~ on_path(X4,X0)
| ~ on_path(X3,X0)
| precedes(X3,X4,X0) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ~ path(X1,X2,X0)
| ! [X3,X4] :
( ( ! [X5] :
( ~ precedes(X5,X4,X0)
| ~ sequential(X3,X5) )
& ~ sequential(X3,X4) )
| ~ on_path(X4,X0)
| ~ on_path(X3,X0)
| precedes(X3,X4,X0) ) ),
inference(flattening,[],[f33]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ~ path(X1,X2,X0)
| ! [X3,X4] :
( ~ precedes(X3,X4,X0)
| ( ( sequential(X3,X4)
<~> ? [X5] :
( precedes(X5,X4,X0)
& sequential(X3,X5) ) )
& on_path(X4,X0)
& on_path(X3,X0) ) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f36,plain,
! [X0,X1,X2] :
( shortest_path(X0,X1,X2)
<=> ( ! [X3] :
( ~ path(X0,X1,X3)
| less_or_equal(length_of(X2),length_of(X3)) )
& X0 != X1
& path(X0,X1,X2) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f37,plain,
! [X0,X1,X2,X3,X4] :
( ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| ( ~ precedes(X3,X2,X4)
& ! [X5] :
( head_of(X3) != head_of(X5)
| tail_of(X2) != tail_of(X5) ) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f38,plain,
! [X0,X1,X2,X3,X4] :
( ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| ( ~ precedes(X3,X2,X4)
& ! [X5] :
( head_of(X3) != head_of(X5)
| tail_of(X2) != tail_of(X5) ) ) ),
inference(flattening,[],[f37]) ).
fof(f45,plain,
( complete
& ? [X0,X1,X2,X3,X4] :
( precedes(X2,X3,X4)
& shortest_path(X0,X1,X4)
& ( ? [X5] :
( head_of(X5) = head_of(X3)
& tail_of(X5) = tail_of(X2)
& edge(X5) )
<=> ? [X6] :
( tail_of(X2) = head_of(X6)
& head_of(X3) = tail_of(X6)
& edge(X6) ) ) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f46,plain,
( complete
& ? [X0,X1,X2,X3,X4] :
( precedes(X2,X3,X4)
& shortest_path(X0,X1,X4)
& ( ? [X5] :
( head_of(X5) = head_of(X3)
& tail_of(X5) = tail_of(X2)
& edge(X5) )
<=> ? [X6] :
( tail_of(X2) = head_of(X6)
& head_of(X3) = tail_of(X6)
& edge(X6) ) ) ) ),
inference(flattening,[],[f45]) ).
fof(f47,plain,
( ~ complete
| ! [X0,X1] :
( X0 = X1
| ~ vertex(X1)
| ~ vertex(X0)
| ? [X2] :
( ( ( X1 = tail_of(X2)
& X0 = head_of(X2) )
| ( X0 = tail_of(X2)
& X1 = head_of(X2) ) )
& ( tail_of(X2) != X1
| head_of(X2) != X0
| tail_of(X2) != X0
| head_of(X2) != X1 )
& edge(X2) ) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f48,plain,
( ~ complete
| ! [X0,X1] :
( X0 = X1
| ~ vertex(X1)
| ~ vertex(X0)
| ? [X2] :
( ( ( X1 = tail_of(X2)
& X0 = head_of(X2) )
| ( X0 = tail_of(X2)
& X1 = head_of(X2) ) )
& ( tail_of(X2) != X1
| head_of(X2) != X0
| tail_of(X2) != X0
| head_of(X2) != X1 )
& edge(X2) ) ) ),
inference(flattening,[],[f47]) ).
fof(f49,plain,
( ~ complete
| ! [X0,X1] :
( X0 = X1
| ~ vertex(X1)
| ~ vertex(X0)
| ( ( ( tail_of(sK0(X0,X1)) = X1
& head_of(sK0(X0,X1)) = X0 )
| ( tail_of(sK0(X0,X1)) = X0
& head_of(sK0(X0,X1)) = X1 ) )
& ( tail_of(sK0(X0,X1)) != X1
| head_of(sK0(X0,X1)) != X0
| tail_of(sK0(X0,X1)) != X0
| head_of(sK0(X0,X1)) != X1 )
& edge(sK0(X0,X1)) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f48]) ).
fof(f55,plain,
! [X0,X1] :
( ( ~ sequential(X0,X1)
| ( head_of(X0) = tail_of(X1)
& X0 != X1
& edge(X1)
& edge(X0) ) )
& ( head_of(X0) != tail_of(X1)
| X0 = X1
| ~ edge(X1)
| ~ edge(X0)
| sequential(X0,X1) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f56,plain,
! [X0,X1] :
( ( ~ sequential(X0,X1)
| ( head_of(X0) = tail_of(X1)
& X0 != X1
& edge(X1)
& edge(X0) ) )
& ( head_of(X0) != tail_of(X1)
| X0 = X1
| ~ edge(X1)
| ~ edge(X0)
| sequential(X0,X1) ) ),
inference(flattening,[],[f55]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ~ path(X1,X2,X0)
| ! [X3,X4] :
( ~ precedes(X3,X4,X0)
| ( ( sequential(X3,X4)
| ? [X5] :
( precedes(X5,X4,X0)
& sequential(X3,X5) ) )
& ( ~ sequential(X3,X4)
| ! [X5] :
( ~ precedes(X5,X4,X0)
| ~ sequential(X3,X5) ) )
& on_path(X4,X0)
& on_path(X3,X0) ) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f58,plain,
! [X0,X1,X2] :
( ~ path(X1,X2,X0)
| ! [X3,X4] :
( ~ precedes(X3,X4,X0)
| ( ( sequential(X3,X4)
| ? [X5] :
( precedes(X5,X4,X0)
& sequential(X3,X5) ) )
& ( ~ sequential(X3,X4)
| ! [X5] :
( ~ precedes(X5,X4,X0)
| ~ sequential(X3,X5) ) )
& on_path(X4,X0)
& on_path(X3,X0) ) ) ),
inference(flattening,[],[f57]) ).
fof(f59,plain,
! [X0,X1,X2] :
( ~ path(X1,X2,X0)
| ! [X3,X4] :
( ~ precedes(X3,X4,X0)
| ( ( sequential(X3,X4)
| ? [X6] :
( precedes(X6,X4,X0)
& sequential(X3,X6) ) )
& ( ~ sequential(X3,X4)
| ! [X5] :
( ~ precedes(X5,X4,X0)
| ~ sequential(X3,X5) ) )
& on_path(X4,X0)
& on_path(X3,X0) ) ) ),
inference(rectify,[],[f58]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ~ path(X1,X2,X0)
| ! [X3,X4] :
( ~ precedes(X3,X4,X0)
| ( ( sequential(X3,X4)
| ( precedes(sK4(X0,X3,X4),X4,X0)
& sequential(X3,sK4(X0,X3,X4)) ) )
& ( ~ sequential(X3,X4)
| ! [X5] :
( ~ precedes(X5,X4,X0)
| ~ sequential(X3,X5) ) )
& on_path(X4,X0)
& on_path(X3,X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X6,sK4(X0,X3,X4))],[f59]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ( ~ shortest_path(X0,X1,X2)
| ( ! [X3] :
( ~ path(X0,X1,X3)
| less_or_equal(length_of(X2),length_of(X3)) )
& X0 != X1
& path(X0,X1,X2) ) )
& ( ? [X3] :
( path(X0,X1,X3)
& ~ less_or_equal(length_of(X2),length_of(X3)) )
| X0 = X1
| ~ path(X0,X1,X2)
| shortest_path(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f36]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ( ~ shortest_path(X0,X1,X2)
| ( ! [X3] :
( ~ path(X0,X1,X3)
| less_or_equal(length_of(X2),length_of(X3)) )
& X0 != X1
& path(X0,X1,X2) ) )
& ( ? [X3] :
( path(X0,X1,X3)
& ~ less_or_equal(length_of(X2),length_of(X3)) )
| X0 = X1
| ~ path(X0,X1,X2)
| shortest_path(X0,X1,X2) ) ),
inference(flattening,[],[f61]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ( ~ shortest_path(X0,X1,X2)
| ( ! [X4] :
( ~ path(X0,X1,X4)
| less_or_equal(length_of(X2),length_of(X4)) )
& X0 != X1
& path(X0,X1,X2) ) )
& ( ? [X3] :
( path(X0,X1,X3)
& ~ less_or_equal(length_of(X2),length_of(X3)) )
| X0 = X1
| ~ path(X0,X1,X2)
| shortest_path(X0,X1,X2) ) ),
inference(rectify,[],[f62]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ( ~ shortest_path(X0,X1,X2)
| ( ! [X4] :
( ~ path(X0,X1,X4)
| less_or_equal(length_of(X2),length_of(X4)) )
& X0 != X1
& path(X0,X1,X2) ) )
& ( ( path(X0,X1,sK5(X0,X1,X2))
& ~ less_or_equal(length_of(X2),length_of(sK5(X0,X1,X2))) )
| X0 = X1
| ~ path(X0,X1,X2)
| shortest_path(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X3,sK5(X0,X1,X2))],[f63]) ).
fof(f66,plain,
( complete
& ? [X0,X1,X2,X3,X4] :
( precedes(X2,X3,X4)
& shortest_path(X0,X1,X4)
& ( ! [X5] :
( head_of(X3) != head_of(X5)
| tail_of(X2) != tail_of(X5)
| ~ edge(X5) )
| ? [X6] :
( tail_of(X2) = head_of(X6)
& head_of(X3) = tail_of(X6)
& edge(X6) ) )
& ( ! [X6] :
( tail_of(X2) != head_of(X6)
| head_of(X3) != tail_of(X6)
| ~ edge(X6) )
| ? [X5] :
( head_of(X5) = head_of(X3)
& tail_of(X5) = tail_of(X2)
& edge(X5) ) ) ) ),
inference(nnf_transformation,[],[f46]) ).
fof(f67,plain,
( complete
& ? [X0,X1,X2,X3,X4] :
( precedes(X2,X3,X4)
& shortest_path(X0,X1,X4)
& ( ! [X5] :
( head_of(X3) != head_of(X5)
| tail_of(X2) != tail_of(X5)
| ~ edge(X5) )
| ? [X6] :
( tail_of(X2) = head_of(X6)
& head_of(X3) = tail_of(X6)
& edge(X6) ) )
& ( ! [X6] :
( tail_of(X2) != head_of(X6)
| head_of(X3) != tail_of(X6)
| ~ edge(X6) )
| ? [X5] :
( head_of(X5) = head_of(X3)
& tail_of(X5) = tail_of(X2)
& edge(X5) ) ) ) ),
inference(flattening,[],[f66]) ).
fof(f68,plain,
( complete
& ? [X0,X1,X2,X3,X4] :
( precedes(X2,X3,X4)
& shortest_path(X0,X1,X4)
& ( ! [X8] :
( head_of(X3) != head_of(X8)
| tail_of(X2) != tail_of(X8)
| ~ edge(X8) )
| ? [X7] :
( tail_of(X2) = head_of(X7)
& head_of(X3) = tail_of(X7)
& edge(X7) ) )
& ( ! [X6] :
( tail_of(X2) != head_of(X6)
| head_of(X3) != tail_of(X6)
| ~ edge(X6) )
| ? [X5] :
( head_of(X5) = head_of(X3)
& tail_of(X5) = tail_of(X2)
& edge(X5) ) ) ) ),
inference(rectify,[],[f67]) ).
fof(f69,plain,
( complete
& precedes(sK10,sK11,sK12)
& shortest_path(sK8,sK9,sK12)
& ( ! [X8] :
( head_of(X8) != head_of(sK11)
| tail_of(X8) != tail_of(sK10)
| ~ edge(X8) )
| ( tail_of(sK10) = head_of(sK14)
& head_of(sK11) = tail_of(sK14)
& edge(sK14) ) )
& ( ! [X6] :
( head_of(X6) != tail_of(sK10)
| tail_of(X6) != head_of(sK11)
| ~ edge(X6) )
| ( head_of(sK11) = head_of(sK13)
& tail_of(sK10) = tail_of(sK13)
& edge(sK13) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11,sK12,sK13,sK14]),skolemize(X0,sK8),skolemize(X1,sK9),skolemize(X2,sK10),skolemize(X3,sK11),skolemize(X4,sK12),skolemize(X5,sK13),skolemize(X7,sK14)],[f68]) ).
fof(f71,plain,
! [X0] :
( ~ edge(X0)
| vertex(tail_of(X0)) ),
inference(cnf_transformation,[],[f23]) ).
fof(f72,plain,
! [X0] :
( ~ edge(X0)
| vertex(head_of(X0)) ),
inference(cnf_transformation,[],[f23]) ).
fof(f73,plain,
! [X0,X1] :
( ~ complete
| X0 = X1
| ~ vertex(X1)
| ~ vertex(X0)
| tail_of(sK0(X0,X1)) = X1
| tail_of(sK0(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f49]) ).
fof(f74,plain,
! [X0,X1] :
( ~ complete
| X0 = X1
| ~ vertex(X1)
| ~ vertex(X0)
| head_of(sK0(X0,X1)) = X0
| tail_of(sK0(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f49]) ).
fof(f75,plain,
! [X0,X1] :
( ~ complete
| X0 = X1
| ~ vertex(X1)
| ~ vertex(X0)
| tail_of(sK0(X0,X1)) = X1
| head_of(sK0(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f49]) ).
fof(f76,plain,
! [X0,X1] :
( ~ complete
| X0 = X1
| ~ vertex(X1)
| ~ vertex(X0)
| head_of(sK0(X0,X1)) = X0
| head_of(sK0(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f49]) ).
fof(f78,plain,
! [X0,X1] :
( ~ complete
| X0 = X1
| ~ vertex(X1)
| ~ vertex(X0)
| edge(sK0(X0,X1)) ),
inference(cnf_transformation,[],[f49]) ).
fof(f92,plain,
! [X2,X3,X0,X1] :
( ~ on_path(X3,X2)
| ~ path(X0,X1,X2)
| edge(X3) ),
inference(cnf_transformation,[],[f30]) ).
fof(f100,plain,
! [X0,X1] :
( head_of(X0) != tail_of(X1)
| X0 = X1
| ~ edge(X1)
| ~ edge(X0)
| sequential(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f102,plain,
! [X2,X3,X0,X1,X4] :
( ~ path(X1,X2,X0)
| ~ sequential(X3,X4)
| ~ on_path(X4,X0)
| ~ on_path(X3,X0)
| precedes(X3,X4,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f106,plain,
! [X2,X3,X0,X1,X4] :
( ~ path(X1,X2,X0)
| ~ precedes(X3,X4,X0)
| on_path(X4,X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f107,plain,
! [X2,X3,X0,X1,X4] :
( ~ path(X1,X2,X0)
| ~ precedes(X3,X4,X0)
| on_path(X3,X0) ),
inference(cnf_transformation,[],[f60]) ).
fof(f110,plain,
! [X2,X0,X1] :
( ~ shortest_path(X0,X1,X2)
| path(X0,X1,X2) ),
inference(cnf_transformation,[],[f64]) ).
fof(f113,plain,
! [X2,X3,X0,X1,X4] :
( ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X3,X2,X4) ),
inference(cnf_transformation,[],[f38]) ).
fof(f114,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ precedes(X2,X3,X4)
| ~ shortest_path(X0,X1,X4)
| head_of(X3) != head_of(X5)
| tail_of(X2) != tail_of(X5) ),
inference(cnf_transformation,[],[f38]) ).
fof(f123,plain,
complete,
inference(cnf_transformation,[],[f69]) ).
fof(f124,plain,
precedes(sK10,sK11,sK12),
inference(cnf_transformation,[],[f69]) ).
fof(f125,plain,
shortest_path(sK8,sK9,sK12),
inference(cnf_transformation,[],[f69]) ).
fof(f129,plain,
! [X6] :
( head_of(X6) != tail_of(sK10)
| tail_of(X6) != head_of(sK11)
| ~ edge(X6)
| head_of(sK11) = head_of(sK13) ),
inference(cnf_transformation,[],[f69]) ).
fof(f130,plain,
! [X6] :
( head_of(X6) != tail_of(sK10)
| tail_of(X6) != head_of(sK11)
| ~ edge(X6)
| tail_of(sK10) = tail_of(sK13) ),
inference(cnf_transformation,[],[f69]) ).
tcf(c_50,plain,
! [X0: $i] :
( vertex(head_of(X0))
| ~ edge(X0) ),
inference(cnf_transformation,[],[f72]) ).
tcf(c_51,plain,
! [X0: $i] :
( vertex(tail_of(X0))
| ~ edge(X0) ),
inference(cnf_transformation,[],[f71]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( edge(sK0(X0,X1))
| ( X0 = X1 )
| ~ complete
| ~ vertex(X1)
| ~ vertex(X0) ),
inference(cnf_transformation,[],[f78]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( head_of(sK0(X0,X1)) = X1 )
| ( head_of(sK0(X0,X1)) = X0 )
| ~ complete
| ~ vertex(X1)
| ~ vertex(X0) ),
inference(cnf_transformation,[],[f76]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( tail_of(sK0(X0,X1)) = X1 )
| ( head_of(sK0(X0,X1)) = X1 )
| ~ complete
| ~ vertex(X1)
| ~ vertex(X0) ),
inference(cnf_transformation,[],[f75]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( tail_of(sK0(X0,X1)) = X0 )
| ( head_of(sK0(X0,X1)) = X0 )
| ~ complete
| ~ vertex(X1)
| ~ vertex(X0) ),
inference(cnf_transformation,[],[f74]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( tail_of(sK0(X0,X1)) = X1 )
| ( tail_of(sK0(X0,X1)) = X0 )
| ~ complete
| ~ vertex(X1)
| ~ vertex(X0) ),
inference(cnf_transformation,[],[f73]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( edge(X3)
| ~ on_path(X3,X2)
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[],[f92]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( sequential(X0,X1)
| ( X0 = X1 )
| ~ edge(X1)
| ~ edge(X0)
| ( head_of(X0) != tail_of(X1) ) ),
inference(cnf_transformation,[],[f100]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( precedes(X3,X4,X2)
| ~ sequential(X3,X4)
| ~ on_path(X4,X2)
| ~ on_path(X3,X2)
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( on_path(X3,X2)
| ~ precedes(X3,X4,X2)
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[],[f107]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( on_path(X4,X2)
| ~ precedes(X3,X4,X2)
| ~ path(X0,X1,X2) ),
inference(cnf_transformation,[],[f106]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i,X2: $i] :
( path(X0,X1,X2)
| ~ shortest_path(X0,X1,X2) ),
inference(cnf_transformation,[],[f110]) ).
tcf(c_92,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
( ~ shortest_path(X4,X5,X3)
| ~ precedes(X2,X0,X3)
| ( tail_of(X1) != tail_of(X2) )
| ( head_of(X0) != head_of(X1) ) ),
inference(cnf_transformation,[],[f114]) ).
tcf(c_93,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ~ shortest_path(X3,X4,X2)
| ~ precedes(X1,X0,X2)
| ~ precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f113]) ).
tcf(c_103,negated_conjecture,
! [X0: $i] :
( ( tail_of(sK13) = tail_of(sK10) )
| ~ edge(X0)
| ( tail_of(X0) != head_of(sK11) )
| ( head_of(X0) != tail_of(sK10) ) ),
inference(cnf_transformation,[],[f130]) ).
tcf(c_104,negated_conjecture,
! [X0: $i] :
( ( head_of(sK13) = head_of(sK11) )
| ~ edge(X0)
| ( tail_of(X0) != head_of(sK11) )
| ( head_of(X0) != tail_of(sK10) ) ),
inference(cnf_transformation,[],[f129]) ).
tcf(c_108,negated_conjecture,
shortest_path(sK8,sK9,sK12),
inference(cnf_transformation,[],[f125]) ).
tcf(c_109,negated_conjecture,
precedes(sK10,sK11,sK12),
inference(cnf_transformation,[],[f124]) ).
tcf(c_110,negated_conjecture,
complete,
inference(cnf_transformation,[],[f123]) ).
tcf(c_113,plain,
( vertex(tail_of(sK10))
| ~ edge(sK10) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_150,plain,
! [X0: $i,X1: $i] :
( edge(sK0(X0,X1))
| ( X0 = X1 )
| ~ vertex(X0)
| ~ vertex(X1) ),
inference(global_subsumption_just,[status(thm)],[c_52,c_110,c_52]) ).
tcf(c_151,plain,
! [X0: $i,X1: $i] :
( edge(sK0(X0,X1))
| ( X0 = X1 )
| ~ vertex(X1)
| ~ vertex(X0) ),
inference(renaming,[status(thm)],[c_150]) ).
tcf(c_163,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( tail_of(sK0(X0,X1)) = X1 )
| ( tail_of(sK0(X0,X1)) = X0 )
| ~ vertex(X0)
| ~ vertex(X1) ),
inference(global_subsumption_just,[status(thm)],[c_57,c_110,c_57]) ).
tcf(c_164,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( tail_of(sK0(X0,X1)) = X1 )
| ( tail_of(sK0(X0,X1)) = X0 )
| ~ vertex(X1)
| ~ vertex(X0) ),
inference(renaming,[status(thm)],[c_163]) ).
tcf(c_166,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( tail_of(sK0(X0,X1)) = X0 )
| ( head_of(sK0(X0,X1)) = X0 )
| ~ vertex(X0)
| ~ vertex(X1) ),
inference(global_subsumption_just,[status(thm)],[c_56,c_110,c_56]) ).
tcf(c_167,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( tail_of(sK0(X0,X1)) = X0 )
| ( head_of(sK0(X0,X1)) = X0 )
| ~ vertex(X1)
| ~ vertex(X0) ),
inference(renaming,[status(thm)],[c_166]) ).
tcf(c_168,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( tail_of(sK0(X0,X1)) = X1 )
| ( head_of(sK0(X0,X1)) = X1 )
| ~ vertex(X0)
| ~ vertex(X1) ),
inference(global_subsumption_just,[status(thm)],[c_55,c_110,c_55]) ).
tcf(c_169,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( tail_of(sK0(X0,X1)) = X1 )
| ( head_of(sK0(X0,X1)) = X1 )
| ~ vertex(X1)
| ~ vertex(X0) ),
inference(renaming,[status(thm)],[c_168]) ).
tcf(c_170,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( head_of(sK0(X0,X1)) = X1 )
| ( head_of(sK0(X0,X1)) = X0 )
| ~ vertex(X0)
| ~ vertex(X1) ),
inference(global_subsumption_just,[status(thm)],[c_54,c_110,c_54]) ).
tcf(c_171,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( head_of(sK0(X0,X1)) = X1 )
| ( head_of(sK0(X0,X1)) = X0 )
| ~ vertex(X1)
| ~ vertex(X0) ),
inference(renaming,[status(thm)],[c_170]) ).
tcf(c_908,plain,
! [X0: $i,X1: $i,X2: $i] :
( path(X0,X1,X2)
| ( X2 != sK12 )
| ( X1 != sK9 )
| ( X0 != sK8 ) ),
inference(resolution_lifted,[status(thm)],[c_89,c_108]) ).
tcf(c_909,plain,
path(sK8,sK9,sK12),
inference(unflattening,[status(thm)],[c_908]) ).
tcf(c_1754,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X1_iProver_shortest_path_2: iProver_shortest_path_2] :
( ( X0_iProver_shortest_path_2 = X1_iProver_shortest_path_2 )
| ( head_of(sK0(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2)) = X1_iProver_shortest_path_2 )
| ( head_of(sK0(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2)) = X0_iProver_shortest_path_2 )
| ~ vertex(X1_iProver_shortest_path_2)
| ~ vertex(X0_iProver_shortest_path_2) ),
inference(subtyping,[status(esa)],[c_171]) ).
tcf(c_1755,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X1_iProver_shortest_path_2: iProver_shortest_path_2] :
( ( X0_iProver_shortest_path_2 = X1_iProver_shortest_path_2 )
| ( tail_of(sK0(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2)) = X1_iProver_shortest_path_2 )
| ( head_of(sK0(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2)) = X1_iProver_shortest_path_2 )
| ~ vertex(X1_iProver_shortest_path_2)
| ~ vertex(X0_iProver_shortest_path_2) ),
inference(subtyping,[status(esa)],[c_169]) ).
tcf(c_1756,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X1_iProver_shortest_path_2: iProver_shortest_path_2] :
( ( X0_iProver_shortest_path_2 = X1_iProver_shortest_path_2 )
| ( tail_of(sK0(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2)) = X0_iProver_shortest_path_2 )
| ( head_of(sK0(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2)) = X0_iProver_shortest_path_2 )
| ~ vertex(X1_iProver_shortest_path_2)
| ~ vertex(X0_iProver_shortest_path_2) ),
inference(subtyping,[status(esa)],[c_167]) ).
tcf(c_1757,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X1_iProver_shortest_path_2: iProver_shortest_path_2] :
( ( X0_iProver_shortest_path_2 = X1_iProver_shortest_path_2 )
| ( tail_of(sK0(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2)) = X1_iProver_shortest_path_2 )
| ( tail_of(sK0(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2)) = X0_iProver_shortest_path_2 )
| ~ vertex(X1_iProver_shortest_path_2)
| ~ vertex(X0_iProver_shortest_path_2) ),
inference(subtyping,[status(esa)],[c_164]) ).
tcf(c_1760,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X1_iProver_shortest_path_2: iProver_shortest_path_2] :
( edge(sK0(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2))
| ( X0_iProver_shortest_path_2 = X1_iProver_shortest_path_2 )
| ~ vertex(X1_iProver_shortest_path_2)
| ~ vertex(X0_iProver_shortest_path_2) ),
inference(subtyping,[status(esa)],[c_151]) ).
tcf(c_1761,negated_conjecture,
precedes(sK10,sK11,sK12),
inference(subtyping,[status(esa)],[c_109]) ).
tcf(c_1762,negated_conjecture,
shortest_path(sK8,sK9,sK12),
inference(subtyping,[status(esa)],[c_108]) ).
tcf(c_1766,negated_conjecture,
! [X0_iProver_edge_1: iProver_edge_1] :
( ( head_of(sK13) = head_of(sK11) )
| ~ edge(X0_iProver_edge_1)
| ( tail_of(X0_iProver_edge_1) != head_of(sK11) )
| ( head_of(X0_iProver_edge_1) != tail_of(sK10) ) ),
inference(subtyping,[status(esa)],[c_104]) ).
tcf(c_1767,negated_conjecture,
! [X0_iProver_edge_1: iProver_edge_1] :
( ( tail_of(sK13) = tail_of(sK10) )
| ~ edge(X0_iProver_edge_1)
| ( tail_of(X0_iProver_edge_1) != head_of(sK11) )
| ( head_of(X0_iProver_edge_1) != tail_of(sK10) ) ),
inference(subtyping,[status(esa)],[c_103]) ).
tcf(c_1775,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X0_iProver_sK7_1: iProver_sK7_1,X0_iProver_edge_1: iProver_edge_1,X1_iProver_shortest_path_2: iProver_shortest_path_2,X1_iProver_edge_1: iProver_edge_1] :
( ~ shortest_path(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2,X0_iProver_sK7_1)
| ~ precedes(X1_iProver_edge_1,X0_iProver_edge_1,X0_iProver_sK7_1)
| ~ precedes(X0_iProver_edge_1,X1_iProver_edge_1,X0_iProver_sK7_1) ),
inference(subtyping,[status(esa)],[c_93]) ).
tcf(c_1776,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X0_iProver_sK7_1: iProver_sK7_1,X0_iProver_edge_1: iProver_edge_1,X1_iProver_shortest_path_2: iProver_shortest_path_2,X1_iProver_edge_1: iProver_edge_1,X2_iProver_edge_1: iProver_edge_1] :
( ~ shortest_path(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2,X0_iProver_sK7_1)
| ~ precedes(X2_iProver_edge_1,X0_iProver_edge_1,X0_iProver_sK7_1)
| ( tail_of(X1_iProver_edge_1) != tail_of(X2_iProver_edge_1) )
| ( head_of(X0_iProver_edge_1) != head_of(X1_iProver_edge_1) ) ),
inference(subtyping,[status(esa)],[c_92]) ).
tcf(c_1779,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X0_iProver_sK7_1: iProver_sK7_1,X1_iProver_shortest_path_2: iProver_shortest_path_2] :
( path(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2,X0_iProver_sK7_1)
| ~ shortest_path(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2,X0_iProver_sK7_1) ),
inference(subtyping,[status(esa)],[c_89]) ).
tcf(c_1785,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X0_iProver_sK7_1: iProver_sK7_1,X0_iProver_edge_1: iProver_edge_1,X1_iProver_shortest_path_2: iProver_shortest_path_2,X1_iProver_edge_1: iProver_edge_1] :
( on_path(X1_iProver_edge_1,X0_iProver_sK7_1)
| ~ precedes(X0_iProver_edge_1,X1_iProver_edge_1,X0_iProver_sK7_1)
| ~ path(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2,X0_iProver_sK7_1) ),
inference(subtyping,[status(esa)],[c_83]) ).
tcf(c_1786,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X0_iProver_sK7_1: iProver_sK7_1,X0_iProver_edge_1: iProver_edge_1,X1_iProver_shortest_path_2: iProver_shortest_path_2,X1_iProver_edge_1: iProver_edge_1] :
( on_path(X0_iProver_edge_1,X0_iProver_sK7_1)
| ~ precedes(X0_iProver_edge_1,X1_iProver_edge_1,X0_iProver_sK7_1)
| ~ path(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2,X0_iProver_sK7_1) ),
inference(subtyping,[status(esa)],[c_82]) ).
tcf(c_1787,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X0_iProver_sK7_1: iProver_sK7_1,X0_iProver_edge_1: iProver_edge_1,X1_iProver_shortest_path_2: iProver_shortest_path_2,X1_iProver_edge_1: iProver_edge_1] :
( precedes(X0_iProver_edge_1,X1_iProver_edge_1,X0_iProver_sK7_1)
| ~ sequential(X0_iProver_edge_1,X1_iProver_edge_1)
| ~ on_path(X1_iProver_edge_1,X0_iProver_sK7_1)
| ~ on_path(X0_iProver_edge_1,X0_iProver_sK7_1)
| ~ path(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2,X0_iProver_sK7_1) ),
inference(subtyping,[status(esa)],[c_80]) ).
tcf(c_1792,plain,
! [X0_iProver_edge_1: iProver_edge_1,X1_iProver_edge_1: iProver_edge_1] :
( sequential(X0_iProver_edge_1,X1_iProver_edge_1)
| ( X0_iProver_edge_1 = X1_iProver_edge_1 )
| ~ edge(X1_iProver_edge_1)
| ~ edge(X0_iProver_edge_1)
| ( head_of(X0_iProver_edge_1) != tail_of(X1_iProver_edge_1) ) ),
inference(subtyping,[status(esa)],[c_75]) ).
tcf(c_1798,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X0_iProver_sK7_1: iProver_sK7_1,X0_iProver_edge_1: iProver_edge_1,X1_iProver_shortest_path_2: iProver_shortest_path_2] :
( edge(X0_iProver_edge_1)
| ~ on_path(X0_iProver_edge_1,X0_iProver_sK7_1)
| ~ path(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2,X0_iProver_sK7_1) ),
inference(subtyping,[status(esa)],[c_69]) ).
tcf(c_1809,plain,
! [X0_iProver_edge_1: iProver_edge_1] :
( vertex(head_of(X0_iProver_edge_1))
| ~ edge(X0_iProver_edge_1) ),
inference(subtyping,[status(esa)],[c_50]) ).
tcf(c_1814,plain,
! [X0_iProver_edge_1: iProver_edge_1] : X0_iProver_edge_1 = X0_iProver_edge_1,
theory(equality) ).
tcf(c_1816,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X1_iProver_shortest_path_2: iProver_shortest_path_2,X2_iProver_shortest_path_2: iProver_shortest_path_2] :
( ( X2_iProver_shortest_path_2 = X0_iProver_shortest_path_2 )
| ( X2_iProver_shortest_path_2 != X1_iProver_shortest_path_2 )
| ( X0_iProver_shortest_path_2 != X1_iProver_shortest_path_2 ) ),
theory(equality) ).
tcf(c_1820,plain,
! [X0_iProver_edge_1: iProver_edge_1,X1_iProver_edge_1: iProver_edge_1] :
( ( head_of(X0_iProver_edge_1) = head_of(X1_iProver_edge_1) )
| ( X0_iProver_edge_1 != X1_iProver_edge_1 ) ),
theory(equality) ).
tcf(c_1821,plain,
! [X0_iProver_edge_1: iProver_edge_1,X1_iProver_edge_1: iProver_edge_1] :
( ( tail_of(X0_iProver_edge_1) = tail_of(X1_iProver_edge_1) )
| ( X0_iProver_edge_1 != X1_iProver_edge_1 ) ),
theory(equality) ).
tcf(c_1836,plain,
( ( tail_of(sK10) = tail_of(sK10) )
| ( sK10 != sK10 ) ),
inference(instantiation,[status(thm)],[c_1821]) ).
tcf(c_1844,plain,
sK10 = sK10,
inference(instantiation,[status(thm)],[c_1814]) ).
tcf(c_2926,plain,
! [X0_iProver_edge_1: iProver_edge_1,X1_iProver_edge_1: iProver_edge_1,X2_iProver_edge_1: iProver_edge_1] :
( ~ shortest_path(sK8,sK9,sK12)
| ~ precedes(X2_iProver_edge_1,X0_iProver_edge_1,sK12)
| ( tail_of(X1_iProver_edge_1) != tail_of(X2_iProver_edge_1) )
| ( head_of(X0_iProver_edge_1) != head_of(X1_iProver_edge_1) ) ),
inference(instantiation,[status(thm)],[c_1776]) ).
tcf(c_2927,plain,
! [X0_iProver_edge_1: iProver_edge_1,X1_iProver_edge_1: iProver_edge_1] :
( ~ shortest_path(sK8,sK9,sK12)
| ~ precedes(X1_iProver_edge_1,X0_iProver_edge_1,sK12)
| ~ precedes(X0_iProver_edge_1,X1_iProver_edge_1,sK12) ),
inference(instantiation,[status(thm)],[c_1775]) ).
tcf(c_2944,plain,
! [X0_iProver_edge_1: iProver_edge_1] :
( ( head_of(sK11) = head_of(X0_iProver_edge_1) )
| ( sK11 != X0_iProver_edge_1 ) ),
inference(instantiation,[status(thm)],[c_1820]) ).
tcf(c_2945,plain,
( ( head_of(sK11) = head_of(sK10) )
| ( sK11 != sK10 ) ),
inference(instantiation,[status(thm)],[c_2944]) ).
tcf(c_2948,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X0_iProver_edge_1: iProver_edge_1] :
( ( head_of(sK11) = head_of(X0_iProver_edge_1) )
| ( head_of(sK11) != X0_iProver_shortest_path_2 )
| ( head_of(X0_iProver_edge_1) != X0_iProver_shortest_path_2 ) ),
inference(instantiation,[status(thm)],[c_1816]) ).
tcf(c_2950,plain,
! [X0_iProver_edge_1: iProver_edge_1] :
( ~ shortest_path(sK8,sK9,sK12)
| ~ precedes(sK10,sK11,sK12)
| ( head_of(sK11) != head_of(X0_iProver_edge_1) )
| ( tail_of(X0_iProver_edge_1) != tail_of(sK10) ) ),
inference(instantiation,[status(thm)],[c_2926]) ).
tcf(c_2951,plain,
( ~ shortest_path(sK8,sK9,sK12)
| ~ precedes(sK10,sK11,sK12)
| ( tail_of(sK10) != tail_of(sK10) )
| ( head_of(sK11) != head_of(sK10) ) ),
inference(instantiation,[status(thm)],[c_2950]) ).
tcf(c_2967,plain,
( ~ shortest_path(sK8,sK9,sK12)
| ~ precedes(sK10,sK11,sK12)
| ~ precedes(sK11,sK10,sK12) ),
inference(instantiation,[status(thm)],[c_2927]) ).
tcf(c_2982,plain,
! [X0_iProver_edge_1: iProver_edge_1] :
( sequential(sK11,X0_iProver_edge_1)
| ( sK11 = X0_iProver_edge_1 )
| ~ edge(sK11)
| ~ edge(X0_iProver_edge_1)
| ( head_of(sK11) != tail_of(X0_iProver_edge_1) ) ),
inference(instantiation,[status(thm)],[c_1792]) ).
tcf(c_2983,plain,
( sequential(sK11,sK10)
| ( sK11 = sK10 )
| ~ edge(sK10)
| ~ edge(sK11)
| ( head_of(sK11) != tail_of(sK10) ) ),
inference(instantiation,[status(thm)],[c_2982]) ).
tcf(c_2984,plain,
( ( head_of(sK11) = head_of(sK11) )
| ( sK11 != sK11 ) ),
inference(instantiation,[status(thm)],[c_2944]) ).
tcf(c_2987,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2] :
( ( head_of(sK11) = X0_iProver_shortest_path_2 )
| ( head_of(sK0(head_of(sK11),X0_iProver_shortest_path_2)) = X0_iProver_shortest_path_2 )
| ( head_of(sK0(head_of(sK11),X0_iProver_shortest_path_2)) = head_of(sK11) )
| ~ vertex(X0_iProver_shortest_path_2)
| ~ vertex(head_of(sK11)) ),
inference(instantiation,[status(thm)],[c_1754]) ).
tcf(c_2988,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2] :
( ( head_of(sK11) = X0_iProver_shortest_path_2 )
| ( tail_of(sK0(head_of(sK11),X0_iProver_shortest_path_2)) = X0_iProver_shortest_path_2 )
| ( head_of(sK0(head_of(sK11),X0_iProver_shortest_path_2)) = X0_iProver_shortest_path_2 )
| ~ vertex(X0_iProver_shortest_path_2)
| ~ vertex(head_of(sK11)) ),
inference(instantiation,[status(thm)],[c_1755]) ).
tcf(c_2989,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2] :
( ( head_of(sK11) = X0_iProver_shortest_path_2 )
| ( tail_of(sK0(head_of(sK11),X0_iProver_shortest_path_2)) = head_of(sK11) )
| ( head_of(sK0(head_of(sK11),X0_iProver_shortest_path_2)) = head_of(sK11) )
| ~ vertex(X0_iProver_shortest_path_2)
| ~ vertex(head_of(sK11)) ),
inference(instantiation,[status(thm)],[c_1756]) ).
tcf(c_2990,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2] :
( ( head_of(sK11) = X0_iProver_shortest_path_2 )
| ( tail_of(sK0(head_of(sK11),X0_iProver_shortest_path_2)) = X0_iProver_shortest_path_2 )
| ( tail_of(sK0(head_of(sK11),X0_iProver_shortest_path_2)) = head_of(sK11) )
| ~ vertex(X0_iProver_shortest_path_2)
| ~ vertex(head_of(sK11)) ),
inference(instantiation,[status(thm)],[c_1757]) ).
tcf(c_2993,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2] :
( edge(sK0(head_of(sK11),X0_iProver_shortest_path_2))
| ( head_of(sK11) = X0_iProver_shortest_path_2 )
| ~ vertex(X0_iProver_shortest_path_2)
| ~ vertex(head_of(sK11)) ),
inference(instantiation,[status(thm)],[c_1760]) ).
tcf(c_3002,plain,
! [X0_iProver_edge_1: iProver_edge_1,X1_iProver_edge_1: iProver_edge_1] :
( ( head_of(sK11) = head_of(X0_iProver_edge_1) )
| ( head_of(sK11) != head_of(X1_iProver_edge_1) )
| ( head_of(X0_iProver_edge_1) != head_of(X1_iProver_edge_1) ) ),
inference(instantiation,[status(thm)],[c_2948]) ).
tcf(c_3015,plain,
( vertex(head_of(sK11))
| ~ edge(sK11) ),
inference(instantiation,[status(thm)],[c_1809]) ).
tcf(c_3094,plain,
sK11 = sK11,
inference(instantiation,[status(thm)],[c_1814]) ).
tcf(c_3165,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X1_iProver_shortest_path_2: iProver_shortest_path_2] :
( ( tail_of(sK10) = X1_iProver_shortest_path_2 )
| ( X1_iProver_shortest_path_2 != X0_iProver_shortest_path_2 )
| ( tail_of(sK10) != X0_iProver_shortest_path_2 ) ),
inference(instantiation,[status(thm)],[c_1816]) ).
tcf(c_3176,plain,
! [X0_iProver_edge_1: iProver_edge_1] :
( ( head_of(sK11) = head_of(X0_iProver_edge_1) )
| ( head_of(sK11) != head_of(sK11) )
| ( head_of(X0_iProver_edge_1) != head_of(sK11) ) ),
inference(instantiation,[status(thm)],[c_3002]) ).
tcf(c_3203,plain,
! [X0_iProver_edge_1: iProver_edge_1] :
( edge(sK0(head_of(sK11),tail_of(X0_iProver_edge_1)))
| ( head_of(sK11) = tail_of(X0_iProver_edge_1) )
| ~ vertex(head_of(sK11))
| ~ vertex(tail_of(X0_iProver_edge_1)) ),
inference(instantiation,[status(thm)],[c_2993]) ).
tcf(c_3204,plain,
( edge(sK0(head_of(sK11),tail_of(sK10)))
| ( head_of(sK11) = tail_of(sK10) )
| ~ vertex(tail_of(sK10))
| ~ vertex(head_of(sK11)) ),
inference(instantiation,[status(thm)],[c_3203]) ).
tcf(c_3223,plain,
! [X0_iProver_edge_1: iProver_edge_1] :
( ( head_of(sK11) = tail_of(X0_iProver_edge_1) )
| ( head_of(sK0(head_of(sK11),tail_of(X0_iProver_edge_1))) = head_of(sK11) )
| ( head_of(sK0(head_of(sK11),tail_of(X0_iProver_edge_1))) = tail_of(X0_iProver_edge_1) )
| ~ vertex(head_of(sK11))
| ~ vertex(tail_of(X0_iProver_edge_1)) ),
inference(instantiation,[status(thm)],[c_2987]) ).
tcf(c_3224,plain,
( ( head_of(sK11) = tail_of(sK10) )
| ( head_of(sK0(head_of(sK11),tail_of(sK10))) = tail_of(sK10) )
| ( head_of(sK0(head_of(sK11),tail_of(sK10))) = head_of(sK11) )
| ~ vertex(tail_of(sK10))
| ~ vertex(head_of(sK11)) ),
inference(instantiation,[status(thm)],[c_3223]) ).
tcf(c_3226,plain,
! [X0_iProver_edge_1: iProver_edge_1] :
( ( head_of(sK11) = tail_of(X0_iProver_edge_1) )
| ( tail_of(sK0(head_of(sK11),tail_of(X0_iProver_edge_1))) = tail_of(X0_iProver_edge_1) )
| ( head_of(sK0(head_of(sK11),tail_of(X0_iProver_edge_1))) = tail_of(X0_iProver_edge_1) )
| ~ vertex(head_of(sK11))
| ~ vertex(tail_of(X0_iProver_edge_1)) ),
inference(instantiation,[status(thm)],[c_2988]) ).
tcf(c_3227,plain,
( ( head_of(sK11) = tail_of(sK10) )
| ( tail_of(sK0(head_of(sK11),tail_of(sK10))) = tail_of(sK10) )
| ( head_of(sK0(head_of(sK11),tail_of(sK10))) = tail_of(sK10) )
| ~ vertex(tail_of(sK10))
| ~ vertex(head_of(sK11)) ),
inference(instantiation,[status(thm)],[c_3226]) ).
tcf(c_3229,plain,
! [X0_iProver_edge_1: iProver_edge_1] :
( ( head_of(sK11) = tail_of(X0_iProver_edge_1) )
| ( tail_of(sK0(head_of(sK11),tail_of(X0_iProver_edge_1))) = head_of(sK11) )
| ( head_of(sK0(head_of(sK11),tail_of(X0_iProver_edge_1))) = head_of(sK11) )
| ~ vertex(head_of(sK11))
| ~ vertex(tail_of(X0_iProver_edge_1)) ),
inference(instantiation,[status(thm)],[c_2989]) ).
tcf(c_3230,plain,
( ( head_of(sK11) = tail_of(sK10) )
| ( tail_of(sK0(head_of(sK11),tail_of(sK10))) = head_of(sK11) )
| ( head_of(sK0(head_of(sK11),tail_of(sK10))) = head_of(sK11) )
| ~ vertex(tail_of(sK10))
| ~ vertex(head_of(sK11)) ),
inference(instantiation,[status(thm)],[c_3229]) ).
tcf(c_3236,plain,
! [X0_iProver_edge_1: iProver_edge_1] :
( ( head_of(sK11) = tail_of(X0_iProver_edge_1) )
| ( tail_of(sK0(head_of(sK11),tail_of(X0_iProver_edge_1))) = head_of(sK11) )
| ( tail_of(sK0(head_of(sK11),tail_of(X0_iProver_edge_1))) = tail_of(X0_iProver_edge_1) )
| ~ vertex(head_of(sK11))
| ~ vertex(tail_of(X0_iProver_edge_1)) ),
inference(instantiation,[status(thm)],[c_2990]) ).
tcf(c_3237,plain,
( ( head_of(sK11) = tail_of(sK10) )
| ( tail_of(sK0(head_of(sK11),tail_of(sK10))) = tail_of(sK10) )
| ( tail_of(sK0(head_of(sK11),tail_of(sK10))) = head_of(sK11) )
| ~ vertex(tail_of(sK10))
| ~ vertex(head_of(sK11)) ),
inference(instantiation,[status(thm)],[c_3236]) ).
tcf(c_3270,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2] :
( ( tail_of(sK10) = X0_iProver_shortest_path_2 )
| ( X0_iProver_shortest_path_2 != tail_of(sK10) )
| ( tail_of(sK10) != tail_of(sK10) ) ),
inference(instantiation,[status(thm)],[c_3165]) ).
tcf(c_3297,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X0_iProver_edge_1: iProver_edge_1,X1_iProver_shortest_path_2: iProver_shortest_path_2] :
( ( X1_iProver_shortest_path_2 = tail_of(X0_iProver_edge_1) )
| ( X1_iProver_shortest_path_2 != X0_iProver_shortest_path_2 )
| ( tail_of(X0_iProver_edge_1) != X0_iProver_shortest_path_2 ) ),
inference(instantiation,[status(thm)],[c_1816]) ).
tcf(c_3402,plain,
! [X0_iProver_edge_1: iProver_edge_1,X1_iProver_edge_1: iProver_edge_1] :
( on_path(X0_iProver_edge_1,sK12)
| ~ path(sK8,sK9,sK12)
| ~ precedes(X0_iProver_edge_1,X1_iProver_edge_1,sK12) ),
inference(instantiation,[status(thm)],[c_1786]) ).
tcf(c_3404,plain,
! [X0_iProver_edge_1: iProver_edge_1,X1_iProver_edge_1: iProver_edge_1] :
( on_path(X1_iProver_edge_1,sK12)
| ~ path(sK8,sK9,sK12)
| ~ precedes(X0_iProver_edge_1,X1_iProver_edge_1,sK12) ),
inference(instantiation,[status(thm)],[c_1785]) ).
tcf(c_3481,plain,
! [X0_iProver_edge_1: iProver_edge_1] :
( ( tail_of(sK10) = head_of(X0_iProver_edge_1) )
| ( tail_of(sK10) != tail_of(sK10) )
| ( head_of(X0_iProver_edge_1) != tail_of(sK10) ) ),
inference(instantiation,[status(thm)],[c_3270]) ).
tcf(c_3640,plain,
path(sK8,sK9,sK12),
inference(superposition,[status(thm)],[c_1762,c_1779]) ).
tcf(c_3703,plain,
( on_path(sK10,sK12)
| ~ precedes(sK10,sK11,sK12)
| ~ path(sK8,sK9,sK12) ),
inference(instantiation,[status(thm)],[c_3402]) ).
tcf(c_3719,plain,
( on_path(sK11,sK12)
| ~ precedes(sK10,sK11,sK12)
| ~ path(sK8,sK9,sK12) ),
inference(instantiation,[status(thm)],[c_3404]) ).
tcf(c_3723,plain,
! [X0_iProver_edge_1: iProver_edge_1] :
( edge(X0_iProver_edge_1)
| ~ on_path(X0_iProver_edge_1,sK12) ),
inference(superposition,[status(thm)],[c_3640,c_1798]) ).
tcf(c_3725,plain,
( edge(sK10)
| ~ on_path(sK10,sK12) ),
inference(instantiation,[status(thm)],[c_3723]) ).
tcf(c_3777,plain,
! [X0_iProver_edge_1: iProver_edge_1,X1_iProver_edge_1: iProver_edge_1] :
( on_path(X1_iProver_edge_1,sK12)
| ~ precedes(X0_iProver_edge_1,X1_iProver_edge_1,sK12) ),
inference(superposition,[status(thm)],[c_3640,c_1785]) ).
tcf(c_3834,plain,
on_path(sK11,sK12),
inference(superposition,[status(thm)],[c_1761,c_3777]) ).
tcf(c_3835,plain,
edge(sK11),
inference(superposition,[status(thm)],[c_3834,c_3723]) ).
tcf(c_3996,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X0_iProver_edge_1: iProver_edge_1] :
( ( head_of(sK11) = tail_of(X0_iProver_edge_1) )
| ( head_of(sK11) != X0_iProver_shortest_path_2 )
| ( tail_of(X0_iProver_edge_1) != X0_iProver_shortest_path_2 ) ),
inference(instantiation,[status(thm)],[c_3297]) ).
tcf(c_4905,plain,
path(sK8,sK9,sK12),
inference(superposition,[status(thm)],[c_1762,c_1779]) ).
tcf(c_4914,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2,X1_iProver_shortest_path_2: iProver_shortest_path_2] :
( ~ precedes(sK11,sK10,sK12)
| ~ shortest_path(X0_iProver_shortest_path_2,X1_iProver_shortest_path_2,sK12) ),
inference(superposition,[status(thm)],[c_1761,c_1775]) ).
tcf(c_4915,plain,
~ precedes(sK11,sK10,sK12),
inference(global_subsumption_just,[status(thm)],[c_4914,c_109,c_108,c_2967]) ).
tcf(c_4997,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2] :
( ( head_of(sK11) = head_of(sK0(head_of(sK11),X0_iProver_shortest_path_2)) )
| ( head_of(sK11) != head_of(sK11) )
| ( head_of(sK0(head_of(sK11),X0_iProver_shortest_path_2)) != head_of(sK11) ) ),
inference(instantiation,[status(thm)],[c_3176]) ).
tcf(c_5941,plain,
! [X0_iProver_edge_1: iProver_edge_1,X1_iProver_edge_1: iProver_edge_1] :
( precedes(X0_iProver_edge_1,X1_iProver_edge_1,sK12)
| ~ on_path(X1_iProver_edge_1,sK12)
| ~ on_path(X0_iProver_edge_1,sK12)
| ~ sequential(X0_iProver_edge_1,X1_iProver_edge_1) ),
inference(superposition,[status(thm)],[c_4905,c_1787]) ).
tcf(c_6511,plain,
( ~ sequential(sK11,sK10)
| ~ on_path(sK10,sK12)
| ~ on_path(sK11,sK12) ),
inference(superposition,[status(thm)],[c_5941,c_4915]) ).
tcf(c_6605,plain,
! [X0_iProver_edge_1: iProver_edge_1] :
( ( head_of(sK11) = head_of(sK0(head_of(sK11),tail_of(X0_iProver_edge_1))) )
| ( head_of(sK11) != head_of(sK11) )
| ( head_of(sK0(head_of(sK11),tail_of(X0_iProver_edge_1))) != head_of(sK11) ) ),
inference(instantiation,[status(thm)],[c_4997]) ).
tcf(c_6606,plain,
( ( head_of(sK11) = head_of(sK0(head_of(sK11),tail_of(sK10))) )
| ( head_of(sK11) != head_of(sK11) )
| ( head_of(sK0(head_of(sK11),tail_of(sK10))) != head_of(sK11) ) ),
inference(instantiation,[status(thm)],[c_6605]) ).
tcf(c_9486,plain,
! [X0_iProver_shortest_path_2: iProver_shortest_path_2] :
( ~ shortest_path(sK8,sK9,sK12)
| ~ precedes(sK10,sK11,sK12)
| ( head_of(sK11) != head_of(sK0(head_of(sK11),X0_iProver_shortest_path_2)) )
| ( tail_of(sK0(head_of(sK11),X0_iProver_shortest_path_2)) != tail_of(sK10) ) ),
inference(instantiation,[status(thm)],[c_2950]) ).
tcf(c_11768,plain,
( ( tail_of(sK13) = tail_of(sK10) )
| ~ edge(sK0(head_of(sK11),tail_of(sK10)))
| ( tail_of(sK0(head_of(sK11),tail_of(sK10))) != head_of(sK11) )
| ( head_of(sK0(head_of(sK11),tail_of(sK10))) != tail_of(sK10) ) ),
inference(instantiation,[status(thm)],[c_1767]) ).
tcf(c_11769,plain,
( ( head_of(sK13) = head_of(sK11) )
| ~ edge(sK0(head_of(sK11),tail_of(sK10)))
| ( tail_of(sK0(head_of(sK11),tail_of(sK10))) != head_of(sK11) )
| ( head_of(sK0(head_of(sK11),tail_of(sK10))) != tail_of(sK10) ) ),
inference(instantiation,[status(thm)],[c_1766]) ).
tcf(c_11770,plain,
( ( tail_of(sK10) = head_of(sK0(head_of(sK11),tail_of(sK10))) )
| ( tail_of(sK10) != tail_of(sK10) )
| ( head_of(sK0(head_of(sK11),tail_of(sK10))) != tail_of(sK10) ) ),
inference(instantiation,[status(thm)],[c_3481]) ).
tcf(c_15671,plain,
( ( head_of(sK11) = head_of(sK13) )
| ( head_of(sK11) != head_of(sK11) )
| ( head_of(sK13) != head_of(sK11) ) ),
inference(instantiation,[status(thm)],[c_3176]) ).
tcf(c_18702,plain,
( ~ shortest_path(sK8,sK9,sK12)
| ~ precedes(sK10,sK11,sK12)
| ( head_of(sK11) != head_of(sK0(head_of(sK11),tail_of(sK10))) )
| ( tail_of(sK0(head_of(sK11),tail_of(sK10))) != tail_of(sK10) ) ),
inference(instantiation,[status(thm)],[c_9486]) ).
tcf(c_20203,plain,
! [X0_iProver_edge_1: iProver_edge_1] :
( ( head_of(sK11) = tail_of(X0_iProver_edge_1) )
| ( head_of(sK11) != head_of(sK0(head_of(sK11),tail_of(sK10))) )
| ( tail_of(X0_iProver_edge_1) != head_of(sK0(head_of(sK11),tail_of(sK10))) ) ),
inference(instantiation,[status(thm)],[c_3996]) ).
tcf(c_20206,plain,
( ( head_of(sK11) = tail_of(sK10) )
| ( tail_of(sK10) != head_of(sK0(head_of(sK11),tail_of(sK10))) )
| ( head_of(sK11) != head_of(sK0(head_of(sK11),tail_of(sK10))) ) ),
inference(instantiation,[status(thm)],[c_20203]) ).
tcf(c_23065,plain,
( ~ shortest_path(sK8,sK9,sK12)
| ~ precedes(sK10,sK11,sK12)
| ( tail_of(sK13) != tail_of(sK10) )
| ( head_of(sK11) != head_of(sK13) ) ),
inference(instantiation,[status(thm)],[c_2950]) ).
tcf(c_23512,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_23065,c_20206,c_18702,c_15671,c_11768,c_11769,c_11770,c_6606,c_6511,c_3835,c_3725,c_3719,c_3703,c_3237,c_3230,c_3227,c_3224,c_3204,c_3094,c_3015,c_2984,c_2983,c_2951,c_2945,c_1844,c_1836,c_909,c_113,c_108,c_109]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRA006+1 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.02/0.29 % Computer : n012.cluster.edu
% 0.02/0.29 % Model : x86_64 x86_64
% 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29 % Memory : 8046.5625MB
% 0.02/0.29 % OS : Linux 6.8.0-71-generic
% 0.02/0.29 % CPULimit : 300
% 0.02/0.29 % WCLimit : 300
% 0.02/0.29 % DateTime : Wed Sep 23 12:42:51 UTC 2026
% 0.02/0.29 % CPUTime :
% 0.02/0.29 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.02/0.31 Running first-order theorem proving
% 0.02/0.31 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.32
% 0.02/0.32 % ======== iProver multi-core TPTP/SMT =========
% 0.02/0.32
% 0.02/0.32 % Detected problem language: tptp
% 0.06/0.33 % Proving...
% 8.24/1.51 % SZS status Started for theBenchmark.p
% 8.24/1.51 % SZS status Theorem for theBenchmark.p
% 8.24/1.51
% 8.24/1.51 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.24/1.51
% 8.24/1.51 % ------ iProver source info
% 8.24/1.51
% 8.24/1.51 % git: date: 2026-07-19 20:42:38 +0200
% 8.24/1.51 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.24/1.51 % git: non_committed_changes: false
% 8.24/1.51
% 8.24/1.51 % ------ Parsing...
% 8.24/1.51 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 8.24/1.51
% 8.24/1.51 % ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 8.24/1.51
% 8.24/1.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 8.24/1.51
% 8.24/1.51 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 8.24/1.51 % ------ Proving...
% 8.24/1.51 % ------ Problem Properties
% 8.24/1.51
% 8.24/1.51 %
% 8.24/1.51 % clauses 60
% 8.24/1.51 % conjectures 8
% 8.24/1.51 % EPR 17
% 8.24/1.51 % Horn 42
% 8.24/1.51 % unary 5
% 8.24/1.51 % binary 14
% 8.24/1.51 % lits 192
% 8.24/1.51 % lits eq 60
% 8.24/1.51 % fd_pure 0
% 8.24/1.51 % fd_pseudo 0
% 8.24/1.51 % fd_cond 0
% 8.24/1.51 % fd_pseudo_cond 5
% 8.24/1.51 % AC symbols 0
% 8.24/1.51
% 8.24/1.51 % ------ Input Options Time Limit: Unbounded
% 8.24/1.51
% 8.24/1.51
% 8.24/1.51 % ------
% 8.24/1.51 % Current options:
% 8.24/1.51 % ------
% 8.24/1.51
% 8.24/1.51
% 8.24/1.51 %
% 8.24/1.51
% 8.24/1.51 % ------ Proving...
% 8.24/1.51 %
% 8.24/1.51
% 8.24/1.51 % SZS status Theorem for theBenchmark.p
% 8.24/1.51
% 8.24/1.51 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.24/1.51
% 8.24/1.51
%------------------------------------------------------------------------------