↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWX030+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 : n026.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:42 PM UTC 2026

% Result   : Theorem 11.35s 2.80s
% Output   : Refutation 15.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   23
% Syntax   : Number of formulae    :  161 (  19 unt;  10 def)
%            Number of atoms       :  517 ( 118 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  577 ( 221   ~; 251   |;  80   &)
%                                         (  10 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   15 (  13 usr;   9 prp; 0-3 aty)
%            Number of functors    :   18 (  18 usr;   8 con; 0-3 aty)
%            Number of variables   :  256 (   0 sgn 209   !;  47   ?)

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

fof(f8,axiom,
    ! [X0,X1,X2,X3] :
      ( cons(X0,X1) = cons(X2,X3)
     => X1 = X3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',id8) ).

fof(f91,axiom,
    ! [X0,X1] :
      ( permutation_succeeds(X0,X1)
    <=> ( ? [X2,X3,X4] :
            ( X1 = cons(X2,X3)
            & delete_succeeds(X2,X0,X4)
            & permutation_succeeds(X4,X3) )
        | ( X0 = nil
          & X1 = nil ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',id91) ).

fof(f106,axiom,
    ! [X0] :
      ( list_succeeds(X0)
    <=> ( ? [X1,X2] :
            ( X0 = cons(X1,X2)
            & list_succeeds(X2) )
        | X0 = nil ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',id106) ).

fof(f248,axiom,
    ! [X0] : '**'(nil,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','axiom-(app:nil)') ).

fof(f304,axiom,
    ! [X0,X1,X2] :
      ( list_succeeds(X1)
     => delete_succeeds(X0,'**'(X1,cons(X0,X2)),'**'(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','axiom-(delete:app:1)') ).

fof(f313,axiom,
    ! [X0,X1] :
      ( permutation_succeeds(X0,X1)
     => ( list_succeeds(X0)
        & list_succeeds(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','axiom-(permutation:types)') ).

fof(f342,axiom,
    ! [X0,X1] :
      ( permutation_succeeds(X0,X1)
     => permutation_succeeds(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','axiom-(permutation:symmetric)') ).

fof(f343,axiom,
    ! [X0,X1,X2] :
      ( ( permutation_succeeds(X0,X1)
        & permutation_succeeds(X1,X2) )
     => permutation_succeeds(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','axiom-(permutation:transitive)') ).

fof(f345,axiom,
    ! [X0,X1] :
      ( ( list_succeeds(X0)
        & list_succeeds(X1) )
     => permutation_succeeds('**'(X0,X1),'**'(X1,X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','axiom-(permutation:app:commutative)') ).

fof(f365,axiom,
    ! [X0,X1,X2] :
      ( split_succeeds(X0,X1,X2)
     => ( list_succeeds(X0)
        & list_succeeds(X1)
        & list_succeeds(X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','lemma-(split:types)') ).

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

fof(f382,conjecture,
    ! [X0,X1,X2] :
      ( split_succeeds(X0,X1,X2)
     => permutation_succeeds(X0,'**'(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','lemma-(split:permutation)') ).

fof(f383,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( split_succeeds(X0,X1,X2)
       => permutation_succeeds(X0,'**'(X1,X2)) ),
    inference(negated_conjecture,[status(cth)],[f382]) ).

fof(f416,plain,
    ( ! [X0,X1,X2] :
        ( ( ? [X3,X4,X5] :
              ( X0 = cons(X3,X4)
              & X1 = cons(X3,X5)
              & split_succeeds(X4,X2,X5)
              & permutation_succeeds(X4,'**'(X2,X5)) )
          | ( X0 = nil
            & X1 = nil
            & X2 = nil ) )
       => permutation_succeeds(X0,'**'(X1,X2)) )
   => ! [X6,X7,X8] :
        ( split_succeeds(X6,X7,X8)
       => permutation_succeeds(X6,'**'(X7,X8)) ) ),
    inference(rectify,[],[f381]) ).

fof(f418,plain,
    ! [X0,X1,X2,X3] :
      ( X1 = X3
      | cons(X0,X1) != cons(X2,X3) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f745,plain,
    ! [X0,X1,X2] :
      ( delete_succeeds(X0,'**'(X1,cons(X0,X2)),'**'(X1,X2))
      | ~ list_succeeds(X1) ),
    inference(ennf_transformation,[],[f304]) ).

fof(f759,plain,
    ! [X0,X1] :
      ( ( list_succeeds(X0)
        & list_succeeds(X1) )
      | ~ permutation_succeeds(X0,X1) ),
    inference(ennf_transformation,[],[f313]) ).

fof(f806,plain,
    ! [X0,X1] :
      ( permutation_succeeds(X1,X0)
      | ~ permutation_succeeds(X0,X1) ),
    inference(ennf_transformation,[],[f342]) ).

fof(f807,plain,
    ! [X0,X1,X2] :
      ( permutation_succeeds(X0,X2)
      | ~ permutation_succeeds(X0,X1)
      | ~ permutation_succeeds(X1,X2) ),
    inference(ennf_transformation,[],[f343]) ).

fof(f808,plain,
    ! [X0,X1,X2] :
      ( permutation_succeeds(X0,X2)
      | ~ permutation_succeeds(X0,X1)
      | ~ permutation_succeeds(X1,X2) ),
    inference(flattening,[],[f807]) ).

fof(f811,plain,
    ! [X0,X1] :
      ( permutation_succeeds('**'(X0,X1),'**'(X1,X0))
      | ~ list_succeeds(X0)
      | ~ list_succeeds(X1) ),
    inference(ennf_transformation,[],[f345]) ).

fof(f812,plain,
    ! [X0,X1] :
      ( permutation_succeeds('**'(X0,X1),'**'(X1,X0))
      | ~ list_succeeds(X0)
      | ~ list_succeeds(X1) ),
    inference(flattening,[],[f811]) ).

fof(f841,plain,
    ! [X0,X1,X2] :
      ( ( list_succeeds(X0)
        & list_succeeds(X1)
        & list_succeeds(X2) )
      | ~ split_succeeds(X0,X1,X2) ),
    inference(ennf_transformation,[],[f365]) ).

fof(f866,plain,
    ( ! [X6,X7,X8] :
        ( permutation_succeeds(X6,'**'(X7,X8))
        | ~ split_succeeds(X6,X7,X8) )
    | ? [X0,X1,X2] :
        ( ~ permutation_succeeds(X0,'**'(X1,X2))
        & ( ? [X3,X4,X5] :
              ( X0 = cons(X3,X4)
              & X1 = cons(X3,X5)
              & split_succeeds(X4,X2,X5)
              & permutation_succeeds(X4,'**'(X2,X5)) )
          | ( X0 = nil
            & X1 = nil
            & X2 = nil ) ) ) ),
    inference(ennf_transformation,[],[f416]) ).

fof(f867,plain,
    ? [X0,X1,X2] :
      ( ~ permutation_succeeds(X0,'**'(X1,X2))
      & split_succeeds(X0,X1,X2) ),
    inference(ennf_transformation,[],[f383]) ).

fof(f897,definition,
    ! [X0,X1,X2] :
      ( ? [X3,X4,X5] :
          ( X0 = cons(X3,X4)
          & X1 = cons(X3,X5)
          & split_succeeds(X4,X2,X5)
          & permutation_succeeds(X4,'**'(X2,X5)) )
      | ~ sP17(X0,X1,X2) ),
    introduced(definition,[new_symbols(definition,[sP17])],[predicate_definition_introduction]) ).

fof(f898,plain,
    ( ! [X6,X7,X8] :
        ( permutation_succeeds(X6,'**'(X7,X8))
        | ~ split_succeeds(X6,X7,X8) )
    | ? [X0,X1,X2] :
        ( ~ permutation_succeeds(X0,'**'(X1,X2))
        & ( sP17(X0,X1,X2)
          | ( X0 = nil
            & X1 = nil
            & X2 = nil ) ) ) ),
    inference(definition_folding,[],[f866,f897]) ).

fof(f1024,plain,
    ! [X0,X1] :
      ( ( permutation_succeeds(X0,X1)
        | ( ! [X2,X3,X4] :
              ( cons(X2,X3) != X1
              | ~ delete_succeeds(X2,X0,X4)
              | ~ permutation_succeeds(X4,X3) )
          & ( nil != X0
            | nil != X1 ) ) )
      & ( ? [X2,X3,X4] :
            ( X1 = cons(X2,X3)
            & delete_succeeds(X2,X0,X4)
            & permutation_succeeds(X4,X3) )
        | ( X0 = nil
          & X1 = nil )
        | ~ permutation_succeeds(X0,X1) ) ),
    inference(nnf_transformation,[],[f91]) ).

fof(f1025,plain,
    ! [X0,X1] :
      ( ( permutation_succeeds(X0,X1)
        | ( ! [X2,X3,X4] :
              ( cons(X2,X3) != X1
              | ~ delete_succeeds(X2,X0,X4)
              | ~ permutation_succeeds(X4,X3) )
          & ( nil != X0
            | nil != X1 ) ) )
      & ( ? [X2,X3,X4] :
            ( X1 = cons(X2,X3)
            & delete_succeeds(X2,X0,X4)
            & permutation_succeeds(X4,X3) )
        | ( X0 = nil
          & X1 = nil )
        | ~ permutation_succeeds(X0,X1) ) ),
    inference(flattening,[],[f1024]) ).

fof(f1026,plain,
    ! [X0,X1] :
      ( ( permutation_succeeds(X0,X1)
        | ( ! [X2,X3,X4] :
              ( cons(X2,X3) != X1
              | ~ delete_succeeds(X2,X0,X4)
              | ~ permutation_succeeds(X4,X3) )
          & ( nil != X0
            | nil != X1 ) ) )
      & ( ? [X5,X6,X7] :
            ( cons(X5,X6) = X1
            & delete_succeeds(X5,X0,X7)
            & permutation_succeeds(X7,X6) )
        | ( X0 = nil
          & X1 = nil )
        | ~ permutation_succeeds(X0,X1) ) ),
    inference(rectify,[],[f1025]) ).

fof(f1027,plain,
    ! [X0,X1] :
      ( ( permutation_succeeds(X0,X1)
        | ( ! [X2,X3,X4] :
              ( cons(X2,X3) != X1
              | ~ delete_succeeds(X2,X0,X4)
              | ~ permutation_succeeds(X4,X3) )
          & ( nil != X0
            | nil != X1 ) ) )
      & ( ( cons(sK124(X0,X1),sK125(X0,X1)) = X1
          & delete_succeeds(sK124(X0,X1),X0,sK126(X0,X1))
          & permutation_succeeds(sK126(X0,X1),sK125(X0,X1)) )
        | ( X0 = nil
          & X1 = nil )
        | ~ permutation_succeeds(X0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK124,sK125,sK126]),skolemize(X5,sK124(X0,X1)),skolemize(X6,sK125(X0,X1)),skolemize(X7,sK126(X0,X1))],[f1026]) ).

fof(f1079,plain,
    ! [X0] :
      ( ( list_succeeds(X0)
        | ( ! [X1,X2] :
              ( cons(X1,X2) != X0
              | ~ list_succeeds(X2) )
          & nil != X0 ) )
      & ( ? [X1,X2] :
            ( X0 = cons(X1,X2)
            & list_succeeds(X2) )
        | X0 = nil
        | ~ list_succeeds(X0) ) ),
    inference(nnf_transformation,[],[f106]) ).

fof(f1080,plain,
    ! [X0] :
      ( ( list_succeeds(X0)
        | ( ! [X1,X2] :
              ( cons(X1,X2) != X0
              | ~ list_succeeds(X2) )
          & nil != X0 ) )
      & ( ? [X1,X2] :
            ( X0 = cons(X1,X2)
            & list_succeeds(X2) )
        | X0 = nil
        | ~ list_succeeds(X0) ) ),
    inference(flattening,[],[f1079]) ).

fof(f1081,plain,
    ! [X0] :
      ( ( list_succeeds(X0)
        | ( ! [X1,X2] :
              ( cons(X1,X2) != X0
              | ~ list_succeeds(X2) )
          & nil != X0 ) )
      & ( ? [X3,X4] :
            ( cons(X3,X4) = X0
            & list_succeeds(X4) )
        | X0 = nil
        | ~ list_succeeds(X0) ) ),
    inference(rectify,[],[f1080]) ).

fof(f1082,plain,
    ! [X0] :
      ( ( list_succeeds(X0)
        | ( ! [X1,X2] :
              ( cons(X1,X2) != X0
              | ~ list_succeeds(X2) )
          & nil != X0 ) )
      & ( ( cons(sK168(X0),sK169(X0)) = X0
          & list_succeeds(sK169(X0)) )
        | X0 = nil
        | ~ list_succeeds(X0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK168,sK169]),skolemize(X3,sK168(X0)),skolemize(X4,sK169(X0))],[f1081]) ).

fof(f1189,plain,
    ! [X0,X1,X2] :
      ( ? [X3,X4,X5] :
          ( X0 = cons(X3,X4)
          & X1 = cons(X3,X5)
          & split_succeeds(X4,X2,X5)
          & permutation_succeeds(X4,'**'(X2,X5)) )
      | ~ sP17(X0,X1,X2) ),
    inference(nnf_transformation,[],[f897]) ).

fof(f1190,plain,
    ! [X0,X1,X2] :
      ( ( cons(sK238(X0,X1,X2),sK239(X0,X1,X2)) = X0
        & cons(sK238(X0,X1,X2),sK240(X0,X1,X2)) = X1
        & split_succeeds(sK239(X0,X1,X2),X2,sK240(X0,X1,X2))
        & permutation_succeeds(sK239(X0,X1,X2),'**'(X2,sK240(X0,X1,X2))) )
      | ~ sP17(X0,X1,X2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK238,sK239,sK240]),skolemize(X3,sK238(X0,X1,X2)),skolemize(X4,sK239(X0,X1,X2)),skolemize(X5,sK240(X0,X1,X2))],[f1189]) ).

fof(f1191,plain,
    ( ! [X0,X1,X2] :
        ( permutation_succeeds(X0,'**'(X1,X2))
        | ~ split_succeeds(X0,X1,X2) )
    | ? [X3,X4,X5] :
        ( ~ permutation_succeeds(X3,'**'(X4,X5))
        & ( sP17(X3,X4,X5)
          | ( nil = X3
            & nil = X4
            & nil = X5 ) ) ) ),
    inference(rectify,[],[f898]) ).

fof(f1192,plain,
    ( ! [X0,X1,X2] :
        ( permutation_succeeds(X0,'**'(X1,X2))
        | ~ split_succeeds(X0,X1,X2) )
    | ( ~ permutation_succeeds(sK241,'**'(sK242,sK243))
      & ( sP17(sK241,sK242,sK243)
        | ( nil = sK241
          & nil = sK242
          & nil = sK243 ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK241,sK242,sK243]),skolemize(X3,sK241),skolemize(X4,sK242),skolemize(X5,sK243)],[f1191]) ).

fof(f1193,plain,
    ( ~ permutation_succeeds(sK244,'**'(sK245,sK246))
    & split_succeeds(sK244,sK245,sK246) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK244,sK245,sK246]),skolemize(X0,sK244),skolemize(X1,sK245),skolemize(X2,sK246)],[f867]) ).

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

fof(f1201,plain,
    ! [X2,X3,X0,X1] :
      ( cons(X0,X1) != cons(X2,X3)
      | X1 = X3 ),
    inference(cnf_transformation,[],[f418]) ).

fof(f1501,plain,
    ! [X0,X1] :
      ( permutation_succeeds(X0,X1)
      | nil != X0
      | nil != X1 ),
    inference(cnf_transformation,[],[f1027]) ).

fof(f1502,plain,
    ! [X2,X3,X0,X1,X4] :
      ( permutation_succeeds(X0,X1)
      | cons(X2,X3) != X1
      | ~ delete_succeeds(X2,X0,X4)
      | ~ permutation_succeeds(X4,X3) ),
    inference(cnf_transformation,[],[f1027]) ).

fof(f1582,plain,
    ! [X0] :
      ( ~ list_succeeds(X0)
      | nil = X0
      | cons(sK168(X0),sK169(X0)) = X0 ),
    inference(cnf_transformation,[],[f1082]) ).

fof(f1584,plain,
    ! [X2,X0,X1] :
      ( list_succeeds(X0)
      | cons(X1,X2) != X0
      | ~ list_succeeds(X2) ),
    inference(cnf_transformation,[],[f1082]) ).

fof(f1816,plain,
    ! [X0] : '**'(nil,X0) = X0,
    inference(cnf_transformation,[],[f248]) ).

fof(f1874,plain,
    ! [X2,X0,X1] :
      ( delete_succeeds(X0,'**'(X1,cons(X0,X2)),'**'(X1,X2))
      | ~ list_succeeds(X1) ),
    inference(cnf_transformation,[],[f745]) ).

fof(f1887,plain,
    ! [X0,X1] :
      ( ~ permutation_succeeds(X0,X1)
      | list_succeeds(X1) ),
    inference(cnf_transformation,[],[f759]) ).

fof(f1918,plain,
    ! [X0,X1] :
      ( ~ permutation_succeeds(X0,X1)
      | permutation_succeeds(X1,X0) ),
    inference(cnf_transformation,[],[f806]) ).

fof(f1919,plain,
    ! [X2,X0,X1] :
      ( ~ permutation_succeeds(X1,X2)
      | ~ permutation_succeeds(X0,X1)
      | permutation_succeeds(X0,X2) ),
    inference(cnf_transformation,[],[f808]) ).

fof(f1921,plain,
    ! [X0,X1] :
      ( permutation_succeeds('**'(X0,X1),'**'(X1,X0))
      | ~ list_succeeds(X0)
      | ~ list_succeeds(X1) ),
    inference(cnf_transformation,[],[f812]) ).

fof(f1948,plain,
    ! [X2,X0,X1] :
      ( ~ split_succeeds(X0,X1,X2)
      | list_succeeds(X2) ),
    inference(cnf_transformation,[],[f841]) ).

fof(f1949,plain,
    ! [X2,X0,X1] :
      ( ~ split_succeeds(X0,X1,X2)
      | list_succeeds(X1) ),
    inference(cnf_transformation,[],[f841]) ).

fof(f1968,plain,
    ! [X2,X0,X1] :
      ( permutation_succeeds(sK239(X0,X1,X2),'**'(X2,sK240(X0,X1,X2)))
      | ~ sP17(X0,X1,X2) ),
    inference(cnf_transformation,[],[f1190]) ).

fof(f1969,plain,
    ! [X2,X0,X1] :
      ( split_succeeds(sK239(X0,X1,X2),X2,sK240(X0,X1,X2))
      | ~ sP17(X0,X1,X2) ),
    inference(cnf_transformation,[],[f1190]) ).

fof(f1970,plain,
    ! [X2,X0,X1] :
      ( ~ sP17(X0,X1,X2)
      | cons(sK238(X0,X1,X2),sK240(X0,X1,X2)) = X1 ),
    inference(cnf_transformation,[],[f1190]) ).

fof(f1971,plain,
    ! [X2,X0,X1] :
      ( ~ sP17(X0,X1,X2)
      | cons(sK238(X0,X1,X2),sK239(X0,X1,X2)) = X0 ),
    inference(cnf_transformation,[],[f1190]) ).

fof(f1972,plain,
    ! [X2,X0,X1] :
      ( permutation_succeeds(X0,'**'(X1,X2))
      | ~ split_succeeds(X0,X1,X2)
      | sP17(sK241,sK242,sK243)
      | nil = sK243 ),
    inference(cnf_transformation,[],[f1192]) ).

fof(f1973,plain,
    ! [X2,X0,X1] :
      ( permutation_succeeds(X0,'**'(X1,X2))
      | ~ split_succeeds(X0,X1,X2)
      | sP17(sK241,sK242,sK243)
      | nil = sK242 ),
    inference(cnf_transformation,[],[f1192]) ).

fof(f1974,plain,
    ! [X2,X0,X1] :
      ( permutation_succeeds(X0,'**'(X1,X2))
      | ~ split_succeeds(X0,X1,X2)
      | sP17(sK241,sK242,sK243)
      | nil = sK241 ),
    inference(cnf_transformation,[],[f1192]) ).

fof(f1975,plain,
    ! [X2,X0,X1] :
      ( permutation_succeeds(X0,'**'(X1,X2))
      | ~ split_succeeds(X0,X1,X2)
      | ~ permutation_succeeds(sK241,'**'(sK242,sK243)) ),
    inference(cnf_transformation,[],[f1192]) ).

fof(f1976,plain,
    split_succeeds(sK244,sK245,sK246),
    inference(cnf_transformation,[],[f1193]) ).

fof(f1977,plain,
    ~ permutation_succeeds(sK244,'**'(sK245,sK246)),
    inference(cnf_transformation,[],[f1193]) ).

fof(f2077,plain,
    ! [X2,X3,X0,X4] :
      ( ~ delete_succeeds(X2,X0,X4)
      | permutation_succeeds(X0,cons(X2,X3))
      | ~ permutation_succeeds(X4,X3) ),
    inference(equality_resolution,[],[f1502]) ).

fof(f2078,plain,
    ! [X1] :
      ( permutation_succeeds(nil,X1)
      | nil != X1 ),
    inference(equality_resolution,[],[f1501]) ).

fof(f2079,plain,
    permutation_succeeds(nil,nil),
    inference(equality_resolution,[],[f2078]) ).

fof(f2118,plain,
    ! [X2,X1] :
      ( list_succeeds(cons(X1,X2))
      | ~ list_succeeds(X2) ),
    inference(equality_resolution,[],[f1584]) ).

fof(f2177,definition,
    sF247 = '**'(sK245,sK246),
    introduced(definition,[new_symbols(definition,[sF247])],[function_definition]) ).

fof(f2178,plain,
    '**'(sK245,sK246) = sF247,
    inference(reorient_equations,[],[f2177]) ).

fof(f2179,plain,
    ~ permutation_succeeds(sK244,sF247),
    inference(definition_folding,[],[f1977,f2178]) ).

fof(f2181,definition,
    ( spl248_1
  <=> nil = sK243 ),
    introduced(definition,[new_symbols(definition,[spl248_1])],[avatar_definition]) ).

fof(f2183,plain,
    ( nil = sK243
    | ~ spl248_1 ),
    inference(avatar_component_clause,[],[f2181]) ).

fof(f2185,definition,
    ( spl248_2
  <=> sP17(sK241,sK242,sK243) ),
    introduced(definition,[new_symbols(definition,[spl248_2])],[avatar_definition]) ).

fof(f2187,plain,
    ( sP17(sK241,sK242,sK243)
    | ~ spl248_2 ),
    inference(avatar_component_clause,[],[f2185]) ).

fof(f2189,definition,
    ( spl248_3
  <=> ! [X2,X0,X1] :
        ( permutation_succeeds(X0,'**'(X1,X2))
        | ~ split_succeeds(X0,X1,X2) ) ),
    introduced(definition,[new_symbols(definition,[spl248_3])],[avatar_definition]) ).

fof(f2190,plain,
    ( ! [X2,X0,X1] :
        ( permutation_succeeds(X0,'**'(X1,X2))
        | ~ split_succeeds(X0,X1,X2) )
    | ~ spl248_3 ),
    inference(avatar_component_clause,[],[f2189]) ).

fof(f2191,plain,
    ( spl248_1
    | spl248_2
    | spl248_3 ),
    inference(avatar_split_clause,[],[f1972,f2189,f2185,f2181]) ).

fof(f2193,definition,
    ( spl248_4
  <=> nil = sK242 ),
    introduced(definition,[new_symbols(definition,[spl248_4])],[avatar_definition]) ).

fof(f2195,plain,
    ( nil = sK242
    | ~ spl248_4 ),
    inference(avatar_component_clause,[],[f2193]) ).

fof(f2196,plain,
    ( spl248_4
    | spl248_2
    | spl248_3 ),
    inference(avatar_split_clause,[],[f1973,f2189,f2185,f2193]) ).

fof(f2198,definition,
    ( spl248_5
  <=> nil = sK241 ),
    introduced(definition,[new_symbols(definition,[spl248_5])],[avatar_definition]) ).

fof(f2199,plain,
    ( nil != sK241
    | spl248_5 ),
    inference(avatar_component_clause,[],[f2198]) ).

fof(f2200,plain,
    ( nil = sK241
    | ~ spl248_5 ),
    inference(avatar_component_clause,[],[f2198]) ).

fof(f2201,plain,
    ( spl248_5
    | spl248_2
    | spl248_3 ),
    inference(avatar_split_clause,[],[f1974,f2189,f2185,f2198]) ).

fof(f2203,definition,
    ( spl248_6
  <=> permutation_succeeds(sK241,'**'(sK242,sK243)) ),
    introduced(definition,[new_symbols(definition,[spl248_6])],[avatar_definition]) ).

fof(f2205,plain,
    ( ~ permutation_succeeds(sK241,'**'(sK242,sK243))
    | spl248_6 ),
    inference(avatar_component_clause,[],[f2203]) ).

fof(f2206,plain,
    ( ~ spl248_6
    | spl248_3 ),
    inference(avatar_split_clause,[],[f1975,f2189,f2203]) ).

fof(f2277,plain,
    ! [X2,X0,X1] :
      ( ~ sP17(X0,X1,X2)
      | list_succeeds(X2) ),
    inference(resolution,[],[f1969,f1949]) ).

fof(f2349,plain,
    ( list_succeeds(sK243)
    | ~ spl248_2 ),
    inference(resolution,[],[f2277,f2187]) ).

fof(f2425,plain,
    ! [X2,X0,X1] :
      ( permutation_succeeds('**'(X0,sK240(X1,X2,X0)),sK239(X1,X2,X0))
      | ~ sP17(X1,X2,X0) ),
    inference(resolution,[],[f1918,f1968]) ).

fof(f2449,definition,
    ( spl248_28
  <=> list_succeeds(sK241) ),
    introduced(definition,[new_symbols(definition,[spl248_28])],[avatar_definition]) ).

fof(f2450,plain,
    ( list_succeeds(sK241)
    | ~ spl248_28 ),
    inference(avatar_component_clause,[],[f2449]) ).

fof(f2451,plain,
    ( ~ list_succeeds(sK241)
    | spl248_28 ),
    inference(avatar_component_clause,[],[f2449]) ).

fof(f2458,definition,
    ( spl248_30
  <=> list_succeeds(sK242) ),
    introduced(definition,[new_symbols(definition,[spl248_30])],[avatar_definition]) ).

fof(f2459,plain,
    ( list_succeeds(sK242)
    | ~ spl248_30 ),
    inference(avatar_component_clause,[],[f2458]) ).

fof(f2460,plain,
    ( ~ list_succeeds(sK242)
    | spl248_30 ),
    inference(avatar_component_clause,[],[f2458]) ).

fof(f3066,plain,
    ! [X2,X0,X1] :
      ( ~ permutation_succeeds(X0,'**'(X1,X2))
      | permutation_succeeds(X0,'**'(X2,X1))
      | ~ list_succeeds(X1)
      | ~ list_succeeds(X2) ),
    inference(resolution,[],[f1919,f1921]) ).

fof(f3639,plain,
    ( ! [X0] :
        ( ~ split_succeeds(X0,sK245,sK246)
        | permutation_succeeds(X0,sF247) )
    | ~ spl248_3 ),
    inference(superposition,[],[f2190,f2178]) ).

fof(f3644,plain,
    ( permutation_succeeds(sK244,sF247)
    | ~ spl248_3 ),
    inference(resolution,[],[f3639,f1976]) ).

fof(f3645,plain,
    ( $false
    | ~ spl248_3 ),
    inference(forward_subsumption_resolution,[],[f3644,f2179]) ).

fof(f3646,plain,
    ~ spl248_3,
    inference(avatar_contradiction_clause,[],[f3645]) ).

fof(f3648,plain,
    ( sK241 = cons(sK238(sK241,sK242,sK243),sK239(sK241,sK242,sK243))
    | ~ spl248_2 ),
    inference(resolution,[],[f2187,f1971]) ).

fof(f3922,plain,
    ( nil != sK241
    | ~ spl248_2 ),
    inference(superposition,[],[f1200,f3648]) ).

fof(f3923,plain,
    ( ~ spl248_5
    | ~ spl248_2 ),
    inference(avatar_split_clause,[],[f3922,f2185,f2198]) ).

fof(f4051,plain,
    ( sK241 = cons(sK238(sK241,sK242,sK243),sK239(sK241,sK242,sK243))
    | ~ spl248_2 ),
    inference(resolution,[],[f2187,f1971]) ).

fof(f4052,plain,
    ( sK242 = cons(sK238(sK241,sK242,sK243),sK240(sK241,sK242,sK243))
    | ~ spl248_2 ),
    inference(resolution,[],[f2187,f1970]) ).

fof(f4077,plain,
    ( ! [X0,X1] :
        ( cons(X0,X1) != sK241
        | sK239(sK241,sK242,sK243) = X1 )
    | ~ spl248_2 ),
    inference(superposition,[],[f1201,f4051]) ).

fof(f4943,plain,
    ( ! [X0] :
        ( delete_succeeds(sK238(sK241,sK242,sK243),'**'(X0,sK242),'**'(X0,sK240(sK241,sK242,sK243)))
        | ~ list_succeeds(X0) )
    | ~ spl248_2 ),
    inference(superposition,[],[f1874,f4052]) ).

fof(f5169,plain,
    ( ! [X0,X1] :
        ( permutation_succeeds('**'(X0,sK242),cons(sK238(sK241,sK242,sK243),X1))
        | ~ list_succeeds(X0)
        | ~ permutation_succeeds('**'(X0,sK240(sK241,sK242,sK243)),X1) )
    | ~ spl248_2 ),
    inference(resolution,[],[f4943,f2077]) ).

fof(f5221,plain,
    ( ! [X0] :
        ( ~ permutation_succeeds('**'(X0,sK240(sK241,sK242,sK243)),sK239(sK241,sK242,sK243))
        | ~ list_succeeds(X0)
        | permutation_succeeds('**'(X0,sK242),sK241) )
    | ~ spl248_2 ),
    inference(superposition,[],[f5169,f4051]) ).

fof(f5273,plain,
    ( ~ list_succeeds(sK243)
    | permutation_succeeds('**'(sK243,sK242),sK241)
    | ~ sP17(sK241,sK242,sK243)
    | ~ spl248_2 ),
    inference(resolution,[],[f5221,f2425]) ).

fof(f5288,plain,
    ( permutation_succeeds('**'(sK243,sK242),sK241)
    | ~ sP17(sK241,sK242,sK243)
    | ~ spl248_2 ),
    inference(forward_subsumption_resolution,[],[f5273,f2277]) ).

fof(f5293,plain,
    ( permutation_succeeds('**'(sK243,sK242),sK241)
    | ~ spl248_2 ),
    inference(forward_subsumption_resolution,[],[f5288,f2187]) ).

fof(f5308,plain,
    ( list_succeeds(sK241)
    | ~ spl248_2 ),
    inference(resolution,[],[f5293,f1887]) ).

fof(f5311,plain,
    ( permutation_succeeds(sK241,'**'(sK243,sK242))
    | ~ spl248_2 ),
    inference(resolution,[],[f5293,f1918]) ).

fof(f5312,plain,
    ( $false
    | ~ spl248_2
    | spl248_28 ),
    inference(forward_subsumption_resolution,[],[f5308,f2451]) ).

fof(f5313,plain,
    ( ~ spl248_2
    | spl248_28 ),
    inference(avatar_contradiction_clause,[],[f5312]) ).

fof(f5320,plain,
    ( nil = sK241
    | sK241 = cons(sK168(sK241),sK169(sK241))
    | ~ spl248_28 ),
    inference(resolution,[],[f2450,f1582]) ).

fof(f5332,plain,
    ( sK241 = cons(sK168(sK241),sK169(sK241))
    | spl248_5
    | ~ spl248_28 ),
    inference(forward_subsumption_resolution,[],[f5320,f2199]) ).

fof(f5333,plain,
    ( permutation_succeeds(sK241,'**'(sK242,sK243))
    | ~ list_succeeds(sK243)
    | ~ list_succeeds(sK242)
    | ~ spl248_2 ),
    inference(resolution,[],[f5311,f3066]) ).

fof(f5557,plain,
    ( sK241 != sK241
    | sK239(sK241,sK242,sK243) = sK169(sK241)
    | ~ spl248_2
    | spl248_5
    | ~ spl248_28 ),
    inference(superposition,[],[f4077,f5332]) ).

fof(f5560,plain,
    ( sK239(sK241,sK242,sK243) = sK169(sK241)
    | ~ spl248_2
    | spl248_5
    | ~ spl248_28 ),
    inference(trivial_inequality_removal,[],[f5557]) ).

fof(f5591,plain,
    ( split_succeeds(sK169(sK241),sK243,sK240(sK241,sK242,sK243))
    | ~ sP17(sK241,sK242,sK243)
    | ~ spl248_2
    | spl248_5
    | ~ spl248_28 ),
    inference(superposition,[],[f1969,f5560]) ).

fof(f5594,plain,
    ( split_succeeds(sK169(sK241),sK243,sK240(sK241,sK242,sK243))
    | ~ spl248_2
    | spl248_5
    | ~ spl248_28 ),
    inference(forward_subsumption_resolution,[],[f5591,f2187]) ).

fof(f5602,plain,
    ( list_succeeds(sK240(sK241,sK242,sK243))
    | ~ spl248_2
    | spl248_5
    | ~ spl248_28 ),
    inference(resolution,[],[f5594,f1948]) ).

fof(f5951,plain,
    ( list_succeeds(sK242)
    | ~ list_succeeds(sK240(sK241,sK242,sK243))
    | ~ spl248_2 ),
    inference(superposition,[],[f2118,f4052]) ).

fof(f5958,plain,
    ( ~ list_succeeds(sK240(sK241,sK242,sK243))
    | ~ spl248_2
    | spl248_30 ),
    inference(forward_subsumption_resolution,[],[f5951,f2460]) ).

fof(f5962,plain,
    ( $false
    | ~ spl248_2
    | spl248_5
    | ~ spl248_28
    | spl248_30 ),
    inference(forward_subsumption_resolution,[],[f5958,f5602]) ).

fof(f5963,plain,
    ( ~ spl248_2
    | spl248_5
    | ~ spl248_28
    | spl248_30 ),
    inference(avatar_contradiction_clause,[],[f5962]) ).

fof(f5964,plain,
    ( ~ list_succeeds(sK243)
    | ~ list_succeeds(sK242)
    | ~ spl248_2
    | spl248_6 ),
    inference(forward_subsumption_resolution,[],[f5333,f2205]) ).

fof(f5965,plain,
    ( ~ list_succeeds(sK242)
    | ~ spl248_2
    | spl248_6 ),
    inference(forward_subsumption_resolution,[],[f5964,f2349]) ).

fof(f5966,plain,
    ( $false
    | ~ spl248_2
    | spl248_6
    | ~ spl248_30 ),
    inference(forward_subsumption_resolution,[],[f5965,f2459]) ).

fof(f5967,plain,
    ( ~ spl248_2
    | spl248_6
    | ~ spl248_30 ),
    inference(avatar_contradiction_clause,[],[f5966]) ).

fof(f6011,plain,
    ( ~ permutation_succeeds(nil,'**'(sK242,sK243))
    | ~ spl248_5
    | spl248_6 ),
    inference(superposition,[],[f2205,f2200]) ).

fof(f6038,plain,
    ( ~ permutation_succeeds(nil,'**'(sK242,nil))
    | ~ spl248_1
    | ~ spl248_5
    | spl248_6 ),
    inference(forward_demodulation,[],[f6011,f2183]) ).

fof(f6047,plain,
    ( ~ permutation_succeeds(nil,'**'(nil,nil))
    | ~ spl248_1
    | ~ spl248_4
    | ~ spl248_5
    | spl248_6 ),
    inference(forward_demodulation,[],[f6038,f2195]) ).

fof(f6049,plain,
    ( ~ permutation_succeeds(nil,nil)
    | ~ spl248_1
    | ~ spl248_4
    | ~ spl248_5
    | spl248_6 ),
    inference(forward_demodulation,[],[f6047,f1816]) ).

fof(f6052,plain,
    ( $false
    | ~ spl248_1
    | ~ spl248_4
    | ~ spl248_5
    | spl248_6 ),
    inference(forward_subsumption_resolution,[],[f6049,f2079]) ).

fof(f6053,plain,
    ( ~ spl248_1
    | ~ spl248_4
    | ~ spl248_5
    | spl248_6 ),
    inference(avatar_contradiction_clause,[],[f6052]) ).

cnf(s1,plain,
    ( spl248_1
    | spl248_2
    | spl248_3 ),
    inference(sat_conversion,[],[f2191]) ).

cnf(s2,plain,
    ( spl248_2
    | spl248_3
    | spl248_4 ),
    inference(sat_conversion,[],[f2196]) ).

cnf(s3,plain,
    ( spl248_2
    | spl248_3
    | spl248_5 ),
    inference(sat_conversion,[],[f2201]) ).

cnf(s4,plain,
    ( spl248_3
    | ~ spl248_6 ),
    inference(sat_conversion,[],[f2206]) ).

cnf(s89,plain,
    ~ spl248_3,
    inference(sat_conversion,[],[f3646]) ).

cnf(s91,plain,
    ( ~ spl248_2
    | ~ spl248_5 ),
    inference(sat_conversion,[],[f3923]) ).

cnf(s138,plain,
    ( ~ spl248_2
    | spl248_28 ),
    inference(sat_conversion,[],[f5313]) ).

cnf(s153,plain,
    ( ~ spl248_2
    | spl248_5
    | ~ spl248_28
    | spl248_30 ),
    inference(sat_conversion,[],[f5963]) ).

cnf(s154,plain,
    ( ~ spl248_2
    | spl248_6
    | ~ spl248_30 ),
    inference(sat_conversion,[],[f5967]) ).

cnf(s158,plain,
    ( ~ spl248_1
    | ~ spl248_4
    | ~ spl248_5
    | spl248_6 ),
    inference(sat_conversion,[],[f6053]) ).

cnf(s172,plain,
    ~ spl248_6,
    inference(rat,[],[s4,s89]) ).

cnf(s173,plain,
    ( spl248_2
    | spl248_5 ),
    inference(rat,[],[s3,s89]) ).

cnf(s174,plain,
    ( spl248_2
    | spl248_4 ),
    inference(rat,[],[s2,s89]) ).

cnf(s175,plain,
    ( spl248_1
    | spl248_2 ),
    inference(rat,[],[s1,s89]) ).

cnf(s176,plain,
    ~ spl248_2,
    inference(rat,[],[s153,s91,s138,s154,s172]) ).

cnf(s177,plain,
    spl248_5,
    inference(rat,[],[s173,s176]) ).

cnf(s178,plain,
    spl248_4,
    inference(rat,[],[s174,s176]) ).

cnf(s179,plain,
    spl248_1,
    inference(rat,[],[s175,s176]) ).

cnf(s180,plain,
    $false,
    inference(rat,[],[s158,s172,s179,s177,s178]) ).

fof(f6054,plain,
    $false,
    inference(avatar_sat_refutation,[],[s180]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWX030+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.07/0.20  % Computer : n026.cluster.edu
% 0.07/0.20  % Model    : x86_64 x86_64
% 0.07/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.20  % Memory   : 8046.5625MB
% 0.07/0.20  % OS       : Linux 6.8.0-71-generic
% 0.07/0.20  % CPULimit : 300
% 0.07/0.20  % WCLimit  : 300
% 0.07/0.20  % DateTime : Mon Sep 28 14:54:57 UTC 2026
% 0.07/0.20  % CPUTime  : 
% 0.07/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.24  Running first-order theorem proving
% 0.07/0.24  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
% 13.14/2.62  % (3910705)Detected formulas, will run a generic FOF schedule.
% 13.14/2.62  % (3910712)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=2345809275:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 13.14/2.62  % (3910715)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2264437981:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 13.14/2.62  % (3910713)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4248881673:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 13.14/2.62  % (3910711)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=819924093:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 13.14/2.62  % (3910714)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1809257953:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 13.14/2.62  % (3910710)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=2113483837:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 13.14/2.62  % (3910716)dis-21_1_sil=8000:lcm=predicate:random_seed=3737908149: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)
% 13.14/2.62  % (3910713)Refutation not found, incomplete strategy
% 13.14/2.62  % (3910713)------------------------------
% 13.14/2.62  % (3910713)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.14/2.62  % (3910713)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.14/2.62  % (3910713)CaDiCaL version: 2.1.3
% 13.14/2.62  % (3910713)Termination reason: Refutation not found, incomplete strategy
% 13.14/2.62  % (3910713)Time elapsed: 0.005 s
% 13.14/2.62  % (3910713)Peak memory usage: 89 MB
% 13.14/2.62  % (3910713)Instructions burned: 4 (million)
% 13.14/2.62  % (3910714)Instruction limit reached! 
% 13.14/2.62  % (3910714)------------------------------
% 13.14/2.62  % (3910714)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.14/2.62  % (3910714)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.14/2.62  % (3910714)CaDiCaL version: 2.1.3
% 13.14/2.62  % (3910714)Termination reason: Instruction limit
% 13.14/2.62  % (3910714)Termination phase: Saturation
% 13.14/2.62  % (3910714)Time elapsed: 0.074 s
% 13.14/2.62  % (3910714)Peak memory usage: 89 MB
% 13.14/2.62  % (3910714)Instructions burned: 120 (million)
% 13.14/2.62  % (3910716)Instruction limit reached! 
% 13.14/2.62  % (3910716)------------------------------
% 13.14/2.62  % (3910716)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.14/2.62  % (3910716)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.14/2.62  % (3910716)CaDiCaL version: 2.1.3
% 13.14/2.62  % (3910716)Termination reason: Instruction limit
% 13.14/2.62  % (3910716)Termination phase: Saturation
% 13.14/2.62  % (3910716)Time elapsed: 0.078 s
% 13.14/2.62  % (3910716)Peak memory usage: 90 MB
% 13.14/2.62  % (3910716)Instructions burned: 129 (million)
% 13.14/2.62  % (3910715)Instruction limit reached! 
% 13.14/2.62  % (3910715)------------------------------
% 13.14/2.62  % (3910715)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.14/2.62  % (3910715)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.14/2.62  % (3910715)CaDiCaL version: 2.1.3
% 13.14/2.62  % (3910715)Termination reason: Instruction limit
% 13.14/2.62  % (3910715)Termination phase: Saturation
% 13.14/2.62  % (3910715)Time elapsed: 0.100 s
% 13.14/2.62  % (3910715)Peak memory usage: 91 MB
% 13.14/2.62  % (3910715)Instructions burned: 140 (million)
% 13.14/2.62  % (3910725)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2680299722:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 13.14/2.62  % (3910724)lrs+10_1_sil=8000:sp=occurrence:random_seed=4041806689:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 13.14/2.62  % (3910726)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4230654853:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 13.14/2.62  % (3910713)------------------------------
% 13.14/2.62  % (3910713)------------------------------
% 13.14/2.62  % (3910725)Instruction limit reached! 
% 13.14/2.62  % (3910725)------------------------------
% 13.14/2.62  % (3910725)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.35/2.80  % (3910725)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.35/2.80  % (3910725)CaDiCaL version: 2.1.3
% 11.35/2.80  % (3910725)Termination reason: Instruction limit
% 11.35/2.80  % (3910725)Termination phase: Saturation
% 11.35/2.80  % (3910725)Time elapsed: 0.085 s
% 11.35/2.80  % (3910725)Peak memory usage: 92 MB
% 11.35/2.80  % (3910725)Instructions burned: 159 (million)
% 11.35/2.80  % (3910730)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=3587282804:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 11.35/2.80  % (3910724)Instruction limit reached! 
% 11.35/2.80  % (3910724)------------------------------
% 11.35/2.80  % (3910724)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.35/2.80  % (3910724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.35/2.80  % (3910724)CaDiCaL version: 2.1.3
% 11.35/2.80  % (3910724)Termination reason: Instruction limit
% 11.35/2.80  % (3910724)Termination phase: Saturation
% 11.35/2.80  % (3910724)Time elapsed: 0.195 s
% 11.35/2.80  % (3910724)Peak memory usage: 93 MB
% 11.35/2.80  % (3910724)Instructions burned: 286 (million)
% 11.35/2.80  % (3910731)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3073631731:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 11.35/2.80  % (3910726)Instruction limit reached! 
% 11.35/2.80  % (3910726)------------------------------
% 11.35/2.80  % (3910726)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.35/2.80  % (3910726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.35/2.80  % (3910726)CaDiCaL version: 2.1.3
% 11.35/2.80  % (3910726)Termination reason: Instruction limit
% 11.35/2.80  % (3910726)Termination phase: Saturation
% 11.35/2.80  % (3910726)Time elapsed: 0.198 s
% 11.35/2.80  % (3910726)Peak memory usage: 92 MB
% 11.35/2.80  % (3910726)Instructions burned: 326 (million)
% 11.35/2.80  % (3910730)Instruction limit reached! 
% 11.35/2.80  % (3910730)------------------------------
% 11.35/2.80  % (3910730)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.35/2.80  % (3910730)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.35/2.80  % (3910730)CaDiCaL version: 2.1.3
% 11.35/2.80  % (3910730)Termination reason: Instruction limit
% 11.35/2.80  % (3910730)Termination phase: Saturation
% 11.35/2.80  % (3910730)Time elapsed: 0.138 s
% 11.35/2.80  % (3910730)Peak memory usage: 94 MB
% 11.35/2.80  % (3910730)Instructions burned: 250 (million)
% 11.35/2.80  % (3910733)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3575602736:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 11.35/2.80  % (3910735)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2016167463:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 11.35/2.80  % (3910731)Instruction limit reached! 
% 11.35/2.80  % (3910731)------------------------------
% 11.35/2.80  % (3910731)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.35/2.80  % (3910731)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.35/2.80  % (3910731)CaDiCaL version: 2.1.3
% 11.35/2.80  % (3910731)Termination reason: Instruction limit
% 11.35/2.80  % (3910731)Termination phase: Saturation
% 11.35/2.80  % (3910731)Time elapsed: 0.170 s
% 11.35/2.80  % (3910731)Peak memory usage: 90 MB
% 11.35/2.80  % (3910731)Instructions burned: 294 (million)
% 11.35/2.80  % (3910735)Instruction limit reached! 
% 11.35/2.80  % (3910735)------------------------------
% 11.35/2.80  % (3910735)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.35/2.80  % (3910735)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.35/2.80  % (3910735)CaDiCaL version: 2.1.3
% 11.35/2.80  % (3910735)Termination reason: Instruction limit
% 11.35/2.80  % (3910735)Termination phase: Saturation
% 11.35/2.80  % (3910735)Time elapsed: 0.073 s
% 11.35/2.80  % (3910735)Peak memory usage: 91 MB
% 11.35/2.80  % (3910735)Instructions burned: 113 (million)
% 11.35/2.80  % (3910736)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1483493096:i=127:av=off:fsr=off:sup=off_2993 on theBenchmark for (2993ds/127Mi)
% 11.35/2.80  % (3910739)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=1889787263:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2992 on theBenchmark for (2992ds/114Mi)
% 11.35/2.80  % (3910736)Instruction limit reached! 
% 11.35/2.80  % (3910736)------------------------------
% 11.35/2.80  % (3910736)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.35/2.80  % (3910736)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.35/2.80  % (3910736)CaDiCaL version: 2.1.3
% 11.35/2.80  % (3910736)Termination reason: Instruction limit
% 11.35/2.80  % (3910736)Termination phase: Saturation
% 11.35/2.80  % (3910736)Time elapsed: 0.068 s
% 11.35/2.80  % (3910736)Peak memory usage: 90 MB
% 11.35/2.80  % (3910736)Instructions burned: 127 (million)
% 11.35/2.80  % (3910740)lrs+10_1_sil=8000:sp=occurrence:random_seed=3384586635:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2991 on theBenchmark for (2991ds/907Mi)
% 11.35/2.80  % (3910739)Instruction limit reached! 
% 11.35/2.80  % (3910739)------------------------------
% 11.35/2.80  % (3910739)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.35/2.80  % (3910739)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.35/2.80  % (3910739)CaDiCaL version: 2.1.3
% 11.35/2.80  % (3910739)Termination reason: Instruction limit
% 11.35/2.80  % (3910739)Termination phase: Saturation
% 11.35/2.80  % (3910739)Time elapsed: 0.066 s
% 11.35/2.80  % (3910739)Peak memory usage: 89 MB
% 11.35/2.80  % (3910739)Instructions burned: 114 (million)
% 11.35/2.80  % (3910743)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=2324652281:i=437:sd=1:aac=none:ss=included_2991 on theBenchmark for (2991ds/437Mi)
% 11.35/2.80  % (3910745)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1592014366:i=5202:ss=axioms:sgt=16_2990 on theBenchmark for (2990ds/5202Mi)
% 11.35/2.80  % (3910743)Instruction limit reached! 
% 11.35/2.80  % (3910743)------------------------------
% 11.35/2.80  % (3910743)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.35/2.80  % (3910743)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.35/2.80  % (3910743)CaDiCaL version: 2.1.3
% 11.35/2.80  % (3910743)Termination reason: Instruction limit
% 11.35/2.80  % (3910743)Termination phase: Saturation
% 11.35/2.80  % (3910743)Time elapsed: 0.256 s
% 11.35/2.80  % (3910743)Peak memory usage: 93 MB
% 11.35/2.80  % (3910743)Instructions burned: 438 (million)
% 11.35/2.80  % (3910748)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=257015732:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2987 on theBenchmark for (2987ds/134Mi)
% 11.35/2.80  % (3910748)Instruction limit reached! 
% 11.35/2.80  % (3910748)------------------------------
% 11.35/2.80  % (3910748)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.35/2.80  % (3910748)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.35/2.80  % (3910748)CaDiCaL version: 2.1.3
% 11.35/2.80  % (3910748)Termination reason: Instruction limit
% 11.35/2.80  % (3910748)Termination phase: Saturation
% 11.35/2.80  % (3910748)Time elapsed: 0.079 s
% 11.35/2.80  % (3910748)Peak memory usage: 92 MB
% 11.35/2.80  % (3910748)Instructions burned: 134 (million)
% 11.35/2.80  % (3910740)Instruction limit reached! 
% 11.35/2.80  % (3910740)------------------------------
% 11.35/2.80  % (3910740)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.35/2.80  % (3910740)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.35/2.80  % (3910740)CaDiCaL version: 2.1.3
% 11.35/2.80  % (3910740)Termination reason: Instruction limit
% 11.35/2.80  % (3910740)Termination phase: Saturation
% 11.35/2.80  % (3910740)Time elapsed: 0.588 s
% 11.35/2.80  % (3910740)Peak memory usage: 100 MB
% 11.35/2.80  % (3910740)Instructions burned: 907 (million)
% 11.35/2.80  % (3910750)lrs+1002_8_sil=8000:sp=occurrence:sos=on:sac=on:random_seed=3601763782:st=8:i=592:sd=3:ep=RST:ss=axioms_2985 on theBenchmark for (2985ds/592Mi)
% 11.35/2.80  % (3910751)lrs+10_1_ncem=casc2026/models/loop6.pt:sil=32000:npcc=on:random_seed=2955190971:st=3:i=13193:sd=3:ss=axioms_2984 on theBenchmark for (2984ds/13193Mi)
% 11.35/2.80  % (3910733)First to succeed.
% 11.35/2.80  % (3910733)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3910705"
% 11.35/2.80  % (3910710)Also succeeded, but the first one will report.
% 11.35/2.80  % (3910750)Instruction limit reached! 
% 11.35/2.80  % (3910750)------------------------------
% 11.35/2.80  % (3910750)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.35/2.80  % (3910750)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.35/2.80  % (3910750)CaDiCaL version: 2.1.3
% 11.35/2.80  % (3910750)Termination reason: Instruction limit
% 11.35/2.80  % (3910750)Termination phase: Saturation
% 11.35/2.80  % (3910750)Time elapsed: 0.334 s
% 11.35/2.80  % (3910750)Peak memory usage: 93 MB
% 11.35/2.80  % (3910750)Instructions burned: 593 (million)
% 11.35/2.80  % (3910754)lrs+1666_7_slsqr=4,1:sil=8000:plsq=on:plsqc=1:sos=on:urr=on:plsql=on:rp=on:alpa=false:sac=on:slsq=on:random_seed=3289174906:i=125:slsql=off:bs=unit_only:gtg=position:fdi=2:gsp=on:ss=axioms:sgt=8_2980 on theBenchmark for (2980ds/125Mi)
% 11.35/2.80  % (3910733)Refutation found. Thanks to Tanya!
% 11.35/2.80  % SZS status Theorem for theBenchmark
% 11.35/2.80  % SZS output start Proof for theBenchmark
% See solution above
% 15.50/3.00  % (3910733)------------------------------
% 15.50/3.00  % (3910733)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 15.50/3.00  % (3910733)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.50/3.00  % (3910733)CaDiCaL version: 2.1.3
% 15.50/3.00  % (3910733)Termination reason: Refutation
% 15.50/3.00  % (3910733)Time elapsed: 1.175 s
% 15.50/3.00  % (3910733)Peak memory usage: 141 MB
% 15.50/3.00  % (3910733)Instructions burned: 1810 (million)
% 15.50/3.00  % (3910733)------------------------------
% 15.50/3.00  % (3910733)------------------------------
% 15.50/3.00  % (3910705)Success in time 2.122 s
% 15.50/3.00  % Vampire exiting
%------------------------------------------------------------------------------