TSTP Solution File: GRA002+3 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : GRA002+3 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 16:13:20 EDT 2022

% Result   : Theorem 1.51s 0.57s
% Output   : Refutation 1.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   25
% Syntax   : Number of formulae    :  115 (  15 unt;   0 def)
%            Number of atoms       :  395 (  32 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  470 ( 190   ~; 173   |;  64   &)
%                                         (  17 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   24 (  22 usr;  11 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;   7 con; 0-3 aty)
%            Number of variables   :  253 ( 227   !;  26   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f285,plain,
    $false,
    inference(avatar_sat_refutation,[],[f165,f166,f198,f204,f209,f214,f237,f253,f256,f284]) ).

fof(f284,plain,
    ( ~ spl30_2
    | ~ spl30_4
    | ~ spl30_6
    | ~ spl30_9 ),
    inference(avatar_contradiction_clause,[],[f283]) ).

fof(f283,plain,
    ( $false
    | ~ spl30_2
    | ~ spl30_4
    | ~ spl30_6
    | ~ spl30_9 ),
    inference(subsumption_resolution,[],[f282,f171]) ).

fof(f171,plain,
    ( ~ sP14(sK6)
    | ~ spl30_2 ),
    inference(resolution,[],[f164,f95]) ).

fof(f95,plain,
    shortest_path(sK5,sK4,sK6),
    inference(cnf_transformation,[],[f64]) ).

fof(f64,plain,
    ( complete
    & shortest_path(sK5,sK4,sK6)
    & ~ less_or_equal(minus(length_of(sK6),n1),number_of_in(triangles,graph)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f35,f63]) ).

fof(f63,plain,
    ( ? [X0,X1,X2] :
        ( shortest_path(X1,X0,X2)
        & ~ less_or_equal(minus(length_of(X2),n1),number_of_in(triangles,graph)) )
   => ( shortest_path(sK5,sK4,sK6)
      & ~ less_or_equal(minus(length_of(sK6),n1),number_of_in(triangles,graph)) ) ),
    introduced(choice_axiom,[]) ).

fof(f35,plain,
    ( complete
    & ? [X0,X1,X2] :
        ( shortest_path(X1,X0,X2)
        & ~ less_or_equal(minus(length_of(X2),n1),number_of_in(triangles,graph)) ) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f22,plain,
    ~ ( complete
     => ! [X0,X1,X2] :
          ( shortest_path(X1,X0,X2)
         => less_or_equal(minus(length_of(X2),n1),number_of_in(triangles,graph)) ) ),
    inference(rectify,[],[f20]) ).

fof(f20,negated_conjecture,
    ~ ( complete
     => ! [X2,X1,X3] :
          ( shortest_path(X1,X2,X3)
         => less_or_equal(minus(length_of(X3),n1),number_of_in(triangles,graph)) ) ),
    inference(negated_conjecture,[],[f19]) ).

fof(f19,conjecture,
    ( complete
   => ! [X2,X1,X3] :
        ( shortest_path(X1,X2,X3)
       => less_or_equal(minus(length_of(X3),n1),number_of_in(triangles,graph)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',maximal_path_length) ).

fof(f164,plain,
    ( ! [X3,X1,X4] :
        ( ~ shortest_path(X4,X1,X3)
        | ~ sP14(X3) )
    | ~ spl30_2 ),
    inference(avatar_component_clause,[],[f163]) ).

fof(f163,plain,
    ( spl30_2
  <=> ! [X4,X1,X3] :
        ( ~ sP14(X3)
        | ~ shortest_path(X4,X1,X3) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl30_2])]) ).

fof(f282,plain,
    ( sP14(sK6)
    | ~ spl30_4
    | ~ spl30_6
    | ~ spl30_9 ),
    inference(resolution,[],[f281,f126]) ).

fof(f126,plain,
    ! [X3,X0] :
      ( ~ sP13(X0,X3)
      | sP14(X3) ),
    inference(cnf_transformation,[],[f126_D]) ).

fof(f126_D,plain,
    ! [X3] :
      ( ! [X0] : ~ sP13(X0,X3)
    <=> ~ sP14(X3) ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP14])]) ).

fof(f281,plain,
    ( sP13(sK3(sK6),sK6)
    | ~ spl30_4
    | ~ spl30_6
    | ~ spl30_9 ),
    inference(subsumption_resolution,[],[f280,f224]) ).

fof(f224,plain,
    sP19(sK6),
    inference(resolution,[],[f184,f136]) ).

fof(f136,plain,
    ! [X0,X1] :
      ( ~ sP18(X0,X1)
      | sP19(X0) ),
    inference(cnf_transformation,[],[f136_D]) ).

fof(f136_D,plain,
    ! [X0] :
      ( ! [X1] : ~ sP18(X0,X1)
    <=> ~ sP19(X0) ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP19])]) ).

fof(f184,plain,
    sP18(sK6,sK4),
    inference(resolution,[],[f168,f134]) ).

fof(f134,plain,
    ! [X2,X0,X1] :
      ( ~ path(X2,X1,X0)
      | sP18(X0,X1) ),
    inference(cnf_transformation,[],[f134_D]) ).

fof(f134_D,plain,
    ! [X1,X0] :
      ( ! [X2] : ~ path(X2,X1,X0)
    <=> ~ sP18(X0,X1) ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP18])]) ).

fof(f168,plain,
    path(sK5,sK4,sK6),
    inference(resolution,[],[f95,f79]) ).

fof(f79,plain,
    ! [X2,X0,X1] :
      ( ~ shortest_path(X1,X0,X2)
      | path(X1,X0,X2) ),
    inference(cnf_transformation,[],[f52]) ).

fof(f52,plain,
    ! [X0,X1,X2] :
      ( ( ( path(X1,X0,X2)
          & ! [X3] :
              ( ~ path(X1,X0,X3)
              | less_or_equal(length_of(X2),length_of(X3)) )
          & X0 != X1 )
        | ~ shortest_path(X1,X0,X2) )
      & ( shortest_path(X1,X0,X2)
        | ~ path(X1,X0,X2)
        | ( path(X1,X0,sK0(X0,X1,X2))
          & ~ less_or_equal(length_of(X2),length_of(sK0(X0,X1,X2))) )
        | X0 = X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f50,f51]) ).

fof(f51,plain,
    ! [X0,X1,X2] :
      ( ? [X4] :
          ( path(X1,X0,X4)
          & ~ less_or_equal(length_of(X2),length_of(X4)) )
     => ( path(X1,X0,sK0(X0,X1,X2))
        & ~ less_or_equal(length_of(X2),length_of(sK0(X0,X1,X2))) ) ),
    introduced(choice_axiom,[]) ).

fof(f50,plain,
    ! [X0,X1,X2] :
      ( ( ( path(X1,X0,X2)
          & ! [X3] :
              ( ~ path(X1,X0,X3)
              | less_or_equal(length_of(X2),length_of(X3)) )
          & X0 != X1 )
        | ~ shortest_path(X1,X0,X2) )
      & ( shortest_path(X1,X0,X2)
        | ~ path(X1,X0,X2)
        | ? [X4] :
            ( path(X1,X0,X4)
            & ~ less_or_equal(length_of(X2),length_of(X4)) )
        | X0 = X1 ) ),
    inference(rectify,[],[f49]) ).

fof(f49,plain,
    ! [X0,X2,X1] :
      ( ( ( path(X2,X0,X1)
          & ! [X3] :
              ( ~ path(X2,X0,X3)
              | less_or_equal(length_of(X1),length_of(X3)) )
          & X0 != X2 )
        | ~ shortest_path(X2,X0,X1) )
      & ( shortest_path(X2,X0,X1)
        | ~ path(X2,X0,X1)
        | ? [X3] :
            ( path(X2,X0,X3)
            & ~ less_or_equal(length_of(X1),length_of(X3)) )
        | X0 = X2 ) ),
    inference(flattening,[],[f48]) ).

fof(f48,plain,
    ! [X0,X2,X1] :
      ( ( ( path(X2,X0,X1)
          & ! [X3] :
              ( ~ path(X2,X0,X3)
              | less_or_equal(length_of(X1),length_of(X3)) )
          & X0 != X2 )
        | ~ shortest_path(X2,X0,X1) )
      & ( shortest_path(X2,X0,X1)
        | ~ path(X2,X0,X1)
        | ? [X3] :
            ( path(X2,X0,X3)
            & ~ less_or_equal(length_of(X1),length_of(X3)) )
        | X0 = X2 ) ),
    inference(nnf_transformation,[],[f43]) ).

fof(f43,plain,
    ! [X0,X2,X1] :
      ( ( path(X2,X0,X1)
        & ! [X3] :
            ( ~ path(X2,X0,X3)
            | less_or_equal(length_of(X1),length_of(X3)) )
        & X0 != X2 )
    <=> shortest_path(X2,X0,X1) ),
    inference(ennf_transformation,[],[f25]) ).

fof(f25,plain,
    ! [X1,X2,X0] :
      ( shortest_path(X2,X0,X1)
    <=> ( ! [X3] :
            ( path(X2,X0,X3)
           => less_or_equal(length_of(X1),length_of(X3)) )
        & X0 != X2
        & path(X2,X0,X1) ) ),
    inference(rectify,[],[f11]) ).

fof(f11,axiom,
    ! [X2,X9,X1] :
      ( ( X1 != X2
        & ! [X3] :
            ( path(X1,X2,X3)
           => less_or_equal(length_of(X9),length_of(X3)) )
        & path(X1,X2,X9) )
    <=> shortest_path(X1,X2,X9) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',shortest_path_defn) ).

fof(f280,plain,
    ( sP13(sK3(sK6),sK6)
    | ~ sP19(sK6)
    | ~ spl30_4
    | ~ spl30_6
    | ~ spl30_9 ),
    inference(subsumption_resolution,[],[f279,f197]) ).

fof(f197,plain,
    ( on_path(sK2(sK6),sK6)
    | ~ spl30_4 ),
    inference(avatar_component_clause,[],[f195]) ).

fof(f195,plain,
    ( spl30_4
  <=> on_path(sK2(sK6),sK6) ),
    introduced(avatar_definition,[new_symbols(naming,[spl30_4])]) ).

fof(f279,plain,
    ( ~ on_path(sK2(sK6),sK6)
    | ~ sP19(sK6)
    | sP13(sK3(sK6),sK6)
    | ~ spl30_6
    | ~ spl30_9 ),
    inference(resolution,[],[f236,f208]) ).

fof(f208,plain,
    ( on_path(sK3(sK6),sK6)
    | ~ spl30_6 ),
    inference(avatar_component_clause,[],[f206]) ).

fof(f206,plain,
    ( spl30_6
  <=> on_path(sK3(sK6),sK6) ),
    introduced(avatar_definition,[new_symbols(naming,[spl30_6])]) ).

fof(f236,plain,
    ( ! [X0] :
        ( ~ on_path(sK3(sK6),X0)
        | sP13(sK3(sK6),X0)
        | ~ sP19(X0)
        | ~ on_path(sK2(sK6),X0) )
    | ~ spl30_9 ),
    inference(avatar_component_clause,[],[f235]) ).

fof(f235,plain,
    ( spl30_9
  <=> ! [X0] :
        ( ~ sP19(X0)
        | sP13(sK3(sK6),X0)
        | ~ on_path(sK3(sK6),X0)
        | ~ on_path(sK2(sK6),X0) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl30_9])]) ).

fof(f256,plain,
    ~ spl30_3,
    inference(avatar_contradiction_clause,[],[f255]) ).

fof(f255,plain,
    ( $false
    | ~ spl30_3 ),
    inference(subsumption_resolution,[],[f254,f199]) ).

fof(f199,plain,
    ~ less_or_equal(number_of_in(sequential_pairs,sK6),number_of_in(triangles,graph)),
    inference(backward_demodulation,[],[f94,f177]) ).

fof(f177,plain,
    number_of_in(sequential_pairs,sK6) = minus(length_of(sK6),n1),
    inference(resolution,[],[f168,f87]) ).

fof(f87,plain,
    ! [X2,X0,X1] :
      ( ~ path(X0,X1,X2)
      | number_of_in(sequential_pairs,X2) = minus(length_of(X2),n1) ),
    inference(cnf_transformation,[],[f42]) ).

fof(f42,plain,
    ! [X0,X1,X2] :
      ( ~ path(X0,X1,X2)
      | number_of_in(sequential_pairs,X2) = minus(length_of(X2),n1) ),
    inference(ennf_transformation,[],[f32]) ).

fof(f32,plain,
    ! [X2,X1,X0] :
      ( path(X0,X1,X2)
     => number_of_in(sequential_pairs,X2) = minus(length_of(X2),n1) ),
    inference(rectify,[],[f15]) ).

fof(f15,axiom,
    ! [X1,X2,X3] :
      ( path(X1,X2,X3)
     => number_of_in(sequential_pairs,X3) = minus(length_of(X3),n1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',path_length_sequential_pairs) ).

fof(f94,plain,
    ~ less_or_equal(minus(length_of(sK6),n1),number_of_in(triangles,graph)),
    inference(cnf_transformation,[],[f64]) ).

fof(f254,plain,
    ( less_or_equal(number_of_in(sequential_pairs,sK6),number_of_in(triangles,graph))
    | ~ spl30_3 ),
    inference(superposition,[],[f89,f193]) ).

fof(f193,plain,
    ( number_of_in(sequential_pairs,sK6) = number_of_in(triangles,sK6)
    | ~ spl30_3 ),
    inference(avatar_component_clause,[],[f191]) ).

fof(f191,plain,
    ( spl30_3
  <=> number_of_in(sequential_pairs,sK6) = number_of_in(triangles,sK6) ),
    introduced(avatar_definition,[new_symbols(naming,[spl30_3])]) ).

fof(f89,plain,
    ! [X0,X1] : less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph)),
    inference(cnf_transformation,[],[f60]) ).

fof(f60,plain,
    ! [X0,X1] : less_or_equal(number_of_in(X0,X1),number_of_in(X0,graph)),
    inference(rectify,[],[f31]) ).

fof(f31,plain,
    ! [X1,X0] : less_or_equal(number_of_in(X1,X0),number_of_in(X1,graph)),
    inference(rectify,[],[f17]) ).

fof(f17,axiom,
    ! [X11,X10] : less_or_equal(number_of_in(X10,X11),number_of_in(X10,graph)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',graph_has_them_all) ).

fof(f253,plain,
    ( spl30_5
    | ~ spl30_8 ),
    inference(avatar_contradiction_clause,[],[f252]) ).

fof(f252,plain,
    ( $false
    | spl30_5
    | ~ spl30_8 ),
    inference(subsumption_resolution,[],[f245,f203]) ).

fof(f203,plain,
    ( ~ sP15(sK6)
    | spl30_5 ),
    inference(avatar_component_clause,[],[f201]) ).

fof(f201,plain,
    ( spl30_5
  <=> sP15(sK6) ),
    introduced(avatar_definition,[new_symbols(naming,[spl30_5])]) ).

fof(f245,plain,
    ( sP15(sK6)
    | ~ spl30_8 ),
    inference(resolution,[],[f233,f128]) ).

fof(f128,plain,
    ! [X2,X5] :
      ( ~ triangle(sK2(X2),sK3(X2),X5)
      | sP15(X2) ),
    inference(cnf_transformation,[],[f128_D]) ).

fof(f128_D,plain,
    ! [X2] :
      ( ! [X5] : ~ triangle(sK2(X2),sK3(X2),X5)
    <=> ~ sP15(X2) ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP15])]) ).

fof(f233,plain,
    ( triangle(sK2(sK6),sK3(sK6),sK1(sK3(sK6),sK2(sK6)))
    | ~ spl30_8 ),
    inference(avatar_component_clause,[],[f231]) ).

fof(f231,plain,
    ( spl30_8
  <=> triangle(sK2(sK6),sK3(sK6),sK1(sK3(sK6),sK2(sK6))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl30_8])]) ).

fof(f237,plain,
    ( spl30_8
    | spl30_9
    | ~ spl30_7 ),
    inference(avatar_split_clause,[],[f226,f211,f235,f231]) ).

fof(f211,plain,
    ( spl30_7
  <=> sequential(sK2(sK6),sK3(sK6)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl30_7])]) ).

fof(f226,plain,
    ( ! [X0] :
        ( ~ sP19(X0)
        | ~ on_path(sK2(sK6),X0)
        | triangle(sK2(sK6),sK3(sK6),sK1(sK3(sK6),sK2(sK6)))
        | ~ on_path(sK3(sK6),X0)
        | sP13(sK3(sK6),X0) )
    | ~ spl30_7 ),
    inference(resolution,[],[f213,f175]) ).

fof(f175,plain,
    ! [X2,X0,X1] :
      ( ~ sequential(X2,X0)
      | triangle(X2,X0,sK1(X0,X2))
      | ~ sP19(X1)
      | sP13(X0,X1)
      | ~ on_path(X0,X1)
      | ~ on_path(X2,X1) ),
    inference(duplicate_literal_removal,[],[f173]) ).

fof(f173,plain,
    ! [X2,X0,X1] :
      ( ~ sequential(X2,X0)
      | triangle(X2,X0,sK1(X0,X2))
      | sP13(X0,X1)
      | ~ on_path(X0,X1)
      | ~ sequential(X2,X0)
      | ~ sP19(X1)
      | ~ on_path(X2,X1) ),
    inference(resolution,[],[f124,f137]) ).

fof(f137,plain,
    ! [X3,X0,X4] :
      ( precedes(X3,X4,X0)
      | ~ sequential(X3,X4)
      | ~ sP19(X0)
      | ~ on_path(X3,X0)
      | ~ on_path(X4,X0) ),
    inference(general_splitting,[],[f135,f136_D]) ).

fof(f135,plain,
    ! [X3,X0,X1,X4] :
      ( ~ sequential(X3,X4)
      | ~ on_path(X4,X0)
      | precedes(X3,X4,X0)
      | ~ on_path(X3,X0)
      | ~ sP18(X0,X1) ),
    inference(general_splitting,[],[f97,f134_D]) ).

fof(f97,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ path(X2,X1,X0)
      | ~ sequential(X3,X4)
      | ~ on_path(X4,X0)
      | precedes(X3,X4,X0)
      | ~ on_path(X3,X0) ),
    inference(cnf_transformation,[],[f65]) ).

fof(f65,plain,
    ! [X0,X1,X2] :
      ( ~ path(X2,X1,X0)
      | ! [X3,X4] :
          ( ( ! [X5] :
                ( ~ sequential(X3,X5)
                | ~ precedes(X5,X4,X0) )
            & ~ sequential(X3,X4) )
          | ~ on_path(X4,X0)
          | precedes(X3,X4,X0)
          | ~ on_path(X3,X0) ) ),
    inference(rectify,[],[f45]) ).

fof(f45,plain,
    ! [X0,X1,X2] :
      ( ~ path(X2,X1,X0)
      | ! [X4,X3] :
          ( ( ! [X5] :
                ( ~ sequential(X4,X5)
                | ~ precedes(X5,X3,X0) )
            & ~ sequential(X4,X3) )
          | ~ on_path(X3,X0)
          | precedes(X4,X3,X0)
          | ~ on_path(X4,X0) ) ),
    inference(flattening,[],[f44]) ).

fof(f44,plain,
    ! [X2,X1,X0] :
      ( ! [X4,X3] :
          ( precedes(X4,X3,X0)
          | ~ on_path(X3,X0)
          | ( ! [X5] :
                ( ~ sequential(X4,X5)
                | ~ precedes(X5,X3,X0) )
            & ~ sequential(X4,X3) )
          | ~ on_path(X4,X0) )
      | ~ path(X2,X1,X0) ),
    inference(ennf_transformation,[],[f29]) ).

fof(f29,plain,
    ! [X2,X1,X0] :
      ( path(X2,X1,X0)
     => ! [X4,X3] :
          ( ( on_path(X3,X0)
            & ( ? [X5] :
                  ( sequential(X4,X5)
                  & precedes(X5,X3,X0) )
              | sequential(X4,X3) )
            & on_path(X4,X0) )
         => precedes(X4,X3,X0) ) ),
    inference(rectify,[],[f9]) ).

fof(f9,axiom,
    ! [X3,X2,X1] :
      ( path(X1,X2,X3)
     => ! [X7,X6] :
          ( ( on_path(X6,X3)
            & ( ? [X8] :
                  ( precedes(X8,X7,X3)
                  & sequential(X6,X8) )
              | sequential(X6,X7) )
            & on_path(X7,X3) )
         => precedes(X6,X7,X3) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',precedes_defn) ).

fof(f124,plain,
    ! [X2,X3,X0] :
      ( ~ precedes(X2,X0,X3)
      | sP13(X0,X3)
      | ~ sequential(X2,X0)
      | triangle(X2,X0,sK1(X0,X2)) ),
    inference(cnf_transformation,[],[f124_D]) ).

fof(f124_D,plain,
    ! [X3,X0] :
      ( ! [X2] :
          ( ~ precedes(X2,X0,X3)
          | ~ sequential(X2,X0)
          | triangle(X2,X0,sK1(X0,X2)) )
    <=> ~ sP13(X0,X3) ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP13])]) ).

fof(f213,plain,
    ( sequential(sK2(sK6),sK3(sK6))
    | ~ spl30_7 ),
    inference(avatar_component_clause,[],[f211]) ).

fof(f214,plain,
    ( spl30_3
    | spl30_7 ),
    inference(avatar_split_clause,[],[f178,f211,f191]) ).

fof(f178,plain,
    ( sequential(sK2(sK6),sK3(sK6))
    | number_of_in(sequential_pairs,sK6) = number_of_in(triangles,sK6) ),
    inference(resolution,[],[f168,f90]) ).

fof(f90,plain,
    ! [X2,X0,X1] :
      ( ~ path(X0,X1,X2)
      | sequential(sK2(X2),sK3(X2))
      | number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2) ),
    inference(cnf_transformation,[],[f62]) ).

fof(f62,plain,
    ! [X0,X1,X2] :
      ( number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2)
      | ~ path(X0,X1,X2)
      | ( ! [X5] : ~ triangle(sK2(X2),sK3(X2),X5)
        & on_path(sK3(X2),X2)
        & on_path(sK2(X2),X2)
        & sequential(sK2(X2),sK3(X2)) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f47,f61]) ).

fof(f61,plain,
    ! [X2] :
      ( ? [X3,X4] :
          ( ! [X5] : ~ triangle(X3,X4,X5)
          & on_path(X4,X2)
          & on_path(X3,X2)
          & sequential(X3,X4) )
     => ( ! [X5] : ~ triangle(sK2(X2),sK3(X2),X5)
        & on_path(sK3(X2),X2)
        & on_path(sK2(X2),X2)
        & sequential(sK2(X2),sK3(X2)) ) ),
    introduced(choice_axiom,[]) ).

fof(f47,plain,
    ! [X0,X1,X2] :
      ( number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2)
      | ~ path(X0,X1,X2)
      | ? [X3,X4] :
          ( ! [X5] : ~ triangle(X3,X4,X5)
          & on_path(X4,X2)
          & on_path(X3,X2)
          & sequential(X3,X4) ) ),
    inference(flattening,[],[f46]) ).

fof(f46,plain,
    ! [X1,X2,X0] :
      ( number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2)
      | ~ path(X0,X1,X2)
      | ? [X4,X3] :
          ( ! [X5] : ~ triangle(X3,X4,X5)
          & on_path(X3,X2)
          & on_path(X4,X2)
          & sequential(X3,X4) ) ),
    inference(ennf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X1,X2,X0] :
      ( ( path(X0,X1,X2)
        & ! [X4,X3] :
            ( ( on_path(X3,X2)
              & on_path(X4,X2)
              & sequential(X3,X4) )
           => ? [X5] : triangle(X3,X4,X5) ) )
     => number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2) ),
    inference(rectify,[],[f16]) ).

fof(f16,axiom,
    ! [X1,X2,X3] :
      ( ( path(X1,X2,X3)
        & ! [X6,X7] :
            ( ( sequential(X6,X7)
              & on_path(X7,X3)
              & on_path(X6,X3) )
           => ? [X8] : triangle(X6,X7,X8) ) )
     => number_of_in(sequential_pairs,X3) = number_of_in(triangles,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).

fof(f209,plain,
    ( spl30_3
    | spl30_6 ),
    inference(avatar_split_clause,[],[f180,f206,f191]) ).

fof(f180,plain,
    ( on_path(sK3(sK6),sK6)
    | number_of_in(sequential_pairs,sK6) = number_of_in(triangles,sK6) ),
    inference(resolution,[],[f168,f92]) ).

fof(f92,plain,
    ! [X2,X0,X1] :
      ( ~ path(X0,X1,X2)
      | number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2)
      | on_path(sK3(X2),X2) ),
    inference(cnf_transformation,[],[f62]) ).

fof(f204,plain,
    ( ~ spl30_5
    | spl30_3 ),
    inference(avatar_split_clause,[],[f182,f191,f201]) ).

fof(f182,plain,
    ( number_of_in(sequential_pairs,sK6) = number_of_in(triangles,sK6)
    | ~ sP15(sK6) ),
    inference(resolution,[],[f168,f129]) ).

fof(f129,plain,
    ! [X2,X0,X1] :
      ( ~ path(X0,X1,X2)
      | ~ sP15(X2)
      | number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2) ),
    inference(general_splitting,[],[f93,f128_D]) ).

fof(f93,plain,
    ! [X2,X0,X1,X5] :
      ( number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2)
      | ~ path(X0,X1,X2)
      | ~ triangle(sK2(X2),sK3(X2),X5) ),
    inference(cnf_transformation,[],[f62]) ).

fof(f198,plain,
    ( spl30_3
    | spl30_4 ),
    inference(avatar_split_clause,[],[f179,f195,f191]) ).

fof(f179,plain,
    ( on_path(sK2(sK6),sK6)
    | number_of_in(sequential_pairs,sK6) = number_of_in(triangles,sK6) ),
    inference(resolution,[],[f168,f91]) ).

fof(f91,plain,
    ! [X2,X0,X1] :
      ( ~ path(X0,X1,X2)
      | number_of_in(sequential_pairs,X2) = number_of_in(triangles,X2)
      | on_path(sK2(X2),X2) ),
    inference(cnf_transformation,[],[f62]) ).

fof(f166,plain,
    spl30_1,
    inference(avatar_split_clause,[],[f96,f159]) ).

fof(f159,plain,
    ( spl30_1
  <=> complete ),
    introduced(avatar_definition,[new_symbols(naming,[spl30_1])]) ).

fof(f96,plain,
    complete,
    inference(cnf_transformation,[],[f64]) ).

fof(f165,plain,
    ( ~ spl30_1
    | spl30_2 ),
    inference(avatar_split_clause,[],[f127,f163,f159]) ).

fof(f127,plain,
    ! [X3,X1,X4] :
      ( ~ sP14(X3)
      | ~ shortest_path(X4,X1,X3)
      | ~ complete ),
    inference(general_splitting,[],[f125,f126_D]) ).

fof(f125,plain,
    ! [X3,X0,X1,X4] :
      ( ~ shortest_path(X4,X1,X3)
      | ~ complete
      | ~ sP13(X0,X3) ),
    inference(general_splitting,[],[f88,f124_D]) ).

fof(f88,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ shortest_path(X4,X1,X3)
      | ~ precedes(X2,X0,X3)
      | triangle(X2,X0,sK1(X0,X2))
      | ~ sequential(X2,X0)
      | ~ complete ),
    inference(cnf_transformation,[],[f59]) ).

fof(f59,plain,
    ( ! [X0,X1,X2,X3,X4] :
        ( ~ shortest_path(X4,X1,X3)
        | ~ precedes(X2,X0,X3)
        | triangle(X2,X0,sK1(X0,X2))
        | ~ sequential(X2,X0) )
    | ~ complete ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f57,f58]) ).

fof(f58,plain,
    ! [X0,X2] :
      ( ? [X5] : triangle(X2,X0,X5)
     => triangle(X2,X0,sK1(X0,X2)) ),
    introduced(choice_axiom,[]) ).

fof(f57,plain,
    ( ! [X0,X1,X2,X3,X4] :
        ( ~ shortest_path(X4,X1,X3)
        | ~ precedes(X2,X0,X3)
        | ? [X5] : triangle(X2,X0,X5)
        | ~ sequential(X2,X0) )
    | ~ complete ),
    inference(rectify,[],[f39]) ).

fof(f39,plain,
    ( ! [X0,X2,X4,X1,X3] :
        ( ~ shortest_path(X3,X2,X1)
        | ~ precedes(X4,X0,X1)
        | ? [X5] : triangle(X4,X0,X5)
        | ~ sequential(X4,X0) )
    | ~ complete ),
    inference(flattening,[],[f38]) ).

fof(f38,plain,
    ( ! [X2,X1,X4,X3,X0] :
        ( ? [X5] : triangle(X4,X0,X5)
        | ~ sequential(X4,X0)
        | ~ shortest_path(X3,X2,X1)
        | ~ precedes(X4,X0,X1) )
    | ~ complete ),
    inference(ennf_transformation,[],[f21]) ).

fof(f21,plain,
    ( complete
   => ! [X2,X1,X4,X3,X0] :
        ( ( sequential(X4,X0)
          & shortest_path(X3,X2,X1)
          & precedes(X4,X0,X1) )
       => ? [X5] : triangle(X4,X0,X5) ) ),
    inference(rectify,[],[f18]) ).

fof(f18,axiom,
    ( complete
   => ! [X7,X3,X2,X1,X6] :
        ( ( shortest_path(X1,X2,X3)
          & sequential(X6,X7)
          & precedes(X6,X7,X3) )
       => ? [X8] : triangle(X6,X7,X8) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_is_triangle) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : GRA002+3 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35  % Computer : n020.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Aug 29 22:02:30 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.19/0.50  % (13643)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.51  % (13646)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.51  % (13642)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51  % (13651)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.52  % (13654)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.52  % (13658)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.19/0.52  % (13643)Instruction limit reached!
% 0.19/0.52  % (13643)------------------------------
% 0.19/0.52  % (13643)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (13643)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (13643)Termination reason: Unknown
% 0.19/0.52  % (13643)Termination phase: Saturation
% 0.19/0.52  
% 0.19/0.52  % (13643)Memory used [KB]: 6140
% 0.19/0.52  % (13643)Time elapsed: 0.116 s
% 0.19/0.52  % (13643)Instructions burned: 13 (million)
% 0.19/0.52  % (13643)------------------------------
% 0.19/0.52  % (13643)------------------------------
% 0.19/0.52  % (13639)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.53  % (13660)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.53  % (13648)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.53  % (13661)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.53  % (13650)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.53  % (13653)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.53  % (13642)Refutation not found, incomplete strategy% (13642)------------------------------
% 0.19/0.53  % (13642)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53  % (13642)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53  % (13642)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.53  
% 0.19/0.53  % (13642)Memory used [KB]: 6012
% 0.19/0.53  % (13642)Time elapsed: 0.128 s
% 0.19/0.53  % (13642)Instructions burned: 4 (million)
% 0.19/0.53  % (13642)------------------------------
% 0.19/0.53  % (13642)------------------------------
% 0.19/0.53  % (13640)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.53  % (13666)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.19/0.53  % (13647)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.53  % (13667)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.19/0.53  % (13641)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.54  % (13641)Instruction limit reached!
% 0.19/0.54  % (13641)------------------------------
% 0.19/0.54  % (13641)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (13641)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54  % (13641)Termination reason: Unknown
% 0.19/0.54  % (13641)Termination phase: shuffling
% 0.19/0.54  
% 0.19/0.54  % (13641)Memory used [KB]: 1535
% 0.19/0.54  % (13641)Time elapsed: 0.003 s
% 0.19/0.54  % (13641)Instructions burned: 3 (million)
% 0.19/0.54  % (13641)------------------------------
% 0.19/0.54  % (13641)------------------------------
% 0.19/0.54  % (13644)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.54  % (13649)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.54  % (13649)Instruction limit reached!
% 0.19/0.54  % (13649)------------------------------
% 0.19/0.54  % (13649)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (13659)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.19/0.54  % (13668)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.19/0.54  % (13651)Instruction limit reached!
% 0.19/0.54  % (13651)------------------------------
% 0.19/0.54  % (13651)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (13654)Instruction limit reached!
% 0.19/0.54  % (13654)------------------------------
% 0.19/0.54  % (13654)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (13655)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.54  % (13650)Refutation not found, incomplete strategy% (13650)------------------------------
% 0.19/0.54  % (13650)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (13648)Refutation not found, incomplete strategy% (13648)------------------------------
% 0.19/0.54  % (13648)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54  % (13665)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.54  % (13652)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.54  % (13662)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.55  % (13653)Instruction limit reached!
% 0.19/0.55  % (13653)------------------------------
% 0.19/0.55  % (13653)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (13667)Instruction limit reached!
% 0.19/0.55  % (13667)------------------------------
% 0.19/0.55  % (13667)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (13640)First to succeed.
% 0.19/0.55  % (13667)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (13645)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.55  % (13667)Termination reason: Unknown
% 0.19/0.55  % (13667)Termination phase: Saturation
% 0.19/0.55  
% 0.19/0.55  % (13667)Memory used [KB]: 6140
% 0.19/0.55  % (13667)Time elapsed: 0.140 s
% 0.19/0.55  % (13667)Instructions burned: 8 (million)
% 0.19/0.55  % (13667)------------------------------
% 0.19/0.55  % (13667)------------------------------
% 0.19/0.55  % (13657)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.55  % (13644)Instruction limit reached!
% 0.19/0.55  % (13644)------------------------------
% 0.19/0.55  % (13644)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (13651)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (13651)Termination reason: Unknown
% 0.19/0.55  % (13651)Termination phase: Saturation
% 0.19/0.55  
% 0.19/0.55  % (13651)Memory used [KB]: 1791
% 0.19/0.55  % (13651)Time elapsed: 0.123 s
% 0.19/0.55  % (13651)Instructions burned: 17 (million)
% 0.19/0.55  % (13648)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (13651)------------------------------
% 0.19/0.55  % (13651)------------------------------
% 0.19/0.55  % (13648)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.55  
% 0.19/0.55  % (13648)Memory used [KB]: 6012
% 0.19/0.55  % (13648)Time elapsed: 0.121 s
% 0.19/0.55  % (13648)Instructions burned: 4 (million)
% 0.19/0.55  % (13648)------------------------------
% 0.19/0.55  % (13648)------------------------------
% 0.19/0.55  % (13663)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.55  % (13653)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (13653)Termination reason: Unknown
% 0.19/0.55  % (13653)Termination phase: Equality resolution with deletion
% 0.19/0.55  
% 0.19/0.55  % (13653)Memory used [KB]: 1535
% 0.19/0.55  % (13653)Time elapsed: 0.004 s
% 0.19/0.55  % (13653)Instructions burned: 3 (million)
% 0.19/0.55  % (13653)------------------------------
% 0.19/0.55  % (13653)------------------------------
% 0.19/0.55  % (13658)Instruction limit reached!
% 0.19/0.55  % (13658)------------------------------
% 0.19/0.55  % (13658)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (13650)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (13650)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.55  
% 0.19/0.55  % (13650)Memory used [KB]: 6140
% 0.19/0.55  % (13650)Time elapsed: 0.154 s
% 0.19/0.55  % (13650)Instructions burned: 6 (million)
% 0.19/0.55  % (13650)------------------------------
% 0.19/0.55  % (13650)------------------------------
% 0.19/0.55  % (13664)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.19/0.55  % (13658)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (13658)Termination reason: Unknown
% 0.19/0.55  % (13658)Termination phase: Saturation
% 0.19/0.55  
% 0.19/0.55  % (13658)Memory used [KB]: 6268
% 0.19/0.55  % (13658)Time elapsed: 0.147 s
% 0.19/0.55  % (13658)Instructions burned: 12 (million)
% 0.19/0.55  % (13658)------------------------------
% 0.19/0.55  % (13658)------------------------------
% 0.19/0.55  % (13649)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (13649)Termination reason: Unknown
% 0.19/0.55  % (13649)Termination phase: Saturation
% 0.19/0.55  
% 0.19/0.55  % (13649)Memory used [KB]: 6140
% 0.19/0.55  % (13649)Time elapsed: 0.138 s
% 0.19/0.55  % (13649)Instructions burned: 12 (million)
% 0.19/0.55  % (13649)------------------------------
% 0.19/0.55  % (13649)------------------------------
% 0.19/0.56  % (13656)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.56  % (13654)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56  % (13654)Termination reason: Unknown
% 0.19/0.56  % (13654)Termination phase: Saturation
% 0.19/0.56  
% 0.19/0.56  % (13654)Memory used [KB]: 6140
% 0.19/0.56  % (13654)Time elapsed: 0.151 s
% 0.19/0.56  % (13654)Instructions burned: 7 (million)
% 0.19/0.56  % (13654)------------------------------
% 0.19/0.56  % (13654)------------------------------
% 0.19/0.56  % (13657)Instruction limit reached!
% 0.19/0.56  % (13657)------------------------------
% 0.19/0.56  % (13657)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56  % (13657)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56  % (13657)Termination reason: Unknown
% 0.19/0.56  % (13657)Termination phase: Preprocessing 3
% 0.19/0.56  
% 0.19/0.56  % (13657)Memory used [KB]: 1407
% 0.19/0.56  % (13657)Time elapsed: 0.003 s
% 0.19/0.56  % (13657)Instructions burned: 2 (million)
% 0.19/0.56  % (13657)------------------------------
% 0.19/0.56  % (13657)------------------------------
% 0.19/0.56  % (13666)Instruction limit reached!
% 0.19/0.56  % (13666)------------------------------
% 0.19/0.56  % (13666)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56  % (13666)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56  % (13666)Termination reason: Unknown
% 0.19/0.56  % (13666)Termination phase: Saturation
% 0.19/0.56  
% 0.19/0.56  % (13666)Memory used [KB]: 6396
% 0.19/0.56  % (13666)Time elapsed: 0.155 s
% 0.19/0.56  % (13666)Instructions burned: 25 (million)
% 0.19/0.56  % (13666)------------------------------
% 0.19/0.56  % (13666)------------------------------
% 0.19/0.57  % (13652)Refutation not found, incomplete strategy% (13652)------------------------------
% 0.19/0.57  % (13652)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57  % (13652)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57  % (13652)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.57  
% 0.19/0.57  % (13652)Memory used [KB]: 6140
% 0.19/0.57  % (13652)Time elapsed: 0.170 s
% 0.19/0.57  % (13652)Instructions burned: 5 (million)
% 0.19/0.57  % (13652)------------------------------
% 0.19/0.57  % (13652)------------------------------
% 0.19/0.57  % (13656)Instruction limit reached!
% 0.19/0.57  % (13656)------------------------------
% 0.19/0.57  % (13656)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57  % (13656)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57  % (13656)Termination reason: Unknown
% 0.19/0.57  % (13656)Termination phase: Preprocessing 3
% 0.19/0.57  
% 0.19/0.57  % (13656)Memory used [KB]: 1535
% 0.19/0.57  % (13656)Time elapsed: 0.006 s
% 0.19/0.57  % (13656)Instructions burned: 3 (million)
% 0.19/0.57  % (13656)------------------------------
% 0.19/0.57  % (13656)------------------------------
% 0.19/0.57  % (13644)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57  % (13644)Termination reason: Unknown
% 0.19/0.57  % (13644)Termination phase: Saturation
% 0.19/0.57  
% 0.19/0.57  % (13644)Memory used [KB]: 1663
% 0.19/0.57  % (13644)Time elapsed: 0.141 s
% 0.19/0.57  % (13644)Instructions burned: 16 (million)
% 0.19/0.57  % (13644)------------------------------
% 0.19/0.57  % (13644)------------------------------
% 1.51/0.57  % (13646)Instruction limit reached!
% 1.51/0.57  % (13646)------------------------------
% 1.51/0.57  % (13646)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.57  % (13668)Instruction limit reached!
% 1.51/0.57  % (13668)------------------------------
% 1.51/0.57  % (13668)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.57  % (13640)Refutation found. Thanks to Tanya!
% 1.51/0.57  % SZS status Theorem for theBenchmark
% 1.51/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 1.51/0.57  % (13640)------------------------------
% 1.51/0.57  % (13640)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.51/0.57  % (13640)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.51/0.57  % (13640)Termination reason: Refutation
% 1.51/0.57  
% 1.51/0.57  % (13640)Memory used [KB]: 6140
% 1.51/0.57  % (13640)Time elapsed: 0.150 s
% 1.51/0.57  % (13640)Instructions burned: 7 (million)
% 1.51/0.57  % (13640)------------------------------
% 1.51/0.57  % (13640)------------------------------
% 1.51/0.57  % (13638)Success in time 0.211 s
%------------------------------------------------------------------------------