↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n008.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:03:11 PM UTC 2026

% Result   : Theorem 6.75s 1.77s
% Output   : Refutation 8.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   28
%            Number of leaves      :   16
% Syntax   : Number of formulae    :  140 (  23 unt;   9 def)
%            Number of atoms       :  566 (  40 equ)
%            Maximal formula atoms :   17 (   4 avg)
%            Number of connectives :  745 ( 319   ~; 327   |;  58   &)
%                                         (  16 <=>;  25  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   16 (  14 usr;  10 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   5 con; 0-2 aty)
%            Number of variables   :  137 (   0 sgn 112   !;  25   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ( memberP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( ssList(X3)
                    & app(X2,cons(X1,X3)) = X0 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).

fof(f11,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( totalorderedP(X0)
      <=> ! [X1] :
            ( ssItem(X1)
           => ! [X2] :
                ( ssItem(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ! [X4] :
                        ( ssList(X4)
                       => ! [X5] :
                            ( ssList(X5)
                           => ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                             => leq(X1,X2) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax11) ).

fof(f16,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ssList(cons(X1,X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).

fof(f26,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ssList(app(X0,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).

fof(f31,axiom,
    ! [X0] :
      ( ssItem(X0)
     => leq(X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax31) ).

fof(f36,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ( memberP(app(X1,X2),X0)
              <=> ( memberP(X1,X0)
                  | memberP(X2,X0) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax36) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ~ ssList(X3)
                  | X1 != X3
                  | X0 != X2
                  | ! [X4] :
                      ( ssItem(X4)
                     => ? [X5] :
                          ( ssItem(X5)
                          & X4 != X5
                          & memberP(X2,X5) ) )
                  | totalorderedP(X0) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ~ ssList(X3)
                    | X1 != X3
                    | X0 != X2
                    | ! [X4] :
                        ( ssItem(X4)
                       => ? [X5] :
                            ( ssItem(X5)
                            & X4 != X5
                            & memberP(X2,X5) ) )
                    | totalorderedP(X0) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f99,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( memberP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( ssList(X3)
                    & app(X2,cons(X1,X3)) = X0 ) ) )
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f110,plain,
    ! [X0] :
      ( ( totalorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( leq(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f111,plain,
    ! [X0] :
      ( ( totalorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( leq(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f110]) ).

fof(f119,plain,
    ! [X0] :
      ( ! [X1] :
          ( ssList(cons(X1,X0))
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f132,plain,
    ! [X0] :
      ( ! [X1] :
          ( ssList(app(X0,X1))
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f26]) ).

fof(f139,plain,
    ! [X0] :
      ( leq(X0,X0)
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f31]) ).

fof(f146,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( memberP(app(X1,X2),X0)
              <=> ( memberP(X1,X0)
                  | memberP(X2,X0) ) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f36]) ).

fof(f221,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ssList(X3)
                  & X1 = X3
                  & X0 = X2
                  & ? [X4] :
                      ( ! [X5] :
                          ( ~ ssItem(X5)
                          | X4 = X5
                          | ~ memberP(X2,X5) )
                      & ssItem(X4) )
                  & ~ totalorderedP(X0) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f233,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( memberP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(X2,cons(X1,X3)) != X0 ) ) )
            & ( ? [X2] :
                  ( ssList(X2)
                  & ? [X3] :
                      ( ssList(X3)
                      & app(X2,cons(X1,X3)) = X0 ) )
              | ~ memberP(X0,X1) ) )
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f99]) ).

fof(f234,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( memberP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(X2,cons(X1,X3)) != X0 ) ) )
            & ( ? [X4] :
                  ( ssList(X4)
                  & ? [X5] :
                      ( ssList(X5)
                      & app(X4,cons(X1,X5)) = X0 ) )
              | ~ memberP(X0,X1) ) )
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(rectify,[],[f233]) ).

fof(f235,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( memberP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(X2,cons(X1,X3)) != X0 ) ) )
            & ( ( ssList(sK8(X0,X1))
                & ssList(sK9(X0,X1))
                & app(sK8(X0,X1),cons(X1,sK9(X0,X1))) = X0 )
              | ~ memberP(X0,X1) ) )
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X4,sK8(X0,X1)),skolemize(X5,sK9(X0,X1))],[f234]) ).

fof(f260,plain,
    ! [X0] :
      ( ( ( totalorderedP(X0)
          | ? [X1] :
              ( ? [X2] :
                  ( ? [X3] :
                      ( ? [X4] :
                          ( ? [X5] :
                              ( ~ leq(X1,X2)
                              & app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                              & ssList(X5) )
                          & ssList(X4) )
                      & ssList(X3) )
                  & ssItem(X2) )
              & ssItem(X1) ) )
        & ( ! [X1] :
              ( ! [X2] :
                  ( ! [X3] :
                      ( ! [X4] :
                          ( ! [X5] :
                              ( leq(X1,X2)
                              | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                              | ~ ssList(X5) )
                          | ~ ssList(X4) )
                      | ~ ssList(X3) )
                  | ~ ssItem(X2) )
              | ~ ssItem(X1) )
          | ~ totalorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f111]) ).

fof(f261,plain,
    ! [X0] :
      ( ( ( totalorderedP(X0)
          | ? [X1] :
              ( ? [X2] :
                  ( ? [X3] :
                      ( ? [X4] :
                          ( ? [X5] :
                              ( ~ leq(X1,X2)
                              & app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                              & ssList(X5) )
                          & ssList(X4) )
                      & ssList(X3) )
                  & ssItem(X2) )
              & ssItem(X1) ) )
        & ( ! [X6] :
              ( ! [X7] :
                  ( ! [X8] :
                      ( ! [X9] :
                          ( ! [X10] :
                              ( leq(X6,X7)
                              | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
                              | ~ ssList(X10) )
                          | ~ ssList(X9) )
                      | ~ ssList(X8) )
                  | ~ ssItem(X7) )
              | ~ ssItem(X6) )
          | ~ totalorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(rectify,[],[f260]) ).

fof(f262,plain,
    ! [X0] :
      ( ( ( totalorderedP(X0)
          | ( ~ leq(sK30(X0),sK31(X0))
            & app(app(sK32(X0),cons(sK30(X0),sK33(X0))),cons(sK31(X0),sK34(X0))) = X0
            & ssList(sK34(X0))
            & ssList(sK33(X0))
            & ssList(sK32(X0))
            & ssItem(sK31(X0))
            & ssItem(sK30(X0)) ) )
        & ( ! [X6] :
              ( ! [X7] :
                  ( ! [X8] :
                      ( ! [X9] :
                          ( ! [X10] :
                              ( leq(X6,X7)
                              | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
                              | ~ ssList(X10) )
                          | ~ ssList(X9) )
                      | ~ ssList(X8) )
                  | ~ ssItem(X7) )
              | ~ ssItem(X6) )
          | ~ totalorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK30,sK31,sK32,sK33,sK34]),skolemize(X1,sK30(X0)),skolemize(X2,sK31(X0)),skolemize(X3,sK32(X0)),skolemize(X4,sK33(X0)),skolemize(X5,sK34(X0))],[f261]) ).

fof(f276,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( ( memberP(app(X1,X2),X0)
                  | ( ~ memberP(X1,X0)
                    & ~ memberP(X2,X0) ) )
                & ( memberP(X1,X0)
                  | memberP(X2,X0)
                  | ~ memberP(app(X1,X2),X0) ) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssItem(X0) ),
    inference(nnf_transformation,[],[f146]) ).

fof(f277,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( ( memberP(app(X1,X2),X0)
                  | ( ~ memberP(X1,X0)
                    & ~ memberP(X2,X0) ) )
                & ( memberP(X1,X0)
                  | memberP(X2,X0)
                  | ~ memberP(app(X1,X2),X0) ) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssItem(X0) ),
    inference(flattening,[],[f276]) ).

fof(f295,plain,
    ( ssList(sK56)
    & sK54 = sK56
    & sK53 = sK55
    & ! [X5] :
        ( ~ ssItem(X5)
        | sK57 = X5
        | ~ memberP(sK55,X5) )
    & ssItem(sK57)
    & ~ totalorderedP(sK53)
    & ssList(sK55)
    & ssList(sK54)
    & ssList(sK53) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57)],[f221]) ).

fof(f304,plain,
    ! [X2,X3,X0,X1] :
      ( memberP(X0,X1)
      | ~ ssList(X2)
      | ~ ssList(X3)
      | app(X2,cons(X1,X3)) != X0
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f235]) ).

fof(f355,plain,
    ! [X0] :
      ( ssItem(sK30(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f262]) ).

fof(f356,plain,
    ! [X0] :
      ( ssItem(sK31(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f262]) ).

fof(f357,plain,
    ! [X0] :
      ( ssList(sK32(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f262]) ).

fof(f358,plain,
    ! [X0] :
      ( ssList(sK33(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f262]) ).

fof(f359,plain,
    ! [X0] :
      ( ssList(sK34(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f262]) ).

fof(f360,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(app(sK32(X0),cons(sK30(X0),sK33(X0))),cons(sK31(X0),sK34(X0))) = X0
      | totalorderedP(X0) ),
    inference(cnf_transformation,[],[f262]) ).

fof(f361,plain,
    ! [X0] :
      ( ~ leq(sK30(X0),sK31(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f262]) ).

fof(f387,plain,
    ! [X0,X1] :
      ( ssList(cons(X1,X0))
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f119]) ).

fof(f400,plain,
    ! [X0,X1] :
      ( ssList(app(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f132]) ).

fof(f405,plain,
    ! [X0] :
      ( leq(X0,X0)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f139]) ).

fof(f414,plain,
    ! [X2,X0,X1] :
      ( memberP(app(X1,X2),X0)
      | ~ memberP(X1,X0)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f277]) ).

fof(f495,plain,
    ssList(sK53),
    inference(cnf_transformation,[],[f295]) ).

fof(f498,plain,
    ~ totalorderedP(sK53),
    inference(cnf_transformation,[],[f295]) ).

fof(f499,plain,
    ssItem(sK57),
    inference(cnf_transformation,[],[f295]) ).

fof(f500,plain,
    ! [X5] :
      ( ~ memberP(sK55,X5)
      | sK57 = X5
      | ~ ssItem(X5) ),
    inference(cnf_transformation,[],[f295]) ).

fof(f501,plain,
    sK53 = sK55,
    inference(cnf_transformation,[],[f295]) ).

fof(f504,plain,
    ~ totalorderedP(sK55),
    inference(definition_unfolding,[],[f498,f501]) ).

fof(f506,plain,
    ssList(sK55),
    inference(definition_unfolding,[],[f495,f501]) ).

fof(f508,plain,
    ! [X2,X3,X1] :
      ( memberP(app(X2,cons(X1,X3)),X1)
      | ~ ssList(X2)
      | ~ ssList(X3)
      | ~ ssItem(X1)
      | ~ ssList(app(X2,cons(X1,X3))) ),
    inference(equality_resolution,[],[f304]) ).

fof(f584,plain,
    ( sK55 = app(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))),cons(sK31(sK55),sK34(sK55)))
    | totalorderedP(sK55) ),
    inference(resolution,[],[f360,f506]) ).

fof(f595,plain,
    sK55 = app(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))),cons(sK31(sK55),sK34(sK55))),
    inference(forward_subsumption_resolution,[],[f584,f504]) ).

fof(f596,plain,
    ( memberP(sK55,sK31(sK55))
    | ~ ssList(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))))
    | ~ ssList(sK34(sK55))
    | ~ ssItem(sK31(sK55))
    | ~ ssList(sK55) ),
    inference(superposition,[],[f508,f595]) ).

fof(f598,plain,
    ( memberP(sK55,sK31(sK55))
    | ~ ssList(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))))
    | ~ ssList(sK34(sK55))
    | ~ ssItem(sK31(sK55)) ),
    inference(forward_subsumption_resolution,[],[f596,f506]) ).

fof(f600,definition,
    ( spl58_9
  <=> ssItem(sK31(sK55)) ),
    introduced(definition,[new_symbols(definition,[spl58_9])],[avatar_definition]) ).

fof(f601,plain,
    ( ssItem(sK31(sK55))
    | ~ spl58_9 ),
    inference(avatar_component_clause,[],[f600]) ).

fof(f602,plain,
    ( ~ ssItem(sK31(sK55))
    | spl58_9 ),
    inference(avatar_component_clause,[],[f600]) ).

fof(f604,definition,
    ( spl58_10
  <=> ssList(sK34(sK55)) ),
    introduced(definition,[new_symbols(definition,[spl58_10])],[avatar_definition]) ).

fof(f605,plain,
    ( ssList(sK34(sK55))
    | ~ spl58_10 ),
    inference(avatar_component_clause,[],[f604]) ).

fof(f606,plain,
    ( ~ ssList(sK34(sK55))
    | spl58_10 ),
    inference(avatar_component_clause,[],[f604]) ).

fof(f608,definition,
    ( spl58_11
  <=> ssList(app(sK32(sK55),cons(sK30(sK55),sK33(sK55)))) ),
    introduced(definition,[new_symbols(definition,[spl58_11])],[avatar_definition]) ).

fof(f609,plain,
    ( ssList(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))))
    | ~ spl58_11 ),
    inference(avatar_component_clause,[],[f608]) ).

fof(f610,plain,
    ( ~ ssList(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))))
    | spl58_11 ),
    inference(avatar_component_clause,[],[f608]) ).

fof(f612,definition,
    ( spl58_12
  <=> memberP(sK55,sK31(sK55)) ),
    introduced(definition,[new_symbols(definition,[spl58_12])],[avatar_definition]) ).

fof(f614,plain,
    ( memberP(sK55,sK31(sK55))
    | ~ spl58_12 ),
    inference(avatar_component_clause,[],[f612]) ).

fof(f615,plain,
    ( ~ spl58_9
    | ~ spl58_10
    | ~ spl58_11
    | spl58_12 ),
    inference(avatar_split_clause,[],[f598,f612,f608,f604,f600]) ).

fof(f616,plain,
    ( totalorderedP(sK55)
    | ~ ssList(sK55)
    | spl58_9 ),
    inference(resolution,[],[f356,f602]) ).

fof(f617,plain,
    ( ~ ssList(sK55)
    | spl58_9 ),
    inference(forward_subsumption_resolution,[],[f616,f504]) ).

fof(f618,plain,
    ( $false
    | spl58_9 ),
    inference(forward_subsumption_resolution,[],[f617,f506]) ).

fof(f619,plain,
    spl58_9,
    inference(avatar_contradiction_clause,[],[f618]) ).

fof(f620,plain,
    ( totalorderedP(sK55)
    | ~ ssList(sK55)
    | spl58_10 ),
    inference(resolution,[],[f606,f359]) ).

fof(f621,plain,
    ( ~ ssList(sK55)
    | spl58_10 ),
    inference(forward_subsumption_resolution,[],[f620,f504]) ).

fof(f622,plain,
    ( $false
    | spl58_10 ),
    inference(forward_subsumption_resolution,[],[f621,f506]) ).

fof(f623,plain,
    spl58_10,
    inference(avatar_contradiction_clause,[],[f622]) ).

fof(f635,plain,
    ( ~ ssList(cons(sK30(sK55),sK33(sK55)))
    | ~ ssList(sK32(sK55))
    | spl58_11 ),
    inference(resolution,[],[f610,f400]) ).

fof(f637,definition,
    ( spl58_15
  <=> ssList(sK32(sK55)) ),
    introduced(definition,[new_symbols(definition,[spl58_15])],[avatar_definition]) ).

fof(f638,plain,
    ( ssList(sK32(sK55))
    | ~ spl58_15 ),
    inference(avatar_component_clause,[],[f637]) ).

fof(f639,plain,
    ( ~ ssList(sK32(sK55))
    | spl58_15 ),
    inference(avatar_component_clause,[],[f637]) ).

fof(f641,definition,
    ( spl58_16
  <=> ssList(cons(sK30(sK55),sK33(sK55))) ),
    introduced(definition,[new_symbols(definition,[spl58_16])],[avatar_definition]) ).

fof(f643,plain,
    ( ~ ssList(cons(sK30(sK55),sK33(sK55)))
    | spl58_16 ),
    inference(avatar_component_clause,[],[f641]) ).

fof(f644,plain,
    ( ~ spl58_15
    | ~ spl58_16
    | spl58_11 ),
    inference(avatar_split_clause,[],[f635,f608,f641,f637]) ).

fof(f645,plain,
    ( totalorderedP(sK55)
    | ~ ssList(sK55)
    | spl58_15 ),
    inference(resolution,[],[f639,f357]) ).

fof(f646,plain,
    ( ~ ssList(sK55)
    | spl58_15 ),
    inference(forward_subsumption_resolution,[],[f645,f504]) ).

fof(f647,plain,
    ( $false
    | spl58_15 ),
    inference(forward_subsumption_resolution,[],[f646,f506]) ).

fof(f648,plain,
    spl58_15,
    inference(avatar_contradiction_clause,[],[f647]) ).

fof(f660,plain,
    ( ~ ssItem(sK30(sK55))
    | ~ ssList(sK33(sK55))
    | spl58_16 ),
    inference(resolution,[],[f387,f643]) ).

fof(f664,definition,
    ( spl58_19
  <=> ssList(sK33(sK55)) ),
    introduced(definition,[new_symbols(definition,[spl58_19])],[avatar_definition]) ).

fof(f665,plain,
    ( ssList(sK33(sK55))
    | ~ spl58_19 ),
    inference(avatar_component_clause,[],[f664]) ).

fof(f666,plain,
    ( ~ ssList(sK33(sK55))
    | spl58_19 ),
    inference(avatar_component_clause,[],[f664]) ).

fof(f668,definition,
    ( spl58_20
  <=> ssItem(sK30(sK55)) ),
    introduced(definition,[new_symbols(definition,[spl58_20])],[avatar_definition]) ).

fof(f669,plain,
    ( ssItem(sK30(sK55))
    | ~ spl58_20 ),
    inference(avatar_component_clause,[],[f668]) ).

fof(f670,plain,
    ( ~ ssItem(sK30(sK55))
    | spl58_20 ),
    inference(avatar_component_clause,[],[f668]) ).

fof(f671,plain,
    ( ~ spl58_19
    | ~ spl58_20
    | spl58_16 ),
    inference(avatar_split_clause,[],[f660,f641,f668,f664]) ).

fof(f672,plain,
    ( totalorderedP(sK55)
    | ~ ssList(sK55)
    | spl58_19 ),
    inference(resolution,[],[f666,f358]) ).

fof(f673,plain,
    ( ~ ssList(sK55)
    | spl58_19 ),
    inference(forward_subsumption_resolution,[],[f672,f504]) ).

fof(f674,plain,
    ( $false
    | spl58_19 ),
    inference(forward_subsumption_resolution,[],[f673,f506]) ).

fof(f675,plain,
    spl58_19,
    inference(avatar_contradiction_clause,[],[f674]) ).

fof(f676,plain,
    ( totalorderedP(sK55)
    | ~ ssList(sK55)
    | spl58_20 ),
    inference(resolution,[],[f670,f355]) ).

fof(f677,plain,
    ( ~ ssList(sK55)
    | spl58_20 ),
    inference(forward_subsumption_resolution,[],[f676,f504]) ).

fof(f678,plain,
    ( $false
    | spl58_20 ),
    inference(forward_subsumption_resolution,[],[f677,f506]) ).

fof(f679,plain,
    spl58_20,
    inference(avatar_contradiction_clause,[],[f678]) ).

fof(f680,plain,
    ( sK57 = sK31(sK55)
    | ~ ssItem(sK31(sK55))
    | ~ spl58_12 ),
    inference(resolution,[],[f614,f500]) ).

fof(f681,plain,
    ( sK57 = sK31(sK55)
    | ~ spl58_9
    | ~ spl58_12 ),
    inference(forward_subsumption_resolution,[],[f680,f601]) ).

fof(f684,plain,
    ( sK55 = app(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))),cons(sK57,sK34(sK55)))
    | ~ spl58_9
    | ~ spl58_12 ),
    inference(superposition,[],[f595,f681]) ).

fof(f686,plain,
    ( ~ leq(sK30(sK55),sK57)
    | totalorderedP(sK55)
    | ~ ssList(sK55)
    | ~ spl58_9
    | ~ spl58_12 ),
    inference(superposition,[],[f361,f681]) ).

fof(f687,plain,
    ( ~ leq(sK30(sK55),sK57)
    | ~ ssList(sK55)
    | ~ spl58_9
    | ~ spl58_12 ),
    inference(forward_subsumption_resolution,[],[f686,f504]) ).

fof(f688,plain,
    ( ~ leq(sK30(sK55),sK57)
    | ~ spl58_9
    | ~ spl58_12 ),
    inference(forward_subsumption_resolution,[],[f687,f506]) ).

fof(f731,definition,
    ( spl58_27
  <=> ssList(cons(sK57,sK34(sK55))) ),
    introduced(definition,[new_symbols(definition,[spl58_27])],[avatar_definition]) ).

fof(f732,plain,
    ( ssList(cons(sK57,sK34(sK55)))
    | ~ spl58_27 ),
    inference(avatar_component_clause,[],[f731]) ).

fof(f733,plain,
    ( ~ ssList(cons(sK57,sK34(sK55)))
    | spl58_27 ),
    inference(avatar_component_clause,[],[f731]) ).

fof(f741,plain,
    ( ~ ssItem(sK57)
    | ~ ssList(sK34(sK55))
    | spl58_27 ),
    inference(resolution,[],[f733,f387]) ).

fof(f742,plain,
    ( ~ ssList(sK34(sK55))
    | spl58_27 ),
    inference(forward_subsumption_resolution,[],[f741,f499]) ).

fof(f743,plain,
    ( $false
    | ~ spl58_10
    | spl58_27 ),
    inference(forward_subsumption_resolution,[],[f742,f605]) ).

fof(f744,plain,
    ( ~ spl58_10
    | spl58_27 ),
    inference(avatar_contradiction_clause,[],[f743]) ).

fof(f760,plain,
    ( ! [X0] :
        ( memberP(sK55,X0)
        | ~ memberP(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))),X0)
        | ~ ssList(cons(sK57,sK34(sK55)))
        | ~ ssList(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))))
        | ~ ssItem(X0) )
    | ~ spl58_9
    | ~ spl58_12 ),
    inference(superposition,[],[f414,f684]) ).

fof(f761,plain,
    ( ! [X0] :
        ( memberP(sK55,X0)
        | ~ memberP(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))),X0)
        | ~ ssList(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))))
        | ~ ssItem(X0) )
    | ~ spl58_9
    | ~ spl58_12
    | ~ spl58_27 ),
    inference(forward_subsumption_resolution,[],[f760,f732]) ).

fof(f763,plain,
    ( ! [X0] :
        ( ~ memberP(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))),X0)
        | memberP(sK55,X0)
        | ~ ssItem(X0) )
    | ~ spl58_9
    | ~ spl58_11
    | ~ spl58_12
    | ~ spl58_27 ),
    inference(forward_subsumption_resolution,[],[f761,f609]) ).

fof(f765,plain,
    ( memberP(sK55,sK30(sK55))
    | ~ ssItem(sK30(sK55))
    | ~ ssList(sK32(sK55))
    | ~ ssList(sK33(sK55))
    | ~ ssItem(sK30(sK55))
    | ~ ssList(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))))
    | ~ spl58_9
    | ~ spl58_11
    | ~ spl58_12
    | ~ spl58_27 ),
    inference(resolution,[],[f763,f508]) ).

fof(f770,plain,
    ( memberP(sK55,sK30(sK55))
    | ~ ssItem(sK30(sK55))
    | ~ ssList(sK32(sK55))
    | ~ ssList(sK33(sK55))
    | ~ ssList(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))))
    | ~ spl58_9
    | ~ spl58_11
    | ~ spl58_12
    | ~ spl58_27 ),
    inference(duplicate_literal_removal,[],[f765]) ).

fof(f773,plain,
    ( memberP(sK55,sK30(sK55))
    | ~ ssList(sK32(sK55))
    | ~ ssList(sK33(sK55))
    | ~ ssList(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))))
    | ~ spl58_9
    | ~ spl58_11
    | ~ spl58_12
    | ~ spl58_20
    | ~ spl58_27 ),
    inference(forward_subsumption_resolution,[],[f770,f669]) ).

fof(f776,plain,
    ( memberP(sK55,sK30(sK55))
    | ~ ssList(sK33(sK55))
    | ~ ssList(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))))
    | ~ spl58_9
    | ~ spl58_11
    | ~ spl58_12
    | ~ spl58_15
    | ~ spl58_20
    | ~ spl58_27 ),
    inference(forward_subsumption_resolution,[],[f773,f638]) ).

fof(f777,plain,
    ( memberP(sK55,sK30(sK55))
    | ~ ssList(app(sK32(sK55),cons(sK30(sK55),sK33(sK55))))
    | ~ spl58_9
    | ~ spl58_11
    | ~ spl58_12
    | ~ spl58_15
    | ~ spl58_19
    | ~ spl58_20
    | ~ spl58_27 ),
    inference(forward_subsumption_resolution,[],[f776,f665]) ).

fof(f778,plain,
    ( memberP(sK55,sK30(sK55))
    | ~ spl58_9
    | ~ spl58_11
    | ~ spl58_12
    | ~ spl58_15
    | ~ spl58_19
    | ~ spl58_20
    | ~ spl58_27 ),
    inference(forward_subsumption_resolution,[],[f777,f609]) ).

fof(f779,plain,
    ( sK57 = sK30(sK55)
    | ~ ssItem(sK30(sK55))
    | ~ spl58_9
    | ~ spl58_11
    | ~ spl58_12
    | ~ spl58_15
    | ~ spl58_19
    | ~ spl58_20
    | ~ spl58_27 ),
    inference(resolution,[],[f778,f500]) ).

fof(f780,plain,
    ( sK57 = sK30(sK55)
    | ~ spl58_9
    | ~ spl58_11
    | ~ spl58_12
    | ~ spl58_15
    | ~ spl58_19
    | ~ spl58_20
    | ~ spl58_27 ),
    inference(forward_subsumption_resolution,[],[f779,f669]) ).

fof(f788,plain,
    ( ~ leq(sK57,sK57)
    | ~ spl58_9
    | ~ spl58_11
    | ~ spl58_12
    | ~ spl58_15
    | ~ spl58_19
    | ~ spl58_20
    | ~ spl58_27 ),
    inference(superposition,[],[f688,f780]) ).

fof(f894,plain,
    ( ~ ssItem(sK57)
    | ~ spl58_9
    | ~ spl58_11
    | ~ spl58_12
    | ~ spl58_15
    | ~ spl58_19
    | ~ spl58_20
    | ~ spl58_27 ),
    inference(resolution,[],[f405,f788]) ).

fof(f895,plain,
    ( $false
    | ~ spl58_9
    | ~ spl58_11
    | ~ spl58_12
    | ~ spl58_15
    | ~ spl58_19
    | ~ spl58_20
    | ~ spl58_27 ),
    inference(forward_subsumption_resolution,[],[f894,f499]) ).

fof(f896,plain,
    ( ~ spl58_9
    | ~ spl58_11
    | ~ spl58_12
    | ~ spl58_15
    | ~ spl58_19
    | ~ spl58_20
    | ~ spl58_27 ),
    inference(avatar_contradiction_clause,[],[f895]) ).

cnf(s10,plain,
    ( ~ spl58_9
    | ~ spl58_10
    | ~ spl58_11
    | spl58_12 ),
    inference(sat_conversion,[],[f615]) ).

cnf(s11,plain,
    spl58_9,
    inference(sat_conversion,[],[f619]) ).

cnf(s12,plain,
    spl58_10,
    inference(sat_conversion,[],[f623]) ).

cnf(s14,plain,
    ( spl58_11
    | ~ spl58_15
    | ~ spl58_16 ),
    inference(sat_conversion,[],[f644]) ).

cnf(s15,plain,
    spl58_15,
    inference(sat_conversion,[],[f648]) ).

cnf(s17,plain,
    ( spl58_16
    | ~ spl58_19
    | ~ spl58_20 ),
    inference(sat_conversion,[],[f671]) ).

cnf(s18,plain,
    spl58_19,
    inference(sat_conversion,[],[f675]) ).

cnf(s19,plain,
    spl58_20,
    inference(sat_conversion,[],[f679]) ).

cnf(s25,plain,
    ( ~ spl58_10
    | spl58_27 ),
    inference(sat_conversion,[],[f744]) ).

cnf(s34,plain,
    ( ~ spl58_9
    | ~ spl58_11
    | ~ spl58_12
    | ~ spl58_15
    | ~ spl58_19
    | ~ spl58_20
    | ~ spl58_27 ),
    inference(sat_conversion,[],[f896]) ).

cnf(s35,plain,
    spl58_16,
    inference(rat,[],[s17,s19,s18]) ).

cnf(s36,plain,
    spl58_11,
    inference(rat,[],[s14,s35,s15]) ).

cnf(s37,plain,
    spl58_27,
    inference(rat,[],[s25,s12]) ).

cnf(s38,plain,
    ~ spl58_12,
    inference(rat,[],[s34,s37,s19,s18,s15,s36,s11]) ).

cnf(s39,plain,
    $false,
    inference(rat,[],[s10,s38,s36,s12,s11]) ).

fof(f897,plain,
    $false,
    inference(avatar_sat_refutation,[],[s39]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC261+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19  % Computer : n008.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 08:46:10 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23  Running first-order theorem proving
% 0.09/0.23  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.75/1.77  % (2104816)Detected formulas, will run a generic FOF schedule.
% 6.75/1.77  % (2104825)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2423310066:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.75/1.77  % (2104825)Instruction limit reached! 
% 6.75/1.77  % (2104825)------------------------------
% 6.75/1.77  % (2104825)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.75/1.77  % (2104825)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.75/1.77  % (2104825)CaDiCaL version: 2.1.3
% 6.75/1.77  % (2104825)Termination reason: Instruction limit
% 6.75/1.77  % (2104825)Termination phase: Saturation
% 6.75/1.77  % (2104825)Time elapsed: 0.038 s
% 6.75/1.77  % (2104825)Peak memory usage: 88 MB
% 6.75/1.77  % (2104825)Instructions burned: 122 (million)
% 6.75/1.77  % (2104821)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=3051543524:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.75/1.77  % (2104824)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2706585076:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.75/1.77  % (2104822)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=4164949956:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.75/1.77  % (2104823)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=4216667497:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.75/1.77  % (2104824)Refutation not found, incomplete strategy
% 6.75/1.77  % (2104824)------------------------------
% 6.75/1.77  % (2104824)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.75/1.77  % (2104824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.75/1.77  % (2104824)CaDiCaL version: 2.1.3
% 6.75/1.77  % (2104824)Termination reason: Refutation not found, incomplete strategy
% 6.75/1.77  % (2104824)Time elapsed: 0.003 s
% 6.75/1.77  % (2104824)Peak memory usage: 88 MB
% 6.75/1.77  % (2104824)Instructions burned: 3 (million)
% 6.75/1.77  % (2104826)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3114090363:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.75/1.77  % (2104827)dis-21_1_sil=8000:lcm=predicate:random_seed=204473291: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.75/1.77  % (2104827)Instruction limit reached! 
% 6.75/1.77  % (2104827)------------------------------
% 6.75/1.77  % (2104827)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.75/1.77  % (2104827)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.75/1.77  % (2104827)CaDiCaL version: 2.1.3
% 6.75/1.77  % (2104827)Termination reason: Instruction limit
% 6.75/1.77  % (2104827)Termination phase: Saturation
% 6.75/1.77  % (2104827)Time elapsed: 0.070 s
% 6.75/1.77  % (2104827)Peak memory usage: 91 MB
% 6.75/1.77  % (2104827)Instructions burned: 130 (million)
% 6.75/1.77  % (2104829)lrs+10_1_sil=8000:sp=occurrence:random_seed=85947679:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 6.75/1.77  % (2104826)Instruction limit reached! 
% 6.75/1.77  % (2104826)------------------------------
% 6.75/1.77  % (2104826)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.75/1.77  % (2104826)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.75/1.77  % (2104826)CaDiCaL version: 2.1.3
% 6.75/1.77  % (2104826)Termination reason: Instruction limit
% 6.75/1.77  % (2104826)Termination phase: Saturation
% 6.75/1.77  % (2104826)Time elapsed: 0.094 s
% 6.75/1.77  % (2104826)Peak memory usage: 90 MB
% 6.75/1.77  % (2104826)Instructions burned: 139 (million)
% 6.75/1.77  % (2104829)Instruction limit reached! 
% 6.75/1.77  % (2104829)------------------------------
% 6.75/1.77  % (2104829)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.75/1.77  % (2104829)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.75/1.77  % (2104829)CaDiCaL version: 2.1.3
% 6.75/1.77  % (2104829)Termination reason: Instruction limit
% 6.75/1.77  % (2104829)Termination phase: Saturation
% 6.75/1.77  % (2104829)Time elapsed: 0.088 s
% 6.75/1.77  % (2104829)Peak memory usage: 93 MB
% 6.75/1.77  % (2104829)Instructions burned: 287 (million)
% 6.75/1.77  % (2104837)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3762406410:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 6.75/1.77  % (2104837)Refutation not found, incomplete strategy
% 6.75/1.77  % (2104837)------------------------------
% 6.75/1.77  % (2104837)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.75/1.77  % (2104837)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.75/1.77  % (2104837)CaDiCaL version: 2.1.3
% 6.75/1.77  % (2104837)Termination reason: Refutation not found, incomplete strategy
% 6.75/1.77  % (2104837)Time elapsed: 0.007 s
% 6.75/1.77  % (2104837)Peak memory usage: 89 MB
% 6.75/1.77  % (2104837)Instructions burned: 9 (million)
% 6.75/1.77  % (2104838)lrs+1011_1_sil=32000:sp=occurrence:random_seed=497551584:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 6.75/1.77  % (2104838)Refutation not found, incomplete strategy
% 6.75/1.77  % (2104838)------------------------------
% 6.75/1.77  % (2104838)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.75/1.77  % (2104838)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.75/1.77  % (2104838)CaDiCaL version: 2.1.3
% 6.75/1.77  % (2104838)Termination reason: Refutation not found, incomplete strategy
% 6.75/1.77  % (2104838)Time elapsed: 0.005 s
% 6.75/1.77  % (2104838)Peak memory usage: 89 MB
% 6.75/1.77  % (2104838)Instructions burned: 5 (million)
% 6.75/1.77  % (2104824)------------------------------
% 6.75/1.77  % (2104824)------------------------------
% 6.75/1.77  % (2104839)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=4257899442:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 6.75/1.77  % (2104839)Instruction limit reached! 
% 6.75/1.77  % (2104839)------------------------------
% 6.75/1.77  % (2104839)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.75/1.77  % (2104839)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.75/1.77  % (2104839)CaDiCaL version: 2.1.3
% 6.75/1.77  % (2104839)Termination reason: Instruction limit
% 6.75/1.77  % (2104839)Termination phase: Saturation
% 6.75/1.77  % (2104839)Time elapsed: 0.060 s
% 6.75/1.77  % (2104839)Peak memory usage: 92 MB
% 6.75/1.77  % (2104839)Instructions burned: 248 (million)
% 6.75/1.77  % (2104842)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=752111197:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 6.75/1.77  % (2104842)Refutation not found, incomplete strategy
% 6.75/1.77  % (2104842)------------------------------
% 6.75/1.77  % (2104842)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.75/1.77  % (2104842)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.75/1.77  % (2104842)CaDiCaL version: 2.1.3
% 6.75/1.77  % (2104842)Termination reason: Refutation not found, incomplete strategy
% 6.75/1.77  % (2104842)Time elapsed: 0.005 s
% 6.75/1.77  % (2104842)Peak memory usage: 88 MB
% 6.75/1.77  % (2104842)Instructions burned: 6 (million)
% 6.75/1.77  % (2104844)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2671711897:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 6.75/1.77  % (2104837)------------------------------
% 6.75/1.77  % (2104837)------------------------------
% 6.75/1.77  % (2104838)------------------------------
% 6.75/1.77  % (2104838)------------------------------
% 6.75/1.77  % (2104847)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=1324206797:cts=off:i=113:fsr=off:ss=included:sgt=4_2993 on theBenchmark for (2993ds/113Mi)
% 6.75/1.77  % (2104848)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=3231722688:i=127:av=off:fsr=off:sup=off_2993 on theBenchmark for (2993ds/127Mi)
% 6.75/1.77  % (2104842)------------------------------
% 6.75/1.77  % (2104842)------------------------------
% 6.75/1.77  % (2104847)Instruction limit reached! 
% 6.75/1.77  % (2104847)------------------------------
% 6.75/1.77  % (2104847)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.75/1.77  % (2104847)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.75/1.77  % (2104847)CaDiCaL version: 2.1.3
% 6.75/1.77  % (2104847)Termination reason: Instruction limit
% 6.75/1.77  % (2104847)Termination phase: Saturation
% 6.75/1.77  % (2104847)Time elapsed: 0.074 s
% 6.75/1.77  % (2104847)Peak memory usage: 90 MB
% 6.75/1.77  % (2104847)Instructions burned: 114 (million)
% 6.75/1.77  % (2104848)Instruction limit reached! 
% 6.75/1.77  % (2104848)------------------------------
% 6.75/1.77  % (2104848)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.75/1.77  % (2104848)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.75/1.77  % (2104848)CaDiCaL version: 2.1.3
% 6.75/1.77  % (2104848)Termination reason: Instruction limit
% 6.75/1.77  % (2104848)Termination phase: Saturation
% 6.75/1.77  % (2104848)Time elapsed: 0.062 s
% 6.75/1.77  % (2104848)Peak memory usage: 90 MB
% 6.75/1.77  % (2104848)Instructions burned: 127 (million)
% 6.75/1.77  % (2104821)First to succeed.
% 6.75/1.77  % (2104821)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2104816"
% 6.75/1.77  % (2104822)Also succeeded, but the first one will report.
% 6.75/1.77  % (2104851)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=1883165018:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2992 on theBenchmark for (2992ds/114Mi)
% 6.75/1.77  % (2104853)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=1777477278:i=437:sd=1:aac=none:ss=included_2991 on theBenchmark for (2991ds/437Mi)
% 6.75/1.77  % (2104852)lrs+10_1_sil=8000:sp=occurrence:random_seed=663457468:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2991 on theBenchmark for (2991ds/907Mi)
% 6.75/1.77  % (2104853)Refutation not found, incomplete strategy
% 6.75/1.77  % (2104853)------------------------------
% 6.75/1.77  % (2104853)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.75/1.77  % (2104853)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.75/1.77  % (2104853)CaDiCaL version: 2.1.3
% 6.75/1.77  % (2104853)Termination reason: Refutation not found, incomplete strategy
% 6.75/1.77  % (2104853)Time elapsed: 0.002 s
% 6.75/1.77  % (2104853)Peak memory usage: 88 MB
% 6.75/1.77  % (2104853)Instructions burned: 2 (million)
% 6.75/1.77  % (2104851)Instruction limit reached! 
% 6.75/1.77  % (2104851)------------------------------
% 6.75/1.77  % (2104851)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.75/1.77  % (2104851)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.75/1.77  % (2104851)CaDiCaL version: 2.1.3
% 6.75/1.77  % (2104851)Termination reason: Instruction limit
% 6.75/1.77  % (2104851)Termination phase: Saturation
% 6.75/1.77  % (2104851)Time elapsed: 0.067 s
% 6.75/1.77  % (2104851)Peak memory usage: 90 MB
% 6.75/1.77  % (2104851)Instructions burned: 115 (million)
% 6.75/1.77  % (2104844)Also succeeded, but the first one will report.
% 6.75/1.77  % (2104821)Refutation found. Thanks to Tanya!
% 6.75/1.77  % SZS status Theorem for theBenchmark
% 6.75/1.77  % SZS output start Proof for theBenchmark
% See solution above
% 8.27/1.86  % (2104821)------------------------------
% 8.27/1.86  % (2104821)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.27/1.86  % (2104821)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.27/1.86  % (2104821)CaDiCaL version: 2.1.3
% 8.27/1.86  % (2104821)Termination reason: Refutation
% 8.27/1.86  % (2104821)Time elapsed: 0.681 s
% 8.27/1.86  % (2104821)Peak memory usage: 131 MB
% 8.27/1.86  % (2104821)Instructions burned: 1020 (million)
% 8.27/1.86  % (2104821)------------------------------
% 8.27/1.86  % (2104821)------------------------------
% 8.27/1.86  % (2104816)Success in time 1.103 s
% 8.27/1.86  % Vampire exiting
%------------------------------------------------------------------------------