%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRA002+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:25 AM UTC 2026
% Result : Theorem 26.31s 10.14s
% Output : Refutation 26.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 17
% Syntax : Number of formulae : 131 ( 19 unt; 5 def)
% Number of atoms : 480 ( 78 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 581 ( 232 ~; 246 |; 78 &)
% ( 9 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 7 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-3 aty)
% Number of variables : 237 ( 0 sgn 222 !; 15 ?)
% 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(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(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(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(f13,axiom,
! [X0,X1,X2] :
( triangle(X0,X1,X2)
<=> ( edge(X0)
& edge(X1)
& edge(X2)
& sequential(X0,X1)
& sequential(X1,X2)
& sequential(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',triangle_defn) ).
fof(f14,axiom,
! [X0,X1,X2] :
( path(X0,X1,X2)
=> length_of(X2) = number_of_in(edges,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',length_defn) ).
fof(f15,axiom,
! [X0,X1,X2] :
( path(X0,X1,X2)
=> number_of_in(sequential_pairs,X2) = minus(length_of(X2),n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',path_length_sequential_pairs) ).
fof(f16,axiom,
! [X0,X1,X2] :
( ( path(X1,X2,X0)
& ! [X3,X4] :
( ( on_path(X3,X0)
& on_path(X4,X0)
& sequential(X3,X4) )
=> ? [X5] : triangle(X3,X4,X5) ) )
=> number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
fof(f17,axiom,
! [X0,X1] : less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',graph_has_them_all) ).
fof(f18,axiom,
( 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,conjecture,
( complete
=> ! [X0,X1,X2] :
( shortest_path(X1,X2,X0)
=> less_or_equal(minus(length_of(X0),n1),number_of_in(triangles,graph)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maximal_path_length) ).
fof(f20,negated_conjecture,
~ ( complete
=> ! [X0,X1,X2] :
( shortest_path(X1,X2,X0)
=> less_or_equal(minus(length_of(X0),n1),number_of_in(triangles,graph)) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( edge(X0)
& edge(X1)
& edge(X2)
& sequential(X0,X1)
& sequential(X1,X2)
& sequential(X2,X0) )
=> triangle(X0,X1,X2) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
fof(f22,plain,
! [X0] :
( head_of(X0) != tail_of(X0)
| ~ edge(X0) ),
inference(ennf_transformation,[],[f1]) ).
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(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(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(f39,plain,
! [X0,X1,X2] :
( triangle(X0,X1,X2)
| ~ edge(X0)
| ~ edge(X1)
| ~ edge(X2)
| ~ sequential(X0,X1)
| ~ sequential(X1,X2)
| ~ sequential(X2,X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f40,plain,
! [X0,X1,X2] :
( triangle(X0,X1,X2)
| ~ edge(X0)
| ~ edge(X1)
| ~ edge(X2)
| ~ sequential(X0,X1)
| ~ sequential(X1,X2)
| ~ sequential(X2,X0) ),
inference(flattening,[],[f39]) ).
fof(f41,plain,
! [X0,X1,X2] :
( length_of(X2) = number_of_in(edges,X2)
| ~ path(X0,X1,X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f42,plain,
! [X0,X1,X2] :
( number_of_in(sequential_pairs,X2) = minus(length_of(X2),n1)
| ~ path(X0,X1,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f43,plain,
! [X0,X1,X2] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| ~ path(X1,X2,X0)
| ? [X3,X4] :
( ! [X5] : ~ triangle(X3,X4,X5)
& on_path(X3,X0)
& on_path(X4,X0)
& sequential(X3,X4) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f44,plain,
! [X0,X1,X2] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| ~ path(X1,X2,X0)
| ? [X3,X4] :
( ! [X5] : ~ triangle(X3,X4,X5)
& on_path(X3,X0)
& on_path(X4,X0)
& sequential(X3,X4) ) ),
inference(flattening,[],[f43]) ).
fof(f45,plain,
( ! [X0,X1,X2,X3,X4] :
( ? [X5] :
( edge(X5)
& tail_of(X5) = head_of(X3)
& head_of(X5) = tail_of(X2) )
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4) )
| ~ complete ),
inference(ennf_transformation,[],[f18]) ).
fof(f46,plain,
( ! [X0,X1,X2,X3,X4] :
( ? [X5] :
( edge(X5)
& tail_of(X5) = head_of(X3)
& head_of(X5) = tail_of(X2) )
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4) )
| ~ complete ),
inference(flattening,[],[f45]) ).
fof(f47,plain,
( ? [X0,X1,X2] :
( ~ less_or_equal(minus(length_of(X0),n1),number_of_in(triangles,graph))
& shortest_path(X1,X2,X0) )
& complete ),
inference(ennf_transformation,[],[f20]) ).
fof(f56,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(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(flattening,[],[f56]) ).
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
& ! [X3] :
( less_or_equal(length_of(X2),length_of(X3))
| ~ path(X0,X1,X3) ) )
| ~ shortest_path(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f36]) ).
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(flattening,[],[f62]) ).
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
& ! [X4] :
( less_or_equal(length_of(X2),length_of(X4))
| ~ path(X0,X1,X4) ) )
| ~ shortest_path(X0,X1,X2) ) ),
inference(rectify,[],[f63]) ).
fof(f65,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))],[f64]) ).
fof(f66,plain,
! [X0,X1,X2] :
( number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| ~ path(X1,X2,X0)
| ( ! [X5] : ~ triangle(sK6(X0),sK7(X0),X5)
& on_path(sK6(X0),X0)
& on_path(sK7(X0),X0)
& sequential(sK6(X0),sK7(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X3,sK6(X0)),skolemize(X4,sK7(X0))],[f44]) ).
fof(f67,plain,
( ! [X0,X1,X2,X3,X4] :
( ( edge(sK8(X2,X3))
& head_of(X3) = tail_of(sK8(X2,X3))
& tail_of(X2) = head_of(sK8(X2,X3)) )
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4) )
| ~ complete ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X5,sK8(X2,X3))],[f46]) ).
fof(f68,plain,
( ~ less_or_equal(minus(length_of(sK9),n1),number_of_in(triangles,graph))
& shortest_path(sK10,sK11,sK9)
& complete ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10,sK11]),skolemize(X0,sK9),skolemize(X1,sK10),skolemize(X2,sK11)],[f47]) ).
fof(f69,plain,
! [X0] :
( head_of(X0) != tail_of(X0)
| ~ edge(X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f91,plain,
! [X2,X3,X0,X1] :
( ~ path(X0,X1,X2)
| edge(X3)
| ~ on_path(X3,X2) ),
inference(cnf_transformation,[],[f30]) ).
fof(f97,plain,
! [X0,X1] :
( ~ sequential(X0,X1)
| edge(X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f99,plain,
! [X0,X1] :
( head_of(X0) != tail_of(X1)
| ~ edge(X0)
| ~ edge(X1)
| X0 = X1
| sequential(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f101,plain,
! [X2,X3,X0,X1,X4] :
( ~ path(X1,X2,X0)
| ~ on_path(X3,X0)
| ~ on_path(X4,X0)
| ~ sequential(X3,X4)
| precedes(X3,X4,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f109,plain,
! [X2,X0,X1] :
( ~ shortest_path(X0,X1,X2)
| path(X0,X1,X2) ),
inference(cnf_transformation,[],[f65]) ).
fof(f114,plain,
! [X2,X0,X1] :
( triangle(X0,X1,X2)
| ~ edge(X0)
| ~ edge(X1)
| ~ edge(X2)
| ~ sequential(X0,X1)
| ~ sequential(X1,X2)
| ~ sequential(X2,X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f115,plain,
! [X2,X0,X1] :
( ~ path(X0,X1,X2)
| length_of(X2) = number_of_in(edges,X2) ),
inference(cnf_transformation,[],[f41]) ).
fof(f116,plain,
! [X2,X0,X1] :
( ~ path(X0,X1,X2)
| number_of_in(sequential_pairs,X2) = minus(length_of(X2),n1) ),
inference(cnf_transformation,[],[f42]) ).
fof(f117,plain,
! [X2,X0,X1] :
( sequential(sK6(X0),sK7(X0))
| ~ path(X1,X2,X0)
| number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f118,plain,
! [X2,X0,X1] :
( ~ path(X1,X2,X0)
| number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| on_path(sK7(X0),X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f119,plain,
! [X2,X0,X1] :
( ~ path(X1,X2,X0)
| number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| on_path(sK6(X0),X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f120,plain,
! [X2,X0,X1,X5] :
( ~ triangle(sK6(X0),sK7(X0),X5)
| ~ path(X1,X2,X0)
| number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0) ),
inference(cnf_transformation,[],[f66]) ).
fof(f121,plain,
! [X0,X1] : less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph)),
inference(cnf_transformation,[],[f17]) ).
fof(f122,plain,
! [X2,X3,X0,X1,X4] :
( tail_of(X2) = head_of(sK8(X2,X3))
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ complete ),
inference(cnf_transformation,[],[f67]) ).
fof(f123,plain,
! [X2,X3,X0,X1,X4] :
( head_of(X3) = tail_of(sK8(X2,X3))
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ complete ),
inference(cnf_transformation,[],[f67]) ).
fof(f124,plain,
! [X2,X3,X0,X1,X4] :
( edge(sK8(X2,X3))
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ complete ),
inference(cnf_transformation,[],[f67]) ).
fof(f125,plain,
complete,
inference(cnf_transformation,[],[f68]) ).
fof(f126,plain,
shortest_path(sK10,sK11,sK9),
inference(cnf_transformation,[],[f68]) ).
fof(f127,plain,
~ less_or_equal(minus(length_of(sK9),n1),number_of_in(triangles,graph)),
inference(cnf_transformation,[],[f68]) ).
fof(f135,plain,
path(sK10,sK11,sK9),
inference(unit_resulting_resolution,[],[f109,f126]) ).
fof(f150,plain,
! [X0] :
( ~ on_path(X0,sK9)
| edge(X0) ),
inference(resolution,[],[f91,f135]) ).
fof(f152,plain,
length_of(sK9) = number_of_in(edges,sK9),
inference(unit_resulting_resolution,[],[f115,f135]) ).
fof(f154,plain,
~ less_or_equal(minus(number_of_in(edges,sK9),n1),number_of_in(triangles,graph)),
inference(superposition,[],[f127,f152]) ).
fof(f437,plain,
minus(length_of(sK9),n1) = number_of_in(sequential_pairs,sK9),
inference(resolution,[],[f116,f135]) ).
fof(f438,plain,
minus(number_of_in(edges,sK9),n1) = number_of_in(sequential_pairs,sK9),
inference(forward_demodulation,[],[f437,f152]) ).
fof(f440,plain,
~ less_or_equal(number_of_in(sequential_pairs,sK9),number_of_in(triangles,graph)),
inference(superposition,[],[f154,f438]) ).
fof(f561,plain,
! [X2,X3,X0,X1,X4] :
( ~ shortest_path(X0,X1,X4)
| edge(sK8(X2,X3))
| ~ precedes(X2,X3,X4) ),
inference(forward_subsumption_resolution,[],[f124,f125]) ).
fof(f562,plain,
! [X0,X1] :
( ~ precedes(X0,X1,sK9)
| edge(sK8(X0,X1)) ),
inference(resolution,[],[f561,f126]) ).
fof(f947,plain,
( number_of_in(sequential_pairs,sK9) = number_of_in(triangles,sK9)
| on_path(sK7(sK9),sK9) ),
inference(resolution,[],[f118,f135]) ).
fof(f949,definition,
( spl12_3
<=> on_path(sK7(sK9),sK9) ),
introduced(definition,[new_symbols(definition,[spl12_3])],[avatar_definition]) ).
fof(f951,plain,
( on_path(sK7(sK9),sK9)
| ~ spl12_3 ),
inference(avatar_component_clause,[],[f949]) ).
fof(f953,definition,
( spl12_4
<=> number_of_in(sequential_pairs,sK9) = number_of_in(triangles,sK9) ),
introduced(definition,[new_symbols(definition,[spl12_4])],[avatar_definition]) ).
fof(f954,plain,
( number_of_in(sequential_pairs,sK9) != number_of_in(triangles,sK9)
| spl12_4 ),
inference(avatar_component_clause,[],[f953]) ).
fof(f955,plain,
( number_of_in(sequential_pairs,sK9) = number_of_in(triangles,sK9)
| ~ spl12_4 ),
inference(avatar_component_clause,[],[f953]) ).
fof(f956,plain,
( spl12_3
| spl12_4 ),
inference(avatar_split_clause,[],[f947,f953,f949]) ).
fof(f957,plain,
( edge(sK7(sK9))
| ~ spl12_3 ),
inference(unit_resulting_resolution,[],[f150,f951]) ).
fof(f1642,plain,
( tail_of(sK7(sK9)) != head_of(sK7(sK9))
| ~ spl12_3 ),
inference(unit_resulting_resolution,[],[f69,f957]) ).
fof(f3080,plain,
( number_of_in(sequential_pairs,sK9) = number_of_in(triangles,sK9)
| on_path(sK6(sK9),sK9) ),
inference(resolution,[],[f119,f135]) ).
fof(f5841,plain,
! [X2,X3,X0,X1,X4] :
( ~ shortest_path(X0,X1,X4)
| tail_of(X2) = head_of(sK8(X2,X3))
| ~ precedes(X2,X3,X4) ),
inference(forward_subsumption_resolution,[],[f122,f125]) ).
fof(f5843,definition,
( spl12_5
<=> on_path(sK6(sK9),sK9) ),
introduced(definition,[new_symbols(definition,[spl12_5])],[avatar_definition]) ).
fof(f5845,plain,
( on_path(sK6(sK9),sK9)
| ~ spl12_5 ),
inference(avatar_component_clause,[],[f5843]) ).
fof(f5846,plain,
( spl12_5
| spl12_4 ),
inference(avatar_split_clause,[],[f3080,f953,f5843]) ).
fof(f5847,plain,
( less_or_equal(number_of_in(sequential_pairs,sK9),number_of_in(triangles,graph))
| ~ spl12_4 ),
inference(superposition,[],[f121,f955]) ).
fof(f5848,plain,
( $false
| ~ spl12_4 ),
inference(forward_subsumption_resolution,[],[f5847,f440]) ).
fof(f5849,plain,
~ spl12_4,
inference(avatar_contradiction_clause,[],[f5848]) ).
fof(f5850,plain,
( edge(sK6(sK9))
| ~ spl12_5 ),
inference(unit_resulting_resolution,[],[f150,f5845]) ).
fof(f6562,plain,
! [X0,X1] :
( ~ precedes(X0,X1,sK9)
| tail_of(X0) = head_of(sK8(X0,X1)) ),
inference(resolution,[],[f5841,f126]) ).
fof(f7996,plain,
! [X2,X3,X0,X1,X4] :
( ~ shortest_path(X0,X1,X4)
| head_of(X3) = tail_of(sK8(X2,X3))
| ~ precedes(X2,X3,X4) ),
inference(forward_subsumption_resolution,[],[f123,f125]) ).
fof(f10737,plain,
! [X0,X1] :
( ~ precedes(X1,X0,sK9)
| head_of(X0) = tail_of(sK8(X1,X0)) ),
inference(resolution,[],[f7996,f126]) ).
fof(f10854,plain,
( sequential(sK6(sK9),sK7(sK9))
| spl12_4 ),
inference(unit_resulting_resolution,[],[f117,f135,f954]) ).
fof(f11210,plain,
( precedes(sK6(sK9),sK7(sK9),sK9)
| ~ spl12_3
| spl12_4
| ~ spl12_5 ),
inference(unit_resulting_resolution,[],[f101,f951,f10854,f5845,f135]) ).
fof(f11215,plain,
( head_of(sK7(sK9)) = tail_of(sK8(sK6(sK9),sK7(sK9)))
| ~ spl12_3
| spl12_4
| ~ spl12_5 ),
inference(unit_resulting_resolution,[],[f10737,f11210]) ).
fof(f11216,plain,
( tail_of(sK6(sK9)) = head_of(sK8(sK6(sK9),sK7(sK9)))
| ~ spl12_3
| spl12_4
| ~ spl12_5 ),
inference(unit_resulting_resolution,[],[f6562,f11210]) ).
fof(f11217,plain,
( edge(sK8(sK6(sK9),sK7(sK9)))
| ~ spl12_3
| spl12_4
| ~ spl12_5 ),
inference(unit_resulting_resolution,[],[f562,f11210]) ).
fof(f11244,plain,
( ! [X0] :
( head_of(X0) != head_of(sK7(sK9))
| ~ edge(X0)
| ~ edge(sK8(sK6(sK9),sK7(sK9)))
| sK8(sK6(sK9),sK7(sK9)) = X0
| sequential(X0,sK8(sK6(sK9),sK7(sK9))) )
| ~ spl12_3
| spl12_4
| ~ spl12_5 ),
inference(superposition,[],[f99,f11215]) ).
fof(f11247,plain,
( head_of(sK7(sK9)) != head_of(sK8(sK6(sK9),sK7(sK9)))
| ~ edge(sK8(sK6(sK9),sK7(sK9)))
| ~ spl12_3
| spl12_4
| ~ spl12_5 ),
inference(superposition,[],[f69,f11215]) ).
fof(f11248,plain,
( head_of(sK7(sK9)) != head_of(sK8(sK6(sK9),sK7(sK9)))
| ~ spl12_3
| spl12_4
| ~ spl12_5 ),
inference(forward_subsumption_resolution,[],[f11247,f11217]) ).
fof(f11249,plain,
( ! [X0] :
( head_of(X0) != head_of(sK7(sK9))
| ~ edge(X0)
| sK8(sK6(sK9),sK7(sK9)) = X0
| sequential(X0,sK8(sK6(sK9),sK7(sK9))) )
| ~ spl12_3
| spl12_4
| ~ spl12_5 ),
inference(forward_subsumption_resolution,[],[f11244,f11217]) ).
fof(f11257,plain,
( head_of(sK7(sK9)) != tail_of(sK6(sK9))
| ~ spl12_3
| spl12_4
| ~ spl12_5 ),
inference(forward_demodulation,[],[f11248,f11216]) ).
fof(f18161,plain,
( ! [X0] : ~ triangle(sK6(sK9),sK7(sK9),X0)
| spl12_4 ),
inference(unit_resulting_resolution,[],[f120,f135,f954]) ).
fof(f20133,plain,
! [X2,X0,X1] :
( triangle(X0,X1,X2)
| ~ edge(X0)
| ~ edge(X2)
| ~ sequential(X0,X1)
| ~ sequential(X1,X2)
| ~ sequential(X2,X0) ),
inference(forward_subsumption_resolution,[],[f114,f97]) ).
fof(f20134,plain,
! [X2,X0,X1] :
( triangle(X0,X1,X2)
| ~ edge(X0)
| ~ sequential(X0,X1)
| ~ sequential(X1,X2)
| ~ sequential(X2,X0) ),
inference(forward_subsumption_resolution,[],[f20133,f97]) ).
fof(f20135,plain,
! [X2,X0,X1] :
( triangle(X0,X1,X2)
| ~ sequential(X0,X1)
| ~ sequential(X1,X2)
| ~ sequential(X2,X0) ),
inference(forward_subsumption_resolution,[],[f20134,f97]) ).
fof(f20137,plain,
( ! [X0] :
( ~ sequential(sK6(sK9),sK7(sK9))
| ~ sequential(sK7(sK9),X0)
| ~ sequential(X0,sK6(sK9)) )
| spl12_4 ),
inference(resolution,[],[f20135,f18161]) ).
fof(f20138,plain,
( ! [X0] :
( ~ sequential(sK7(sK9),X0)
| ~ sequential(X0,sK6(sK9)) )
| spl12_4 ),
inference(forward_subsumption_resolution,[],[f20137,f10854]) ).
fof(f133665,plain,
( ~ edge(sK7(sK9))
| sK7(sK9) = sK8(sK6(sK9),sK7(sK9))
| sequential(sK7(sK9),sK8(sK6(sK9),sK7(sK9)))
| ~ spl12_3
| spl12_4
| ~ spl12_5 ),
inference(equality_resolution,[],[f11249]) ).
fof(f133666,plain,
( sK7(sK9) = sK8(sK6(sK9),sK7(sK9))
| sequential(sK7(sK9),sK8(sK6(sK9),sK7(sK9)))
| ~ spl12_3
| spl12_4
| ~ spl12_5 ),
inference(forward_subsumption_resolution,[],[f133665,f957]) ).
fof(f133668,definition,
( spl12_364
<=> sequential(sK7(sK9),sK8(sK6(sK9),sK7(sK9))) ),
introduced(definition,[new_symbols(definition,[spl12_364])],[avatar_definition]) ).
fof(f133670,plain,
( sequential(sK7(sK9),sK8(sK6(sK9),sK7(sK9)))
| ~ spl12_364 ),
inference(avatar_component_clause,[],[f133668]) ).
fof(f133672,definition,
( spl12_365
<=> sK7(sK9) = sK8(sK6(sK9),sK7(sK9)) ),
introduced(definition,[new_symbols(definition,[spl12_365])],[avatar_definition]) ).
fof(f133674,plain,
( sK7(sK9) = sK8(sK6(sK9),sK7(sK9))
| ~ spl12_365 ),
inference(avatar_component_clause,[],[f133672]) ).
fof(f133675,plain,
( spl12_364
| spl12_365
| ~ spl12_3
| spl12_4
| ~ spl12_5 ),
inference(avatar_split_clause,[],[f133666,f5843,f953,f949,f133672,f133668]) ).
fof(f133676,plain,
( ~ sequential(sK8(sK6(sK9),sK7(sK9)),sK6(sK9))
| spl12_4
| ~ spl12_364 ),
inference(unit_resulting_resolution,[],[f20138,f133670]) ).
fof(f133717,plain,
( sK6(sK9) = sK8(sK6(sK9),sK7(sK9))
| ~ spl12_3
| spl12_4
| ~ spl12_5
| ~ spl12_364 ),
inference(unit_resulting_resolution,[],[f99,f5850,f11217,f11216,f133676]) ).
fof(f133718,plain,
( head_of(sK7(sK9)) = tail_of(sK6(sK9))
| ~ spl12_3
| spl12_4
| ~ spl12_5
| ~ spl12_364 ),
inference(superposition,[],[f11215,f133717]) ).
fof(f133825,plain,
( $false
| ~ spl12_3
| spl12_4
| ~ spl12_5
| ~ spl12_364 ),
inference(forward_subsumption_resolution,[],[f133718,f11257]) ).
fof(f133826,plain,
( ~ spl12_3
| spl12_4
| ~ spl12_5
| ~ spl12_364 ),
inference(avatar_contradiction_clause,[],[f133825]) ).
fof(f133832,plain,
( tail_of(sK7(sK9)) = head_of(sK7(sK9))
| ~ spl12_3
| spl12_4
| ~ spl12_5
| ~ spl12_365 ),
inference(superposition,[],[f11215,f133674]) ).
fof(f133936,plain,
( $false
| ~ spl12_3
| spl12_4
| ~ spl12_5
| ~ spl12_365 ),
inference(forward_subsumption_resolution,[],[f133832,f1642]) ).
fof(f133937,plain,
( ~ spl12_3
| spl12_4
| ~ spl12_5
| ~ spl12_365 ),
inference(avatar_contradiction_clause,[],[f133936]) ).
cnf(s2,plain,
( spl12_3
| spl12_4 ),
inference(sat_conversion,[],[f956]) ).
cnf(s3,plain,
( spl12_4
| spl12_5 ),
inference(sat_conversion,[],[f5846]) ).
cnf(s4,plain,
~ spl12_4,
inference(sat_conversion,[],[f5849]) ).
cnf(s273,plain,
( ~ spl12_3
| spl12_4
| ~ spl12_5
| spl12_364
| spl12_365 ),
inference(sat_conversion,[],[f133675]) ).
cnf(s276,plain,
( ~ spl12_3
| spl12_4
| ~ spl12_5
| ~ spl12_364 ),
inference(sat_conversion,[],[f133826]) ).
cnf(s278,plain,
( ~ spl12_3
| spl12_4
| ~ spl12_5
| ~ spl12_365 ),
inference(sat_conversion,[],[f133937]) ).
cnf(s288,plain,
spl12_5,
inference(rat,[],[s3,s4]) ).
cnf(s289,plain,
spl12_3,
inference(rat,[],[s2,s4]) ).
cnf(s290,plain,
~ spl12_365,
inference(rat,[],[s278,s288,s4,s289]) ).
cnf(s291,plain,
~ spl12_364,
inference(rat,[],[s276,s288,s4,s289]) ).
cnf(s292,plain,
$false,
inference(rat,[],[s273,s290,s288,s4,s291,s289]) ).
fof(f133938,plain,
$false,
inference(avatar_sat_refutation,[],[s292]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRA002+2 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Sun Sep 27 08:45:34 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.03/0.32 Running first-order model finding
% 0.03/0.32 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
% 14.51/2.45 % (2071818)Will run a generic schedule for satisfiability detection.
% 14.51/2.45 % (2071824)% WARNING: option uhcvi not known.
% 14.51/2.45 % (2071824)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3350075965:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 14.51/2.45 % (2071823)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=400710552_2999 on theBenchmark for (2999ds/0Mi)
% 14.51/2.45 % (2071825)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1416150843:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 14.51/2.45 % (2071826)dis+10_1_sil=32000:sp=arity:random_seed=461617117:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 14.51/2.45 % (2071827)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3750972562:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 14.51/2.45 % (2071828)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3416324998:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 14.51/2.45 % (2071829)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1320916509:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 14.51/2.45 % TRYING [1]
% 14.51/2.45 % TRYING [2]
% 14.51/2.45 % TRYING [3]
% 14.51/2.45 % (2071826)Instruction limit reached!
% 14.51/2.45 % (2071826)------------------------------
% 14.51/2.45 % (2071826)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.51/2.45 % (2071826)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.51/2.45 % (2071826)CaDiCaL version: 2.1.3
% 14.51/2.45 % (2071826)Termination reason: Instruction limit
% 14.51/2.45 % (2071826)Termination phase: Saturation
% 14.51/2.45 % (2071826)Time elapsed: 0.037 s
% 14.51/2.45 % (2071826)Peak memory usage: 12 MB
% 14.51/2.45 % (2071826)Instructions burned: 104 (million)
% 14.51/2.45 % (2071827)Instruction limit reached!
% 14.51/2.45 % (2071827)------------------------------
% 14.51/2.45 % (2071827)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.51/2.45 % (2071827)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.51/2.45 % (2071827)CaDiCaL version: 2.1.3
% 14.51/2.45 % (2071827)Termination reason: Instruction limit
% 14.51/2.45 % (2071827)Termination phase: Saturation
% 14.51/2.45 % (2071827)Time elapsed: 0.037 s
% 14.51/2.45 % (2071827)Peak memory usage: 12 MB
% 14.51/2.45 % (2071827)Instructions burned: 119 (million)
% 14.51/2.45 % (2071828)Instruction limit reached!
% 14.51/2.45 % (2071828)------------------------------
% 14.51/2.45 % (2071828)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.51/2.45 % (2071828)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.51/2.45 % (2071828)CaDiCaL version: 2.1.3
% 14.51/2.45 % (2071828)Termination reason: Instruction limit
% 14.51/2.45 % (2071828)Termination phase: Saturation
% 14.51/2.45 % (2071828)Time elapsed: 0.040 s
% 14.51/2.45 % (2071828)Peak memory usage: 12 MB
% 14.51/2.45 % (2071828)Instructions burned: 133 (million)
% 14.51/2.45 % (2071838)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1842288220:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 14.51/2.45 % (2071837)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3882914373:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 14.51/2.45 % (2071839)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=470303642:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 14.51/2.45 % TRYING [1]
% 14.51/2.45 % TRYING [2]
% 14.51/2.45 % (2071829)Instruction limit reached!
% 14.51/2.45 % (2071829)------------------------------
% 14.51/2.45 % (2071829)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.51/2.45 % (2071829)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.51/2.45 % (2071829)CaDiCaL version: 2.1.3
% 14.51/2.45 % (2071829)Termination reason: Instruction limit
% 14.51/2.45 % (2071829)Termination phase: Saturation
% 14.51/2.45 % (2071829)Time elapsed: 0.054 s
% 14.51/2.45 % (2071829)Peak memory usage: 14 MB
% 14.51/2.45 % (2071829)Instructions burned: 159 (million)
% 14.51/2.45 % TRYING [4]
% 14.51/2.45 % TRYING [3]
% 14.51/2.45 % (2071843)ott-21_1_sil=16000:fs=off:random_seed=3383582201:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 14.51/2.45 % (2071838)Instruction limit reached!
% 14.51/2.45 % (2071838)------------------------------
% 14.51/2.45 % (2071838)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 14.51/2.45 % (2071838)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 29.89/4.60 % (2071838)CaDiCaL version: 2.1.3
% 29.89/4.60 % (2071838)Termination reason: Instruction limit
% 29.89/4.60 % (2071838)Termination phase: Saturation
% 29.89/4.60 % (2071838)Time elapsed: 0.045 s
% 29.89/4.60 % (2071838)Peak memory usage: 12 MB
% 29.89/4.60 % (2071838)Instructions burned: 131 (million)
% 29.89/4.60 % TRYING [4]
% 29.89/4.60 % (2071845)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=798728226:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 29.89/4.60 % (2071843)Instruction limit reached!
% 29.89/4.60 % (2071843)------------------------------
% 29.89/4.60 % (2071843)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 29.89/4.60 % (2071843)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 29.89/4.60 % (2071843)CaDiCaL version: 2.1.3
% 29.89/4.60 % (2071843)Termination reason: Instruction limit
% 29.89/4.60 % (2071843)Termination phase: Saturation
% 29.89/4.60 % (2071843)Time elapsed: 0.052 s
% 29.89/4.60 % (2071843)Peak memory usage: 12 MB
% 29.89/4.60 % (2071843)Instructions burned: 182 (million)
% 29.89/4.60 % (2071847)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3439129255:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 29.89/4.60 % TRYING [1]
% 29.89/4.60 % TRYING [2]
% 29.89/4.60 % TRYING [3]
% 29.89/4.60 % TRYING [4]
% 29.89/4.60 % (2071839)Instruction limit reached!
% 29.89/4.60 % (2071839)------------------------------
% 29.89/4.60 % (2071839)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 29.89/4.60 % (2071839)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 29.89/4.60 % (2071839)CaDiCaL version: 2.1.3
% 29.89/4.60 % (2071839)Termination reason: Instruction limit
% 29.89/4.60 % (2071839)Termination phase: Saturation
% 29.89/4.60 % (2071839)Time elapsed: 0.194 s
% 29.89/4.60 % (2071839)Peak memory usage: 19 MB
% 29.89/4.60 % (2071839)Instructions burned: 685 (million)
% 29.89/4.60 % (2071837)Instruction limit reached!
% 29.89/4.60 % (2071837)------------------------------
% 29.89/4.60 % (2071837)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 29.89/4.60 % (2071837)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 29.89/4.60 % (2071837)CaDiCaL version: 2.1.3
% 29.89/4.60 % (2071837)Termination reason: Instruction limit
% 29.89/4.60 % (2071837)Termination phase: Finite model building SAT solving
% 29.89/4.60 % (2071837)Time elapsed: 0.204 s
% 29.89/4.60 % (2071837)Peak memory usage: 16 MB
% 29.89/4.60 % (2071837)Instructions burned: 715 (million)
% 29.89/4.60 % (2071849)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1997254444:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 29.89/4.60 % (2071850)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1973428648:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 29.89/4.60 % (2071845)Instruction limit reached!
% 29.89/4.60 % (2071845)------------------------------
% 29.89/4.60 % (2071845)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 29.89/4.60 % (2071845)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 29.89/4.60 % (2071845)CaDiCaL version: 2.1.3
% 29.89/4.60 % (2071845)Termination reason: Instruction limit
% 29.89/4.60 % (2071845)Termination phase: Saturation
% 29.89/4.60 % (2071845)Time elapsed: 0.180 s
% 29.89/4.60 % (2071845)Peak memory usage: 14 MB
% 29.89/4.60 % (2071845)Instructions burned: 477 (million)
% 29.89/4.60 % (2071853)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=3208762972: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)
% 29.89/4.60 % TRYING [14]
% 29.89/4.60 % (2071847)Instruction limit reached!
% 29.89/4.60 % (2071847)------------------------------
% 29.89/4.60 % (2071847)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 29.89/4.60 % (2071847)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 29.89/4.60 % (2071847)CaDiCaL version: 2.1.3
% 29.89/4.60 % (2071847)Termination reason: Instruction limit
% 29.89/4.60 % (2071847)Termination phase: Finite model building SAT solving
% 29.89/4.60 % (2071847)Time elapsed: 0.245 s
% 29.89/4.60 % (2071847)Peak memory usage: 15 MB
% 29.89/4.60 % (2071847)Instructions burned: 866 (million)
% 29.89/4.60 % (2071855)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=480377199:i=879:kws=inv_precedence:fsr=off_2996 on theBenchmark for (2996ds/879Mi)
% 29.89/4.60 % TRYING [5]
% 29.89/4.60 % (2071850)Instruction limit reached!
% 29.89/4.60 % (2071850)------------------------------
% 68.22/10.10 % (2071850)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.22/10.10 % (2071850)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.22/10.10 % (2071850)CaDiCaL version: 2.1.3
% 68.22/10.10 % (2071850)Termination reason: Instruction limit
% 68.22/10.10 % (2071850)Termination phase: Finite model building constraint generation
% 68.22/10.10 % (2071850)Time elapsed: 0.184 s
% 68.22/10.10 % (2071850)Peak memory usage: 71 MB
% 68.22/10.10 % (2071850)Instructions burned: 892 (million)
% 68.22/10.10 % (2071857)fmb+10_1_sil=64000:random_seed=2404510718:i=22061:nm=2:gsp=on_2995 on theBenchmark for (2995ds/22061Mi)
% 68.22/10.10 % TRYING [1]
% 68.22/10.10 % TRYING [2]
% 68.22/10.10 % TRYING [3]
% 68.22/10.10 % (2071853)Instruction limit reached!
% 68.22/10.10 % (2071853)------------------------------
% 68.22/10.10 % (2071853)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.22/10.10 % (2071853)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.22/10.10 % (2071853)CaDiCaL version: 2.1.3
% 68.22/10.10 % (2071853)Termination reason: Instruction limit
% 68.22/10.10 % (2071853)Termination phase: Saturation
% 68.22/10.10 % (2071853)Time elapsed: 0.191 s
% 68.22/10.10 % (2071853)Peak memory usage: 19 MB
% 68.22/10.10 % (2071853)Instructions burned: 694 (million)
% 68.22/10.10 % TRYING [4]
% 68.22/10.10 % (2071859)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2308646500:i=9515:nm=5_2994 on theBenchmark for (2994ds/9515Mi)
% 68.22/10.10 % TRYING [20]
% 68.22/10.10 % TRYING [5]
% 68.22/10.10 % (2071849)Instruction limit reached!
% 68.22/10.10 % (2071849)------------------------------
% 68.22/10.10 % (2071849)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.22/10.10 % (2071849)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.22/10.10 % (2071849)CaDiCaL version: 2.1.3
% 68.22/10.10 % (2071849)Termination reason: Instruction limit
% 68.22/10.10 % (2071849)Termination phase: Saturation
% 68.22/10.10 % (2071849)Time elapsed: 0.345 s
% 68.22/10.10 % (2071849)Peak memory usage: 20 MB
% 68.22/10.10 % (2071849)Instructions burned: 1182 (million)
% 68.22/10.10 % (2071861)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3140709662:fmbsr=1.7:i=920_2993 on theBenchmark for (2993ds/920Mi)
% 68.22/10.10 % TRYING [8]
% 68.22/10.10 % (2071855)Instruction limit reached!
% 68.22/10.10 % (2071855)------------------------------
% 68.22/10.10 % (2071855)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.22/10.10 % (2071855)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.22/10.10 % (2071855)CaDiCaL version: 2.1.3
% 68.22/10.10 % (2071855)Termination reason: Instruction limit
% 68.22/10.10 % (2071855)Termination phase: Saturation
% 68.22/10.10 % (2071855)Time elapsed: 0.278 s
% 68.22/10.10 % (2071855)Peak memory usage: 17 MB
% 68.22/10.10 % (2071855)Instructions burned: 879 (million)
% 68.22/10.10 % (2071863)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2479996952:i=5131_2993 on theBenchmark for (2993ds/5131Mi)
% 68.22/10.10 % (2071861)Instruction limit reached!
% 68.22/10.10 % (2071861)------------------------------
% 68.22/10.10 % (2071861)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.22/10.10 % (2071861)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.22/10.10 % (2071861)CaDiCaL version: 2.1.3
% 68.22/10.10 % (2071861)Termination reason: Instruction limit
% 68.22/10.10 % (2071861)Termination phase: Finite model building constraint generation
% 68.22/10.10 % (2071861)Time elapsed: 0.199 s
% 68.22/10.10 % (2071861)Peak memory usage: 64 MB
% 68.22/10.10 % (2071861)Instructions burned: 921 (million)
% 68.22/10.10 % (2071865)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=1217438399:i=1472:ins=7:fdi=8:gsp=on_2991 on theBenchmark for (2991ds/1472Mi)
% 68.22/10.10 % (2071865)Instruction limit reached!
% 68.22/10.10 % (2071865)------------------------------
% 68.22/10.10 % (2071865)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 68.22/10.10 % (2071865)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 68.22/10.10 % (2071865)CaDiCaL version: 2.1.3
% 68.22/10.10 % (2071865)Termination reason: Instruction limit
% 68.22/10.10 % (2071865)Termination phase: Saturation
% 68.22/10.10 % (2071865)Time elapsed: 0.416 s
% 68.22/10.10 % (2071865)Peak memory usage: 26 MB
% 68.22/10.10 % (2071865)Instructions burned: 1475 (million)
% 68.22/10.10 % (2071867)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1367990788:i=6324_2987 on theBenchmark for (2987ds/6324Mi)
% 68.22/10.10 % TRYING [77]
% 68.22/10.10 % TRYING [6]
% 68.22/10.10 % (2071863)Instruction limit reached!
% 68.22/10.10 % (2071863)------------------------------
% 26.31/10.14 % (2071863)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.31/10.14 % (2071863)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.31/10.14 % (2071863)CaDiCaL version: 2.1.3
% 26.31/10.14 % (2071863)Termination reason: Instruction limit
% 26.31/10.14 % (2071863)Termination phase: Saturation
% 26.31/10.14 % (2071863)Time elapsed: 1.426 s
% 26.31/10.14 % (2071863)Peak memory usage: 24 MB
% 26.31/10.14 % (2071863)Instructions burned: 5132 (million)
% 26.31/10.14 % (2071869)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=3304257576:fmbsr=2.30978:i=2174_2978 on theBenchmark for (2978ds/2174Mi)
% 26.31/10.14 % TRYING [16]
% 26.31/10.14 % TRYING [6]
% 26.31/10.14 % (2071869)Instruction limit reached!
% 26.31/10.14 % (2071869)------------------------------
% 26.31/10.14 % (2071869)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.31/10.14 % (2071869)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.31/10.14 % (2071869)CaDiCaL version: 2.1.3
% 26.31/10.14 % (2071869)Termination reason: Instruction limit
% 26.31/10.14 % (2071869)Termination phase: Finite model building constraint generation
% 26.31/10.14 % (2071869)Time elapsed: 0.402 s
% 26.31/10.14 % (2071869)Peak memory usage: 125 MB
% 26.31/10.14 % (2071869)Instructions burned: 2179 (million)
% 26.31/10.14 % (2071871)ott-2_1_sil=16000:newcnf=on:random_seed=1051816189:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2974 on theBenchmark for (2974ds/869Mi)
% 26.31/10.14 % (2071867)Instruction limit reached!
% 26.31/10.14 % (2071867)------------------------------
% 26.31/10.14 % (2071867)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.31/10.14 % (2071867)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.31/10.14 % (2071867)CaDiCaL version: 2.1.3
% 26.31/10.14 % (2071867)Termination reason: Instruction limit
% 26.31/10.14 % (2071867)Termination phase: Finite model building constraint generation
% 26.31/10.14 % (2071867)Time elapsed: 1.284 s
% 26.31/10.14 % (2071867)Peak memory usage: 460 MB
% 26.31/10.14 % (2071867)Instructions burned: 6326 (million)
% 26.31/10.14 % (2071873)ott+10_1_sil=32000:tgt=ground:random_seed=2839100448:i=5114:av=off_2974 on theBenchmark for (2974ds/5114Mi)
% 26.31/10.14 % (2071871)Instruction limit reached!
% 26.31/10.14 % (2071871)------------------------------
% 26.31/10.14 % (2071871)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.31/10.14 % (2071871)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.31/10.14 % (2071871)CaDiCaL version: 2.1.3
% 26.31/10.14 % (2071871)Termination reason: Instruction limit
% 26.31/10.14 % (2071871)Termination phase: Saturation
% 26.31/10.14 % (2071871)Time elapsed: 0.256 s
% 26.31/10.14 % (2071871)Peak memory usage: 17 MB
% 26.31/10.14 % (2071871)Instructions burned: 872 (million)
% 26.31/10.14 % (2071875)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=3098571424:i=54282_2971 on theBenchmark for (2971ds/54282Mi)
% 26.31/10.14 % TRYING [1]
% 26.31/10.14 % TRYING [2]
% 26.31/10.14 % TRYING [3]
% 26.31/10.14 % TRYING [4]
% 26.31/10.14 % (2071859)Instruction limit reached!
% 26.31/10.14 % (2071859)------------------------------
% 26.31/10.14 % (2071859)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.31/10.14 % (2071859)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.31/10.14 % (2071859)CaDiCaL version: 2.1.3
% 26.31/10.14 % (2071859)Termination reason: Instruction limit
% 26.31/10.14 % (2071859)Termination phase: Finite model building constraint generation
% 26.31/10.14 % (2071859)Time elapsed: 2.647 s
% 26.31/10.14 % (2071859)Peak memory usage: 853 MB
% 26.31/10.14 % (2071859)Instructions burned: 9516 (million)
% 26.31/10.14 % (2071877)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=810723864:i=3512:aac=none_2967 on theBenchmark for (2967ds/3512Mi)
% 26.31/10.14 % TRYING [5]
% 26.31/10.14 % (2071873)Instruction limit reached!
% 26.31/10.14 % (2071873)------------------------------
% 26.31/10.14 % (2071873)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.31/10.14 % (2071873)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.31/10.14 % (2071873)CaDiCaL version: 2.1.3
% 26.31/10.14 % (2071873)Termination reason: Instruction limit
% 26.31/10.14 % (2071873)Termination phase: Saturation
% 26.31/10.14 % (2071873)Time elapsed: 1.512 s
% 26.31/10.14 % (2071873)Peak memory usage: 42 MB
% 26.31/10.14 % (2071873)Instructions burned: 5116 (million)
% 26.31/10.14 % (2071880)dis+21_1_sil=32000:sas=cadical:random_seed=2513182657:i=3773:amm=off_2958 on theBenchmark for (2958ds/3773Mi)
% 26.31/10.14 % (2071877)Instruction limit reached!
% 26.31/10.14 % (2071877)------------------------------
% 26.31/10.14 % (2071877)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.31/10.14 % (2071877)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.31/10.14 % (2071877)CaDiCaL version: 2.1.3
% 26.31/10.14 % (2071877)Termination reason: Instruction limit
% 26.31/10.14 % (2071877)Termination phase: Saturation
% 26.31/10.14 % (2071877)Time elapsed: 1.041 s
% 26.31/10.14 % (2071877)Peak memory usage: 28 MB
% 26.31/10.14 % (2071877)Instructions burned: 3513 (million)
% 26.31/10.14 % (2071882)ott+11_1_sil=16000:gs=on:random_seed=798796604:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2957 on theBenchmark for (2957ds/2251Mi)
% 26.31/10.14 % (2071882)Instruction limit reached!
% 26.31/10.14 % (2071882)------------------------------
% 26.31/10.14 % (2071882)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.31/10.14 % (2071882)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.31/10.14 % (2071882)CaDiCaL version: 2.1.3
% 26.31/10.14 % (2071882)Termination reason: Instruction limit
% 26.31/10.14 % (2071882)Termination phase: Saturation
% 26.31/10.14 % (2071882)Time elapsed: 0.666 s
% 26.31/10.14 % (2071882)Peak memory usage: 31 MB
% 26.31/10.14 % (2071882)Instructions burned: 2252 (million)
% 26.31/10.14 % (2071884)fmb+10_1_fmbas=predicate:sil=64000:tgt=ground:fmbss=7:random_seed=1598494551:fmbsr=1.6:i=67534_2950 on theBenchmark for (2950ds/67534Mi)
% 26.31/10.14 % TRYING [7]
% 26.31/10.14 % (2071880)Instruction limit reached!
% 26.31/10.14 % (2071880)------------------------------
% 26.31/10.14 % (2071880)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.31/10.14 % (2071880)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.31/10.14 % (2071880)CaDiCaL version: 2.1.3
% 26.31/10.14 % (2071880)Termination reason: Instruction limit
% 26.31/10.14 % (2071880)Termination phase: Saturation
% 26.31/10.14 % (2071880)Time elapsed: 1.052 s
% 26.31/10.14 % (2071880)Peak memory usage: 35 MB
% 26.31/10.14 % (2071880)Instructions burned: 3775 (million)
% 26.31/10.14 % (2071886)ott-22_32_sil=16000:tgt=full:fdtod=off:sp=weighted_frequency:rnwc=on:alpa=false:random_seed=2232101213:avsq=on:i=4591:add=off:avsqr=1,16:kws=inv_arity:nm=10:ins=9:fdi=4_2948 on theBenchmark for (2948ds/4591Mi)
% 26.31/10.14 % (2071886)Instruction limit reached!
% 26.31/10.14 % (2071886)------------------------------
% 26.31/10.14 % (2071886)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.31/10.14 % (2071886)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.31/10.14 % (2071886)CaDiCaL version: 2.1.3
% 26.31/10.14 % (2071886)Termination reason: Instruction limit
% 26.31/10.14 % (2071886)Termination phase: Saturation
% 26.31/10.14 % (2071886)Time elapsed: 1.049 s
% 26.31/10.14 % (2071886)Peak memory usage: 34 MB
% 26.31/10.14 % (2071886)Instructions burned: 4594 (million)
% 26.31/10.14 % (2071888)dis+10_64_to=lpo:sil=32000:spb=intro:urr=on:sac=on:random_seed=99765371:i=29340_2937 on theBenchmark for (2937ds/29340Mi)
% 26.31/10.14 % TRYING [6]
% 26.31/10.14 % (2071857)Instruction limit reached!
% 26.31/10.14 % (2071857)------------------------------
% 26.31/10.14 % (2071857)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.31/10.14 % (2071857)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.31/10.14 % (2071857)CaDiCaL version: 2.1.3
% 26.31/10.14 % (2071857)Termination reason: Instruction limit
% 26.31/10.14 % (2071857)Termination phase: Finite model building SAT solving
% 26.31/10.14 % (2071857)Time elapsed: 6.544 s
% 26.31/10.14 % (2071857)Peak memory usage: 31 MB
% 26.31/10.14 % (2071857)Instructions burned: 22063 (million)
% 26.31/10.14 % (2071890)dis-10_1_sil=64000:sas=cadical:cn=on:random_seed=2802348181:i=5211_2929 on theBenchmark for (2929ds/5211Mi)
% 26.31/10.14 % (2071890)Instruction limit reached!
% 26.31/10.14 % (2071890)------------------------------
% 26.31/10.14 % (2071890)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.31/10.14 % (2071890)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.31/10.14 % (2071890)CaDiCaL version: 2.1.3
% 26.31/10.14 % (2071890)Termination reason: Instruction limit
% 26.31/10.14 % (2071890)Termination phase: Saturation
% 26.31/10.14 % (2071890)Time elapsed: 1.467 s
% 26.31/10.14 % (2071890)Peak memory usage: 48 MB
% 26.31/10.14 % (2071890)Instructions burned: 5214 (million)
% 26.31/10.14 % (2071892)fmb+10_1_sil=32000:sas=cadical:bce=on:fmbss=17:random_seed=191609530:i=5497:nm=2_2914 on theBenchmark for (2914ds/5497Mi)
% 26.31/10.14 % TRYING [17]
% 26.31/10.14 % TRYING [7]
% 26.31/10.14 % (2071888) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2071818-2071888"...
% 26.31/10.14 % (2071888)...printing done.
% 26.31/10.14 % (2071888)Refutation found. Thanks to Tanya!
% 26.31/10.14 % SZS status Theorem for theBenchmark
% 26.31/10.14 % SZS output start Proof for theBenchmark
% See solution above
% 26.31/10.14 % (2071888)------------------------------
% 26.31/10.14 % (2071888)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 26.31/10.14 % (2071888)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 26.31/10.14 % (2071888)CaDiCaL version: 2.1.3
% 26.31/10.14 % (2071888)Termination reason: Refutation
% 26.31/10.14 % (2071888)Time elapsed: 3.512 s
% 26.31/10.14 % (2071888)Peak memory usage: 59 MB
% 26.31/10.14 % (2071888)Instructions burned: 13494 (million)
% 26.31/10.14 % (2071818)Success in time 9.816 s
% 26.31/10.14 % Vampire exiting
%------------------------------------------------------------------------------