%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRA007+2 : 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 : 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 : Tue Sep 29 10:08:26 AM UTC 2026
% Result : Theorem 11.63s 3.15s
% Output : Refutation 11.63s
% 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(f19,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(f20,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)],[f19]) ).
fof(f22,plain,
! [X0] :
( head_of(X0) != tail_of(X0)
| ~ edge(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f23,plain,
! [X0] :
( ( vertex(head_of(X0))
& vertex(tail_of(X0)) )
| ~ edge(X0) ),
inference(ennf_transformation,[],[f2]) ).
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(ennf_transformation,[],[f3]) ).
fof(f25,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,[],[f24]) ).
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(ennf_transformation,[],[f4]) ).
fof(f27,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,[],[f26]) ).
fof(f28,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(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(ennf_transformation,[],[f6]) ).
fof(f30,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,[],[f29]) ).
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(ennf_transformation,[],[f7]) ).
fof(f32,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,[],[f31]) ).
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(ennf_transformation,[],[f9]) ).
fof(f34,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,[],[f33]) ).
fof(f35,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(f36,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(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(ennf_transformation,[],[f12]) ).
fof(f38,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,[],[f37]) ).
fof(f47,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,[],[f20]) ).
fof(f48,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,[],[f47]) ).
fof(f49,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,[],[f25]) ).
fof(f50,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,[],[f49]) ).
fof(f51,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))],[f50]) ).
fof(f52,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,[],[f28]) ).
fof(f53,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,[],[f52]) ).
fof(f54,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,[],[f53]) ).
fof(f55,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))],[f54]) ).
fof(f56,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))],[f32]) ).
fof(f57,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(f58,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,[],[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) )
& ( ? [X5] :
( sequential(X3,X5)
& precedes(X5,X4,X0) )
| sequential(X3,X4) ) )
| ~ precedes(X3,X4,X0) )
| ~ path(X1,X2,X0) ),
inference(nnf_transformation,[],[f35]) ).
fof(f60,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,[],[f59]) ).
fof(f61,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,[],[f60]) ).
fof(f62,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))],[f61]) ).
fof(f63,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,[],[f36]) ).
fof(f64,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,[],[f63]) ).
fof(f65,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,[],[f64]) ).
fof(f66,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))],[f65]) ).
fof(f68,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)],[f48]) ).
fof(f69,plain,
! [X0] :
( head_of(X0) != tail_of(X0)
| ~ edge(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f70,plain,
! [X0] :
( vertex(tail_of(X0))
| ~ edge(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f71,plain,
! [X0] :
( vertex(head_of(X0))
| ~ edge(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f72,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,[],[f51]) ).
fof(f73,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,[],[f51]) ).
fof(f74,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,[],[f51]) ).
fof(f77,plain,
! [X0,X1] :
( edge(sK0(X0,X1))
| ~ vertex(X0)
| ~ vertex(X1)
| X0 = X1
| ~ complete ),
inference(cnf_transformation,[],[f51]) ).
fof(f79,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,[],[f27]) ).
fof(f87,plain,
! [X2,X0,X1] :
( ~ path(X0,X1,X2)
| vertex(X1) ),
inference(cnf_transformation,[],[f55]) ).
fof(f89,plain,
! [X2,X3,X0,X1] :
( ~ path(X0,X1,X2)
| in_path(tail_of(X3),X2)
| ~ on_path(X3,X2) ),
inference(cnf_transformation,[],[f30]) ).
fof(f91,plain,
! [X2,X3,X0,X1] :
( ~ path(X0,X1,X2)
| edge(X3)
| ~ on_path(X3,X2) ),
inference(cnf_transformation,[],[f30]) ).
fof(f94,plain,
! [X2,X3,X0,X1] :
( ~ path(X0,X1,X2)
| vertex(X3)
| ~ in_path(X3,X2) ),
inference(cnf_transformation,[],[f56]) ).
fof(f99,plain,
! [X0,X1] :
( head_of(X0) != tail_of(X1)
| ~ edge(X0)
| ~ edge(X1)
| X0 = X1
| sequential(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
fof(f100,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,[],[f34]) ).
fof(f105,plain,
! [X2,X3,X0,X1,X4] :
( ~ precedes(X3,X4,X0)
| on_path(X4,X0)
| ~ path(X1,X2,X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f106,plain,
! [X2,X3,X0,X1,X4] :
( ~ precedes(X3,X4,X0)
| on_path(X3,X0)
| ~ path(X1,X2,X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f109,plain,
! [X2,X0,X1] :
( ~ shortest_path(X0,X1,X2)
| path(X0,X1,X2) ),
inference(cnf_transformation,[],[f66]) ).
fof(f112,plain,
! [X2,X3,X0,X1,X4] :
( ~ shortest_path(X0,X1,X4)
| ~ precedes(X3,X2,X4)
| ~ precedes(X2,X3,X4) ),
inference(cnf_transformation,[],[f38]) ).
fof(f113,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,[],[f38]) ).
fof(f123,plain,
complete,
inference(cnf_transformation,[],[f68]) ).
fof(f124,plain,
precedes(sK10,sK11,sK12),
inference(cnf_transformation,[],[f68]) ).
fof(f125,plain,
shortest_path(sK8,sK9,sK12),
inference(cnf_transformation,[],[f68]) ).
fof(f126,plain,
! [X5] :
( ~ edge(X5)
| tail_of(X5) != head_of(sK11)
| head_of(X5) != tail_of(sK10) ),
inference(cnf_transformation,[],[f68]) ).
fof(f127,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,[],[f79]) ).
fof(f128,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,[],[f127]) ).
fof(f129,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,[],[f128]) ).
fof(f134,definition,
sF13 = head_of(sK11),
introduced(definition,[new_symbols(definition,[sF13])],[function_definition]) ).
fof(f135,plain,
head_of(sK11) = sF13,
inference(reorient_equations,[],[f134]) ).
fof(f136,definition,
sF14 = tail_of(sK10),
introduced(definition,[new_symbols(definition,[sF14])],[function_definition]) ).
fof(f137,plain,
tail_of(sK10) = sF14,
inference(reorient_equations,[],[f136]) ).
fof(f138,plain,
! [X5] :
( tail_of(X5) != sF13
| ~ edge(X5)
| head_of(X5) != sF14 ),
inference(definition_folding,[],[f126,f137,f135]) ).
fof(f139,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,[],[f100,f105]) ).
fof(f141,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,[],[f72,f123]) ).
fof(f142,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,[],[f73,f123]) ).
fof(f143,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,[],[f74,f123]) ).
fof(f146,plain,
! [X0,X1] :
( edge(sK0(X0,X1))
| ~ vertex(X0)
| ~ vertex(X1)
| X0 = X1 ),
inference(forward_subsumption_resolution,[],[f77,f123]) ).
fof(f160,plain,
( ~ edge(sK11)
| vertex(sF13) ),
inference(superposition,[],[f71,f135]) ).
fof(f177,plain,
path(sK8,sK9,sK12),
inference(resolution,[],[f109,f125]) ).
fof(f193,plain,
! [X0] :
( ~ on_path(X0,sK12)
| edge(X0) ),
inference(resolution,[],[f91,f177]) ).
fof(f206,plain,
! [X0] :
( ~ in_path(X0,sK12)
| vertex(X0) ),
inference(resolution,[],[f94,f177]) ).
fof(f210,plain,
! [X0] :
( in_path(tail_of(X0),sK12)
| ~ on_path(X0,sK12) ),
inference(resolution,[],[f89,f177]) ).
fof(f215,plain,
! [X0,X1] :
( ~ path(X0,X1,sK12)
| on_path(sK11,sK12) ),
inference(resolution,[],[f105,f124]) ).
fof(f216,plain,
on_path(sK11,sK12),
inference(resolution,[],[f215,f177]) ).
fof(f217,plain,
! [X0,X1] :
( ~ path(X0,X1,sK12)
| on_path(sK10,sK12) ),
inference(resolution,[],[f106,f124]) ).
fof(f218,plain,
edge(sK11),
inference(resolution,[],[f216,f193]) ).
fof(f221,plain,
! [X0,X1] :
( ~ precedes(X1,X0,sK12)
| ~ precedes(X0,X1,sK12) ),
inference(resolution,[],[f112,f125]) ).
fof(f222,plain,
on_path(sK10,sK12),
inference(resolution,[],[f217,f177]) ).
fof(f224,plain,
edge(sK10),
inference(resolution,[],[f222,f193]) ).
fof(f244,plain,
( in_path(sF14,sK12)
| ~ on_path(sK10,sK12) ),
inference(superposition,[],[f210,f137]) ).
fof(f246,plain,
in_path(sF14,sK12),
inference(forward_subsumption_resolution,[],[f244,f222]) ).
fof(f247,plain,
! [X0] :
( head_of(X0) != sF14
| ~ edge(X0)
| ~ edge(sK10)
| sK10 = X0
| sequential(X0,sK10) ),
inference(superposition,[],[f99,f137]) ).
fof(f249,plain,
! [X0] :
( head_of(X0) != sF14
| ~ edge(X0)
| sK10 = X0
| sequential(X0,sK10) ),
inference(forward_subsumption_resolution,[],[f247,f224]) ).
fof(f250,plain,
vertex(sF14),
inference(resolution,[],[f246,f206]) ).
fof(f299,plain,
( path(tail_of(sK11),sF13,path_cons(sK11,empty))
| ~ vertex(tail_of(sK11))
| ~ vertex(sF13)
| ~ edge(sK11) ),
inference(superposition,[],[f129,f135]) ).
fof(f300,plain,
( path(tail_of(sK11),sF13,path_cons(sK11,empty))
| ~ vertex(sF13)
| ~ edge(sK11) ),
inference(forward_subsumption_resolution,[],[f299,f70]) ).
fof(f314,plain,
( path(tail_of(sK11),sF13,path_cons(sK11,empty))
| ~ edge(sK11) ),
inference(forward_subsumption_resolution,[],[f300,f160]) ).
fof(f328,plain,
path(tail_of(sK11),sF13,path_cons(sK11,empty)),
inference(forward_subsumption_resolution,[],[f314,f218]) ).
fof(f331,plain,
vertex(sF13),
inference(resolution,[],[f328,f87]) ).
fof(f349,plain,
! [X0] :
( ~ vertex(X0)
| sF13 = tail_of(sK0(X0,sF13))
| tail_of(sK0(X0,sF13)) = X0
| sF13 = X0 ),
inference(resolution,[],[f331,f141]) ).
fof(f350,plain,
! [X0] :
( ~ vertex(X0)
| head_of(sK0(X0,sF13)) = X0
| tail_of(sK0(X0,sF13)) = X0
| sF13 = X0 ),
inference(resolution,[],[f331,f142]) ).
fof(f351,plain,
! [X0] :
( ~ vertex(X0)
| sF13 = tail_of(sK0(X0,sF13))
| sF13 = head_of(sK0(X0,sF13))
| sF13 = X0 ),
inference(resolution,[],[f331,f143]) ).
fof(f411,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,[],[f113,f137]) ).
fof(f415,plain,
! [X2,X3,X0,X1,X4] :
( head_of(X0) != head_of(X1)
| ~ shortest_path(X2,X3,X4)
| ~ precedes(X1,X0,X4) ),
inference(equality_resolution,[],[f113]) ).
fof(f416,plain,
! [X2,X0,X1] :
( ~ path(X1,X2,sK12)
| ~ sequential(X0,sK10)
| precedes(X0,sK11,sK12)
| ~ on_path(X0,sK12) ),
inference(resolution,[],[f139,f124]) ).
fof(f533,plain,
( sF13 != sF14
| ~ edge(sK11)
| sK10 = sK11
| sequential(sK11,sK10) ),
inference(superposition,[],[f249,f135]) ).
fof(f534,plain,
( sF13 != sF14
| sK10 = sK11
| sequential(sK11,sK10) ),
inference(forward_subsumption_resolution,[],[f533,f218]) ).
fof(f542,plain,
! [X0] :
( precedes(X0,sK11,sK12)
| ~ sequential(X0,sK10)
| ~ on_path(X0,sK12) ),
inference(resolution,[],[f416,f177]) ).
fof(f568,plain,
! [X0] :
( ~ precedes(sK11,X0,sK12)
| ~ on_path(X0,sK12)
| ~ sequential(X0,sK10) ),
inference(resolution,[],[f542,f221]) ).
fof(f582,plain,
( ~ on_path(sK11,sK12)
| ~ sequential(sK11,sK10)
| ~ sequential(sK11,sK10)
| ~ on_path(sK11,sK12) ),
inference(resolution,[],[f568,f542]) ).
fof(f583,plain,
( ~ on_path(sK11,sK12)
| ~ sequential(sK11,sK10) ),
inference(duplicate_literal_removal,[],[f582]) ).
fof(f584,plain,
~ sequential(sK11,sK10),
inference(forward_subsumption_resolution,[],[f583,f216]) ).
fof(f602,plain,
! [X2,X3,X0,X1] :
( ~ shortest_path(X0,X1,X2)
| ~ precedes(X3,X3,X2) ),
inference(equality_resolution,[],[f415]) ).
fof(f669,plain,
! [X2,X3,X0,X1] :
( tail_of(X0) != sF14
| head_of(X0) != sF13
| ~ shortest_path(X1,X2,X3)
| ~ precedes(sK10,sK11,X3) ),
inference(superposition,[],[f411,f135]) ).
fof(f2542,plain,
( sF14 = tail_of(sK0(sF14,sF13))
| sF13 = tail_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(resolution,[],[f349,f250]) ).
fof(f2640,plain,
( sF14 != head_of(sK0(sF14,sF13))
| ~ edge(sK0(sF14,sF13))
| sF13 = tail_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(superposition,[],[f69,f2542]) ).
fof(f2660,plain,
( sF14 != head_of(sK0(sF14,sF13))
| ~ edge(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(forward_subsumption_resolution,[],[f2640,f138]) ).
fof(f2717,plain,
( sF14 = tail_of(sK0(sF14,sF13))
| sF14 = head_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(resolution,[],[f350,f250]) ).
fof(f2874,plain,
( sF13 = tail_of(sK0(sF14,sF13))
| sF13 = head_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(resolution,[],[f351,f250]) ).
fof(f2984,plain,
( sF13 = sF14
| sF14 = head_of(sK0(sF14,sF13))
| sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(superposition,[],[f2717,f2874]) ).
fof(f3005,plain,
( sF14 = head_of(sK0(sF14,sF13))
| sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13)) ),
inference(duplicate_literal_removal,[],[f2984]) ).
fof(f3104,plain,
( sF14 != sF14
| ~ edge(sK0(sF14,sF13))
| sF13 = sF14
| sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13)) ),
inference(superposition,[],[f2660,f3005]) ).
fof(f3131,plain,
( sF14 != sF14
| ~ edge(sK0(sF14,sF13))
| sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13)) ),
inference(duplicate_literal_removal,[],[f3104]) ).
fof(f3132,plain,
( ~ edge(sK0(sF14,sF13))
| sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13)) ),
inference(trivial_inequality_removal,[],[f3131]) ).
fof(f3143,plain,
( sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13))
| ~ vertex(sF14)
| ~ vertex(sF13)
| sF13 = sF14 ),
inference(resolution,[],[f3132,f146]) ).
fof(f3144,plain,
( sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13))
| ~ vertex(sF14)
| ~ vertex(sF13) ),
inference(duplicate_literal_removal,[],[f3143]) ).
fof(f3145,plain,
( sF13 = sF14
| sF13 = head_of(sK0(sF14,sF13))
| ~ vertex(sF13) ),
inference(forward_subsumption_resolution,[],[f3144,f250]) ).
fof(f3146,plain,
( sF13 = head_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(forward_subsumption_resolution,[],[f3145,f331]) ).
fof(f4512,plain,
! [X0] : ~ precedes(X0,X0,sK12),
inference(resolution,[],[f602,f125]) ).
fof(f4908,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,[],[f669,f2542]) ).
fof(f4938,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,[],[f4908]) ).
fof(f4944,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,[],[f4938,f2874]) ).
fof(f5051,plain,
( ~ precedes(sK10,sK11,sK12)
| sF13 = tail_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(resolution,[],[f4944,f125]) ).
fof(f5067,plain,
( sF13 = tail_of(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(forward_subsumption_resolution,[],[f5051,f124]) ).
fof(f5083,plain,
( sF13 != head_of(sK0(sF14,sF13))
| ~ edge(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(superposition,[],[f69,f5067]) ).
fof(f5109,plain,
( ~ edge(sK0(sF14,sF13))
| sF13 = sF14 ),
inference(forward_subsumption_resolution,[],[f5083,f3146]) ).
fof(f5117,plain,
( sF13 = sF14
| ~ vertex(sF14)
| ~ vertex(sF13)
| sF13 = sF14 ),
inference(resolution,[],[f5109,f146]) ).
fof(f5118,plain,
( sF13 = sF14
| ~ vertex(sF14)
| ~ vertex(sF13) ),
inference(duplicate_literal_removal,[],[f5117]) ).
fof(f5119,plain,
( sF13 = sF14
| ~ vertex(sF13) ),
inference(forward_subsumption_resolution,[],[f5118,f250]) ).
fof(f5120,plain,
sF13 = sF14,
inference(forward_subsumption_resolution,[],[f5119,f331]) ).
fof(f5134,plain,
( sF13 != sF13
| sK10 = sK11
| sequential(sK11,sK10) ),
inference(superposition,[],[f534,f5120]) ).
fof(f5192,plain,
( sK10 = sK11
| sequential(sK11,sK10) ),
inference(trivial_inequality_removal,[],[f5134]) ).
fof(f5193,plain,
sK10 = sK11,
inference(forward_subsumption_resolution,[],[f5192,f584]) ).
fof(f5206,plain,
precedes(sK10,sK10,sK12),
inference(superposition,[],[f124,f5193]) ).
fof(f5330,plain,
$false,
inference(forward_subsumption_resolution,[],[f5206,f4512]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRA007+2 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.03/0.32 % Computer : n012.cluster.edu
% 0.03/0.32 % Model : x86_64 x86_64
% 0.03/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.32 % Memory : 8046.5625MB
% 0.03/0.32 % OS : Linux 6.8.0-71-generic
% 0.03/0.32 % CPULimit : 300
% 0.03/0.32 % WCLimit : 300
% 0.03/0.32 % DateTime : Sun Sep 27 08:46:50 UTC 2026
% 0.03/0.32 % CPUTime :
% 0.03/0.32 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.34 Running first-order model finding
% 0.07/0.34 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
% 8.33/1.61 % (2072289)Will run a generic schedule for satisfiability detection.
% 8.33/1.61 % (2072295)% WARNING: option uhcvi not known.
% 8.33/1.61 % (2072300)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3011554858:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 8.33/1.61 % (2072294)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3071484800_2999 on theBenchmark for (2999ds/0Mi)
% 8.33/1.61 % (2072297)dis+10_1_sil=32000:sp=arity:random_seed=2722455899:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 8.33/1.61 % (2072296)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4104774885:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 8.33/1.61 % (2072295)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=672852500:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 8.33/1.61 % (2072298)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1005316021:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 8.33/1.61 % (2072299)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2510730613:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 8.33/1.61 % TRYING [1]
% 8.33/1.61 % TRYING [2]
% 8.33/1.61 % TRYING [3]
% 8.33/1.61 % TRYING [4]
% 8.33/1.61 % TRYING [5]
% 8.33/1.61 % (2072297)Instruction limit reached!
% 8.33/1.61 % (2072297)------------------------------
% 8.33/1.61 % (2072297)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.33/1.61 % (2072297)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.33/1.61 % (2072297)CaDiCaL version: 2.1.3
% 8.33/1.61 % (2072297)Termination reason: Instruction limit
% 8.33/1.61 % (2072297)Termination phase: Saturation
% 8.33/1.61 % (2072297)Time elapsed: 0.037 s
% 8.33/1.61 % (2072297)Peak memory usage: 12 MB
% 8.33/1.61 % (2072297)Instructions burned: 104 (million)
% 8.33/1.61 % (2072298)Instruction limit reached!
% 8.33/1.61 % (2072298)------------------------------
% 8.33/1.61 % (2072298)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.33/1.61 % (2072298)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.33/1.61 % (2072298)CaDiCaL version: 2.1.3
% 8.33/1.61 % (2072298)Termination reason: Instruction limit
% 8.33/1.61 % (2072298)Termination phase: Saturation
% 8.33/1.61 % (2072298)Time elapsed: 0.037 s
% 8.33/1.61 % (2072298)Peak memory usage: 13 MB
% 8.33/1.61 % (2072298)Instructions burned: 118 (million)
% 8.33/1.61 % (2072299)Instruction limit reached!
% 8.33/1.61 % (2072299)------------------------------
% 8.33/1.61 % (2072299)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.33/1.61 % (2072299)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.33/1.61 % (2072299)CaDiCaL version: 2.1.3
% 8.33/1.61 % (2072299)Termination reason: Instruction limit
% 8.33/1.61 % (2072299)Termination phase: Saturation
% 8.33/1.61 % (2072299)Time elapsed: 0.044 s
% 8.33/1.61 % (2072299)Peak memory usage: 13 MB
% 8.33/1.61 % (2072299)Instructions burned: 131 (million)
% 8.33/1.61 % (2072309)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1851322548:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 8.33/1.61 % (2072308)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2626317702:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 8.33/1.61 % TRYING [1]
% 8.33/1.61 % TRYING [2]
% 8.33/1.61 % TRYING [3]
% 8.33/1.61 % (2072310)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=3526569082:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 8.33/1.61 % (2072300)Instruction limit reached!
% 8.33/1.61 % (2072300)------------------------------
% 8.33/1.61 % (2072300)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 8.33/1.61 % (2072300)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.33/1.61 % (2072300)CaDiCaL version: 2.1.3
% 8.33/1.61 % (2072300)Termination reason: Instruction limit
% 8.33/1.61 % (2072300)Termination phase: Saturation
% 8.33/1.61 % (2072300)Time elapsed: 0.056 s
% 8.33/1.61 % (2072300)Peak memory usage: 14 MB
% 8.33/1.61 % (2072300)Instructions burned: 159 (million)
% 8.33/1.61 % (2072314)ott-21_1_sil=16000:fs=off:random_seed=3550399062:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 8.33/1.61 % TRYING [6]
% 8.33/1.61 % (2072309)Instruction limit reached!
% 8.33/1.61 % (2072309)------------------------------
% 8.33/1.61 % (2072309)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072309)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072309)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072309)Termination reason: Instruction limit
% 11.63/3.15 % (2072309)Termination phase: Saturation
% 11.63/3.15 % (2072309)Time elapsed: 0.044 s
% 11.63/3.15 % (2072309)Peak memory usage: 12 MB
% 11.63/3.15 % (2072309)Instructions burned: 131 (million)
% 11.63/3.15 % (2072316)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3722399026:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 11.63/3.15 % TRYING [4]
% 11.63/3.15 % (2072314)Instruction limit reached!
% 11.63/3.15 % (2072314)------------------------------
% 11.63/3.15 % (2072314)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072314)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072314)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072314)Termination reason: Instruction limit
% 11.63/3.15 % (2072314)Termination phase: Saturation
% 11.63/3.15 % (2072314)Time elapsed: 0.053 s
% 11.63/3.15 % (2072314)Peak memory usage: 12 MB
% 11.63/3.15 % (2072314)Instructions burned: 181 (million)
% 11.63/3.15 % (2072318)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2348083421:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 11.63/3.15 % TRYING [1]
% 11.63/3.15 % TRYING [2]
% 11.63/3.15 % TRYING [3]
% 11.63/3.15 % TRYING [4]
% 11.63/3.15 % TRYING [5]
% 11.63/3.15 % TRYING [7]
% 11.63/3.15 % (2072310)Instruction limit reached!
% 11.63/3.15 % (2072310)------------------------------
% 11.63/3.15 % (2072310)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072310)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072310)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072310)Termination reason: Instruction limit
% 11.63/3.15 % (2072310)Termination phase: Saturation
% 11.63/3.15 % (2072310)Time elapsed: 0.206 s
% 11.63/3.15 % (2072310)Peak memory usage: 20 MB
% 11.63/3.15 % (2072310)Instructions burned: 684 (million)
% 11.63/3.15 % (2072308)Instruction limit reached!
% 11.63/3.15 % (2072308)------------------------------
% 11.63/3.15 % (2072308)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072308)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072308)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072308)Termination reason: Instruction limit
% 11.63/3.15 % (2072308)Termination phase: Finite model building SAT solving
% 11.63/3.15 % (2072308)Time elapsed: 0.224 s
% 11.63/3.15 % (2072308)Peak memory usage: 16 MB
% 11.63/3.15 % (2072308)Instructions burned: 716 (million)
% 11.63/3.15 % (2072320)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3442196733:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 11.63/3.15 % (2072316)Instruction limit reached!
% 11.63/3.15 % (2072316)------------------------------
% 11.63/3.15 % (2072316)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072316)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072316)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072316)Termination reason: Instruction limit
% 11.63/3.15 % (2072316)Termination phase: Saturation
% 11.63/3.15 % (2072316)Time elapsed: 0.172 s
% 11.63/3.15 % (2072316)Peak memory usage: 14 MB
% 11.63/3.15 % (2072316)Instructions burned: 477 (million)
% 11.63/3.15 % (2072321)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=283945532:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 11.63/3.15 % (2072323)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=1489823663:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2996 on theBenchmark for (2996ds/692Mi)
% 11.63/3.15 % TRYING [6]
% 11.63/3.15 % (2072318)Instruction limit reached!
% 11.63/3.15 % (2072318)------------------------------
% 11.63/3.15 % (2072318)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072318)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072318)Termination reason: Instruction limit
% 11.63/3.15 % (2072318)Termination phase: Finite model building constraint generation
% 11.63/3.15 % (2072318)Time elapsed: 0.174 s
% 11.63/3.15 % (2072318)Peak memory usage: 20 MB
% 11.63/3.15 % (2072318)Instructions burned: 868 (million)
% 11.63/3.15 % (2072326)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=4249903090:i=879:kws=inv_precedence:fsr=off_2996 on theBenchmark for (2996ds/879Mi)
% 11.63/3.15 % TRYING [14]
% 11.63/3.15 % (2072321)Instruction limit reached!
% 11.63/3.15 % (2072321)------------------------------
% 11.63/3.15 % (2072321)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072321)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072321)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072321)Termination reason: Instruction limit
% 11.63/3.15 % (2072321)Termination phase: Finite model building constraint generation
% 11.63/3.15 % (2072321)Time elapsed: 0.181 s
% 11.63/3.15 % (2072321)Peak memory usage: 71 MB
% 11.63/3.15 % (2072321)Instructions burned: 890 (million)
% 11.63/3.15 % (2072323)Instruction limit reached!
% 11.63/3.15 % (2072323)------------------------------
% 11.63/3.15 % (2072323)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072323)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072323)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072323)Termination reason: Instruction limit
% 11.63/3.15 % (2072323)Termination phase: Saturation
% 11.63/3.15 % (2072323)Time elapsed: 0.192 s
% 11.63/3.15 % (2072323)Peak memory usage: 20 MB
% 11.63/3.15 % (2072323)Instructions burned: 692 (million)
% 11.63/3.15 % (2072328)fmb+10_1_sil=64000:random_seed=128067197:i=22061:nm=2:gsp=on_2995 on theBenchmark for (2995ds/22061Mi)
% 11.63/3.15 % TRYING [1]
% 11.63/3.15 % TRYING [2]
% 11.63/3.15 % TRYING [3]
% 11.63/3.15 % (2072330)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3128593723:i=9515:nm=5_2994 on theBenchmark for (2994ds/9515Mi)
% 11.63/3.15 % TRYING [20]
% 11.63/3.15 % TRYING [4]
% 11.63/3.15 % TRYING [5]
% 11.63/3.15 % TRYING [6]
% 11.63/3.15 % (2072326)Instruction limit reached!
% 11.63/3.15 % (2072326)------------------------------
% 11.63/3.15 % (2072326)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072326)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072326)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072326)Termination reason: Instruction limit
% 11.63/3.15 % (2072326)Termination phase: Saturation
% 11.63/3.15 % (2072326)Time elapsed: 0.273 s
% 11.63/3.15 % (2072326)Peak memory usage: 19 MB
% 11.63/3.15 % (2072326)Instructions burned: 881 (million)
% 11.63/3.15 % (2072320)Instruction limit reached!
% 11.63/3.15 % (2072320)------------------------------
% 11.63/3.15 % (2072320)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072320)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072320)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072320)Termination reason: Instruction limit
% 11.63/3.15 % (2072320)Termination phase: Saturation
% 11.63/3.15 % (2072320)Time elapsed: 0.327 s
% 11.63/3.15 % (2072320)Peak memory usage: 21 MB
% 11.63/3.15 % (2072320)Instructions burned: 1179 (million)
% 11.63/3.15 % (2072332)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=4191145201:fmbsr=1.7:i=920_2993 on theBenchmark for (2993ds/920Mi)
% 11.63/3.15 % TRYING [8]
% 11.63/3.15 % TRYING [8]
% 11.63/3.15 % (2072334)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2229332313:i=5131_2993 on theBenchmark for (2993ds/5131Mi)
% 11.63/3.15 % TRYING [7]
% 11.63/3.15 % (2072332)Instruction limit reached!
% 11.63/3.15 % (2072332)------------------------------
% 11.63/3.15 % (2072332)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072332)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072332)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072332)Termination reason: Instruction limit
% 11.63/3.15 % (2072332)Termination phase: Finite model building constraint generation
% 11.63/3.15 % (2072332)Time elapsed: 0.196 s
% 11.63/3.15 % (2072332)Peak memory usage: 64 MB
% 11.63/3.15 % (2072332)Instructions burned: 921 (million)
% 11.63/3.15 % (2072336)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3569168595:i=1472:ins=7:fdi=8:gsp=on_2991 on theBenchmark for (2991ds/1472Mi)
% 11.63/3.15 % TRYING [8]
% 11.63/3.15 % TRYING [9]
% 11.63/3.15 % (2072336)Instruction limit reached!
% 11.63/3.15 % (2072336)------------------------------
% 11.63/3.15 % (2072336)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072336)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072336)Termination reason: Instruction limit
% 11.63/3.15 % (2072336)Termination phase: Saturation
% 11.63/3.15 % (2072336)Time elapsed: 0.420 s
% 11.63/3.15 % (2072336)Peak memory usage: 23 MB
% 11.63/3.15 % (2072336)Instructions burned: 1475 (million)
% 11.63/3.15 % (2072338)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=230399558:i=6324_2987 on theBenchmark for (2987ds/6324Mi)
% 11.63/3.15 % TRYING [77]
% 11.63/3.15 % TRYING [9]
% 11.63/3.15 % TRYING [10]
% 11.63/3.15 % (2072334)Instruction limit reached!
% 11.63/3.15 % (2072334)------------------------------
% 11.63/3.15 % (2072334)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072334)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072334)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072334)Termination reason: Instruction limit
% 11.63/3.15 % (2072334)Termination phase: Saturation
% 11.63/3.15 % (2072334)Time elapsed: 1.397 s
% 11.63/3.15 % (2072334)Peak memory usage: 24 MB
% 11.63/3.15 % (2072334)Instructions burned: 5133 (million)
% 11.63/3.15 % (2072340)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=2717842114:fmbsr=2.30978:i=2174_2979 on theBenchmark for (2979ds/2174Mi)
% 11.63/3.15 % TRYING [16]
% 11.63/3.15 % TRYING [10]
% 11.63/3.15 % (2072340)Instruction limit reached!
% 11.63/3.15 % (2072340)------------------------------
% 11.63/3.15 % (2072340)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072340)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072340)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072340)Termination reason: Instruction limit
% 11.63/3.15 % (2072340)Termination phase: Finite model building constraint generation
% 11.63/3.15 % (2072340)Time elapsed: 0.399 s
% 11.63/3.15 % (2072340)Peak memory usage: 125 MB
% 11.63/3.15 % (2072340)Instructions burned: 2180 (million)
% 11.63/3.15 % (2072342)ott-2_1_sil=16000:newcnf=on:random_seed=629993027:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2975 on theBenchmark for (2975ds/869Mi)
% 11.63/3.15 % (2072338)Instruction limit reached!
% 11.63/3.15 % (2072338)------------------------------
% 11.63/3.15 % (2072338)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072338)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072338)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072338)Termination reason: Instruction limit
% 11.63/3.15 % (2072338)Termination phase: Finite model building constraint generation
% 11.63/3.15 % (2072338)Time elapsed: 1.271 s
% 11.63/3.15 % (2072338)Peak memory usage: 446 MB
% 11.63/3.15 % (2072338)Instructions burned: 6329 (million)
% 11.63/3.15 % (2072344)ott+10_1_sil=32000:tgt=ground:random_seed=3555031209:i=5114:av=off_2974 on theBenchmark for (2974ds/5114Mi)
% 11.63/3.15 % (2072342)Instruction limit reached!
% 11.63/3.15 % (2072342)------------------------------
% 11.63/3.15 % (2072342)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.15 % (2072342)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.15 % (2072342)CaDiCaL version: 2.1.3
% 11.63/3.15 % (2072342)Termination reason: Instruction limit
% 11.63/3.15 % (2072342)Termination phase: Saturation
% 11.63/3.15 % (2072342)Time elapsed: 0.267 s
% 11.63/3.15 % (2072342)Peak memory usage: 18 MB
% 11.63/3.15 % (2072342)Instructions burned: 869 (million)
% 11.63/3.15 % (2072346)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1489572146:i=54282_2972 on theBenchmark for (2972ds/54282Mi)
% 11.63/3.15 % TRYING [1]
% 11.63/3.15 % TRYING [2]
% 11.63/3.15 % TRYING [3]
% 11.63/3.15 % (2072344) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2072289-2072344"...
% 11.63/3.15 % (2072344)...printing done.
% 11.63/3.15 % (2072344)Refutation found. Thanks to Tanya!
% 11.63/3.15 % SZS status Theorem for theBenchmark
% 11.63/3.15 % SZS output start Proof for theBenchmark
% See solution above
% 11.63/3.16 % (2072344)------------------------------
% 11.63/3.16 % (2072344)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.63/3.16 % (2072344)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.63/3.16 % (2072344)CaDiCaL version: 2.1.3
% 11.63/3.16 % (2072344)Termination reason: Refutation
% 11.63/3.16 % (2072344)Time elapsed: 0.170 s
% 11.63/3.16 % (2072344)Peak memory usage: 16 MB
% 11.63/3.16 % (2072344)Instructions burned: 555 (million)
% 11.63/3.16 % (2072289)Success in time 2.811 s
% 11.63/3.16 % Vampire exiting
%------------------------------------------------------------------------------