%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRA007+1 : TPTP v9.3.1. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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 : Tue Sep 29 10:08:26 AM UTC 2026
% Result : Theorem 48.20s 9.78s
% Output : Refutation 48.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 15
% Syntax : Number of formulae : 156 ( 22 unt; 2 def)
% Number of atoms : 718 ( 262 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 898 ( 336 ~; 367 |; 167 &)
% ( 3 <=>; 18 =>; 0 <=; 7 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 2 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 8 con; 0-3 aty)
% Number of variables : 363 ( 321 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( edge(X0)
=> head_of(X0) != tail_of(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',no_loops) ).
fof(f2,axiom,
! [X0] :
( edge(X0)
=> ( vertex(head_of(X0))
& vertex(tail_of(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',edge_ends_are_vertices) ).
fof(f3,axiom,
( complete
=> ! [X0,X1] :
( ( vertex(X0)
& vertex(X1)
& X0 != X1 )
=> ? [X2] :
( edge(X2)
& ( ( X0 = head_of(X2)
& X1 = tail_of(X2) )
<~> ( X1 = head_of(X2)
& X0 = tail_of(X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',complete_properties) ).
fof(f4,axiom,
! [X0,X1,X2] :
( ( vertex(X0)
& vertex(X1)
& ? [X3] :
( edge(X3)
& X0 = tail_of(X3)
& ( ( X1 = head_of(X3)
& X2 = path_cons(X3,empty) )
| ? [X4] :
( path(head_of(X3),X1,X4)
& X2 = path_cons(X3,X4) ) ) ) )
=> path(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',path_defn) ).
fof(f5,axiom,
! [X0,X1,X2] :
( path(X0,X1,X2)
=> ( vertex(X0)
& vertex(X1)
& ? [X3] :
( edge(X3)
& X0 = tail_of(X3)
& ( ( X1 = head_of(X3)
& X2 = path_cons(X3,empty) )
<~> ? [X4] :
( path(head_of(X3),X1,X4)
& X2 = path_cons(X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',path_properties) ).
fof(f6,axiom,
! [X0,X1,X2,X3] :
( ( path(X0,X1,X2)
& on_path(X3,X2) )
=> ( edge(X3)
& in_path(head_of(X3),X2)
& in_path(tail_of(X3),X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',on_path_properties) ).
fof(f7,axiom,
! [X0,X1,X2,X3] :
( ( path(X0,X1,X2)
& in_path(X3,X2) )
=> ( vertex(X3)
& ? [X4] :
( on_path(X4,X2)
& ( X3 = head_of(X4)
| X3 = tail_of(X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',in_path_properties) ).
fof(f8,axiom,
! [X0,X1] :
( sequential(X0,X1)
<=> ( edge(X0)
& edge(X1)
& X0 != X1
& head_of(X0) = tail_of(X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',sequential_defn) ).
fof(f9,axiom,
! [X0,X1,X2] :
( path(X1,X2,X0)
=> ! [X3,X4] :
( ( on_path(X3,X0)
& on_path(X4,X0)
& ( sequential(X3,X4)
| ? [X5] :
( sequential(X3,X5)
& precedes(X5,X4,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)
=> ( on_path(X3,X0)
& on_path(X4,X0)
& ( sequential(X3,X4)
<~> ? [X5] :
( sequential(X3,X5)
& precedes(X5,X4,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',precedes_properties) ).
fof(f11,axiom,
! [X0,X1,X2] :
( shortest_path(X0,X1,X2)
<=> ( path(X0,X1,X2)
& X0 != X1
& ! [X3] :
( path(X0,X1,X3)
=> less_or_equal(length_of(X2),length_of(X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).
fof(f12,axiom,
! [X0,X1,X2,X3,X4] :
( ( shortest_path(X0,X1,X4)
& precedes(X2,X3,X4) )
=> ( ~ ? [X5] :
( tail_of(X5) = tail_of(X2)
& head_of(X5) = head_of(X3) )
& ~ precedes(X3,X2,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',shortest_path_properties) ).
fof(f18,conjecture,
( complete
=> ! [X0,X1,X2,X3,X4] :
( ( shortest_path(X0,X1,X4)
& precedes(X2,X3,X4) )
=> ? [X5] :
( edge(X5)
& tail_of(X5) = head_of(X3)
& head_of(X5) = tail_of(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',back_edge) ).
fof(f19,negated_conjecture,
~ ( complete
=> ! [X0,X1,X2,X3,X4] :
( ( shortest_path(X0,X1,X4)
& precedes(X2,X3,X4) )
=> ? [X5] :
( edge(X5)
& tail_of(X5) = head_of(X3)
& head_of(X5) = tail_of(X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f21,plain,
! [X0] :
( head_of(X0) != tail_of(X0)
| ~ edge(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f22,plain,
! [X0] :
( ( vertex(head_of(X0))
& vertex(tail_of(X0)) )
| ~ edge(X0) ),
inference(ennf_transformation,[],[f2]) ).
fof(f23,plain,
( ! [X0,X1] :
( ? [X2] :
( edge(X2)
& ( ( X0 = head_of(X2)
& X1 = tail_of(X2) )
<~> ( X1 = head_of(X2)
& X0 = tail_of(X2) ) ) )
| ~ vertex(X0)
| ~ vertex(X1)
| X0 = X1 )
| ~ complete ),
inference(ennf_transformation,[],[f3]) ).
fof(f24,plain,
( ! [X0,X1] :
( ? [X2] :
( edge(X2)
& ( ( X0 = head_of(X2)
& X1 = tail_of(X2) )
<~> ( X1 = head_of(X2)
& X0 = tail_of(X2) ) ) )
| ~ vertex(X0)
| ~ vertex(X1)
| X0 = X1 )
| ~ complete ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
! [X0,X1,X2] :
( path(X0,X1,X2)
| ~ vertex(X0)
| ~ vertex(X1)
| ! [X3] :
( ~ edge(X3)
| tail_of(X3) != X0
| ( ( head_of(X3) != X1
| path_cons(X3,empty) != X2 )
& ! [X4] :
( ~ path(head_of(X3),X1,X4)
| path_cons(X3,X4) != X2 ) ) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f26,plain,
! [X0,X1,X2] :
( path(X0,X1,X2)
| ~ vertex(X0)
| ~ vertex(X1)
| ! [X3] :
( ~ edge(X3)
| tail_of(X3) != X0
| ( ( head_of(X3) != X1
| path_cons(X3,empty) != X2 )
& ! [X4] :
( ~ path(head_of(X3),X1,X4)
| path_cons(X3,X4) != X2 ) ) ) ),
inference(flattening,[],[f25]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( vertex(X0)
& vertex(X1)
& ? [X3] :
( edge(X3)
& X0 = tail_of(X3)
& ( ( X1 = head_of(X3)
& X2 = path_cons(X3,empty) )
<~> ? [X4] :
( path(head_of(X3),X1,X4)
& X2 = path_cons(X3,X4) ) ) ) )
| ~ path(X0,X1,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f28,plain,
! [X0,X1,X2,X3] :
( ( edge(X3)
& in_path(head_of(X3),X2)
& in_path(tail_of(X3),X2) )
| ~ path(X0,X1,X2)
| ~ on_path(X3,X2) ),
inference(ennf_transformation,[],[f6]) ).
fof(f29,plain,
! [X0,X1,X2,X3] :
( ( edge(X3)
& in_path(head_of(X3),X2)
& in_path(tail_of(X3),X2) )
| ~ path(X0,X1,X2)
| ~ on_path(X3,X2) ),
inference(flattening,[],[f28]) ).
fof(f30,plain,
! [X0,X1,X2,X3] :
( ( vertex(X3)
& ? [X4] :
( on_path(X4,X2)
& ( X3 = head_of(X4)
| X3 = tail_of(X4) ) ) )
| ~ path(X0,X1,X2)
| ~ in_path(X3,X2) ),
inference(ennf_transformation,[],[f7]) ).
fof(f31,plain,
! [X0,X1,X2,X3] :
( ( vertex(X3)
& ? [X4] :
( on_path(X4,X2)
& ( X3 = head_of(X4)
| X3 = tail_of(X4) ) ) )
| ~ path(X0,X1,X2)
| ~ in_path(X3,X2) ),
inference(flattening,[],[f30]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ! [X3,X4] :
( precedes(X3,X4,X0)
| ~ on_path(X3,X0)
| ~ on_path(X4,X0)
| ( ~ sequential(X3,X4)
& ! [X5] :
( ~ sequential(X3,X5)
| ~ precedes(X5,X4,X0) ) ) )
| ~ path(X1,X2,X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ! [X3,X4] :
( precedes(X3,X4,X0)
| ~ on_path(X3,X0)
| ~ on_path(X4,X0)
| ( ~ sequential(X3,X4)
& ! [X5] :
( ~ sequential(X3,X5)
| ~ precedes(X5,X4,X0) ) ) )
| ~ path(X1,X2,X0) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ! [X3,X4] :
( ( on_path(X3,X0)
& on_path(X4,X0)
& ( sequential(X3,X4)
<~> ? [X5] :
( sequential(X3,X5)
& precedes(X5,X4,X0) ) ) )
| ~ precedes(X3,X4,X0) )
| ~ path(X1,X2,X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f35,plain,
! [X0,X1,X2] :
( shortest_path(X0,X1,X2)
<=> ( path(X0,X1,X2)
& X0 != X1
& ! [X3] :
( less_or_equal(length_of(X2),length_of(X3))
| ~ path(X0,X1,X3) ) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f36,plain,
! [X0,X1,X2,X3,X4] :
( ( ! [X5] :
( tail_of(X2) != tail_of(X5)
| head_of(X3) != head_of(X5) )
& ~ precedes(X3,X2,X4) )
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4) ),
inference(ennf_transformation,[],[f12]) ).
fof(f37,plain,
! [X0,X1,X2,X3,X4] :
( ( ! [X5] :
( tail_of(X2) != tail_of(X5)
| head_of(X3) != head_of(X5) )
& ~ precedes(X3,X2,X4) )
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4) ),
inference(flattening,[],[f36]) ).
fof(f44,plain,
( ? [X0,X1,X2,X3,X4] :
( ! [X5] :
( ~ edge(X5)
| head_of(X3) != tail_of(X5)
| tail_of(X2) != head_of(X5) )
& shortest_path(X0,X1,X4)
& precedes(X2,X3,X4) )
& complete ),
inference(ennf_transformation,[],[f19]) ).
fof(f45,plain,
( ? [X0,X1,X2,X3,X4] :
( ! [X5] :
( ~ edge(X5)
| head_of(X3) != tail_of(X5)
| tail_of(X2) != head_of(X5) )
& shortest_path(X0,X1,X4)
& precedes(X2,X3,X4) )
& complete ),
inference(flattening,[],[f44]) ).
fof(f46,plain,
( ! [X0,X1] :
( ? [X2] :
( edge(X2)
& ( head_of(X2) != X1
| tail_of(X2) != X0
| head_of(X2) != X0
| tail_of(X2) != X1 )
& ( ( X1 = head_of(X2)
& X0 = tail_of(X2) )
| ( X0 = head_of(X2)
& X1 = tail_of(X2) ) ) )
| ~ vertex(X0)
| ~ vertex(X1)
| X0 = X1 )
| ~ complete ),
inference(nnf_transformation,[],[f24]) ).
fof(f47,plain,
( ! [X0,X1] :
( ? [X2] :
( edge(X2)
& ( head_of(X2) != X1
| tail_of(X2) != X0
| head_of(X2) != X0
| tail_of(X2) != X1 )
& ( ( X1 = head_of(X2)
& X0 = tail_of(X2) )
| ( X0 = head_of(X2)
& X1 = tail_of(X2) ) ) )
| ~ vertex(X0)
| ~ vertex(X1)
| X0 = X1 )
| ~ complete ),
inference(flattening,[],[f46]) ).
fof(f48,plain,
( ! [X0,X1] :
( ( edge(sK0(X0,X1))
& ( head_of(sK0(X0,X1)) != X1
| tail_of(sK0(X0,X1)) != X0
| head_of(sK0(X0,X1)) != X0
| tail_of(sK0(X0,X1)) != X1 )
& ( ( head_of(sK0(X0,X1)) = X1
& tail_of(sK0(X0,X1)) = X0 )
| ( head_of(sK0(X0,X1)) = X0
& tail_of(sK0(X0,X1)) = X1 ) ) )
| ~ vertex(X0)
| ~ vertex(X1)
| X0 = X1 )
| ~ complete ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f47]) ).
fof(f49,plain,
! [X0,X1,X2] :
( ( vertex(X0)
& vertex(X1)
& ? [X3] :
( edge(X3)
& X0 = tail_of(X3)
& ( ! [X4] :
( ~ path(head_of(X3),X1,X4)
| path_cons(X3,X4) != X2 )
| head_of(X3) != X1
| path_cons(X3,empty) != X2 )
& ( ? [X4] :
( path(head_of(X3),X1,X4)
& X2 = path_cons(X3,X4) )
| ( X1 = head_of(X3)
& X2 = path_cons(X3,empty) ) ) ) )
| ~ path(X0,X1,X2) ),
inference(nnf_transformation,[],[f27]) ).
fof(f50,plain,
! [X0,X1,X2] :
( ( vertex(X0)
& vertex(X1)
& ? [X3] :
( edge(X3)
& X0 = tail_of(X3)
& ( ! [X4] :
( ~ path(head_of(X3),X1,X4)
| path_cons(X3,X4) != X2 )
| head_of(X3) != X1
| path_cons(X3,empty) != X2 )
& ( ? [X4] :
( path(head_of(X3),X1,X4)
& X2 = path_cons(X3,X4) )
| ( X1 = head_of(X3)
& X2 = path_cons(X3,empty) ) ) ) )
| ~ path(X0,X1,X2) ),
inference(flattening,[],[f49]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ( vertex(X0)
& vertex(X1)
& ? [X3] :
( edge(X3)
& X0 = tail_of(X3)
& ( ! [X4] :
( ~ path(head_of(X3),X1,X4)
| path_cons(X3,X4) != X2 )
| head_of(X3) != X1
| path_cons(X3,empty) != X2 )
& ( ? [X5] :
( path(head_of(X3),X1,X5)
& path_cons(X3,X5) = X2 )
| ( X1 = head_of(X3)
& X2 = path_cons(X3,empty) ) ) ) )
| ~ path(X0,X1,X2) ),
inference(rectify,[],[f50]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ( vertex(X0)
& vertex(X1)
& edge(sK1(X0,X1,X2))
& tail_of(sK1(X0,X1,X2)) = X0
& ( ! [X4] :
( ~ path(head_of(sK1(X0,X1,X2)),X1,X4)
| path_cons(sK1(X0,X1,X2),X4) != X2 )
| head_of(sK1(X0,X1,X2)) != X1
| path_cons(sK1(X0,X1,X2),empty) != X2 )
& ( ( path(head_of(sK1(X0,X1,X2)),X1,sK2(X0,X1,X2))
& path_cons(sK1(X0,X1,X2),sK2(X0,X1,X2)) = X2 )
| ( head_of(sK1(X0,X1,X2)) = X1
& path_cons(sK1(X0,X1,X2),empty) = X2 ) ) )
| ~ path(X0,X1,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X3,sK1(X0,X1,X2)),skolemize(X5,sK2(X0,X1,X2))],[f51]) ).
fof(f53,plain,
! [X0,X1,X2,X3] :
( ( vertex(X3)
& on_path(sK3(X2,X3),X2)
& ( head_of(sK3(X2,X3)) = X3
| tail_of(sK3(X2,X3)) = X3 ) )
| ~ path(X0,X1,X2)
| ~ in_path(X3,X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X4,sK3(X2,X3))],[f31]) ).
fof(f54,plain,
! [X0,X1] :
( ( sequential(X0,X1)
| ~ edge(X0)
| ~ edge(X1)
| X0 = X1
| head_of(X0) != tail_of(X1) )
& ( ( edge(X0)
& edge(X1)
& X0 != X1
& head_of(X0) = tail_of(X1) )
| ~ sequential(X0,X1) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f55,plain,
! [X0,X1] :
( ( sequential(X0,X1)
| ~ edge(X0)
| ~ edge(X1)
| X0 = X1
| head_of(X0) != tail_of(X1) )
& ( ( edge(X0)
& edge(X1)
& X0 != X1
& head_of(X0) = tail_of(X1) )
| ~ sequential(X0,X1) ) ),
inference(flattening,[],[f54]) ).
fof(f56,plain,
! [X0,X1,X2] :
( ! [X3,X4] :
( ( on_path(X3,X0)
& on_path(X4,X0)
& ( ! [X5] :
( ~ sequential(X3,X5)
| ~ precedes(X5,X4,X0) )
| ~ sequential(X3,X4) )
& ( ? [X5] :
( sequential(X3,X5)
& precedes(X5,X4,X0) )
| sequential(X3,X4) ) )
| ~ precedes(X3,X4,X0) )
| ~ path(X1,X2,X0) ),
inference(nnf_transformation,[],[f34]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ! [X3,X4] :
( ( on_path(X3,X0)
& on_path(X4,X0)
& ( ! [X5] :
( ~ sequential(X3,X5)
| ~ precedes(X5,X4,X0) )
| ~ sequential(X3,X4) )
& ( ? [X5] :
( sequential(X3,X5)
& precedes(X5,X4,X0) )
| sequential(X3,X4) ) )
| ~ precedes(X3,X4,X0) )
| ~ path(X1,X2,X0) ),
inference(flattening,[],[f56]) ).
fof(f58,plain,
! [X0,X1,X2] :
( ! [X3,X4] :
( ( on_path(X3,X0)
& on_path(X4,X0)
& ( ! [X5] :
( ~ sequential(X3,X5)
| ~ precedes(X5,X4,X0) )
| ~ sequential(X3,X4) )
& ( ? [X6] :
( sequential(X3,X6)
& precedes(X6,X4,X0) )
| sequential(X3,X4) ) )
| ~ precedes(X3,X4,X0) )
| ~ path(X1,X2,X0) ),
inference(rectify,[],[f57]) ).
fof(f59,plain,
! [X0,X1,X2] :
( ! [X3,X4] :
( ( on_path(X3,X0)
& on_path(X4,X0)
& ( ! [X5] :
( ~ sequential(X3,X5)
| ~ precedes(X5,X4,X0) )
| ~ sequential(X3,X4) )
& ( ( sequential(X3,sK4(X0,X3,X4))
& precedes(sK4(X0,X3,X4),X4,X0) )
| sequential(X3,X4) ) )
| ~ precedes(X3,X4,X0) )
| ~ path(X1,X2,X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X6,sK4(X0,X3,X4))],[f58]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ( shortest_path(X0,X1,X2)
| ~ path(X0,X1,X2)
| X0 = X1
| ? [X3] :
( ~ less_or_equal(length_of(X2),length_of(X3))
& path(X0,X1,X3) ) )
& ( ( path(X0,X1,X2)
& X0 != X1
& ! [X3] :
( less_or_equal(length_of(X2),length_of(X3))
| ~ path(X0,X1,X3) ) )
| ~ shortest_path(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ( shortest_path(X0,X1,X2)
| ~ path(X0,X1,X2)
| X0 = X1
| ? [X3] :
( ~ less_or_equal(length_of(X2),length_of(X3))
& path(X0,X1,X3) ) )
& ( ( path(X0,X1,X2)
& X0 != X1
& ! [X3] :
( less_or_equal(length_of(X2),length_of(X3))
| ~ path(X0,X1,X3) ) )
| ~ shortest_path(X0,X1,X2) ) ),
inference(flattening,[],[f60]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ( shortest_path(X0,X1,X2)
| ~ path(X0,X1,X2)
| X0 = X1
| ? [X3] :
( ~ less_or_equal(length_of(X2),length_of(X3))
& path(X0,X1,X3) ) )
& ( ( path(X0,X1,X2)
& X0 != X1
& ! [X4] :
( less_or_equal(length_of(X2),length_of(X4))
| ~ path(X0,X1,X4) ) )
| ~ shortest_path(X0,X1,X2) ) ),
inference(rectify,[],[f61]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ( shortest_path(X0,X1,X2)
| ~ path(X0,X1,X2)
| X0 = X1
| ( ~ less_or_equal(length_of(X2),length_of(sK5(X0,X1,X2)))
& path(X0,X1,sK5(X0,X1,X2)) ) )
& ( ( path(X0,X1,X2)
& X0 != X1
& ! [X4] :
( less_or_equal(length_of(X2),length_of(X4))
| ~ path(X0,X1,X4) ) )
| ~ shortest_path(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X3,sK5(X0,X1,X2))],[f62]) ).
fof(f65,plain,
( ! [X5] :
( ~ edge(X5)
| tail_of(X5) != head_of(sK11)
| head_of(X5) != tail_of(sK10) )
& shortest_path(sK8,sK9,sK12)
& precedes(sK10,sK11,sK12)
& complete ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11,sK12]),skolemize(X0,sK8),skolemize(X1,sK9),skolemize(X2,sK10),skolemize(X3,sK11),skolemize(X4,sK12)],[f45]) ).
fof(f66,plain,
! [X0] :
( head_of(X0) != tail_of(X0)
| ~ edge(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f67,plain,
! [X0] :
( vertex(tail_of(X0))
| ~ edge(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f68,plain,
! [X0] :
( vertex(head_of(X0))
| ~ edge(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f69,plain,
! [X0,X1] :
( tail_of(sK0(X0,X1)) = X0
| tail_of(sK0(X0,X1)) = X1
| ~ vertex(X0)
| ~ vertex(X1)
| X0 = X1
| ~ complete ),
inference(cnf_transformation,[],[f48]) ).
fof(f70,plain,
! [X0,X1] :
( tail_of(sK0(X0,X1)) = X0
| head_of(sK0(X0,X1)) = X0
| ~ vertex(X0)
| ~ vertex(X1)
| X0 = X1
| ~ complete ),
inference(cnf_transformation,[],[f48]) ).
fof(f71,plain,
! [X0,X1] :
( head_of(sK0(X0,X1)) = X1
| tail_of(sK0(X0,X1)) = X1
| ~ vertex(X0)
| ~ vertex(X1)
| X0 = X1
| ~ complete ),
inference(cnf_transformation,[],[f48]) ).
fof(f74,plain,
! [X0,X1] :
( edge(sK0(X0,X1))
| ~ vertex(X0)
| ~ vertex(X1)
| X0 = X1
| ~ complete ),
inference(cnf_transformation,[],[f48]) ).
fof(f76,plain,
! [X2,X3,X0,X1] :
( path(X0,X1,X2)
| ~ vertex(X0)
| ~ vertex(X1)
| ~ edge(X3)
| tail_of(X3) != X0
| head_of(X3) != X1
| path_cons(X3,empty) != X2 ),
inference(cnf_transformation,[],[f26]) ).
fof(f84,plain,
! [X2,X0,X1] :
( ~ path(X0,X1,X2)
| vertex(X1) ),
inference(cnf_transformation,[],[f52]) ).
fof(f86,plain,
! [X2,X3,X0,X1] :
( ~ path(X0,X1,X2)
| in_path(tail_of(X3),X2)
| ~ on_path(X3,X2) ),
inference(cnf_transformation,[],[f29]) ).
fof(f88,plain,
! [X2,X3,X0,X1] :
( ~ path(X0,X1,X2)
| edge(X3)
| ~ on_path(X3,X2) ),
inference(cnf_transformation,[],[f29]) ).
fof(f91,plain,
! [X2,X3,X0,X1] :
( ~ path(X0,X1,X2)
| vertex(X3)
| ~ in_path(X3,X2) ),
inference(cnf_transformation,[],[f53]) ).
fof(f96,plain,
! [X0,X1] :
( head_of(X0) != tail_of(X1)
| ~ edge(X0)
| ~ edge(X1)
| X0 = X1
| sequential(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
fof(f97,plain,
! [X2,X3,X0,X1,X4,X5] :
( precedes(X3,X4,X0)
| ~ on_path(X3,X0)
| ~ on_path(X4,X0)
| ~ sequential(X3,X5)
| ~ precedes(X5,X4,X0)
| ~ path(X1,X2,X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f102,plain,
! [X2,X3,X0,X1,X4] :
( ~ precedes(X3,X4,X0)
| on_path(X4,X0)
| ~ path(X1,X2,X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f103,plain,
! [X2,X3,X0,X1,X4] :
( ~ precedes(X3,X4,X0)
| on_path(X3,X0)
| ~ path(X1,X2,X0) ),
inference(cnf_transformation,[],[f59]) ).
fof(f106,plain,
! [X2,X0,X1] :
( ~ shortest_path(X0,X1,X2)
| path(X0,X1,X2) ),
inference(cnf_transformation,[],[f63]) ).
fof(f109,plain,
! [X2,X3,X0,X1,X4] :
( ~ shortest_path(X0,X1,X4)
| ~ precedes(X3,X2,X4)
| ~ precedes(X2,X3,X4) ),
inference(cnf_transformation,[],[f37]) ).
fof(f110,plain,
! [X2,X3,X0,X1,X4,X5] :
( tail_of(X2) != tail_of(X5)
| head_of(X3) != head_of(X5)
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4) ),
inference(cnf_transformation,[],[f37]) ).
fof(f119,plain,
complete,
inference(cnf_transformation,[],[f65]) ).
fof(f120,plain,
precedes(sK10,sK11,sK12),
inference(cnf_transformation,[],[f65]) ).
fof(f121,plain,
shortest_path(sK8,sK9,sK12),
inference(cnf_transformation,[],[f65]) ).
fof(f122,plain,
! [X5] :
( ~ edge(X5)
| tail_of(X5) != head_of(sK11)
| head_of(X5) != tail_of(sK10) ),
inference(cnf_transformation,[],[f65]) ).
fof(f123,plain,
! [X2,X3,X1] :
( path(tail_of(X3),X1,X2)
| ~ vertex(tail_of(X3))
| ~ vertex(X1)
| ~ edge(X3)
| head_of(X3) != X1
| path_cons(X3,empty) != X2 ),
inference(equality_resolution,[],[f76]) ).
fof(f124,plain,
! [X2,X3] :
( path(tail_of(X3),head_of(X3),X2)
| ~ vertex(tail_of(X3))
| ~ vertex(head_of(X3))
| ~ edge(X3)
| path_cons(X3,empty) != X2 ),
inference(equality_resolution,[],[f123]) ).
fof(f125,plain,
! [X3] :
( path(tail_of(X3),head_of(X3),path_cons(X3,empty))
| ~ vertex(tail_of(X3))
| ~ vertex(head_of(X3))
| ~ edge(X3) ),
inference(equality_resolution,[],[f124]) ).
fof(f130,definition,
sF13 = head_of(sK11),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f131,plain,
head_of(sK11) = sF13,
inference(reorient_equations,[],[f130]) ).
fof(f132,definition,
sF14 = tail_of(sK10),
introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).
fof(f133,plain,
tail_of(sK10) = sF14,
inference(reorient_equations,[],[f132]) ).
fof(f134,plain,
! [X5] :
( tail_of(X5) != sF13
| ~ edge(X5)
| head_of(X5) != sF14 ),
inference(definition_folding,[],[f122,f133,f131]) ).
fof(f135,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ precedes(X5,X4,X0)
| ~ on_path(X3,X0)
| ~ sequential(X3,X5)
| precedes(X3,X4,X0)
| ~ path(X1,X2,X0) ),
inference(forward_subsumption_resolution,[],[f97,f102]) ).
fof(f137,plain,
! [X0,X1] :
( ~ vertex(X1)
| tail_of(sK0(X0,X1)) = X1
| ~ vertex(X0)
| tail_of(sK0(X0,X1)) = X0
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f69,f119]) ).
fof(f138,plain,
! [X0,X1] :
( ~ vertex(X1)
| head_of(sK0(X0,X1)) = X0
| ~ vertex(X0)
| tail_of(sK0(X0,X1)) = X0
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f70,f119]) ).
fof(f139,plain,
! [X0,X1] :
( ~ vertex(X1)
| tail_of(sK0(X0,X1)) = X1
| ~ vertex(X0)
| head_of(sK0(X0,X1)) = X1
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f71,f119]) ).
fof(f142,plain,
! [X0,X1] :
( edge(sK0(X0,X1))
| ~ vertex(X0)
| ~ vertex(X1)
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f74,f119]) ).
fof(f156,plain,
( ~ edge(sK11)
| vertex(sF13) ),
inference(superposition,[],[f68,f131]) ).
fof(f173,plain,
path(sK8,sK9,sK12),
inference(resolution,[],[f106,f121]) ).
fof(f189,plain,
! [X0] :
( ~ on_path(X0,sK12)
| edge(X0) ),
inference(resolution,[],[f88,f173]) ).
fof(f202,plain,
! [X0] :
( ~ in_path(X0,sK12)
| vertex(X0) ),
inference(resolution,[],[f91,f173]) ).
fof(f206,plain,
! [X0] :
( in_path(tail_of(X0),sK12)
| ~ on_path(X0,sK12) ),
inference(resolution,[],[f86,f173]) ).
fof(f211,plain,
! [X0,X1] :
( ~ path(X0,X1,sK12)
| on_path(sK11,sK12) ),
inference(resolution,[],[f102,f120]) ).
fof(f212,plain,
on_path(sK11,sK12),
inference(resolution,[],[f211,f173]) ).
fof(f213,plain,
! [X0,X1] :
( ~ path(X0,X1,sK12)
| on_path(sK10,sK12) ),
inference(resolution,[],[f103,f120]) ).
fof(f214,plain,
edge(sK11),
inference(resolution,[],[f212,f189]) ).
fof(f217,plain,
! [X0,X1] :
( ~ precedes(X1,X0,sK12)
| ~ precedes(X0,X1,sK12) ),
inference(resolution,[],[f109,f121]) ).
fof(f218,plain,
on_path(sK10,sK12),
inference(resolution,[],[f213,f173]) ).
fof(f220,plain,
edge(sK10),
inference(resolution,[],[f218,f189]) ).
fof(f240,plain,
( in_path(sF14,sK12)
| ~ on_path(sK10,sK12) ),
inference(superposition,[],[f206,f133]) ).
fof(f242,plain,
in_path(sF14,sK12),
inference(forward_subsumption_resolution,[],[f240,f218]) ).
fof(f243,plain,
! [X0] :
( head_of(X0) != sF14
| ~ edge(X0)
| ~ edge(sK10)
| sK10 = X0
| sequential(X0,sK10) ),
inference(superposition,[],[f96,f133]) ).
fof(f245,plain,
! [X0] :
( head_of(X0) != sF14
| ~ edge(X0)
| sK10 = X0
| sequential(X0,sK10) ),
inference(forward_subsumption_resolution,[],[f243,f220]) ).
fof(f246,plain,
vertex(sF14),
inference(resolution,[],[f242,f202]) ).
fof(f295,plain,
( path(tail_of(sK11),sF13,path_cons(sK11,empty))
| ~ vertex(tail_of(sK11))
| ~ vertex(sF13)
| ~ edge(sK11) ),
inference(superposition,[],[f125,f131]) ).
fof(f296,plain,
( path(tail_of(sK11),sF13,path_cons(sK11,empty))
| ~ vertex(sF13)
| ~ edge(sK11) ),
inference(forward_subsumption_resolution,[],[f295,f67]) ).
fof(f310,plain,
( path(tail_of(sK11),sF13,path_cons(sK11,empty))
| ~ edge(sK11) ),
inference(forward_subsumption_resolution,[],[f296,f156]) ).
fof(f324,plain,
path(tail_of(sK11),sF13,path_cons(sK11,empty)),
inference(forward_subsumption_resolution,[],[f310,f214]) ).
fof(f327,plain,
vertex(sF13),
inference(resolution,[],[f324,f84]) ).
fof(f345,plain,
! [X0] :
( ~ vertex(X0)
| sF13 = tail_of(sK0(X0,sF13))
| tail_of(sK0(X0,sF13)) = X0
| sF13 = X0 ),
inference(resolution,[],[f327,f137]) ).
fof(f346,plain,
! [X0] :
( ~ vertex(X0)
| head_of(sK0(X0,sF13)) = X0
| tail_of(sK0(X0,sF13)) = X0
| sF13 = X0 ),
inference(resolution,[],[f327,f138]) ).
fof(f347,plain,
! [X0] :
( ~ vertex(X0)
| sF13 = tail_of(sK0(X0,sF13))
| sF13 = head_of(sK0(X0,sF13))
| sF13 = X0 ),
inference(resolution,[],[f327,f139]) ).
fof(f407,plain,
! [X2,X3,X0,X1,X4] :
( head_of(X0) != head_of(X1)
| tail_of(X0) != sF14
| ~ shortest_path(X2,X3,X4)
| ~ precedes(sK10,X1,X4) ),
inference(superposition,[],[f110,f133]) ).
fof(f411,plain,
! [X2,X3,X0,X1,X4] :
( head_of(X0) != head_of(X1)
| ~ shortest_path(X2,X3,X4)
| ~ precedes(X1,X0,X4) ),
inference(equality_resolution,[],[f110]) ).
fof(f412,plain,
! [X2,X0,X1] :
( ~ path(X1,X2,sK12)
| ~ sequential(X0,sK10)
| precedes(X0,sK11,sK12)
| ~ on_path(X0,sK12) ),
inference(resolution,[],[f135,f120]) ).
fof(f523,plain,
( sF13 != sF14
| ~ edge(sK11)
| sK10 = sK11
| sequential(sK11,sK10) ),
inference(superposition,[],[f245,f131]) ).
fof(f524,plain,
( sF13 != sF14
| sK10 = sK11
| sequential(sK11,sK10) ),
inference(forward_subsumption_resolution,[],[f523,f214]) ).
fof(f533,plain,
! [X0] :
( precedes(X0,sK11,sK12)
| ~ sequential(X0,sK10)
| ~ on_path(X0,sK12) ),
inference(resolution,[],[f412,f173]) ).
fof(f557,plain,
! [X0] :
( ~ precedes(sK11,X0,sK12)
| ~ on_path(X0,sK12)
| ~ sequential(X0,sK10) ),
inference(resolution,[],[f533,f217]) ).
fof(f576,plain,
( ~ on_path(sK11,sK12)
| ~ sequential(sK11,sK10)
| ~ sequential(sK11,sK10)
| ~ on_path(sK11,sK12) ),
inference(resolution,[],[f557,f533]) ).
fof(f577,plain,
( ~ on_path(sK11,sK12)
| ~ sequential(sK11,sK10) ),
inference(duplicate_literal_removal,[],[f576]) ).
fof(f578,plain,
~ sequential(sK11,sK10),
inference(forward_subsumption_resolution,[],[f577,f212]) ).
fof(f588,plain,
! [X2,X3,X0,X1] :
( ~ shortest_path(X0,X1,X2)
| ~ precedes(X3,X3,X2) ),
inference(equality_resolution,[],[f411]) ).
fof(f656,plain,
! [X2,X3,X0,X1] :
( tail_of(X0) != sF14
| head_of(X0) != sF13
| ~ shortest_path(X1,X2,X3)
| ~ precedes(sK10,sK11,X3) ),
inference(superposition,[],[f407,f131]) ).
fof(f2500,plain,
( sF14 = tail_of(sK0(sF14,sF13))
| sF13 = tail_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(resolution,[],[f345,f246]) ).
fof(f2594,plain,
( sF14 != head_of(sK0(sF14,sF13))
| ~ edge(sK0(sF14,sF13))
| sF13 = tail_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(superposition,[],[f66,f2500]) ).
fof(f2612,plain,
( sF14 != head_of(sK0(sF14,sF13))
| ~ edge(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(forward_subsumption_resolution,[],[f2594,f134]) ).
fof(f2669,plain,
( sF14 = tail_of(sK0(sF14,sF13))
| sF14 = head_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(resolution,[],[f346,f246]) ).
fof(f2819,plain,
( sF13 = tail_of(sK0(sF14,sF13))
| sF13 = head_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(resolution,[],[f347,f246]) ).
fof(f2925,plain,
( sF13 = sF14
| sF14 = head_of(sK0(sF14,sF13))
| sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(superposition,[],[f2669,f2819]) ).
fof(f2944,plain,
( sF14 = head_of(sK0(sF14,sF13))
| sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13)) ),
inference(duplicate_literal_removal,[],[f2925]) ).
fof(f3035,plain,
( sF14 != sF14
| ~ edge(sK0(sF14,sF13))
| sF13 = sF14
| sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13)) ),
inference(superposition,[],[f2612,f2944]) ).
fof(f3062,plain,
( sF14 != sF14
| ~ edge(sK0(sF14,sF13))
| sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13)) ),
inference(duplicate_literal_removal,[],[f3035]) ).
fof(f3063,plain,
( ~ edge(sK0(sF14,sF13))
| sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13)) ),
inference(trivial_inequality_removal,[],[f3062]) ).
fof(f3068,plain,
( sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13))
| ~ vertex(sF14)
| ~ vertex(sF13)
| sF13 = sF14 ),
inference(resolution,[],[f3063,f142]) ).
fof(f3069,plain,
( sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13))
| ~ vertex(sF14)
| ~ vertex(sF13) ),
inference(duplicate_literal_removal,[],[f3068]) ).
fof(f3070,plain,
( sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13))
| ~ vertex(sF13) ),
inference(forward_subsumption_resolution,[],[f3069,f246]) ).
fof(f3071,plain,
( sF13 = head_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(forward_subsumption_resolution,[],[f3070,f327]) ).
fof(f4404,plain,
! [X0] : ~ precedes(X0,X0,sK12),
inference(resolution,[],[f588,f121]) ).
fof(f4800,plain,
! [X2,X0,X1] :
( sF14 != sF14
| sF13 != head_of(sK0(sF14,sF13))
| ~ shortest_path(X0,X1,X2)
| ~ precedes(sK10,sK11,X2)
| sF13 = tail_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(superposition,[],[f656,f2500]) ).
fof(f4830,plain,
! [X2,X0,X1] :
( sF13 != head_of(sK0(sF14,sF13))
| ~ shortest_path(X0,X1,X2)
| ~ precedes(sK10,sK11,X2)
| sF13 = tail_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(trivial_inequality_removal,[],[f4800]) ).
fof(f4836,plain,
! [X2,X0,X1] :
( ~ shortest_path(X0,X1,X2)
| ~ precedes(sK10,sK11,X2)
| sF13 = tail_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(forward_subsumption_resolution,[],[f4830,f2819]) ).
fof(f4943,plain,
( ~ precedes(sK10,sK11,sK12)
| sF13 = tail_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(resolution,[],[f4836,f121]) ).
fof(f4959,plain,
( sF13 = tail_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(forward_subsumption_resolution,[],[f4943,f120]) ).
fof(f4975,plain,
( sF13 != head_of(sK0(sF14,sF13))
| ~ edge(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(superposition,[],[f66,f4959]) ).
fof(f4999,plain,
( ~ edge(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(forward_subsumption_resolution,[],[f4975,f3071]) ).
fof(f5007,plain,
( sF13 = sF14
| ~ vertex(sF14)
| ~ vertex(sF13)
| sF13 = sF14 ),
inference(resolution,[],[f4999,f142]) ).
fof(f5008,plain,
( sF13 = sF14
| ~ vertex(sF14)
| ~ vertex(sF13) ),
inference(duplicate_literal_removal,[],[f5007]) ).
fof(f5009,plain,
( sF13 = sF14
| ~ vertex(sF13) ),
inference(forward_subsumption_resolution,[],[f5008,f246]) ).
fof(f5010,plain,
sF13 = sF14,
inference(forward_subsumption_resolution,[],[f5009,f327]) ).
fof(f5024,plain,
( sF13 != sF13
| sK10 = sK11
| sequential(sK11,sK10) ),
inference(superposition,[],[f524,f5010]) ).
fof(f5082,plain,
( sK10 = sK11
| sequential(sK11,sK10) ),
inference(trivial_inequality_removal,[],[f5024]) ).
fof(f5083,plain,
sK10 = sK11,
inference(forward_subsumption_resolution,[],[f5082,f578]) ).
fof(f5096,plain,
precedes(sK10,sK10,sK12),
inference(superposition,[],[f120,f5083]) ).
fof(f5220,plain,
$false,
inference(forward_subsumption_resolution,[],[f5096,f4404]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRA007+1 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n002.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 08:50:07 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.44 Running first-order model finding
% 0.12/0.44 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.69/4.27 % (3241892)Will run a generic schedule for satisfiability detection.
% 26.69/4.27 % (3241898)% WARNING: option uhcvi not known.
% 26.69/4.27 % (3241898)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3942874205:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 26.69/4.27 % (3241900)dis+10_1_sil=32000:sp=arity:random_seed=664439401:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 26.69/4.27 % (3241899)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=607530774:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 26.69/4.27 % (3241901)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2868428643:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 26.69/4.27 % (3241902)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2399039290:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 26.69/4.27 % (3241897)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=290417348_2999 on theBenchmark for (2999ds/0Mi)
% 26.69/4.27 % (3241903)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2792517617:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 26.69/4.27 % TRYING [1]
% 26.69/4.27 % TRYING [2]
% 26.69/4.27 % TRYING [3]
% 26.69/4.27 % TRYING [4]
% 26.69/4.27 % (3241900)Instruction limit reached!
% 26.69/4.27 % (3241900)------------------------------
% 26.69/4.27 % (3241900)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.69/4.27 % (3241900)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.69/4.27 % (3241900)CaDiCaL version: 2.1.3
% 26.69/4.27 % (3241900)Termination reason: Instruction limit
% 26.69/4.27 % (3241900)Termination phase: Saturation
% 26.69/4.27 % (3241900)Time elapsed: 0.106 s
% 26.69/4.27 % (3241900)Peak memory usage: 12 MB
% 26.69/4.27 % (3241900)Instructions burned: 104 (million)
% 26.69/4.27 % (3241901)Instruction limit reached!
% 26.69/4.27 % (3241901)------------------------------
% 26.69/4.27 % (3241901)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.69/4.27 % (3241901)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.69/4.27 % (3241901)CaDiCaL version: 2.1.3
% 26.69/4.27 % (3241901)Termination reason: Instruction limit
% 26.69/4.27 % (3241901)Termination phase: Saturation
% 26.69/4.27 % (3241901)Time elapsed: 0.113 s
% 26.69/4.27 % (3241901)Peak memory usage: 12 MB
% 26.69/4.27 % (3241901)Instructions burned: 116 (million)
% 26.69/4.27 % TRYING [5]
% 26.69/4.27 % (3241902)Instruction limit reached!
% 26.69/4.27 % (3241902)------------------------------
% 26.69/4.27 % (3241902)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.69/4.27 % (3241902)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.69/4.27 % (3241902)CaDiCaL version: 2.1.3
% 26.69/4.27 % (3241902)Termination reason: Instruction limit
% 26.69/4.27 % (3241902)Termination phase: Saturation
% 26.69/4.27 % (3241902)Time elapsed: 0.124 s
% 26.69/4.27 % (3241902)Peak memory usage: 13 MB
% 26.69/4.27 % (3241902)Instructions burned: 131 (million)
% 26.69/4.27 % (3241911)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1932383920:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 26.69/4.27 % TRYING [1]
% 26.69/4.27 % TRYING [2]
% 26.69/4.27 % TRYING [3]
% 26.69/4.27 % (3241912)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4258822924:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 26.69/4.27 % (3241914)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=480153429:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 26.69/4.27 % (3241903)Instruction limit reached!
% 26.69/4.27 % (3241903)------------------------------
% 26.69/4.27 % (3241903)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.69/4.27 % (3241903)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.69/4.27 % (3241903)CaDiCaL version: 2.1.3
% 26.69/4.27 % (3241903)Termination reason: Instruction limit
% 26.69/4.27 % (3241903)Termination phase: Saturation
% 26.69/4.27 % (3241903)Time elapsed: 0.178 s
% 26.69/4.27 % (3241903)Peak memory usage: 14 MB
% 26.69/4.27 % (3241903)Instructions burned: 160 (million)
% 26.69/4.27 % (3241917)ott-21_1_sil=16000:fs=off:random_seed=920749951:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 26.69/4.27 % TRYING [6]
% 26.69/4.27 % (3241912)Instruction limit reached!
% 26.69/4.27 % (3241912)------------------------------
% 26.69/4.27 % (3241912)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241912)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241912)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241912)Termination reason: Instruction limit
% 48.20/9.78 % (3241912)Termination phase: Saturation
% 48.20/9.78 % (3241912)Time elapsed: 0.138 s
% 48.20/9.78 % (3241912)Peak memory usage: 12 MB
% 48.20/9.78 % (3241912)Instructions burned: 131 (million)
% 48.20/9.78 % TRYING [4]
% 48.20/9.78 % (3241917)Instruction limit reached!
% 48.20/9.78 % (3241917)------------------------------
% 48.20/9.78 % (3241917)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241917)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241917)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241917)Termination reason: Instruction limit
% 48.20/9.78 % (3241917)Termination phase: Saturation
% 48.20/9.78 % (3241917)Time elapsed: 0.102 s
% 48.20/9.78 % (3241917)Peak memory usage: 12 MB
% 48.20/9.78 % (3241917)Instructions burned: 181 (million)
% 48.20/9.78 % (3241923)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3647856542:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 48.20/9.78 % (3241924)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1412375492:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 48.20/9.78 % TRYING [1]
% 48.20/9.78 % TRYING [2]
% 48.20/9.78 % TRYING [3]
% 48.20/9.78 % TRYING [4]
% 48.20/9.78 % TRYING [5]
% 48.20/9.78 % TRYING [7]
% 48.20/9.78 % (3241911)Instruction limit reached!
% 48.20/9.78 % (3241911)------------------------------
% 48.20/9.78 % (3241911)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241911)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241911)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241911)Termination reason: Instruction limit
% 48.20/9.78 % (3241911)Termination phase: Finite model building SAT solving
% 48.20/9.78 % (3241911)Time elapsed: 0.591 s
% 48.20/9.78 % (3241911)Peak memory usage: 16 MB
% 48.20/9.78 % (3241911)Instructions burned: 716 (million)
% 48.20/9.78 % (3241931)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=4247670957:i=1179_2992 on theBenchmark for (2992ds/1179Mi)
% 48.20/9.78 % (3241914)Instruction limit reached!
% 48.20/9.78 % (3241914)------------------------------
% 48.20/9.78 % (3241914)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241914)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241914)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241914)Termination reason: Instruction limit
% 48.20/9.78 % (3241914)Termination phase: Saturation
% 48.20/9.78 % (3241914)Time elapsed: 0.611 s
% 48.20/9.78 % (3241914)Peak memory usage: 20 MB
% 48.20/9.78 % (3241914)Instructions burned: 684 (million)
% 48.20/9.78 % (3241935)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1516027887:i=889:ins=1_2991 on theBenchmark for (2991ds/889Mi)
% 48.20/9.78 % (3241923)Instruction limit reached!
% 48.20/9.78 % (3241923)------------------------------
% 48.20/9.78 % (3241923)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241923)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241923)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241923)Termination reason: Instruction limit
% 48.20/9.78 % (3241923)Termination phase: Saturation
% 48.20/9.78 % (3241923)Time elapsed: 0.570 s
% 48.20/9.78 % (3241923)Peak memory usage: 14 MB
% 48.20/9.78 % (3241923)Instructions burned: 477 (million)
% 48.20/9.78 % (3241924)Instruction limit reached!
% 48.20/9.78 % (3241924)------------------------------
% 48.20/9.78 % (3241924)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241924)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241924)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241924)Termination reason: Instruction limit
% 48.20/9.78 % (3241924)Termination phase: Finite model building constraint generation
% 48.20/9.78 % (3241924)Time elapsed: 0.585 s
% 48.20/9.78 % (3241924)Peak memory usage: 20 MB
% 48.20/9.78 % (3241924)Instructions burned: 865 (million)
% 48.20/9.78 % (3241937)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=1086477906:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2990 on theBenchmark for (2990ds/692Mi)
% 48.20/9.78 % (3241939)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2712049588:i=879:kws=inv_precedence:fsr=off_2990 on theBenchmark for (2990ds/879Mi)
% 48.20/9.78 % TRYING [14]
% 48.20/9.78 % (3241935)Instruction limit reached!
% 48.20/9.78 % (3241935)------------------------------
% 48.20/9.78 % (3241935)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241935)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241935)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241935)Termination reason: Instruction limit
% 48.20/9.78 % (3241935)Termination phase: Finite model building constraint generation
% 48.20/9.78 % (3241935)Time elapsed: 0.650 s
% 48.20/9.78 % (3241935)Peak memory usage: 70 MB
% 48.20/9.78 % (3241935)Instructions burned: 889 (million)
% 48.20/9.78 % (3241945)fmb+10_1_sil=64000:random_seed=2501780790:i=22061:nm=2:gsp=on_2984 on theBenchmark for (2984ds/22061Mi)
% 48.20/9.78 % (3241937)Instruction limit reached!
% 48.20/9.78 % (3241937)------------------------------
% 48.20/9.78 % (3241937)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241937)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241937)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241937)Termination reason: Instruction limit
% 48.20/9.78 % (3241937)Termination phase: Saturation
% 48.20/9.78 % (3241937)Time elapsed: 0.559 s
% 48.20/9.78 % (3241937)Peak memory usage: 16 MB
% 48.20/9.78 % (3241937)Instructions burned: 693 (million)
% 48.20/9.78 % TRYING [1]
% 48.20/9.78 % TRYING [2]
% 48.20/9.78 % TRYING [3]
% 48.20/9.78 % TRYING [4]
% 48.20/9.78 % (3241947)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2987190747:i=9515:nm=5_2984 on theBenchmark for (2984ds/9515Mi)
% 48.20/9.78 % TRYING [20]
% 48.20/9.78 % TRYING [5]
% 48.20/9.78 % TRYING [6]
% 48.20/9.78 % (3241931)Instruction limit reached!
% 48.20/9.78 % (3241931)------------------------------
% 48.20/9.78 % (3241931)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241931)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241931)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241931)Termination reason: Instruction limit
% 48.20/9.78 % (3241931)Termination phase: Saturation
% 48.20/9.78 % (3241931)Time elapsed: 0.991 s
% 48.20/9.78 % (3241931)Peak memory usage: 21 MB
% 48.20/9.78 % (3241931)Instructions burned: 1179 (million)
% 48.20/9.78 % (3241951)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=543853683:fmbsr=1.7:i=920_2982 on theBenchmark for (2982ds/920Mi)
% 48.20/9.78 % (3241939)Instruction limit reached!
% 48.20/9.78 % (3241939)------------------------------
% 48.20/9.78 % (3241939)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241939)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241939)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241939)Termination reason: Instruction limit
% 48.20/9.78 % (3241939)Termination phase: Saturation
% 48.20/9.78 % (3241939)Time elapsed: 0.799 s
% 48.20/9.78 % (3241939)Peak memory usage: 18 MB
% 48.20/9.78 % (3241939)Instructions burned: 879 (million)
% 48.20/9.78 % TRYING [8]
% 48.20/9.78 % (3241953)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3939283817:i=5131_2982 on theBenchmark for (2982ds/5131Mi)
% 48.20/9.78 % TRYING [7]
% 48.20/9.78 % TRYING [8]
% 48.20/9.78 % TRYING [8]
% 48.20/9.78 % (3241951)Instruction limit reached!
% 48.20/9.78 % (3241951)------------------------------
% 48.20/9.78 % (3241951)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241951)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241951)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241951)Termination reason: Instruction limit
% 48.20/9.78 % (3241951)Termination phase: Finite model building constraint generation
% 48.20/9.78 % (3241951)Time elapsed: 0.642 s
% 48.20/9.78 % (3241951)Peak memory usage: 64 MB
% 48.20/9.78 % (3241951)Instructions burned: 921 (million)
% 48.20/9.78 % (3241955)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=927478886:i=1472:ins=7:fdi=8:gsp=on_2975 on theBenchmark for (2975ds/1472Mi)
% 48.20/9.78 % TRYING [9]
% 48.20/9.78 % TRYING [9]
% 48.20/9.78 % (3241955)Instruction limit reached!
% 48.20/9.78 % (3241955)------------------------------
% 48.20/9.78 % (3241955)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241955)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241955)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241955)Termination reason: Instruction limit
% 48.20/9.78 % (3241955)Termination phase: Saturation
% 48.20/9.78 % (3241955)Time elapsed: 1.311 s
% 48.20/9.78 % (3241955)Peak memory usage: 22 MB
% 48.20/9.78 % (3241955)Instructions burned: 1472 (million)
% 48.20/9.78 % (3241959)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1948689957:i=6324_2962 on theBenchmark for (2962ds/6324Mi)
% 48.20/9.78 % TRYING [77]
% 48.20/9.78 % TRYING [10]
% 48.20/9.78 % (3241953)Instruction limit reached!
% 48.20/9.78 % (3241953)------------------------------
% 48.20/9.78 % (3241953)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241953)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241953)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241953)Termination reason: Instruction limit
% 48.20/9.78 % (3241953)Termination phase: Saturation
% 48.20/9.78 % (3241953)Time elapsed: 4.437 s
% 48.20/9.78 % (3241953)Peak memory usage: 24 MB
% 48.20/9.78 % (3241953)Instructions burned: 5131 (million)
% 48.20/9.78 % (3241965)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1214912467:fmbsr=2.30978:i=2174_2937 on theBenchmark for (2937ds/2174Mi)
% 48.20/9.78 % TRYING [16]
% 48.20/9.78 % TRYING [10]
% 48.20/9.78 % (3241965)Instruction limit reached!
% 48.20/9.78 % (3241965)------------------------------
% 48.20/9.78 % (3241965)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241965)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241965)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241965)Termination reason: Instruction limit
% 48.20/9.78 % (3241965)Termination phase: Finite model building constraint generation
% 48.20/9.78 % (3241965)Time elapsed: 1.433 s
% 48.20/9.78 % (3241965)Peak memory usage: 126 MB
% 48.20/9.78 % (3241965)Instructions burned: 2174 (million)
% 48.20/9.78 % (3241971)ott-2_1_sil=16000:newcnf=on:random_seed=44311964:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2922 on theBenchmark for (2922ds/869Mi)
% 48.20/9.78 % (3241971)Instruction limit reached!
% 48.20/9.78 % (3241971)------------------------------
% 48.20/9.78 % (3241971)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241971)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241971)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241971)Termination reason: Instruction limit
% 48.20/9.78 % (3241971)Termination phase: Saturation
% 48.20/9.78 % (3241971)Time elapsed: 0.802 s
% 48.20/9.78 % (3241971)Peak memory usage: 18 MB
% 48.20/9.78 % (3241971)Instructions burned: 869 (million)
% 48.20/9.78 % (3241959)Instruction limit reached!
% 48.20/9.78 % (3241959)------------------------------
% 48.20/9.78 % (3241959)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.78 % (3241959)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.78 % (3241959)CaDiCaL version: 2.1.3
% 48.20/9.78 % (3241959)Termination reason: Instruction limit
% 48.20/9.78 % (3241959)Termination phase: Finite model building constraint generation
% 48.20/9.78 % (3241959)Time elapsed: 4.789 s
% 48.20/9.78 % (3241959)Peak memory usage: 447 MB
% 48.20/9.78 % (3241959)Instructions burned: 6324 (million)
% 48.20/9.78 % (3241975)ott+10_1_sil=32000:tgt=ground:random_seed=653362339:i=5114:av=off_2914 on theBenchmark for (2914ds/5114Mi)
% 48.20/9.78 % (3241977)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=2916153744:i=54282_2912 on theBenchmark for (2912ds/54282Mi)
% 48.20/9.78 % TRYING [1]
% 48.20/9.78 % TRYING [2]
% 48.20/9.78 % TRYING [3]
% 48.20/9.78 % TRYING [4]
% 48.20/9.78 % TRYING [5]
% 48.20/9.78 % TRYING [6]
% 48.20/9.78 % (3241975) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3241892-3241975"...
% 48.20/9.78 % (3241975)...printing done.
% 48.20/9.78 % (3241975)Refutation found. Thanks to Tanya!
% 48.20/9.78 % SZS status Theorem for theBenchmark
% 48.20/9.78 % SZS output start Proof for theBenchmark
% See solution above
% 48.20/9.79 % (3241975)------------------------------
% 48.20/9.79 % (3241975)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 48.20/9.79 % (3241975)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 48.20/9.79 % (3241975)CaDiCaL version: 2.1.3
% 48.20/9.79 % (3241975)Termination reason: Refutation
% 48.20/9.79 % (3241975)Time elapsed: 0.509 s
% 48.20/9.79 % (3241975)Peak memory usage: 16 MB
% 48.20/9.79 % (3241975)Instructions burned: 537 (million)
% 48.20/9.79 % (3241892)Success in time 9.331 s
% 48.20/9.79 % Vampire exiting
%------------------------------------------------------------------------------