↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWX024+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n009.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 01:45:41 PM UTC 2026

% Result   : Theorem 6.90s 1.80s
% Output   : Refutation 8.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   16
% Syntax   : Number of formulae    :  120 (  20 unt;  11 def)
%            Number of atoms       :  458 (  93 equ)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :  514 ( 176   ~; 238   |;  73   &)
%                                         (  11 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   15 (  13 usr;  11 prp; 0-3 aty)
%            Number of functors    :   16 (  16 usr;   9 con; 0-3 aty)
%            Number of variables   :  223 (   1 sgn 166   !;  57   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ! [X0,X1] : nil != cons(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',id5) ).

fof(f45,axiom,
    ! [X0,X1] :
      ( member_succeeds(X0,X1)
    <=> ( ? [X2,X3] :
            ( X1 = cons(X2,X3)
            & member_succeeds(X0,X3) )
        | ? [X4] : X1 = cons(X0,X4) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',id45) ).

fof(f170,axiom,
    ! [X0,X1,X2,X3] :
      ( ( member_succeeds(X0,cons(X1,X3))
        & X0 != X1 )
     => member_succeeds(X0,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','lemma-(member:cons)') ).

fof(f218,axiom,
    ( ! [X0,X1,X2] :
        ( ( ? [X3,X4,X5] :
              ( X0 = cons(X3,X4)
              & X2 = cons(X3,X5)
              & append_succeeds(X4,X1,X5)
              & ! [X6] :
                  ( member_succeeds(X6,X5)
                 => ( member_succeeds(X6,X4)
                    | member_succeeds(X6,X1) ) ) )
          | ( X0 = nil
            & X2 = X1 ) )
       => ! [X6] :
            ( member_succeeds(X6,X2)
           => ( member_succeeds(X6,X0)
              | member_succeeds(X6,X1) ) ) )
   => ! [X0,X1,X2] :
        ( append_succeeds(X0,X1,X2)
       => ! [X6] :
            ( member_succeeds(X6,X2)
           => ( member_succeeds(X6,X0)
              | member_succeeds(X6,X1) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',induction) ).

fof(f219,conjecture,
    ! [X0,X1,X2,X3] :
      ( ( append_succeeds(X1,X2,X3)
        & member_succeeds(X0,X3) )
     => ( member_succeeds(X0,X1)
        | member_succeeds(X0,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','lemma-(append:member:3)') ).

fof(f220,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( ( append_succeeds(X1,X2,X3)
          & member_succeeds(X0,X3) )
       => ( member_succeeds(X0,X1)
          | member_succeeds(X0,X2) ) ),
    inference(negated_conjecture,[status(cth)],[f219]) ).

fof(f240,plain,
    ! [X0,X1,X3] :
      ( ( member_succeeds(X0,cons(X1,X3))
        & X0 != X1 )
     => member_succeeds(X0,X3) ),
    inference(rectify,[],[f170]) ).

fof(f241,plain,
    ( ! [X0,X1,X2] :
        ( ( ? [X3,X4,X5] :
              ( X0 = cons(X3,X4)
              & X2 = cons(X3,X5)
              & append_succeeds(X4,X1,X5)
              & ! [X6] :
                  ( member_succeeds(X6,X5)
                 => ( member_succeeds(X6,X4)
                    | member_succeeds(X6,X1) ) ) )
          | ( X0 = nil
            & X2 = X1 ) )
       => ! [X7] :
            ( member_succeeds(X7,X2)
           => ( member_succeeds(X7,X0)
              | member_succeeds(X7,X1) ) ) )
   => ! [X8,X9,X10] :
        ( append_succeeds(X8,X9,X10)
       => ! [X11] :
            ( member_succeeds(X11,X10)
           => ( member_succeeds(X11,X8)
              | member_succeeds(X11,X9) ) ) ) ),
    inference(rectify,[],[f218]) ).

fof(f430,plain,
    ! [X0,X1,X3] :
      ( member_succeeds(X0,X3)
      | ~ member_succeeds(X0,cons(X1,X3))
      | X0 = X1 ),
    inference(ennf_transformation,[],[f240]) ).

fof(f431,plain,
    ! [X0,X1,X3] :
      ( member_succeeds(X0,X3)
      | ~ member_succeeds(X0,cons(X1,X3))
      | X0 = X1 ),
    inference(flattening,[],[f430]) ).

fof(f500,plain,
    ( ! [X8,X9,X10] :
        ( ! [X11] :
            ( member_succeeds(X11,X8)
            | member_succeeds(X11,X9)
            | ~ member_succeeds(X11,X10) )
        | ~ append_succeeds(X8,X9,X10) )
    | ? [X0,X1,X2] :
        ( ? [X7] :
            ( ~ member_succeeds(X7,X0)
            & ~ member_succeeds(X7,X1)
            & member_succeeds(X7,X2) )
        & ( ? [X3,X4,X5] :
              ( X0 = cons(X3,X4)
              & X2 = cons(X3,X5)
              & append_succeeds(X4,X1,X5)
              & ! [X6] :
                  ( member_succeeds(X6,X4)
                  | member_succeeds(X6,X1)
                  | ~ member_succeeds(X6,X5) ) )
          | ( X0 = nil
            & X2 = X1 ) ) ) ),
    inference(ennf_transformation,[],[f241]) ).

fof(f501,plain,
    ( ! [X8,X9,X10] :
        ( ! [X11] :
            ( member_succeeds(X11,X8)
            | member_succeeds(X11,X9)
            | ~ member_succeeds(X11,X10) )
        | ~ append_succeeds(X8,X9,X10) )
    | ? [X0,X1,X2] :
        ( ? [X7] :
            ( ~ member_succeeds(X7,X0)
            & ~ member_succeeds(X7,X1)
            & member_succeeds(X7,X2) )
        & ( ? [X3,X4,X5] :
              ( X0 = cons(X3,X4)
              & X2 = cons(X3,X5)
              & append_succeeds(X4,X1,X5)
              & ! [X6] :
                  ( member_succeeds(X6,X4)
                  | member_succeeds(X6,X1)
                  | ~ member_succeeds(X6,X5) ) )
          | ( X0 = nil
            & X2 = X1 ) ) ) ),
    inference(flattening,[],[f500]) ).

fof(f502,plain,
    ? [X0,X1,X2,X3] :
      ( ~ member_succeeds(X0,X1)
      & ~ member_succeeds(X0,X2)
      & append_succeeds(X1,X2,X3)
      & member_succeeds(X0,X3) ),
    inference(ennf_transformation,[],[f220]) ).

fof(f503,plain,
    ? [X0,X1,X2,X3] :
      ( ~ member_succeeds(X0,X1)
      & ~ member_succeeds(X0,X2)
      & append_succeeds(X1,X2,X3)
      & member_succeeds(X0,X3) ),
    inference(flattening,[],[f502]) ).

fof(f504,definition,
    ! [X0,X2,X1] :
      ( ? [X3,X4,X5] :
          ( X0 = cons(X3,X4)
          & X2 = cons(X3,X5)
          & append_succeeds(X4,X1,X5)
          & ! [X6] :
              ( member_succeeds(X6,X4)
              | member_succeeds(X6,X1)
              | ~ member_succeeds(X6,X5) ) )
      | ( X0 = nil
        & X2 = X1 )
      | ~ sP0(X0,X2,X1) ),
    introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).

fof(f505,plain,
    ( ! [X8,X9,X10] :
        ( ! [X11] :
            ( member_succeeds(X11,X8)
            | member_succeeds(X11,X9)
            | ~ member_succeeds(X11,X10) )
        | ~ append_succeeds(X8,X9,X10) )
    | ? [X0,X1,X2] :
        ( ? [X7] :
            ( ~ member_succeeds(X7,X0)
            & ~ member_succeeds(X7,X1)
            & member_succeeds(X7,X2) )
        & sP0(X0,X2,X1) ) ),
    inference(definition_folding,[],[f501,f504]) ).

fof(f542,plain,
    ! [X0,X1] :
      ( ( member_succeeds(X0,X1)
        | ( ! [X2,X3] :
              ( cons(X2,X3) != X1
              | ~ member_succeeds(X0,X3) )
          & ! [X4] : cons(X0,X4) != X1 ) )
      & ( ? [X2,X3] :
            ( X1 = cons(X2,X3)
            & member_succeeds(X0,X3) )
        | ? [X4] : X1 = cons(X0,X4)
        | ~ member_succeeds(X0,X1) ) ),
    inference(nnf_transformation,[],[f45]) ).

fof(f543,plain,
    ! [X0,X1] :
      ( ( member_succeeds(X0,X1)
        | ( ! [X2,X3] :
              ( cons(X2,X3) != X1
              | ~ member_succeeds(X0,X3) )
          & ! [X4] : cons(X0,X4) != X1 ) )
      & ( ? [X2,X3] :
            ( X1 = cons(X2,X3)
            & member_succeeds(X0,X3) )
        | ? [X4] : X1 = cons(X0,X4)
        | ~ member_succeeds(X0,X1) ) ),
    inference(flattening,[],[f542]) ).

fof(f544,plain,
    ! [X0,X1] :
      ( ( member_succeeds(X0,X1)
        | ( ! [X2,X3] :
              ( cons(X2,X3) != X1
              | ~ member_succeeds(X0,X3) )
          & ! [X4] : cons(X0,X4) != X1 ) )
      & ( ? [X5,X6] :
            ( cons(X5,X6) = X1
            & member_succeeds(X0,X6) )
        | ? [X7] : cons(X0,X7) = X1
        | ~ member_succeeds(X0,X1) ) ),
    inference(rectify,[],[f543]) ).

fof(f545,plain,
    ! [X0,X1] :
      ( ( member_succeeds(X0,X1)
        | ( ! [X2,X3] :
              ( cons(X2,X3) != X1
              | ~ member_succeeds(X0,X3) )
          & ! [X4] : cons(X0,X4) != X1 ) )
      & ( ( cons(sK28(X0,X1),sK29(X0,X1)) = X1
          & member_succeeds(X0,sK29(X0,X1)) )
        | cons(X0,sK30(X0,X1)) = X1
        | ~ member_succeeds(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK28,sK29,sK30]),skolemize(X5,sK28(X0,X1)),skolemize(X6,sK29(X0,X1)),skolemize(X7,sK30(X0,X1))],[f544]) ).

fof(f642,plain,
    ! [X0,X1,X2] :
      ( member_succeeds(X0,X2)
      | ~ member_succeeds(X0,cons(X1,X2))
      | X0 = X1 ),
    inference(rectify,[],[f431]) ).

fof(f647,plain,
    ! [X0,X2,X1] :
      ( ? [X3,X4,X5] :
          ( X0 = cons(X3,X4)
          & X2 = cons(X3,X5)
          & append_succeeds(X4,X1,X5)
          & ! [X6] :
              ( member_succeeds(X6,X4)
              | member_succeeds(X6,X1)
              | ~ member_succeeds(X6,X5) ) )
      | ( X0 = nil
        & X2 = X1 )
      | ~ sP0(X0,X2,X1) ),
    inference(nnf_transformation,[],[f504]) ).

fof(f648,plain,
    ! [X0,X1,X2] :
      ( ? [X3,X4,X5] :
          ( X0 = cons(X3,X4)
          & cons(X3,X5) = X1
          & append_succeeds(X4,X2,X5)
          & ! [X6] :
              ( member_succeeds(X6,X4)
              | member_succeeds(X6,X2)
              | ~ member_succeeds(X6,X5) ) )
      | ( X0 = nil
        & X2 = X1 )
      | ~ sP0(X0,X1,X2) ),
    inference(rectify,[],[f647]) ).

fof(f649,plain,
    ! [X0,X1,X2] :
      ( ( cons(sK91(X0,X1,X2),sK92(X0,X1,X2)) = X0
        & cons(sK91(X0,X1,X2),sK93(X0,X1,X2)) = X1
        & append_succeeds(sK92(X0,X1,X2),X2,sK93(X0,X1,X2))
        & ! [X6] :
            ( member_succeeds(X6,sK92(X0,X1,X2))
            | member_succeeds(X6,X2)
            | ~ member_succeeds(X6,sK93(X0,X1,X2)) ) )
      | ( X0 = nil
        & X2 = X1 )
      | ~ sP0(X0,X1,X2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK91,sK92,sK93]),skolemize(X3,sK91(X0,X1,X2)),skolemize(X4,sK92(X0,X1,X2)),skolemize(X5,sK93(X0,X1,X2))],[f648]) ).

fof(f650,plain,
    ( ! [X0,X1,X2] :
        ( ! [X3] :
            ( member_succeeds(X3,X0)
            | member_succeeds(X3,X1)
            | ~ member_succeeds(X3,X2) )
        | ~ append_succeeds(X0,X1,X2) )
    | ? [X4,X5,X6] :
        ( ? [X7] :
            ( ~ member_succeeds(X7,X4)
            & ~ member_succeeds(X7,X5)
            & member_succeeds(X7,X6) )
        & sP0(X4,X6,X5) ) ),
    inference(rectify,[],[f505]) ).

fof(f651,plain,
    ( ! [X0,X1,X2] :
        ( ! [X3] :
            ( member_succeeds(X3,X0)
            | member_succeeds(X3,X1)
            | ~ member_succeeds(X3,X2) )
        | ~ append_succeeds(X0,X1,X2) )
    | ( ~ member_succeeds(sK97,sK94)
      & ~ member_succeeds(sK97,sK95)
      & member_succeeds(sK97,sK96)
      & sP0(sK94,sK96,sK95) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK94,sK95,sK96,sK97]),skolemize(X4,sK94),skolemize(X5,sK95),skolemize(X6,sK96),skolemize(X7,sK97)],[f650]) ).

fof(f652,plain,
    ( ~ member_succeeds(sK98,sK99)
    & ~ member_succeeds(sK98,sK100)
    & append_succeeds(sK99,sK100,sK101)
    & member_succeeds(sK98,sK101) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK98,sK99,sK100,sK101]),skolemize(X0,sK98),skolemize(X1,sK99),skolemize(X2,sK100),skolemize(X3,sK101)],[f503]) ).

fof(f657,plain,
    ! [X0,X1] : nil != cons(X0,X1),
    inference(cnf_transformation,[],[f5]) ).

fof(f747,plain,
    ! [X0,X1,X4] :
      ( member_succeeds(X0,X1)
      | cons(X0,X4) != X1 ),
    inference(cnf_transformation,[],[f545]) ).

fof(f748,plain,
    ! [X2,X3,X0,X1] :
      ( member_succeeds(X0,X1)
      | cons(X2,X3) != X1
      | ~ member_succeeds(X0,X3) ),
    inference(cnf_transformation,[],[f545]) ).

fof(f973,plain,
    ! [X2,X0,X1] :
      ( ~ member_succeeds(X0,cons(X1,X2))
      | member_succeeds(X0,X2)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f642]) ).

fof(f1025,plain,
    ! [X2,X0,X1,X6] :
      ( ~ member_succeeds(X6,sK93(X0,X1,X2))
      | member_succeeds(X6,X2)
      | member_succeeds(X6,sK92(X0,X1,X2))
      | X1 = X2
      | ~ sP0(X0,X1,X2) ),
    inference(cnf_transformation,[],[f649]) ).

fof(f1030,plain,
    ! [X2,X0,X1] :
      ( ~ sP0(X0,X1,X2)
      | nil = X0
      | cons(sK91(X0,X1,X2),sK93(X0,X1,X2)) = X1 ),
    inference(cnf_transformation,[],[f649]) ).

fof(f1031,plain,
    ! [X2,X0,X1] :
      ( ~ sP0(X0,X1,X2)
      | X1 = X2
      | cons(sK91(X0,X1,X2),sK92(X0,X1,X2)) = X0 ),
    inference(cnf_transformation,[],[f649]) ).

fof(f1032,plain,
    ! [X2,X0,X1] :
      ( ~ sP0(X0,X1,X2)
      | nil = X0
      | cons(sK91(X0,X1,X2),sK92(X0,X1,X2)) = X0 ),
    inference(cnf_transformation,[],[f649]) ).

fof(f1033,plain,
    ! [X2,X3,X0,X1] :
      ( member_succeeds(X3,X0)
      | member_succeeds(X3,X1)
      | ~ member_succeeds(X3,X2)
      | ~ append_succeeds(X0,X1,X2)
      | sP0(sK94,sK96,sK95) ),
    inference(cnf_transformation,[],[f651]) ).

fof(f1034,plain,
    ! [X2,X3,X0,X1] :
      ( member_succeeds(X3,X0)
      | member_succeeds(X3,X1)
      | ~ member_succeeds(X3,X2)
      | ~ append_succeeds(X0,X1,X2)
      | member_succeeds(sK97,sK96) ),
    inference(cnf_transformation,[],[f651]) ).

fof(f1035,plain,
    ! [X2,X3,X0,X1] :
      ( member_succeeds(X3,X0)
      | member_succeeds(X3,X1)
      | ~ member_succeeds(X3,X2)
      | ~ append_succeeds(X0,X1,X2)
      | ~ member_succeeds(sK97,sK95) ),
    inference(cnf_transformation,[],[f651]) ).

fof(f1036,plain,
    ! [X2,X3,X0,X1] :
      ( member_succeeds(X3,X0)
      | member_succeeds(X3,X1)
      | ~ member_succeeds(X3,X2)
      | ~ append_succeeds(X0,X1,X2)
      | ~ member_succeeds(sK97,sK94) ),
    inference(cnf_transformation,[],[f651]) ).

fof(f1037,plain,
    member_succeeds(sK98,sK101),
    inference(cnf_transformation,[],[f652]) ).

fof(f1038,plain,
    append_succeeds(sK99,sK100,sK101),
    inference(cnf_transformation,[],[f652]) ).

fof(f1039,plain,
    ~ member_succeeds(sK98,sK100),
    inference(cnf_transformation,[],[f652]) ).

fof(f1040,plain,
    ~ member_succeeds(sK98,sK99),
    inference(cnf_transformation,[],[f652]) ).

fof(f1069,plain,
    ! [X2,X3,X0] :
      ( member_succeeds(X0,cons(X2,X3))
      | ~ member_succeeds(X0,X3) ),
    inference(equality_resolution,[],[f748]) ).

fof(f1070,plain,
    ! [X0,X4] : member_succeeds(X0,cons(X0,X4)),
    inference(equality_resolution,[],[f747]) ).

fof(f1129,definition,
    ( spl102_1
  <=> sP0(sK94,sK96,sK95) ),
    introduced(definition,[new_symbols(definition,[spl102_1])],[avatar_definition]) ).

fof(f1131,plain,
    ( sP0(sK94,sK96,sK95)
    | ~ spl102_1 ),
    inference(avatar_component_clause,[],[f1129]) ).

fof(f1133,definition,
    ( spl102_2
  <=> ! [X0,X3,X2,X1] :
        ( member_succeeds(X3,X0)
        | ~ append_succeeds(X0,X1,X2)
        | ~ member_succeeds(X3,X2)
        | member_succeeds(X3,X1) ) ),
    introduced(definition,[new_symbols(definition,[spl102_2])],[avatar_definition]) ).

fof(f1134,plain,
    ( ! [X2,X3,X0,X1] :
        ( ~ append_succeeds(X0,X1,X2)
        | member_succeeds(X3,X0)
        | ~ member_succeeds(X3,X2)
        | member_succeeds(X3,X1) )
    | ~ spl102_2 ),
    inference(avatar_component_clause,[],[f1133]) ).

fof(f1135,plain,
    ( spl102_1
    | spl102_2 ),
    inference(avatar_split_clause,[],[f1033,f1133,f1129]) ).

fof(f1137,definition,
    ( spl102_3
  <=> member_succeeds(sK97,sK96) ),
    introduced(definition,[new_symbols(definition,[spl102_3])],[avatar_definition]) ).

fof(f1139,plain,
    ( member_succeeds(sK97,sK96)
    | ~ spl102_3 ),
    inference(avatar_component_clause,[],[f1137]) ).

fof(f1140,plain,
    ( spl102_3
    | spl102_2 ),
    inference(avatar_split_clause,[],[f1034,f1133,f1137]) ).

fof(f1142,definition,
    ( spl102_4
  <=> member_succeeds(sK97,sK95) ),
    introduced(definition,[new_symbols(definition,[spl102_4])],[avatar_definition]) ).

fof(f1144,plain,
    ( ~ member_succeeds(sK97,sK95)
    | spl102_4 ),
    inference(avatar_component_clause,[],[f1142]) ).

fof(f1145,plain,
    ( ~ spl102_4
    | spl102_2 ),
    inference(avatar_split_clause,[],[f1035,f1133,f1142]) ).

fof(f1147,definition,
    ( spl102_5
  <=> member_succeeds(sK97,sK94) ),
    introduced(definition,[new_symbols(definition,[spl102_5])],[avatar_definition]) ).

fof(f1149,plain,
    ( ~ member_succeeds(sK97,sK94)
    | spl102_5 ),
    inference(avatar_component_clause,[],[f1147]) ).

fof(f1150,plain,
    ( ~ spl102_5
    | spl102_2 ),
    inference(avatar_split_clause,[],[f1036,f1133,f1147]) ).

fof(f1153,plain,
    ( ! [X0] :
        ( ~ member_succeeds(X0,sK101)
        | member_succeeds(X0,sK99)
        | member_succeeds(X0,sK100) )
    | ~ spl102_2 ),
    inference(resolution,[],[f1134,f1038]) ).

fof(f1154,plain,
    ( member_succeeds(sK98,sK99)
    | member_succeeds(sK98,sK100)
    | ~ spl102_2 ),
    inference(resolution,[],[f1153,f1037]) ).

fof(f1155,plain,
    ( member_succeeds(sK98,sK100)
    | ~ spl102_2 ),
    inference(forward_subsumption_resolution,[],[f1154,f1040]) ).

fof(f1156,plain,
    ( $false
    | ~ spl102_2 ),
    inference(forward_subsumption_resolution,[],[f1155,f1039]) ).

fof(f1157,plain,
    ~ spl102_2,
    inference(avatar_contradiction_clause,[],[f1156]) ).

fof(f1199,plain,
    ( nil = sK94
    | sK96 = cons(sK91(sK94,sK96,sK95),sK93(sK94,sK96,sK95))
    | ~ spl102_1 ),
    inference(resolution,[],[f1030,f1131]) ).

fof(f1201,definition,
    ( spl102_10
  <=> sK96 = cons(sK91(sK94,sK96,sK95),sK93(sK94,sK96,sK95)) ),
    introduced(definition,[new_symbols(definition,[spl102_10])],[avatar_definition]) ).

fof(f1203,plain,
    ( sK96 = cons(sK91(sK94,sK96,sK95),sK93(sK94,sK96,sK95))
    | ~ spl102_10 ),
    inference(avatar_component_clause,[],[f1201]) ).

fof(f1205,definition,
    ( spl102_11
  <=> nil = sK94 ),
    introduced(definition,[new_symbols(definition,[spl102_11])],[avatar_definition]) ).

fof(f1207,plain,
    ( nil = sK94
    | ~ spl102_11 ),
    inference(avatar_component_clause,[],[f1205]) ).

fof(f1208,plain,
    ( spl102_10
    | spl102_11
    | ~ spl102_1 ),
    inference(avatar_split_clause,[],[f1199,f1129,f1205,f1201]) ).

fof(f1210,plain,
    ( ! [X0] :
        ( member_succeeds(X0,sK93(sK94,sK96,sK95))
        | ~ member_succeeds(X0,sK96)
        | sK91(sK94,sK96,sK95) = X0 )
    | ~ spl102_10 ),
    inference(superposition,[],[f973,f1203]) ).

fof(f1213,plain,
    ( ! [X0] :
        ( ~ member_succeeds(X0,sK96)
        | sK91(sK94,sK96,sK95) = X0
        | member_succeeds(X0,sK95)
        | member_succeeds(X0,sK92(sK94,sK96,sK95))
        | sK95 = sK96
        | ~ sP0(sK94,sK96,sK95) )
    | ~ spl102_10 ),
    inference(resolution,[],[f1210,f1025]) ).

fof(f1216,plain,
    ( ! [X0] :
        ( ~ member_succeeds(X0,sK96)
        | sK91(sK94,sK96,sK95) = X0
        | member_succeeds(X0,sK95)
        | member_succeeds(X0,sK92(sK94,sK96,sK95))
        | sK95 = sK96 )
    | ~ spl102_1
    | ~ spl102_10 ),
    inference(forward_subsumption_resolution,[],[f1213,f1131]) ).

fof(f1218,definition,
    ( spl102_12
  <=> ! [X0] :
        ( ~ member_succeeds(X0,sK96)
        | member_succeeds(X0,sK92(sK94,sK96,sK95))
        | member_succeeds(X0,sK95)
        | sK91(sK94,sK96,sK95) = X0 ) ),
    introduced(definition,[new_symbols(definition,[spl102_12])],[avatar_definition]) ).

fof(f1219,plain,
    ( ! [X0] :
        ( member_succeeds(X0,sK92(sK94,sK96,sK95))
        | ~ member_succeeds(X0,sK96)
        | member_succeeds(X0,sK95)
        | sK91(sK94,sK96,sK95) = X0 )
    | ~ spl102_12 ),
    inference(avatar_component_clause,[],[f1218]) ).

fof(f1222,definition,
    ( spl102_13
  <=> sK95 = sK96 ),
    introduced(definition,[new_symbols(definition,[spl102_13])],[avatar_definition]) ).

fof(f1224,plain,
    ( sK95 = sK96
    | ~ spl102_13 ),
    inference(avatar_component_clause,[],[f1222]) ).

fof(f1225,plain,
    ( spl102_13
    | spl102_12
    | ~ spl102_1
    | ~ spl102_10 ),
    inference(avatar_split_clause,[],[f1216,f1201,f1129,f1218,f1222]) ).

fof(f1231,plain,
    ( nil = sK94
    | sK94 = cons(sK91(sK94,sK96,sK95),sK92(sK94,sK96,sK95))
    | ~ spl102_1 ),
    inference(resolution,[],[f1032,f1131]) ).

fof(f1233,definition,
    ( spl102_14
  <=> sK94 = cons(sK91(sK94,sK96,sK95),sK92(sK94,sK96,sK95)) ),
    introduced(definition,[new_symbols(definition,[spl102_14])],[avatar_definition]) ).

fof(f1235,plain,
    ( sK94 = cons(sK91(sK94,sK96,sK95),sK92(sK94,sK96,sK95))
    | ~ spl102_14 ),
    inference(avatar_component_clause,[],[f1233]) ).

fof(f1236,plain,
    ( spl102_14
    | spl102_11
    | ~ spl102_1 ),
    inference(avatar_split_clause,[],[f1231,f1129,f1205,f1233]) ).

fof(f1237,plain,
    ( sP0(nil,sK96,sK95)
    | ~ spl102_1
    | ~ spl102_11 ),
    inference(superposition,[],[f1131,f1207]) ).

fof(f1262,plain,
    ( sK95 = sK96
    | nil = cons(sK91(nil,sK96,sK95),sK92(nil,sK96,sK95))
    | ~ spl102_1
    | ~ spl102_11 ),
    inference(resolution,[],[f1031,f1237]) ).

fof(f1263,plain,
    ( sK95 = sK96
    | ~ spl102_1
    | ~ spl102_11 ),
    inference(forward_subsumption_resolution,[],[f1262,f657]) ).

fof(f1265,plain,
    ( spl102_13
    | ~ spl102_1
    | ~ spl102_11 ),
    inference(avatar_split_clause,[],[f1263,f1205,f1129,f1222]) ).

fof(f1267,plain,
    ( member_succeeds(sK91(sK94,sK96,sK95),sK94)
    | ~ spl102_14 ),
    inference(superposition,[],[f1070,f1235]) ).

fof(f1270,plain,
    ( ! [X0] :
        ( ~ member_succeeds(X0,sK92(sK94,sK96,sK95))
        | member_succeeds(X0,sK94) )
    | ~ spl102_14 ),
    inference(superposition,[],[f1069,f1235]) ).

fof(f1272,plain,
    ( ! [X0] :
        ( ~ member_succeeds(X0,sK96)
        | member_succeeds(X0,sK94)
        | member_succeeds(X0,sK95)
        | sK91(sK94,sK96,sK95) = X0 )
    | ~ spl102_12
    | ~ spl102_14 ),
    inference(resolution,[],[f1270,f1219]) ).

fof(f1274,plain,
    ( member_succeeds(sK97,sK94)
    | member_succeeds(sK97,sK95)
    | sK97 = sK91(sK94,sK96,sK95)
    | ~ spl102_3
    | ~ spl102_12
    | ~ spl102_14 ),
    inference(resolution,[],[f1272,f1139]) ).

fof(f1275,plain,
    ( member_succeeds(sK97,sK95)
    | sK97 = sK91(sK94,sK96,sK95)
    | ~ spl102_3
    | spl102_5
    | ~ spl102_12
    | ~ spl102_14 ),
    inference(forward_subsumption_resolution,[],[f1274,f1149]) ).

fof(f1276,plain,
    ( sK97 = sK91(sK94,sK96,sK95)
    | ~ spl102_3
    | spl102_4
    | spl102_5
    | ~ spl102_12
    | ~ spl102_14 ),
    inference(forward_subsumption_resolution,[],[f1275,f1144]) ).

fof(f1277,plain,
    ( member_succeeds(sK97,sK94)
    | ~ spl102_3
    | spl102_4
    | spl102_5
    | ~ spl102_12
    | ~ spl102_14 ),
    inference(superposition,[],[f1267,f1276]) ).

fof(f1281,plain,
    ( $false
    | ~ spl102_3
    | spl102_4
    | spl102_5
    | ~ spl102_12
    | ~ spl102_14 ),
    inference(forward_subsumption_resolution,[],[f1277,f1149]) ).

fof(f1282,plain,
    ( ~ spl102_3
    | spl102_4
    | spl102_5
    | ~ spl102_12
    | ~ spl102_14 ),
    inference(avatar_contradiction_clause,[],[f1281]) ).

fof(f1286,plain,
    ( member_succeeds(sK97,sK95)
    | ~ spl102_3
    | ~ spl102_13 ),
    inference(superposition,[],[f1139,f1224]) ).

fof(f1298,plain,
    ( $false
    | ~ spl102_3
    | spl102_4
    | ~ spl102_13 ),
    inference(forward_subsumption_resolution,[],[f1286,f1144]) ).

fof(f1299,plain,
    ( ~ spl102_3
    | spl102_4
    | ~ spl102_13 ),
    inference(avatar_contradiction_clause,[],[f1298]) ).

cnf(s1,plain,
    ( spl102_1
    | spl102_2 ),
    inference(sat_conversion,[],[f1135]) ).

cnf(s2,plain,
    ( spl102_2
    | spl102_3 ),
    inference(sat_conversion,[],[f1140]) ).

cnf(s3,plain,
    ( spl102_2
    | ~ spl102_4 ),
    inference(sat_conversion,[],[f1145]) ).

cnf(s4,plain,
    ( spl102_2
    | ~ spl102_5 ),
    inference(sat_conversion,[],[f1150]) ).

cnf(s5,plain,
    ~ spl102_2,
    inference(sat_conversion,[],[f1157]) ).

cnf(s9,plain,
    ( ~ spl102_1
    | spl102_10
    | spl102_11 ),
    inference(sat_conversion,[],[f1208]) ).

cnf(s11,plain,
    ( ~ spl102_1
    | ~ spl102_10
    | spl102_12
    | spl102_13 ),
    inference(sat_conversion,[],[f1225]) ).

cnf(s13,plain,
    ( ~ spl102_1
    | spl102_11
    | spl102_14 ),
    inference(sat_conversion,[],[f1236]) ).

cnf(s14,plain,
    ( ~ spl102_1
    | ~ spl102_11
    | spl102_13 ),
    inference(sat_conversion,[],[f1265]) ).

cnf(s16,plain,
    ( ~ spl102_3
    | spl102_4
    | spl102_5
    | ~ spl102_12
    | ~ spl102_14 ),
    inference(sat_conversion,[],[f1282]) ).

cnf(s19,plain,
    ( ~ spl102_3
    | spl102_4
    | ~ spl102_13 ),
    inference(sat_conversion,[],[f1299]) ).

cnf(s21,plain,
    ~ spl102_5,
    inference(rat,[],[s4,s5]) ).

cnf(s22,plain,
    ~ spl102_4,
    inference(rat,[],[s3,s5]) ).

cnf(s23,plain,
    spl102_3,
    inference(rat,[],[s2,s5]) ).

cnf(s24,plain,
    ~ spl102_13,
    inference(rat,[],[s19,s22,s23]) ).

cnf(s25,plain,
    spl102_1,
    inference(rat,[],[s1,s5]) ).

cnf(s26,plain,
    ~ spl102_11,
    inference(rat,[],[s14,s24,s25]) ).

cnf(s27,plain,
    spl102_10,
    inference(rat,[],[s9,s26,s25]) ).

cnf(s28,plain,
    spl102_14,
    inference(rat,[],[s13,s25,s26]) ).

cnf(s29,plain,
    spl102_12,
    inference(rat,[],[s11,s24,s25,s27]) ).

cnf(s30,plain,
    $false,
    inference(rat,[],[s16,s23,s22,s21,s28,s29]) ).

fof(f1302,plain,
    $false,
    inference(avatar_sat_refutation,[],[s30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWX024+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.17  % Computer : n009.cluster.edu
% 0.09/0.17  % Model    : x86_64 x86_64
% 0.09/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17  % Memory   : 8046.5625MB
% 0.09/0.17  % OS       : Linux 6.8.0-71-generic
% 0.09/0.17  % CPULimit : 300
% 0.09/0.17  % WCLimit  : 300
% 0.09/0.17  % DateTime : Mon Sep 28 14:52:00 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.21  Running first-order theorem proving
% 0.09/0.21  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.90/1.80  % (3119292)Detected formulas, will run a generic FOF schedule.
% 6.90/1.80  % (3119300)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2117936119:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.90/1.80  % (3119300)Refutation not found, incomplete strategy
% 6.90/1.80  % (3119300)------------------------------
% 6.90/1.80  % (3119300)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.90/1.80  % (3119300)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.90/1.80  % (3119300)CaDiCaL version: 2.1.3
% 6.90/1.80  % (3119300)Termination reason: Refutation not found, incomplete strategy
% 6.90/1.80  % (3119300)Time elapsed: 0.003 s
% 6.90/1.80  % (3119300)Peak memory usage: 89 MB
% 6.90/1.80  % (3119300)Instructions burned: 6 (million)
% 6.90/1.80  % (3119297)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3820389961:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.90/1.80  % (3119298)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=561158222:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.90/1.80  % (3119301)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1894643681:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.90/1.80  % (3119302)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=567976842:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.90/1.80  % (3119303)dis-21_1_sil=8000:lcm=predicate:random_seed=2422533700:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 6.90/1.80  % (3119299)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1950664001:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.90/1.80  % (3119301)Instruction limit reached! 
% 6.90/1.80  % (3119301)------------------------------
% 6.90/1.80  % (3119301)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.90/1.80  % (3119301)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.90/1.80  % (3119301)CaDiCaL version: 2.1.3
% 6.90/1.80  % (3119301)Termination reason: Instruction limit
% 6.90/1.80  % (3119301)Termination phase: Saturation
% 6.90/1.80  % (3119301)Time elapsed: 0.076 s
% 6.90/1.80  % (3119301)Peak memory usage: 88 MB
% 6.90/1.80  % (3119301)Instructions burned: 120 (million)
% 6.90/1.80  % (3119303)Instruction limit reached! 
% 6.90/1.80  % (3119303)------------------------------
% 6.90/1.80  % (3119303)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.90/1.80  % (3119303)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.90/1.80  % (3119303)CaDiCaL version: 2.1.3
% 6.90/1.80  % (3119303)Termination reason: Instruction limit
% 6.90/1.80  % (3119303)Termination phase: Saturation
% 6.90/1.80  % (3119303)Time elapsed: 0.079 s
% 6.90/1.80  % (3119303)Peak memory usage: 89 MB
% 6.90/1.80  % (3119303)Instructions burned: 130 (million)
% 6.90/1.80  % (3119300)------------------------------
% 6.90/1.80  % (3119300)------------------------------
% 6.90/1.80  % (3119302)Instruction limit reached! 
% 6.90/1.80  % (3119302)------------------------------
% 6.90/1.80  % (3119302)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.90/1.80  % (3119302)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.90/1.80  % (3119302)CaDiCaL version: 2.1.3
% 6.90/1.80  % (3119302)Termination reason: Instruction limit
% 6.90/1.80  % (3119302)Termination phase: Saturation
% 6.90/1.80  % (3119302)Time elapsed: 0.102 s
% 6.90/1.80  % (3119302)Peak memory usage: 90 MB
% 6.90/1.80  % (3119302)Instructions burned: 139 (million)
% 6.90/1.80  % (3119313)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2710232065:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 6.90/1.80  % (3119311)lrs+10_1_sil=8000:sp=occurrence:random_seed=2977810018:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 6.90/1.80  % (3119312)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3346600199:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 6.90/1.80  % (3119314)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=1771701961:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 6.90/1.80  % (3119312)Instruction limit reached! 
% 6.90/1.80  % (3119312)------------------------------
% 6.90/1.80  % (3119312)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.90/1.80  % (3119312)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.90/1.80  % (3119312)CaDiCaL version: 2.1.3
% 6.90/1.80  % (3119312)Termination reason: Instruction limit
% 6.90/1.80  % (3119312)Termination phase: Saturation
% 6.90/1.80  % (3119312)Time elapsed: 0.093 s
% 6.90/1.80  % (3119312)Peak memory usage: 91 MB
% 6.90/1.80  % (3119312)Instructions burned: 158 (million)
% 6.90/1.80  % (3119313)Instruction limit reached! 
% 6.90/1.80  % (3119313)------------------------------
% 6.90/1.80  % (3119313)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.90/1.80  % (3119313)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.90/1.80  % (3119313)CaDiCaL version: 2.1.3
% 6.90/1.80  % (3119313)Termination reason: Instruction limit
% 6.90/1.80  % (3119313)Termination phase: Saturation
% 6.90/1.80  % (3119313)Time elapsed: 0.120 s
% 6.90/1.80  % (3119313)Peak memory usage: 92 MB
% 6.90/1.80  % (3119313)Instructions burned: 326 (million)
% 6.90/1.80  % (3119314)Instruction limit reached! 
% 6.90/1.80  % (3119314)------------------------------
% 6.90/1.80  % (3119314)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.90/1.80  % (3119314)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.90/1.80  % (3119314)CaDiCaL version: 2.1.3
% 6.90/1.80  % (3119314)Termination reason: Instruction limit
% 6.90/1.80  % (3119314)Termination phase: Saturation
% 6.90/1.80  % (3119314)Time elapsed: 0.149 s
% 6.90/1.80  % (3119314)Peak memory usage: 92 MB
% 6.90/1.80  % (3119314)Instructions burned: 249 (million)
% 6.90/1.80  % (3119311)Instruction limit reached! 
% 6.90/1.80  % (3119311)------------------------------
% 6.90/1.80  % (3119311)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.90/1.80  % (3119311)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.90/1.80  % (3119311)CaDiCaL version: 2.1.3
% 6.90/1.80  % (3119311)Termination reason: Instruction limit
% 6.90/1.80  % (3119311)Termination phase: Saturation
% 6.90/1.80  % (3119311)Time elapsed: 0.182 s
% 6.90/1.80  % (3119311)Peak memory usage: 92 MB
% 6.90/1.80  % (3119311)Instructions burned: 285 (million)
% 6.90/1.80  % (3119320)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3368917032:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 6.90/1.80  % (3119319)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=29954801:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 6.90/1.80  % (3119319)Refutation not found, incomplete strategy
% 6.90/1.80  % (3119319)------------------------------
% 6.90/1.80  % (3119319)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.90/1.80  % (3119319)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.90/1.80  % (3119319)CaDiCaL version: 2.1.3
% 6.90/1.80  % (3119319)Termination reason: Refutation not found, incomplete strategy
% 6.90/1.80  % (3119319)Time elapsed: 0.010 s
% 6.90/1.80  % (3119319)Peak memory usage: 89 MB
% 6.90/1.80  % (3119319)Instructions burned: 14 (million)
% 6.90/1.80  % (3119322)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=2072388807:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 6.90/1.80  % (3119321)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=227755172:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 6.90/1.80  % (3119322)Instruction limit reached! 
% 6.90/1.80  % (3119322)------------------------------
% 6.90/1.80  % (3119322)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.90/1.80  % (3119322)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.90/1.80  % (3119322)CaDiCaL version: 2.1.3
% 6.90/1.80  % (3119322)Termination reason: Instruction limit
% 6.90/1.80  % (3119322)Termination phase: Saturation
% 6.90/1.80  % (3119322)Time elapsed: 0.068 s
% 6.90/1.80  % (3119322)Peak memory usage: 89 MB
% 6.90/1.80  % (3119322)Instructions burned: 128 (million)
% 6.90/1.80  % (3119321)Instruction limit reached! 
% 6.90/1.80  % (3119321)------------------------------
% 6.90/1.80  % (3119321)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.90/1.80  % (3119321)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.90/1.80  % (3119321)CaDiCaL version: 2.1.3
% 6.90/1.80  % (3119321)Termination reason: Instruction limit
% 6.90/1.80  % (3119321)Termination phase: Saturation
% 6.90/1.80  % (3119321)Time elapsed: 0.075 s
% 6.90/1.80  % (3119321)Peak memory usage: 90 MB
% 6.90/1.80  % (3119321)Instructions burned: 113 (million)
% 6.90/1.80  % (3119297)First to succeed.
% 6.90/1.80  % (3119319)------------------------------
% 6.90/1.80  % (3119319)------------------------------
% 6.90/1.80  % (3119297)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3119292"
% 6.90/1.80  % (3119298)Also succeeded, but the first one will report.
% 6.90/1.80  % (3119327)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=3178376207:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2991 on theBenchmark for (2991ds/114Mi)
% 6.90/1.80  % (3119328)lrs+10_1_sil=8000:sp=occurrence:random_seed=3347613089:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2991 on theBenchmark for (2991ds/907Mi)
% 6.90/1.80  % (3119327)Instruction limit reached! 
% 6.90/1.80  % (3119327)------------------------------
% 6.90/1.80  % (3119327)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.90/1.80  % (3119327)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.90/1.80  % (3119327)CaDiCaL version: 2.1.3
% 6.90/1.80  % (3119327)Termination reason: Instruction limit
% 6.90/1.80  % (3119327)Termination phase: Saturation
% 6.90/1.80  % (3119327)Time elapsed: 0.062 s
% 6.90/1.80  % (3119327)Peak memory usage: 89 MB
% 6.90/1.80  % (3119327)Instructions burned: 115 (million)
% 6.90/1.80  % (3119320)Also succeeded, but the first one will report.
% 6.90/1.80  % (3119329)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=337594259:i=437:sd=1:aac=none:ss=included_2991 on theBenchmark for (2991ds/437Mi)
% 6.90/1.80  % (3119297)Refutation found. Thanks to Tanya!
% 6.90/1.80  % SZS status Theorem for theBenchmark
% 6.90/1.80  % SZS output start Proof for theBenchmark
% See solution above
% 8.64/1.99  % (3119297)------------------------------
% 8.64/1.99  % (3119297)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.64/1.99  % (3119297)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.64/1.99  % (3119297)CaDiCaL version: 2.1.3
% 8.64/1.99  % (3119297)Termination reason: Refutation
% 8.64/1.99  % (3119297)Time elapsed: 0.700 s
% 8.64/1.99  % (3119297)Peak memory usage: 133 MB
% 8.64/1.99  % (3119297)Instructions burned: 1058 (million)
% 8.64/1.99  % (3119297)------------------------------
% 8.64/1.99  % (3119297)------------------------------
% 8.64/1.99  % (3119292)Success in time 1.153 s
% 8.64/1.99  % Vampire exiting
%------------------------------------------------------------------------------