↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC126+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 : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 01:02:34 PM UTC 2026

% Result   : Theorem 9.60s 2.24s
% Output   : Refutation 10.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :   17
% Syntax   : Number of formulae    :  127 (  20 unt;   6 def)
%            Number of atoms       :  493 (  68 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  637 ( 271   ~; 261   |;  64   &)
%                                         (  12 <=>;  29  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   7 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   6 con; 0-2 aty)
%            Number of variables   :  153 (   0 sgn 127   !;  26   ?)

% 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(f7,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( segmentP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( ssList(X3)
                    & app(app(X2,X1),X3) = X0 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax7) ).

fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).

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

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

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

fof(f56,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( segmentP(X0,X1)
                   => segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax56) ).

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

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

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X1 != X3
                    | X0 != X2
                    | ( ( ~ neq(X1,nil)
                        | ! [X4] :
                            ( ssItem(X4)
                           => ( cons(X4,nil) != X2
                              | ~ memberP(X3,X4) ) )
                        | ( neq(X0,nil)
                          & segmentP(X1,X0) ) )
                      & ( ~ neq(X1,nil)
                        | neq(X3,nil) ) ) ) ) ) ) ),
    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
                      | ( ( ~ neq(X1,nil)
                          | ! [X4] :
                              ( ssItem(X4)
                             => ( cons(X4,nil) != X2
                                | ~ memberP(X3,X4) ) )
                          | ( neq(X0,nil)
                            & segmentP(X1,X0) ) )
                        & ( ~ neq(X1,nil)
                          | neq(X3,nil) ) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f98,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ( ( neq(X1,nil)
                      & ? [X4] :
                          ( cons(X4,nil) = X2
                          & memberP(X3,X4)
                          & ssItem(X4) )
                      & ( ~ neq(X0,nil)
                        | ~ segmentP(X1,X0) ) )
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ( ( neq(X1,nil)
                      & ? [X4] :
                          ( cons(X4,nil) = X2
                          & memberP(X3,X4)
                          & ssItem(X4) )
                      & ( ~ neq(X0,nil)
                        | ~ segmentP(X1,X0) ) )
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f98]) ).

fof(f100,plain,
    ! [X0] :
      ( ! [X1] :
          ( nil != cons(X1,X0)
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f107,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( neq(X0,X1)
          <=> X0 != X1 )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f112,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(f115,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ! [X3] :
                  ( segmentP(app(app(X2,X0),X3),X1)
                  | ~ segmentP(X0,X1)
                  | ~ ssList(X3) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f56]) ).

fof(f116,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ! [X3] :
                  ( segmentP(app(app(X2,X0),X3),X1)
                  | ~ segmentP(X0,X1)
                  | ~ ssList(X3) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f115]) ).

fof(f122,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( segmentP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( ssList(X3)
                    & app(app(X2,X1),X3) = X0 ) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f123,plain,
    ! [X0] :
      ( app(X0,nil) = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f84]) ).

fof(f126,plain,
    ! [X0] :
      ( ! [X1] :
          ( cons(X1,X0) = app(cons(X1,nil),X0)
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f81]) ).

fof(f131,plain,
    ! [X0] :
      ( app(nil,X0) = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f28]) ).

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

fof(f134,plain,
    ( sK1 = sK3
    & sK0 = sK2
    & ( ( neq(sK1,nil)
        & sK2 = cons(sK4,nil)
        & memberP(sK3,sK4)
        & ssItem(sK4)
        & ( ~ neq(sK0,nil)
          | ~ segmentP(sK1,sK0) ) )
      | ( neq(sK1,nil)
        & ~ neq(sK3,nil) ) )
    & ssList(sK3)
    & ssList(sK2)
    & ssList(sK1)
    & ssList(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f99]) ).

fof(f137,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( neq(X0,X1)
              | X0 = X1 )
            & ( X0 != X1
              | ~ neq(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f107]) ).

fof(f143,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,[],[f112]) ).

fof(f144,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,[],[f143]) ).

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

fof(f147,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(app(X2,X1),X3) != X0 ) ) )
            & ( ? [X2] :
                  ( ssList(X2)
                  & ? [X3] :
                      ( ssList(X3)
                      & app(app(X2,X1),X3) = X0 ) )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f122]) ).

fof(f148,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(app(X2,X1),X3) != X0 ) ) )
            & ( ? [X4] :
                  ( ssList(X4)
                  & ? [X5] :
                      ( ssList(X5)
                      & app(app(X4,X1),X5) = X0 ) )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(rectify,[],[f147]) ).

fof(f149,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(app(X2,X1),X3) != X0 ) ) )
            & ( ( ssList(sK11(X0,X1))
                & ssList(sK12(X0,X1))
                & app(app(sK11(X0,X1),X1),sK12(X0,X1)) = X0 )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12]),skolemize(X4,sK11(X0,X1)),skolemize(X5,sK12(X0,X1))],[f148]) ).

fof(f152,plain,
    ssList(sK0),
    inference(cnf_transformation,[],[f134]) ).

fof(f153,plain,
    ssList(sK1),
    inference(cnf_transformation,[],[f134]) ).

fof(f156,plain,
    ( ~ neq(sK0,nil)
    | ~ segmentP(sK1,sK0)
    | ~ neq(sK3,nil) ),
    inference(cnf_transformation,[],[f134]) ).

fof(f158,plain,
    ( ssItem(sK4)
    | ~ neq(sK3,nil) ),
    inference(cnf_transformation,[],[f134]) ).

fof(f160,plain,
    ( memberP(sK3,sK4)
    | ~ neq(sK3,nil) ),
    inference(cnf_transformation,[],[f134]) ).

fof(f162,plain,
    ( sK2 = cons(sK4,nil)
    | ~ neq(sK3,nil) ),
    inference(cnf_transformation,[],[f134]) ).

fof(f165,plain,
    ( neq(sK1,nil)
    | neq(sK1,nil) ),
    inference(cnf_transformation,[],[f134]) ).

fof(f166,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f134]) ).

fof(f167,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f134]) ).

fof(f171,plain,
    ! [X0,X1] :
      ( nil != cons(X1,X0)
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f100]) ).

fof(f180,plain,
    ! [X0,X1] :
      ( neq(X0,X1)
      | X0 = X1
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f137]) ).

fof(f183,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f17]) ).

fof(f191,plain,
    ! [X0,X1] :
      ( ~ ssItem(X1)
      | ~ memberP(X0,X1)
      | app(sK9(X0,X1),cons(X1,sK10(X0,X1))) = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f145]) ).

fof(f192,plain,
    ! [X0,X1] :
      ( ~ ssItem(X1)
      | ~ memberP(X0,X1)
      | ssList(sK10(X0,X1))
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f145]) ).

fof(f193,plain,
    ! [X0,X1] :
      ( ~ ssItem(X1)
      | ~ memberP(X0,X1)
      | ssList(sK9(X0,X1))
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f145]) ).

fof(f198,plain,
    ! [X2,X3,X0,X1] :
      ( ~ segmentP(X0,X1)
      | segmentP(app(app(X2,X0),X3),X1)
      | ~ ssList(X3)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f116]) ).

fof(f205,plain,
    ! [X2,X3,X0,X1] :
      ( segmentP(X0,X1)
      | ~ ssList(X2)
      | ~ ssList(X3)
      | app(app(X2,X1),X3) != X0
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f149]) ).

fof(f206,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(X0,nil) = X0 ),
    inference(cnf_transformation,[],[f123]) ).

fof(f211,plain,
    ! [X0,X1] :
      ( ~ ssItem(X1)
      | cons(X1,X0) = app(cons(X1,nil),X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f126]) ).

fof(f214,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | app(nil,X0) = X0 ),
    inference(cnf_transformation,[],[f131]) ).

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

fof(f217,plain,
    ( neq(sK3,nil)
    | neq(sK3,nil) ),
    inference(definition_unfolding,[],[f165,f167,f167]) ).

fof(f223,plain,
    ( ~ neq(sK2,nil)
    | ~ segmentP(sK3,sK2)
    | ~ neq(sK3,nil) ),
    inference(definition_unfolding,[],[f156,f166,f167,f166]) ).

fof(f224,plain,
    ssList(sK3),
    inference(definition_unfolding,[],[f153,f167]) ).

fof(f225,plain,
    ssList(sK2),
    inference(definition_unfolding,[],[f152,f166]) ).

fof(f231,plain,
    ! [X2,X3,X1] :
      ( ~ ssList(app(app(X2,X1),X3))
      | ~ ssList(X2)
      | ~ ssList(X3)
      | ~ ssList(X1)
      | segmentP(app(app(X2,X1),X3),X1) ),
    inference(equality_resolution,[],[f205]) ).

fof(f238,plain,
    neq(sK3,nil),
    inference(duplicate_literal_removal,[],[f217]) ).

fof(f240,definition,
    ( spl13_1
  <=> neq(sK3,nil) ),
    introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).

fof(f243,definition,
    ( spl13_2
  <=> segmentP(sK3,sK2) ),
    introduced(definition,[new_symbols(definition,[spl13_2])],[avatar_definition]) ).

fof(f244,plain,
    ( ~ segmentP(sK3,sK2)
    | spl13_2 ),
    inference(avatar_component_clause,[],[f243]) ).

fof(f246,definition,
    ( spl13_3
  <=> neq(sK2,nil) ),
    introduced(definition,[new_symbols(definition,[spl13_3])],[avatar_definition]) ).

fof(f247,plain,
    ( ~ neq(sK2,nil)
    | spl13_3 ),
    inference(avatar_component_clause,[],[f246]) ).

fof(f248,plain,
    ( ~ spl13_1
    | ~ spl13_2
    | ~ spl13_3 ),
    inference(avatar_split_clause,[],[f223,f246,f243,f240]) ).

fof(f252,definition,
    ( spl13_4
  <=> ssItem(sK4) ),
    introduced(definition,[new_symbols(definition,[spl13_4])],[avatar_definition]) ).

fof(f253,plain,
    ( ssItem(sK4)
    | ~ spl13_4 ),
    inference(avatar_component_clause,[],[f252]) ).

fof(f254,plain,
    ( ~ spl13_1
    | spl13_4 ),
    inference(avatar_split_clause,[],[f158,f252,f240]) ).

fof(f257,definition,
    ( spl13_5
  <=> memberP(sK3,sK4) ),
    introduced(definition,[new_symbols(definition,[spl13_5])],[avatar_definition]) ).

fof(f258,plain,
    ( memberP(sK3,sK4)
    | ~ spl13_5 ),
    inference(avatar_component_clause,[],[f257]) ).

fof(f259,plain,
    ( ~ spl13_1
    | spl13_5 ),
    inference(avatar_split_clause,[],[f160,f257,f240]) ).

fof(f262,definition,
    ( spl13_6
  <=> sK2 = cons(sK4,nil) ),
    introduced(definition,[new_symbols(definition,[spl13_6])],[avatar_definition]) ).

fof(f263,plain,
    ( sK2 = cons(sK4,nil)
    | ~ spl13_6 ),
    inference(avatar_component_clause,[],[f262]) ).

fof(f264,plain,
    ( ~ spl13_1
    | spl13_6 ),
    inference(avatar_split_clause,[],[f162,f262,f240]) ).

fof(f266,plain,
    spl13_1,
    inference(avatar_split_clause,[],[f238,f240]) ).

fof(f267,plain,
    ( nil != sK2
    | ~ ssItem(sK4)
    | ~ ssList(nil)
    | ~ spl13_6 ),
    inference(superposition,[],[f171,f263]) ).

fof(f268,plain,
    ( nil != sK2
    | ~ ssList(nil)
    | ~ spl13_4
    | ~ spl13_6 ),
    inference(forward_subsumption_resolution,[],[f267,f253]) ).

fof(f269,plain,
    ( nil != sK2
    | ~ spl13_4
    | ~ spl13_6 ),
    inference(forward_subsumption_resolution,[],[f268,f183]) ).

fof(f270,plain,
    sK3 = app(sK3,nil),
    inference(resolution,[],[f206,f224]) ).

fof(f279,plain,
    sK2 = app(nil,sK2),
    inference(resolution,[],[f214,f225]) ).

fof(f283,plain,
    ! [X0] :
      ( ~ ssList(app(sK2,X0))
      | ~ ssList(nil)
      | ~ ssList(X0)
      | ~ ssList(sK2)
      | segmentP(app(sK2,X0),sK2) ),
    inference(superposition,[],[f231,f279]) ).

fof(f286,plain,
    ! [X0] :
      ( ~ ssList(app(sK2,X0))
      | ~ ssList(X0)
      | ~ ssList(sK2)
      | segmentP(app(sK2,X0),sK2) ),
    inference(forward_subsumption_resolution,[],[f283,f183]) ).

fof(f288,plain,
    ! [X0] :
      ( segmentP(app(sK2,X0),sK2)
      | ~ ssList(X0)
      | ~ ssList(app(sK2,X0)) ),
    inference(forward_subsumption_resolution,[],[f286,f225]) ).

fof(f291,plain,
    ( ! [X0] :
        ( cons(sK4,X0) = app(cons(sK4,nil),X0)
        | ~ ssList(X0) )
    | ~ spl13_4 ),
    inference(resolution,[],[f211,f253]) ).

fof(f292,plain,
    ( ! [X0] :
        ( ~ ssList(X0)
        | cons(sK4,X0) = app(sK2,X0) )
    | ~ spl13_4
    | ~ spl13_6 ),
    inference(forward_demodulation,[],[f291,f263]) ).

fof(f298,plain,
    ( ! [X0] :
        ( ~ memberP(X0,sK4)
        | app(sK9(X0,sK4),cons(sK4,sK10(X0,sK4))) = X0
        | ~ ssList(X0) )
    | ~ spl13_4 ),
    inference(resolution,[],[f191,f253]) ).

fof(f299,plain,
    ( sK3 = app(sK9(sK3,sK4),cons(sK4,sK10(sK3,sK4)))
    | ~ ssList(sK3)
    | ~ spl13_4
    | ~ spl13_5 ),
    inference(resolution,[],[f298,f258]) ).

fof(f300,plain,
    ( sK3 = app(sK9(sK3,sK4),cons(sK4,sK10(sK3,sK4)))
    | ~ spl13_4
    | ~ spl13_5 ),
    inference(forward_subsumption_resolution,[],[f299,f224]) ).

fof(f314,plain,
    ! [X0] :
      ( ssList(app(sK2,X0))
      | ~ ssList(X0) ),
    inference(resolution,[],[f216,f225]) ).

fof(f316,plain,
    ( ! [X0] :
        ( ~ memberP(X0,sK4)
        | ssList(sK10(X0,sK4))
        | ~ ssList(X0) )
    | ~ spl13_4 ),
    inference(resolution,[],[f192,f253]) ).

fof(f317,plain,
    ( ssList(sK10(sK3,sK4))
    | ~ ssList(sK3)
    | ~ spl13_4
    | ~ spl13_5 ),
    inference(resolution,[],[f316,f258]) ).

fof(f318,plain,
    ( ssList(sK10(sK3,sK4))
    | ~ spl13_4
    | ~ spl13_5 ),
    inference(forward_subsumption_resolution,[],[f317,f224]) ).

fof(f320,plain,
    ( cons(sK4,sK10(sK3,sK4)) = app(sK2,sK10(sK3,sK4))
    | ~ spl13_4
    | ~ spl13_5
    | ~ spl13_6 ),
    inference(resolution,[],[f318,f292]) ).

fof(f361,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X0,app(sK2,X1)),X2),sK2)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssList(sK2)
      | ~ ssList(app(sK2,X1))
      | ~ ssList(X1)
      | ~ ssList(app(sK2,X1)) ),
    inference(resolution,[],[f198,f288]) ).

fof(f364,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X0,app(sK2,X1)),X2),sK2)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssList(sK2)
      | ~ ssList(app(sK2,X1))
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f361]) ).

fof(f367,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X0,app(sK2,X1)),X2),sK2)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssList(app(sK2,X1))
      | ~ ssList(X1) ),
    inference(forward_subsumption_resolution,[],[f364,f225]) ).

fof(f369,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X0,app(sK2,X1)),X2),sK2)
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssList(X1) ),
    inference(forward_subsumption_resolution,[],[f367,f314]) ).

fof(f380,plain,
    ( ! [X0] :
        ( ~ memberP(X0,sK4)
        | ssList(sK9(X0,sK4))
        | ~ ssList(X0) )
    | ~ spl13_4 ),
    inference(resolution,[],[f193,f253]) ).

fof(f385,plain,
    ( ssList(sK9(sK3,sK4))
    | ~ ssList(sK3)
    | ~ spl13_4
    | ~ spl13_5 ),
    inference(resolution,[],[f380,f258]) ).

fof(f390,plain,
    ( ssList(sK9(sK3,sK4))
    | ~ spl13_4
    | ~ spl13_5 ),
    inference(forward_subsumption_resolution,[],[f385,f224]) ).

fof(f460,plain,
    ( sK3 = app(sK9(sK3,sK4),app(sK2,sK10(sK3,sK4)))
    | ~ spl13_4
    | ~ spl13_5
    | ~ spl13_6 ),
    inference(superposition,[],[f300,f320]) ).

fof(f576,plain,
    ( ! [X0] :
        ( segmentP(app(sK3,X0),sK2)
        | ~ ssList(X0)
        | ~ ssList(sK9(sK3,sK4))
        | ~ ssList(sK10(sK3,sK4)) )
    | ~ spl13_4
    | ~ spl13_5
    | ~ spl13_6 ),
    inference(superposition,[],[f369,f460]) ).

fof(f578,plain,
    ( ! [X0] :
        ( segmentP(app(sK3,X0),sK2)
        | ~ ssList(X0)
        | ~ ssList(sK10(sK3,sK4)) )
    | ~ spl13_4
    | ~ spl13_5
    | ~ spl13_6 ),
    inference(forward_subsumption_resolution,[],[f576,f390]) ).

fof(f579,plain,
    ( ! [X0] :
        ( segmentP(app(sK3,X0),sK2)
        | ~ ssList(X0) )
    | ~ spl13_4
    | ~ spl13_5
    | ~ spl13_6 ),
    inference(forward_subsumption_resolution,[],[f578,f318]) ).

fof(f581,plain,
    ( segmentP(sK3,sK2)
    | ~ ssList(nil)
    | ~ spl13_4
    | ~ spl13_5
    | ~ spl13_6 ),
    inference(superposition,[],[f579,f270]) ).

fof(f582,plain,
    ( ~ ssList(nil)
    | spl13_2
    | ~ spl13_4
    | ~ spl13_5
    | ~ spl13_6 ),
    inference(forward_subsumption_resolution,[],[f581,f244]) ).

fof(f584,plain,
    ( $false
    | spl13_2
    | ~ spl13_4
    | ~ spl13_5
    | ~ spl13_6 ),
    inference(forward_subsumption_resolution,[],[f582,f183]) ).

fof(f585,plain,
    ( spl13_2
    | ~ spl13_4
    | ~ spl13_5
    | ~ spl13_6 ),
    inference(avatar_contradiction_clause,[],[f584]) ).

fof(f590,plain,
    ( nil = sK2
    | ~ ssList(nil)
    | ~ ssList(sK2)
    | spl13_3 ),
    inference(resolution,[],[f247,f180]) ).

fof(f592,plain,
    ( ~ ssList(nil)
    | ~ ssList(sK2)
    | spl13_3
    | ~ spl13_4
    | ~ spl13_6 ),
    inference(forward_subsumption_resolution,[],[f590,f269]) ).

fof(f594,plain,
    ( ~ ssList(sK2)
    | spl13_3
    | ~ spl13_4
    | ~ spl13_6 ),
    inference(forward_subsumption_resolution,[],[f592,f183]) ).

fof(f602,plain,
    ( $false
    | spl13_3
    | ~ spl13_4
    | ~ spl13_6 ),
    inference(forward_subsumption_resolution,[],[f594,f225]) ).

fof(f603,plain,
    ( spl13_3
    | ~ spl13_4
    | ~ spl13_6 ),
    inference(avatar_contradiction_clause,[],[f602]) ).

cnf(s1,plain,
    ( ~ spl13_1
    | ~ spl13_2
    | ~ spl13_3 ),
    inference(sat_conversion,[],[f248]) ).

cnf(s3,plain,
    ( ~ spl13_1
    | spl13_4 ),
    inference(sat_conversion,[],[f254]) ).

cnf(s5,plain,
    ( ~ spl13_1
    | spl13_5 ),
    inference(sat_conversion,[],[f259]) ).

cnf(s7,plain,
    ( ~ spl13_1
    | spl13_6 ),
    inference(sat_conversion,[],[f264]) ).

cnf(s9,plain,
    spl13_1,
    inference(sat_conversion,[],[f266]) ).

cnf(s38,plain,
    ( spl13_2
    | ~ spl13_4
    | ~ spl13_5
    | ~ spl13_6 ),
    inference(sat_conversion,[],[f585]) ).

cnf(s41,plain,
    ( spl13_3
    | ~ spl13_4
    | ~ spl13_6 ),
    inference(sat_conversion,[],[f603]) ).

cnf(s48,plain,
    spl13_6,
    inference(rat,[],[s7,s9]) ).

cnf(s49,plain,
    spl13_5,
    inference(rat,[],[s5,s9]) ).

cnf(s50,plain,
    spl13_4,
    inference(rat,[],[s3,s9]) ).

cnf(s51,plain,
    spl13_3,
    inference(rat,[],[s41,s48,s50]) ).

cnf(s52,plain,
    spl13_2,
    inference(rat,[],[s38,s48,s49,s50]) ).

cnf(s71,plain,
    $false,
    inference(rat,[],[s1,s51,s52,s9]) ).

fof(f604,plain,
    $false,
    inference(avatar_sat_refutation,[],[s71]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC126+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39  % Computer : n009.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Mon Sep 28 08:02:44 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43  Running first-order theorem proving
% 0.12/0.43  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
% 9.60/2.23  % (2875531)Detected formulas, will run a generic FOF schedule.
% 9.60/2.23  % (2875613)dis-21_1_sil=8000:lcm=predicate:random_seed=3955827264: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)
% 9.60/2.23  % (2875606)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=1845593681:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 9.60/2.23  % (2875604)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=344664116:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 9.60/2.23  % (2875610)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1590490795:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 9.60/2.23  % (2875612)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=615277727:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 9.60/2.23  % (2875609)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=500095709:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 9.60/2.23  % (2875613)Instruction limit reached! 
% 9.60/2.23  % (2875613)------------------------------
% 9.60/2.23  % (2875613)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.60/2.23  % (2875613)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.60/2.23  % (2875613)CaDiCaL version: 2.1.3
% 9.60/2.23  % (2875613)Termination reason: Instruction limit
% 9.60/2.23  % (2875613)Termination phase: Saturation
% 9.60/2.23  % (2875613)Time elapsed: 0.040 s
% 9.60/2.23  % (2875613)Peak memory usage: 90 MB
% 9.60/2.23  % (2875613)Instructions burned: 129 (million)
% 9.60/2.23  % (2875609)Refutation not found, incomplete strategy
% 9.60/2.23  % (2875609)------------------------------
% 9.60/2.23  % (2875609)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.60/2.23  % (2875609)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.60/2.23  % (2875609)CaDiCaL version: 2.1.3
% 9.60/2.23  % (2875609)Termination reason: Refutation not found, incomplete strategy
% 9.60/2.23  % (2875609)Time elapsed: 0.006 s
% 9.60/2.23  % (2875609)Peak memory usage: 89 MB
% 9.60/2.23  % (2875609)Instructions burned: 4 (million)
% 9.60/2.23  % (2875608)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=632295187:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 9.60/2.23  % (2875610)Instruction limit reached! 
% 9.60/2.23  % (2875610)------------------------------
% 9.60/2.23  % (2875610)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.60/2.23  % (2875610)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.60/2.23  % (2875610)CaDiCaL version: 2.1.3
% 9.60/2.23  % (2875610)Termination reason: Instruction limit
% 9.60/2.23  % (2875610)Termination phase: Saturation
% 9.60/2.23  % (2875610)Time elapsed: 0.052 s
% 9.60/2.23  % (2875610)Peak memory usage: 88 MB
% 9.60/2.23  % (2875610)Instructions burned: 121 (million)
% 9.60/2.23  % (2875612)Instruction limit reached! 
% 9.60/2.23  % (2875612)------------------------------
% 9.60/2.23  % (2875612)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.60/2.23  % (2875612)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.60/2.23  % (2875612)CaDiCaL version: 2.1.3
% 9.60/2.23  % (2875612)Termination reason: Instruction limit
% 9.60/2.23  % (2875612)Termination phase: Saturation
% 9.60/2.23  % (2875612)Time elapsed: 0.064 s
% 9.60/2.23  % (2875612)Peak memory usage: 89 MB
% 9.60/2.23  % (2875612)Instructions burned: 141 (million)
% 9.60/2.23  % (2875626)lrs+10_1_sil=8000:sp=occurrence:random_seed=193113417:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 9.60/2.23  % (2875628)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4000824928:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 9.60/2.23  % (2875626)Instruction limit reached! 
% 9.60/2.23  % (2875626)------------------------------
% 9.60/2.23  % (2875626)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.60/2.23  % (2875629)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1190321155:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 9.60/2.23  % (2875626)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.60/2.23  % (2875626)CaDiCaL version: 2.1.3
% 9.60/2.23  % (2875626)Termination reason: Instruction limit
% 9.60/2.23  % (2875626)Termination phase: Saturation
% 9.60/2.23  % (2875626)Time elapsed: 0.094 s
% 9.60/2.23  % (2875626)Peak memory usage: 93 MB
% 9.60/2.23  % (2875626)Instructions burned: 286 (million)
% 9.60/2.23  % (2875628)Instruction limit reached! 
% 9.60/2.23  % (2875628)------------------------------
% 9.60/2.23  % (2875628)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.60/2.23  % (2875628)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.60/2.23  % (2875628)CaDiCaL version: 2.1.3
% 9.60/2.23  % (2875628)Termination reason: Instruction limit
% 9.60/2.23  % (2875628)Termination phase: Saturation
% 9.60/2.23  % (2875628)Time elapsed: 0.076 s
% 9.60/2.23  % (2875628)Peak memory usage: 91 MB
% 9.60/2.23  % (2875628)Instructions burned: 160 (million)
% 9.60/2.23  % (2875633)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=118151040:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 9.60/2.23  % (2875609)------------------------------
% 9.60/2.24  % (2875609)------------------------------
% 9.60/2.24  % (2875633)Instruction limit reached! 
% 9.60/2.24  % (2875633)------------------------------
% 9.60/2.24  % (2875633)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.60/2.24  % (2875633)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.60/2.24  % (2875633)CaDiCaL version: 2.1.3
% 9.60/2.24  % (2875633)Termination reason: Instruction limit
% 9.60/2.24  % (2875633)Termination phase: Saturation
% 9.60/2.24  % (2875633)Time elapsed: 0.066 s
% 9.60/2.24  % (2875633)Peak memory usage: 94 MB
% 9.60/2.24  % (2875633)Instructions burned: 251 (million)
% 9.60/2.24  % (2875629)Instruction limit reached! 
% 9.60/2.24  % (2875629)------------------------------
% 9.60/2.24  % (2875629)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.60/2.24  % (2875629)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.60/2.24  % (2875629)CaDiCaL version: 2.1.3
% 9.60/2.24  % (2875629)Termination reason: Instruction limit
% 9.60/2.24  % (2875629)Termination phase: Saturation
% 9.60/2.24  % (2875629)Time elapsed: 0.204 s
% 9.60/2.24  % (2875629)Peak memory usage: 92 MB
% 9.60/2.24  % (2875629)Instructions burned: 327 (million)
% 9.60/2.24  % (2875634)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3235327070:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 9.60/2.24  % (2875637)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=4210680579:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 9.60/2.24  % (2875637)Instruction limit reached! 
% 9.60/2.24  % (2875637)------------------------------
% 9.60/2.24  % (2875637)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.60/2.24  % (2875637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.60/2.24  % (2875637)CaDiCaL version: 2.1.3
% 9.60/2.24  % (2875637)Termination reason: Instruction limit
% 9.60/2.24  % (2875637)Termination phase: Saturation
% 9.60/2.24  % (2875637)Time elapsed: 0.045 s
% 9.60/2.24  % (2875637)Peak memory usage: 90 MB
% 9.60/2.24  % (2875637)Instructions burned: 115 (million)
% 9.60/2.24  % (2875636)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=4248886262:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 9.60/2.24  % (2875634)Instruction limit reached! 
% 9.60/2.24  % (2875634)------------------------------
% 9.60/2.24  % (2875634)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.60/2.24  % (2875634)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.60/2.24  % (2875634)CaDiCaL version: 2.1.3
% 9.60/2.24  % (2875634)Termination reason: Instruction limit
% 9.60/2.24  % (2875634)Termination phase: Saturation
% 9.60/2.24  % (2875634)Time elapsed: 0.176 s
% 9.60/2.24  % (2875634)Peak memory usage: 89 MB
% 9.60/2.24  % (2875634)Instructions burned: 295 (million)
% 9.60/2.24  % (2875638)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=762478700:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 9.60/2.24  % (2875649)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=2439483480:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2992 on theBenchmark for (2992ds/114Mi)
% 9.60/2.24  % (2875649)Instruction limit reached! 
% 9.60/2.24  % (2875649)------------------------------
% 9.60/2.24  % (2875649)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.60/2.24  % (2875649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.60/2.24  % (2875649)CaDiCaL version: 2.1.3
% 9.60/2.24  % (2875649)Termination reason: Instruction limit
% 9.60/2.24  % (2875649)Termination phase: Saturation
% 9.60/2.24  % (2875649)Time elapsed: 0.039 s
% 9.60/2.24  % (2875649)Peak memory usage: 89 MB
% 9.60/2.24  % (2875649)Instructions burned: 114 (million)
% 9.60/2.24  % (2875638)Instruction limit reached! 
% 9.60/2.24  % (2875638)------------------------------
% 9.60/2.24  % (2875638)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.60/2.24  % (2875638)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.60/2.24  % (2875638)CaDiCaL version: 2.1.3
% 9.60/2.24  % (2875638)Termination reason: Instruction limit
% 9.60/2.24  % (2875638)Termination phase: Saturation
% 9.60/2.24  % (2875638)Time elapsed: 0.109 s
% 9.60/2.24  % (2875638)Peak memory usage: 90 MB
% 9.60/2.24  % (2875638)Instructions burned: 127 (million)
% 9.60/2.24  % (2875606)First to succeed.
% 9.60/2.24  % (2875606)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2875531"
% 9.60/2.24  % (2875651)lrs+10_1_sil=8000:sp=occurrence:random_seed=2085485842:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2992 on theBenchmark for (2992ds/907Mi)
% 9.60/2.24  % (2875662)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=3309285346:i=437:sd=1:aac=none:ss=included_2990 on theBenchmark for (2990ds/437Mi)
% 9.60/2.24  % (2875662)Instruction limit reached! 
% 9.60/2.24  % (2875662)------------------------------
% 9.60/2.24  % (2875662)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.60/2.24  % (2875662)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.60/2.24  % (2875662)CaDiCaL version: 2.1.3
% 9.60/2.24  % (2875662)Termination reason: Instruction limit
% 9.60/2.24  % (2875662)Termination phase: Saturation
% 9.60/2.24  % (2875662)Time elapsed: 0.116 s
% 9.60/2.24  % (2875662)Peak memory usage: 88 MB
% 9.60/2.24  % (2875662)Instructions burned: 439 (million)
% 9.60/2.24  % (2875663)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3810221412:i=5202:ss=axioms:sgt=16_2990 on theBenchmark for (2990ds/5202Mi)
% 9.60/2.24  % (2875606)Refutation found. Thanks to Tanya!
% 9.60/2.24  % SZS status Theorem for theBenchmark
% 9.60/2.24  % SZS output start Proof for theBenchmark
% See solution above
% 10.04/2.36  % (2875606)------------------------------
% 10.04/2.36  % (2875606)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 10.04/2.36  % (2875606)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 10.04/2.36  % (2875606)CaDiCaL version: 2.1.3
% 10.04/2.36  % (2875606)Termination reason: Refutation
% 10.04/2.36  % (2875606)Time elapsed: 0.789 s
% 10.04/2.36  % (2875606)Peak memory usage: 129 MB
% 10.04/2.36  % (2875606)Instructions burned: 1006 (million)
% 10.04/2.36  % (2875606)------------------------------
% 10.04/2.36  % (2875606)------------------------------
% 10.04/2.36  % (2875531)Success in time 1.358 s
% 10.04/2.36  % Vampire exiting
%------------------------------------------------------------------------------