%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRA002+3 : 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 : n011.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 0.18s 0.51s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of formulae : 90 ( 20 unt; 5 def)
% Number of atoms : 281 ( 34 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 317 ( 126 ~; 128 |; 43 &)
% ( 7 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 7 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 178 ( 0 sgn 163 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
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(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)
& sequential(X2,X3) )
=> ? [X5] : triangle(X2,X3,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_is_triangle) ).
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(f32,plain,
! [X0,X1,X2] :
( ! [X3,X4] :
( precedes(X3,X4,X0)
| ~ on_path(X3,X0)
| ~ on_path(X4,X0)
| ( ~ sequential(X3,X4)
& ! [X5] :
( ~ sequential(X3,X5)
| ~ precedes(X5,X4,X0) ) ) )
| ~ path(X1,X2,X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ! [X3,X4] :
( precedes(X3,X4,X0)
| ~ on_path(X3,X0)
| ~ on_path(X4,X0)
| ( ~ sequential(X3,X4)
& ! [X5] :
( ~ sequential(X3,X5)
| ~ precedes(X5,X4,X0) ) ) )
| ~ path(X1,X2,X0) ),
inference(flattening,[],[f32]) ).
fof(f35,plain,
! [X0,X1,X2] :
( shortest_path(X0,X1,X2)
<=> ( path(X0,X1,X2)
& X0 != X1
& ! [X3] :
( less_or_equal(length_of(X2),length_of(X3))
| ~ path(X0,X1,X3) ) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f38,plain,
! [X0,X1,X2] :
( length_of(X2) = number_of_in(edges,X2)
| ~ path(X0,X1,X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f39,plain,
! [X0,X1,X2] :
( number_of_in(sequential_pairs,X2) = minus(length_of(X2),n1)
| ~ path(X0,X1,X2) ),
inference(ennf_transformation,[],[f15]) ).
fof(f40,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(f41,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,[],[f40]) ).
fof(f42,plain,
( ! [X0,X1,X2,X3,X4] :
( ? [X5] : triangle(X2,X3,X5)
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ sequential(X2,X3) )
| ~ complete ),
inference(ennf_transformation,[],[f18]) ).
fof(f43,plain,
( ! [X0,X1,X2,X3,X4] :
( ? [X5] : triangle(X2,X3,X5)
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ sequential(X2,X3) )
| ~ complete ),
inference(flattening,[],[f42]) ).
fof(f44,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(f59,plain,
! [X0,X1,X2] :
( ( shortest_path(X0,X1,X2)
| ~ path(X0,X1,X2)
| X0 = X1
| ? [X3] :
( ~ less_or_equal(length_of(X2),length_of(X3))
& path(X0,X1,X3) ) )
& ( ( path(X0,X1,X2)
& X0 != X1
& ! [X3] :
( less_or_equal(length_of(X2),length_of(X3))
| ~ path(X0,X1,X3) ) )
| ~ shortest_path(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f60,plain,
! [X0,X1,X2] :
( ( shortest_path(X0,X1,X2)
| ~ path(X0,X1,X2)
| X0 = X1
| ? [X3] :
( ~ less_or_equal(length_of(X2),length_of(X3))
& path(X0,X1,X3) ) )
& ( ( path(X0,X1,X2)
& X0 != X1
& ! [X3] :
( less_or_equal(length_of(X2),length_of(X3))
| ~ path(X0,X1,X3) ) )
| ~ shortest_path(X0,X1,X2) ) ),
inference(flattening,[],[f59]) ).
fof(f61,plain,
! [X0,X1,X2] :
( ( shortest_path(X0,X1,X2)
| ~ path(X0,X1,X2)
| X0 = X1
| ? [X3] :
( ~ less_or_equal(length_of(X2),length_of(X3))
& path(X0,X1,X3) ) )
& ( ( path(X0,X1,X2)
& X0 != X1
& ! [X4] :
( less_or_equal(length_of(X2),length_of(X4))
| ~ path(X0,X1,X4) ) )
| ~ shortest_path(X0,X1,X2) ) ),
inference(rectify,[],[f60]) ).
fof(f62,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))],[f61]) ).
fof(f65,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))],[f41]) ).
fof(f66,plain,
( ! [X0,X1,X2,X3,X4] :
( triangle(X2,X3,sK8(X2,X3))
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ sequential(X2,X3) )
| ~ complete ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X5,sK8(X2,X3))],[f43]) ).
fof(f67,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)],[f44]) ).
fof(f100,plain,
! [X2,X3,X0,X1,X4] :
( ~ sequential(X3,X4)
| ~ on_path(X3,X0)
| ~ on_path(X4,X0)
| precedes(X3,X4,X0)
| ~ path(X1,X2,X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f108,plain,
! [X2,X0,X1] :
( ~ shortest_path(X0,X1,X2)
| path(X0,X1,X2) ),
inference(cnf_transformation,[],[f62]) ).
fof(f120,plain,
! [X2,X0,X1] :
( ~ path(X0,X1,X2)
| length_of(X2) = number_of_in(edges,X2) ),
inference(cnf_transformation,[],[f38]) ).
fof(f121,plain,
! [X2,X0,X1] :
( ~ path(X0,X1,X2)
| number_of_in(sequential_pairs,X2) = minus(length_of(X2),n1) ),
inference(cnf_transformation,[],[f39]) ).
fof(f122,plain,
! [X2,X0,X1] :
( ~ path(X1,X2,X0)
| number_of_in(sequential_pairs,X0) = number_of_in(triangles,X0)
| sequential(sK6(X0),sK7(X0)) ),
inference(cnf_transformation,[],[f65]) ).
fof(f123,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,[],[f65]) ).
fof(f124,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,[],[f65]) ).
fof(f125,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,[],[f65]) ).
fof(f126,plain,
! [X0,X1] : less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph)),
inference(cnf_transformation,[],[f17]) ).
fof(f127,plain,
! [X2,X3,X0,X1,X4] :
( triangle(X2,X3,sK8(X2,X3))
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| ~ sequential(X2,X3)
| ~ complete ),
inference(cnf_transformation,[],[f66]) ).
fof(f128,plain,
complete,
inference(cnf_transformation,[],[f67]) ).
fof(f129,plain,
shortest_path(sK10,sK11,sK9),
inference(cnf_transformation,[],[f67]) ).
fof(f130,plain,
~ less_or_equal(minus(length_of(sK9),n1),number_of_in(triangles,graph)),
inference(cnf_transformation,[],[f67]) ).
fof(f131,plain,
! [X2,X3,X0,X1,X4] :
( ~ sequential(X2,X3)
| ~ shortest_path(X0,X1,X4)
| ~ precedes(X2,X3,X4)
| triangle(X2,X3,sK8(X2,X3)) ),
inference(forward_subsumption_resolution,[],[f127,f128]) ).
fof(f141,plain,
path(sK10,sK11,sK9),
inference(resolution,[],[f108,f129]) ).
fof(f157,plain,
length_of(sK9) = number_of_in(edges,sK9),
inference(resolution,[],[f120,f141]) ).
fof(f162,plain,
~ less_or_equal(minus(number_of_in(edges,sK9),n1),number_of_in(triangles,graph)),
inference(superposition,[],[f130,f157]) ).
fof(f229,plain,
minus(length_of(sK9),n1) = number_of_in(sequential_pairs,sK9),
inference(resolution,[],[f121,f141]) ).
fof(f230,plain,
minus(number_of_in(edges,sK9),n1) = number_of_in(sequential_pairs,sK9),
inference(forward_demodulation,[],[f229,f157]) ).
fof(f254,plain,
( number_of_in(sequential_pairs,sK9) = number_of_in(triangles,sK9)
| on_path(sK7(sK9),sK9) ),
inference(resolution,[],[f123,f141]) ).
fof(f256,definition,
( spl12_7
<=> on_path(sK7(sK9),sK9) ),
introduced(definition,[new_symbols(definition,[spl12_7])],[avatar_definition]) ).
fof(f258,plain,
( on_path(sK7(sK9),sK9)
| ~ spl12_7 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f260,definition,
( spl12_8
<=> number_of_in(sequential_pairs,sK9) = number_of_in(triangles,sK9) ),
introduced(definition,[new_symbols(definition,[spl12_8])],[avatar_definition]) ).
fof(f261,plain,
( number_of_in(sequential_pairs,sK9) != number_of_in(triangles,sK9)
| spl12_8 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f262,plain,
( number_of_in(sequential_pairs,sK9) = number_of_in(triangles,sK9)
| ~ spl12_8 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f263,plain,
( spl12_7
| spl12_8 ),
inference(avatar_split_clause,[],[f254,f260,f256]) ).
fof(f272,definition,
( spl12_10
<=> ! [X0,X1] : ~ path(X0,X1,sK9) ),
introduced(definition,[new_symbols(definition,[spl12_10])],[avatar_definition]) ).
fof(f273,plain,
( ! [X0,X1] : ~ path(X0,X1,sK9)
| ~ spl12_10 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f285,plain,
( number_of_in(sequential_pairs,sK9) = number_of_in(triangles,sK9)
| on_path(sK6(sK9),sK9) ),
inference(resolution,[],[f124,f141]) ).
fof(f286,plain,
( number_of_in(sequential_pairs,sK9) = number_of_in(triangles,sK9)
| sequential(sK6(sK9),sK7(sK9)) ),
inference(resolution,[],[f122,f141]) ).
fof(f287,plain,
( less_or_equal(number_of_in(sequential_pairs,sK9),number_of_in(triangles,graph))
| ~ spl12_8 ),
inference(superposition,[],[f126,f262]) ).
fof(f429,plain,
~ less_or_equal(number_of_in(sequential_pairs,sK9),number_of_in(triangles,graph)),
inference(superposition,[],[f162,f230]) ).
fof(f430,plain,
( $false
| ~ spl12_8 ),
inference(forward_subsumption_resolution,[],[f429,f287]) ).
fof(f431,plain,
~ spl12_8,
inference(avatar_contradiction_clause,[],[f430]) ).
fof(f432,plain,
( on_path(sK6(sK9),sK9)
| spl12_8 ),
inference(forward_subsumption_resolution,[],[f285,f261]) ).
fof(f433,plain,
( sequential(sK6(sK9),sK7(sK9))
| spl12_8 ),
inference(forward_subsumption_resolution,[],[f286,f261]) ).
fof(f484,plain,
( $false
| ~ spl12_10 ),
inference(resolution,[],[f273,f141]) ).
fof(f485,plain,
~ spl12_10,
inference(avatar_contradiction_clause,[],[f484]) ).
fof(f549,plain,
( ! [X2,X0,X1] :
( ~ on_path(sK7(sK9),X0)
| ~ on_path(sK6(sK9),X0)
| precedes(sK6(sK9),sK7(sK9),X0)
| ~ path(X1,X2,X0) )
| spl12_8 ),
inference(resolution,[],[f433,f100]) ).
fof(f551,plain,
( ! [X2,X0,X1] :
( ~ shortest_path(X0,X1,X2)
| ~ precedes(sK6(sK9),sK7(sK9),X2)
| triangle(sK6(sK9),sK7(sK9),sK8(sK6(sK9),sK7(sK9))) )
| spl12_8 ),
inference(resolution,[],[f433,f131]) ).
fof(f554,definition,
( spl12_34
<=> triangle(sK6(sK9),sK7(sK9),sK8(sK6(sK9),sK7(sK9))) ),
introduced(definition,[new_symbols(definition,[spl12_34])],[avatar_definition]) ).
fof(f556,plain,
( triangle(sK6(sK9),sK7(sK9),sK8(sK6(sK9),sK7(sK9)))
| ~ spl12_34 ),
inference(avatar_component_clause,[],[f554]) ).
fof(f558,definition,
( spl12_35
<=> ! [X2,X0,X1] :
( ~ shortest_path(X0,X1,X2)
| ~ precedes(sK6(sK9),sK7(sK9),X2) ) ),
introduced(definition,[new_symbols(definition,[spl12_35])],[avatar_definition]) ).
fof(f559,plain,
( ! [X2,X0,X1] :
( ~ shortest_path(X0,X1,X2)
| ~ precedes(sK6(sK9),sK7(sK9),X2) )
| ~ spl12_35 ),
inference(avatar_component_clause,[],[f558]) ).
fof(f560,plain,
( spl12_34
| spl12_35
| spl12_8 ),
inference(avatar_split_clause,[],[f551,f260,f558,f554]) ).
fof(f729,plain,
( ! [X0,X1] :
( ~ path(X0,X1,sK9)
| number_of_in(sequential_pairs,sK9) = number_of_in(triangles,sK9) )
| ~ spl12_34 ),
inference(resolution,[],[f556,f125]) ).
fof(f736,plain,
( ! [X0,X1] : ~ path(X0,X1,sK9)
| spl12_8
| ~ spl12_34 ),
inference(forward_subsumption_resolution,[],[f729,f261]) ).
fof(f737,plain,
( spl12_10
| spl12_8
| ~ spl12_34 ),
inference(avatar_split_clause,[],[f736,f554,f260,f272]) ).
fof(f788,plain,
( ~ precedes(sK6(sK9),sK7(sK9),sK9)
| ~ spl12_35 ),
inference(resolution,[],[f559,f129]) ).
fof(f1771,plain,
( ! [X0,X1] :
( ~ on_path(sK6(sK9),sK9)
| precedes(sK6(sK9),sK7(sK9),sK9)
| ~ path(X0,X1,sK9) )
| ~ spl12_7
| spl12_8 ),
inference(resolution,[],[f549,f258]) ).
fof(f1772,plain,
( ! [X0,X1] :
( precedes(sK6(sK9),sK7(sK9),sK9)
| ~ path(X0,X1,sK9) )
| ~ spl12_7
| spl12_8 ),
inference(forward_subsumption_resolution,[],[f1771,f432]) ).
fof(f1773,plain,
( ! [X0,X1] : ~ path(X0,X1,sK9)
| ~ spl12_7
| spl12_8
| ~ spl12_35 ),
inference(forward_subsumption_resolution,[],[f1772,f788]) ).
fof(f1774,plain,
( spl12_10
| ~ spl12_7
| spl12_8
| ~ spl12_35 ),
inference(avatar_split_clause,[],[f1773,f558,f260,f256,f272]) ).
cnf(s4,plain,
( spl12_7
| spl12_8 ),
inference(sat_conversion,[],[f263]) ).
cnf(s17,plain,
~ spl12_8,
inference(sat_conversion,[],[f431]) ).
cnf(s22,plain,
~ spl12_10,
inference(sat_conversion,[],[f485]) ).
cnf(s28,plain,
( spl12_8
| spl12_34
| spl12_35 ),
inference(sat_conversion,[],[f560]) ).
cnf(s41,plain,
( spl12_8
| spl12_10
| ~ spl12_34 ),
inference(sat_conversion,[],[f737]) ).
cnf(s129,plain,
( ~ spl12_7
| spl12_8
| spl12_10
| ~ spl12_35 ),
inference(sat_conversion,[],[f1774]) ).
cnf(s130,plain,
~ spl12_34,
inference(rat,[],[s41,s22,s17]) ).
cnf(s134,plain,
spl12_35,
inference(rat,[],[s28,s17,s130]) ).
cnf(s136,plain,
~ spl12_7,
inference(rat,[],[s129,s17,s22,s134]) ).
cnf(s137,plain,
$false,
inference(rat,[],[s4,s17,s136]) ).
fof(f1775,plain,
$false,
inference(avatar_sat_refutation,[],[s137]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRA002+3 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n011.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 08:45:45 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43 Running first-order model finding
% 0.12/0.43 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
% 0.18/0.51 % (2102664)Will run a generic schedule for satisfiability detection.
% 0.18/0.51 % (2102673)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=246969887:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.51 % (2102670)% WARNING: option uhcvi not known.
% 0.18/0.51 % (2102671)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3998878614:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.51 % (2102669)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1140993295_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.51 % (2102674)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=664808963:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.51 % (2102670)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3056600094:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.51 % (2102672)dis+10_1_sil=32000:sp=arity:random_seed=4229397320:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.51 % (2102675)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2573673330:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.51 % TRYING [1]
% 0.18/0.51 % TRYING [2]
% 0.18/0.51 % TRYING [3]
% 0.18/0.51 % (2102673)Instruction limit reached!
% 0.18/0.51 % (2102673)------------------------------
% 0.18/0.51 % (2102673)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.51 % (2102673)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.51 % (2102673)CaDiCaL version: 2.1.3
% 0.18/0.51 % (2102673)Termination reason: Instruction limit
% 0.18/0.51 % (2102673)Termination phase: Saturation
% 0.18/0.51 % (2102673)Time elapsed: 0.038 s
% 0.18/0.51 % (2102673)Peak memory usage: 13 MB
% 0.18/0.51 % (2102673)Instructions burned: 119 (million)
% 0.18/0.51 % (2102674) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2102664-2102674"...
% 0.18/0.51 % (2102674)...printing done.
% 0.18/0.51 % (2102674)Refutation found. Thanks to Tanya!
% 0.18/0.51 % SZS status Theorem for theBenchmark
% 0.18/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.51 % (2102674)------------------------------
% 0.18/0.51 % (2102674)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.51 % (2102674)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.51 % (2102674)CaDiCaL version: 2.1.3
% 0.18/0.51 % (2102674)Termination reason: Refutation
% 0.18/0.51 % (2102674)Time elapsed: 0.039 s
% 0.18/0.51 % (2102674)Peak memory usage: 13 MB
% 0.18/0.51 % (2102674)Instructions burned: 66 (million)
% 0.18/0.51 % (2102664)Success in time 0.072 s
% 0.18/0.51 % Vampire exiting
%------------------------------------------------------------------------------