↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n014.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:22 PM UTC 2026

% Result   : Theorem 6.84s 1.81s
% Output   : Refutation 8.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   19
% Syntax   : Number of formulae    :  135 (  29 unt;   9 def)
%            Number of atoms       :  506 (  76 equ)
%            Maximal formula atoms :   25 (   3 avg)
%            Number of connectives :  632 ( 261   ~; 253   |;  69   &)
%                                         (  12 <=>;  37  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   5 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :   16 (  14 usr;  10 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;  11 con; 0-2 aty)
%            Number of variables   :  149 (   0 sgn 121   !;  28   ?)

% Comments : 
%------------------------------------------------------------------------------
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/sandbox/benchmark/theBenchmark.p',ax11) ).

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

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

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

fof(f33,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ( lt(X0,X1)
           => ~ lt(X1,X0) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax33) ).

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

fof(f82,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => app(app(X0,X1),X2) = app(X0,app(X1,X2)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).

fof(f90,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ~ lt(X0,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax90) ).

fof(f92,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ( leq(X0,X1)
           => ( X0 = X1
              | lt(X0,X1) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax92) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ~ ssList(X3)
                  | X3 != X1
                  | X2 != X0
                  | ! [X4] :
                      ( ~ ssList(X4)
                      | app(X2,X4) != X3
                      | ~ totalorderedP(X2)
                      | ? [X5] :
                          ( ssItem(X5)
                          & ? [X6] :
                              ( ssList(X6)
                              & app(cons(X5,nil),X6) = X4
                              & ? [X7] :
                                  ( ssItem(X7)
                                  & ? [X8] :
                                      ( ssList(X8)
                                      & app(X8,cons(X7,nil)) = X2
                                      & leq(X7,X5) ) ) ) ) )
                  | ! [X9] :
                      ( ssItem(X9)
                     => ! [X10] :
                          ( ssItem(X10)
                         => ! [X11] :
                              ( ssList(X11)
                             => ! [X12] :
                                  ( ssList(X12)
                                 => ! [X13] :
                                      ( ~ ssList(X13)
                                      | app(app(app(app(X11,cons(X9,nil)),X12),cons(X10,nil)),X13) != X0
                                      | ~ lt(X10,X9) ) ) ) ) )
                  | ( nil != X3
                    & nil = X2 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ~ ssList(X3)
                    | X3 != X1
                    | X2 != X0
                    | ! [X4] :
                        ( ~ ssList(X4)
                        | app(X2,X4) != X3
                        | ~ totalorderedP(X2)
                        | ? [X5] :
                            ( ssItem(X5)
                            & ? [X6] :
                                ( ssList(X6)
                                & app(cons(X5,nil),X6) = X4
                                & ? [X7] :
                                    ( ssItem(X7)
                                    & ? [X8] :
                                        ( ssList(X8)
                                        & app(X8,cons(X7,nil)) = X2
                                        & leq(X7,X5) ) ) ) ) )
                    | ! [X9] :
                        ( ssItem(X9)
                       => ! [X10] :
                            ( ssItem(X10)
                           => ! [X11] :
                                ( ssList(X11)
                               => ! [X12] :
                                    ( ssList(X12)
                                   => ! [X13] :
                                        ( ~ ssList(X13)
                                        | app(app(app(app(X11,cons(X9,nil)),X12),cons(X10,nil)),X13) != X0
                                        | ~ lt(X10,X9) ) ) ) ) )
                    | ( nil != X3
                      & nil = X2 ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f98,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ssList(X3)
                  & X1 = X3
                  & X0 = X2
                  & ? [X4] :
                      ( ssList(X4)
                      & app(X2,X4) = X3
                      & totalorderedP(X2)
                      & ! [X5] :
                          ( ~ ssItem(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | app(cons(X5,nil),X6) != X4
                              | ! [X7] :
                                  ( ~ ssItem(X7)
                                  | ! [X8] :
                                      ( ~ ssList(X8)
                                      | app(X8,cons(X7,nil)) != X2
                                      | ~ leq(X7,X5) ) ) ) ) )
                  & ? [X9] :
                      ( ? [X10] :
                          ( ? [X11] :
                              ( ? [X12] :
                                  ( ? [X13] :
                                      ( ssList(X13)
                                      & app(app(app(app(X11,cons(X9,nil)),X12),cons(X10,nil)),X13) = X0
                                      & lt(X10,X9) )
                                  & ssList(X12) )
                              & ssList(X11) )
                          & ssItem(X10) )
                      & ssItem(X9) )
                  & ( nil = X3
                    | nil != X2 ) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

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

fof(f108,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( app(app(X0,X1),X2) = app(X0,app(X1,X2))
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f82]) ).

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

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

fof(f123,plain,
    ! [X0] :
      ( ! [X1] :
          ( X0 = X1
          | lt(X0,X1)
          | ~ leq(X0,X1)
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f92]) ).

fof(f124,plain,
    ! [X0] :
      ( ! [X1] :
          ( X0 = X1
          | lt(X0,X1)
          | ~ leq(X0,X1)
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(flattening,[],[f123]) ).

fof(f127,plain,
    ! [X0] :
      ( ~ lt(X0,X0)
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f90]) ).

fof(f130,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ lt(X1,X0)
          | ~ lt(X0,X1)
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f33]) ).

fof(f131,plain,
    ! [X0] :
      ( ! [X1] :
          ( ~ lt(X1,X0)
          | ~ lt(X0,X1)
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(flattening,[],[f130]) ).

fof(f134,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(f135,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,[],[f134]) ).

fof(f136,plain,
    ( ssList(sK3)
    & sK1 = sK3
    & sK0 = sK2
    & ssList(sK4)
    & sK3 = app(sK2,sK4)
    & totalorderedP(sK2)
    & ! [X5] :
        ( ~ ssItem(X5)
        | ! [X6] :
            ( ~ ssList(X6)
            | app(cons(X5,nil),X6) != sK4
            | ! [X7] :
                ( ~ ssItem(X7)
                | ! [X8] :
                    ( ~ ssList(X8)
                    | app(X8,cons(X7,nil)) != sK2
                    | ~ leq(X7,X5) ) ) ) )
    & ssList(sK9)
    & sK0 = app(app(app(app(sK7,cons(sK5,nil)),sK8),cons(sK6,nil)),sK9)
    & lt(sK6,sK5)
    & ssList(sK8)
    & ssList(sK7)
    & ssItem(sK6)
    & ssItem(sK5)
    & ( nil = sK3
      | nil != sK2 )
    & ssList(sK2)
    & ssList(sK1)
    & ssList(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X9,sK5),skolemize(X10,sK6),skolemize(X11,sK7),skolemize(X12,sK8),skolemize(X13,sK9)],[f98]) ).

fof(f145,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,[],[f135]) ).

fof(f146,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,[],[f145]) ).

fof(f147,plain,
    ! [X0] :
      ( ( ( totalorderedP(X0)
          | ( ~ leq(sK14(X0),sK15(X0))
            & app(app(sK16(X0),cons(sK14(X0),sK17(X0))),cons(sK15(X0),sK18(X0))) = X0
            & ssList(sK18(X0))
            & ssList(sK17(X0))
            & ssList(sK16(X0))
            & ssItem(sK15(X0))
            & ssItem(sK14(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,[sK14,sK15,sK16,sK17,sK18]),skolemize(X1,sK14(X0)),skolemize(X2,sK15(X0)),skolemize(X3,sK16(X0)),skolemize(X4,sK17(X0)),skolemize(X5,sK18(X0))],[f146]) ).

fof(f148,plain,
    ssList(sK0),
    inference(cnf_transformation,[],[f136]) ).

fof(f152,plain,
    ssItem(sK5),
    inference(cnf_transformation,[],[f136]) ).

fof(f153,plain,
    ssItem(sK6),
    inference(cnf_transformation,[],[f136]) ).

fof(f154,plain,
    ssList(sK7),
    inference(cnf_transformation,[],[f136]) ).

fof(f155,plain,
    ssList(sK8),
    inference(cnf_transformation,[],[f136]) ).

fof(f156,plain,
    lt(sK6,sK5),
    inference(cnf_transformation,[],[f136]) ).

fof(f157,plain,
    sK0 = app(app(app(app(sK7,cons(sK5,nil)),sK8),cons(sK6,nil)),sK9),
    inference(cnf_transformation,[],[f136]) ).

fof(f158,plain,
    ssList(sK9),
    inference(cnf_transformation,[],[f136]) ).

fof(f160,plain,
    totalorderedP(sK2),
    inference(cnf_transformation,[],[f136]) ).

fof(f163,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f136]) ).

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

fof(f181,plain,
    ! [X2,X0,X1] :
      ( app(app(X0,X1),X2) = app(X0,app(X1,X2))
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f108]) ).

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

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

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

fof(f195,plain,
    ! [X0,X1] :
      ( lt(X0,X1)
      | X0 = X1
      | ~ leq(X0,X1)
      | ~ ssItem(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f124]) ).

fof(f197,plain,
    ! [X0] :
      ( ~ lt(X0,X0)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f127]) ).

fof(f199,plain,
    ! [X0,X1] :
      ( ~ lt(X1,X0)
      | ~ lt(X0,X1)
      | ~ ssItem(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f131]) ).

fof(f207,plain,
    ! [X10,X0,X8,X6,X9,X7] :
      ( 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(cnf_transformation,[],[f147]) ).

fof(f220,plain,
    ! [X10,X8,X6,X9,X7] :
      ( ~ totalorderedP(app(app(X8,cons(X6,X9)),cons(X7,X10)))
      | ~ ssList(X10)
      | ~ ssList(X9)
      | ~ ssList(X8)
      | ~ ssItem(X7)
      | ~ ssItem(X6)
      | leq(X6,X7)
      | ~ ssList(app(app(X8,cons(X6,X9)),cons(X7,X10))) ),
    inference(equality_resolution,[],[f207]) ).

fof(f230,plain,
    ( ~ lt(sK5,sK6)
    | ~ ssItem(sK6)
    | ~ ssItem(sK5) ),
    inference(resolution,[],[f156,f199]) ).

fof(f231,plain,
    ( ~ lt(sK5,sK6)
    | ~ ssItem(sK5) ),
    inference(forward_subsumption_resolution,[],[f230,f153]) ).

fof(f232,plain,
    ~ lt(sK5,sK6),
    inference(forward_subsumption_resolution,[],[f231,f152]) ).

fof(f233,plain,
    totalorderedP(sK0),
    inference(superposition,[],[f160,f163]) ).

fof(f241,plain,
    ( sK5 = sK6
    | ~ leq(sK5,sK6)
    | ~ ssItem(sK6)
    | ~ ssItem(sK5) ),
    inference(resolution,[],[f232,f195]) ).

fof(f244,plain,
    ( sK5 = sK6
    | ~ leq(sK5,sK6)
    | ~ ssItem(sK5) ),
    inference(forward_subsumption_resolution,[],[f241,f153]) ).

fof(f248,plain,
    ( sK5 = sK6
    | ~ leq(sK5,sK6) ),
    inference(forward_subsumption_resolution,[],[f244,f152]) ).

fof(f252,definition,
    ( spl19_3
  <=> leq(sK5,sK6) ),
    introduced(definition,[new_symbols(definition,[spl19_3])],[avatar_definition]) ).

fof(f253,plain,
    ( ~ leq(sK5,sK6)
    | spl19_3 ),
    inference(avatar_component_clause,[],[f252]) ).

fof(f255,definition,
    ( spl19_4
  <=> sK5 = sK6 ),
    introduced(definition,[new_symbols(definition,[spl19_4])],[avatar_definition]) ).

fof(f256,plain,
    ( sK5 = sK6
    | ~ spl19_4 ),
    inference(avatar_component_clause,[],[f255]) ).

fof(f258,plain,
    ( ~ spl19_3
    | spl19_4 ),
    inference(avatar_split_clause,[],[f248,f255,f252]) ).

fof(f290,plain,
    ( sK0 = app(app(app(sK7,app(cons(sK5,nil),sK8)),cons(sK6,nil)),sK9)
    | ~ ssList(sK8)
    | ~ ssList(cons(sK5,nil))
    | ~ ssList(sK7) ),
    inference(superposition,[],[f157,f181]) ).

fof(f310,plain,
    ( sK0 = app(app(app(sK7,app(cons(sK5,nil),sK8)),cons(sK6,nil)),sK9)
    | ~ ssList(cons(sK5,nil))
    | ~ ssList(sK7) ),
    inference(forward_subsumption_resolution,[],[f290,f155]) ).

fof(f315,definition,
    ( spl19_8
  <=> ssList(cons(sK6,nil)) ),
    introduced(definition,[new_symbols(definition,[spl19_8])],[avatar_definition]) ).

fof(f316,plain,
    ( ~ ssList(cons(sK6,nil))
    | spl19_8 ),
    inference(avatar_component_clause,[],[f315]) ).

fof(f346,plain,
    ( sK0 = app(app(app(sK7,app(cons(sK5,nil),sK8)),cons(sK6,nil)),sK9)
    | ~ ssList(cons(sK5,nil)) ),
    inference(forward_subsumption_resolution,[],[f310,f154]) ).

fof(f348,definition,
    ( spl19_16
  <=> ssList(cons(sK5,nil)) ),
    introduced(definition,[new_symbols(definition,[spl19_16])],[avatar_definition]) ).

fof(f349,plain,
    ( ~ ssList(cons(sK5,nil))
    | spl19_16 ),
    inference(avatar_component_clause,[],[f348]) ).

fof(f351,definition,
    ( spl19_17
  <=> sK0 = app(app(app(sK7,app(cons(sK5,nil),sK8)),cons(sK6,nil)),sK9) ),
    introduced(definition,[new_symbols(definition,[spl19_17])],[avatar_definition]) ).

fof(f352,plain,
    ( sK0 = app(app(app(sK7,app(cons(sK5,nil),sK8)),cons(sK6,nil)),sK9)
    | ~ spl19_17 ),
    inference(avatar_component_clause,[],[f351]) ).

fof(f353,plain,
    ( ~ spl19_16
    | spl19_17 ),
    inference(avatar_split_clause,[],[f346,f351,f348]) ).

fof(f359,plain,
    ( ~ ssItem(sK6)
    | ~ ssList(nil)
    | spl19_8 ),
    inference(resolution,[],[f316,f176]) ).

fof(f360,plain,
    ( ~ ssList(nil)
    | spl19_8 ),
    inference(forward_subsumption_resolution,[],[f359,f153]) ).

fof(f361,plain,
    ( $false
    | spl19_8 ),
    inference(forward_subsumption_resolution,[],[f360,f188]) ).

fof(f362,plain,
    spl19_8,
    inference(avatar_contradiction_clause,[],[f361]) ).

fof(f370,plain,
    ( ~ ssItem(sK5)
    | ~ ssList(nil)
    | spl19_16 ),
    inference(resolution,[],[f349,f176]) ).

fof(f371,plain,
    ( ~ ssList(nil)
    | spl19_16 ),
    inference(forward_subsumption_resolution,[],[f370,f152]) ).

fof(f372,plain,
    ( $false
    | spl19_16 ),
    inference(forward_subsumption_resolution,[],[f371,f188]) ).

fof(f373,plain,
    spl19_16,
    inference(avatar_contradiction_clause,[],[f372]) ).

fof(f384,definition,
    ( spl19_18
  <=> ssList(app(sK7,app(cons(sK5,nil),sK8))) ),
    introduced(definition,[new_symbols(definition,[spl19_18])],[avatar_definition]) ).

fof(f385,plain,
    ( ~ ssList(app(sK7,app(cons(sK5,nil),sK8)))
    | spl19_18 ),
    inference(avatar_component_clause,[],[f384]) ).

fof(f537,definition,
    ( spl19_27
  <=> sK0 = app(app(sK7,app(cons(sK5,nil),sK8)),app(cons(sK6,nil),sK9)) ),
    introduced(definition,[new_symbols(definition,[spl19_27])],[avatar_definition]) ).

fof(f538,plain,
    ( sK0 = app(app(sK7,app(cons(sK5,nil),sK8)),app(cons(sK6,nil),sK9))
    | ~ spl19_27 ),
    inference(avatar_component_clause,[],[f537]) ).

fof(f603,plain,
    ( sK0 = app(app(sK7,app(cons(sK5,nil),sK8)),app(cons(sK6,nil),sK9))
    | ~ ssList(sK9)
    | ~ ssList(cons(sK6,nil))
    | ~ ssList(app(sK7,app(cons(sK5,nil),sK8)))
    | ~ spl19_17 ),
    inference(superposition,[],[f352,f181]) ).

fof(f619,plain,
    ( sK0 = app(app(sK7,app(cons(sK5,nil),sK8)),app(cons(sK6,nil),sK9))
    | ~ ssList(cons(sK6,nil))
    | ~ ssList(app(sK7,app(cons(sK5,nil),sK8)))
    | ~ spl19_17 ),
    inference(forward_subsumption_resolution,[],[f603,f158]) ).

fof(f638,plain,
    ( ~ spl19_18
    | ~ spl19_8
    | spl19_27
    | ~ spl19_17 ),
    inference(avatar_split_clause,[],[f619,f351,f537,f315,f384]) ).

fof(f640,definition,
    ( spl19_37
  <=> ssList(app(cons(sK5,nil),sK8)) ),
    introduced(definition,[new_symbols(definition,[spl19_37])],[avatar_definition]) ).

fof(f641,plain,
    ( ~ ssList(app(cons(sK5,nil),sK8))
    | spl19_37 ),
    inference(avatar_component_clause,[],[f640]) ).

fof(f650,plain,
    ( ~ ssList(cons(sK5,sK8))
    | ~ ssItem(sK5)
    | ~ ssList(sK8)
    | spl19_37 ),
    inference(superposition,[],[f641,f182]) ).

fof(f653,plain,
    ( ~ ssItem(sK5)
    | ~ ssList(sK8)
    | spl19_37 ),
    inference(forward_subsumption_resolution,[],[f650,f176]) ).

fof(f656,plain,
    ( ~ ssList(sK8)
    | spl19_37 ),
    inference(forward_subsumption_resolution,[],[f653,f152]) ).

fof(f659,plain,
    ( $false
    | spl19_37 ),
    inference(forward_subsumption_resolution,[],[f656,f155]) ).

fof(f660,plain,
    spl19_37,
    inference(avatar_contradiction_clause,[],[f659]) ).

fof(f859,plain,
    ( ~ ssList(app(cons(sK5,nil),sK8))
    | ~ ssList(sK7)
    | spl19_18 ),
    inference(resolution,[],[f385,f187]) ).

fof(f864,plain,
    ( ~ ssList(app(cons(sK5,nil),sK8))
    | spl19_18 ),
    inference(forward_subsumption_resolution,[],[f859,f154]) ).

fof(f867,plain,
    ( ~ spl19_37
    | spl19_18 ),
    inference(avatar_split_clause,[],[f864,f384,f640]) ).

fof(f914,definition,
    ( spl19_61
  <=> sK0 = app(app(sK7,app(cons(sK5,nil),sK8)),cons(sK6,sK9)) ),
    introduced(definition,[new_symbols(definition,[spl19_61])],[avatar_definition]) ).

fof(f915,plain,
    ( sK0 = app(app(sK7,app(cons(sK5,nil),sK8)),cons(sK6,sK9))
    | ~ spl19_61 ),
    inference(avatar_component_clause,[],[f914]) ).

fof(f1184,plain,
    ( sK0 = app(app(sK7,app(cons(sK5,nil),sK8)),cons(sK6,sK9))
    | ~ ssItem(sK6)
    | ~ ssList(sK9)
    | ~ spl19_27 ),
    inference(superposition,[],[f538,f182]) ).

fof(f1213,plain,
    ( sK0 = app(app(sK7,app(cons(sK5,nil),sK8)),cons(sK6,sK9))
    | ~ ssList(sK9)
    | ~ spl19_27 ),
    inference(forward_subsumption_resolution,[],[f1184,f153]) ).

fof(f1222,plain,
    ( sK0 = app(app(sK7,app(cons(sK5,nil),sK8)),cons(sK6,sK9))
    | ~ spl19_27 ),
    inference(forward_subsumption_resolution,[],[f1213,f158]) ).

fof(f1226,plain,
    ( spl19_61
    | ~ spl19_27 ),
    inference(avatar_split_clause,[],[f1222,f537,f914]) ).

fof(f3067,plain,
    ( sK0 = app(app(sK7,cons(sK5,sK8)),cons(sK6,sK9))
    | ~ ssItem(sK5)
    | ~ ssList(sK8)
    | ~ spl19_61 ),
    inference(superposition,[],[f915,f182]) ).

fof(f3089,plain,
    ( sK0 = app(app(sK7,cons(sK5,sK8)),cons(sK6,sK9))
    | ~ ssList(sK8)
    | ~ spl19_61 ),
    inference(forward_subsumption_resolution,[],[f3067,f152]) ).

fof(f3108,plain,
    ( sK0 = app(app(sK7,cons(sK5,sK8)),cons(sK6,sK9))
    | ~ spl19_61 ),
    inference(forward_subsumption_resolution,[],[f3089,f155]) ).

fof(f3117,plain,
    ( ~ totalorderedP(sK0)
    | ~ ssList(sK9)
    | ~ ssList(sK8)
    | ~ ssList(sK7)
    | ~ ssItem(sK6)
    | ~ ssItem(sK5)
    | leq(sK5,sK6)
    | ~ ssList(sK0)
    | ~ spl19_61 ),
    inference(superposition,[],[f220,f3108]) ).

fof(f3135,plain,
    ( ~ ssList(sK9)
    | ~ ssList(sK8)
    | ~ ssList(sK7)
    | ~ ssItem(sK6)
    | ~ ssItem(sK5)
    | leq(sK5,sK6)
    | ~ ssList(sK0)
    | ~ spl19_61 ),
    inference(forward_subsumption_resolution,[],[f3117,f233]) ).

fof(f3153,plain,
    ( ~ ssList(sK8)
    | ~ ssList(sK7)
    | ~ ssItem(sK6)
    | ~ ssItem(sK5)
    | leq(sK5,sK6)
    | ~ ssList(sK0)
    | ~ spl19_61 ),
    inference(forward_subsumption_resolution,[],[f3135,f158]) ).

fof(f3160,plain,
    ( ~ ssList(sK7)
    | ~ ssItem(sK6)
    | ~ ssItem(sK5)
    | leq(sK5,sK6)
    | ~ ssList(sK0)
    | ~ spl19_61 ),
    inference(forward_subsumption_resolution,[],[f3153,f155]) ).

fof(f3162,plain,
    ( ~ ssItem(sK6)
    | ~ ssItem(sK5)
    | leq(sK5,sK6)
    | ~ ssList(sK0)
    | ~ spl19_61 ),
    inference(forward_subsumption_resolution,[],[f3160,f154]) ).

fof(f3163,plain,
    ( ~ ssItem(sK5)
    | leq(sK5,sK6)
    | ~ ssList(sK0)
    | ~ spl19_61 ),
    inference(forward_subsumption_resolution,[],[f3162,f153]) ).

fof(f3164,plain,
    ( leq(sK5,sK6)
    | ~ ssList(sK0)
    | ~ spl19_61 ),
    inference(forward_subsumption_resolution,[],[f3163,f152]) ).

fof(f3165,plain,
    ( ~ ssList(sK0)
    | spl19_3
    | ~ spl19_61 ),
    inference(forward_subsumption_resolution,[],[f3164,f253]) ).

fof(f3166,plain,
    ( $false
    | spl19_3
    | ~ spl19_61 ),
    inference(forward_subsumption_resolution,[],[f3165,f148]) ).

fof(f3167,plain,
    ( spl19_3
    | ~ spl19_61 ),
    inference(avatar_contradiction_clause,[],[f3166]) ).

fof(f3170,plain,
    ( lt(sK5,sK5)
    | ~ spl19_4 ),
    inference(superposition,[],[f156,f256]) ).

fof(f3222,plain,
    ( ~ ssItem(sK5)
    | ~ spl19_4 ),
    inference(resolution,[],[f3170,f197]) ).

fof(f3228,plain,
    ( $false
    | ~ spl19_4 ),
    inference(forward_subsumption_resolution,[],[f3222,f152]) ).

fof(f3229,plain,
    ~ spl19_4,
    inference(avatar_contradiction_clause,[],[f3228]) ).

cnf(s3,plain,
    ( ~ spl19_3
    | spl19_4 ),
    inference(sat_conversion,[],[f258]) ).

cnf(s14,plain,
    ( ~ spl19_16
    | spl19_17 ),
    inference(sat_conversion,[],[f353]) ).

cnf(s15,plain,
    spl19_8,
    inference(sat_conversion,[],[f362]) ).

cnf(s16,plain,
    spl19_16,
    inference(sat_conversion,[],[f373]) ).

cnf(s49,plain,
    ( ~ spl19_8
    | ~ spl19_17
    | ~ spl19_18
    | spl19_27 ),
    inference(sat_conversion,[],[f638]) ).

cnf(s52,plain,
    spl19_37,
    inference(sat_conversion,[],[f660]) ).

cnf(s76,plain,
    ( spl19_18
    | ~ spl19_37 ),
    inference(sat_conversion,[],[f867]) ).

cnf(s138,plain,
    ( ~ spl19_27
    | spl19_61 ),
    inference(sat_conversion,[],[f1226]) ).

cnf(s397,plain,
    ( spl19_3
    | ~ spl19_61 ),
    inference(sat_conversion,[],[f3167]) ).

cnf(s399,plain,
    ~ spl19_4,
    inference(sat_conversion,[],[f3229]) ).

cnf(s436,plain,
    spl19_18,
    inference(rat,[],[s76,s52]) ).

cnf(s438,plain,
    ( ~ spl19_8
    | ~ spl19_17
    | spl19_27 ),
    inference(rat,[],[s49,s436]) ).

cnf(s464,plain,
    spl19_17,
    inference(rat,[],[s14,s16]) ).

cnf(s476,plain,
    spl19_27,
    inference(rat,[],[s438,s15,s464]) ).

cnf(s485,plain,
    spl19_61,
    inference(rat,[],[s138,s476]) ).

cnf(s501,plain,
    spl19_3,
    inference(rat,[],[s397,s485]) ).

cnf(s618,plain,
    $false,
    inference(rat,[],[s3,s399,s501]) ).

fof(f3230,plain,
    $false,
    inference(avatar_sat_refutation,[],[s618]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC303+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.20  % Computer : n014.cluster.edu
% 0.08/0.20  % Model    : x86_64 x86_64
% 0.08/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20  % Memory   : 8046.5625MB
% 0.08/0.20  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Mon Sep 28 08:58:31 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.24  Running first-order theorem proving
% 0.08/0.24  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.84/1.81  % (1647176)Detected formulas, will run a generic FOF schedule.
% 6.84/1.81  % (1647187)dis-21_1_sil=8000:lcm=predicate:random_seed=2185730273: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.84/1.81  % (1647185)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1844572671:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.84/1.81  % (1647181)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=3764545453:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.84/1.81  % (1647182)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=78080698:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.84/1.81  % (1647183)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=38656015:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.84/1.81  % (1647186)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=542272044:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.84/1.81  % (1647184)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=559206250:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.84/1.81  % (1647187)Instruction limit reached! 
% 6.84/1.81  % (1647187)------------------------------
% 6.84/1.81  % (1647187)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.81  % (1647187)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.81  % (1647187)CaDiCaL version: 2.1.3
% 6.84/1.81  % (1647187)Termination reason: Instruction limit
% 6.84/1.81  % (1647187)Termination phase: Saturation
% 6.84/1.81  % (1647187)Time elapsed: 0.039 s
% 6.84/1.81  % (1647187)Peak memory usage: 91 MB
% 6.84/1.81  % (1647187)Instructions burned: 131 (million)
% 6.84/1.81  % (1647184)Instruction limit reached! 
% 6.84/1.81  % (1647184)------------------------------
% 6.84/1.81  % (1647184)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.81  % (1647184)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.81  % (1647184)CaDiCaL version: 2.1.3
% 6.84/1.81  % (1647184)Termination reason: Instruction limit
% 6.84/1.81  % (1647184)Termination phase: Saturation
% 6.84/1.81  % (1647184)Time elapsed: 0.066 s
% 6.84/1.81  % (1647184)Peak memory usage: 89 MB
% 6.84/1.81  % (1647184)Instructions burned: 109 (million)
% 6.84/1.81  % (1647185)Instruction limit reached! 
% 6.84/1.81  % (1647185)------------------------------
% 6.84/1.81  % (1647185)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.81  % (1647185)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.81  % (1647185)CaDiCaL version: 2.1.3
% 6.84/1.81  % (1647185)Termination reason: Instruction limit
% 6.84/1.81  % (1647185)Termination phase: Saturation
% 6.84/1.81  % (1647185)Time elapsed: 0.070 s
% 6.84/1.81  % (1647185)Peak memory usage: 88 MB
% 6.84/1.81  % (1647185)Instructions burned: 119 (million)
% 6.84/1.81  % (1647195)lrs+10_1_sil=8000:sp=occurrence:random_seed=4252975784:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 6.84/1.81  % (1647186)Instruction limit reached! 
% 6.84/1.81  % (1647186)------------------------------
% 6.84/1.81  % (1647186)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.81  % (1647186)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.81  % (1647186)CaDiCaL version: 2.1.3
% 6.84/1.81  % (1647186)Termination reason: Instruction limit
% 6.84/1.81  % (1647186)Termination phase: Saturation
% 6.84/1.81  % (1647186)Time elapsed: 0.092 s
% 6.84/1.81  % (1647186)Peak memory usage: 90 MB
% 6.84/1.81  % (1647186)Instructions burned: 139 (million)
% 6.84/1.81  % (1647195)Instruction limit reached! 
% 6.84/1.81  % (1647195)------------------------------
% 6.84/1.81  % (1647195)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.81  % (1647195)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.81  % (1647195)CaDiCaL version: 2.1.3
% 6.84/1.81  % (1647195)Termination reason: Instruction limit
% 6.84/1.81  % (1647195)Termination phase: Saturation
% 6.84/1.81  % (1647195)Time elapsed: 0.087 s
% 6.84/1.81  % (1647195)Peak memory usage: 93 MB
% 6.84/1.81  % (1647195)Instructions burned: 287 (million)
% 6.84/1.81  % (1647197)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3161518926:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 6.84/1.81  % (1647196)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2219764025:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 6.84/1.81  % (1647199)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=1296570185:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 6.84/1.81  % (1647200)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3287026540:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2996 on theBenchmark for (2996ds/294Mi)
% 6.84/1.81  % (1647196)Instruction limit reached! 
% 6.84/1.81  % (1647196)------------------------------
% 6.84/1.81  % (1647196)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.81  % (1647196)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.81  % (1647196)CaDiCaL version: 2.1.3
% 6.84/1.81  % (1647196)Termination reason: Instruction limit
% 6.84/1.81  % (1647196)Termination phase: Saturation
% 6.84/1.81  % (1647196)Time elapsed: 0.085 s
% 6.84/1.81  % (1647196)Peak memory usage: 95 MB
% 6.84/1.81  % (1647196)Instructions burned: 157 (million)
% 6.84/1.81  % (1647199)Instruction limit reached! 
% 6.84/1.81  % (1647199)------------------------------
% 6.84/1.81  % (1647199)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.81  % (1647199)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.81  % (1647199)CaDiCaL version: 2.1.3
% 6.84/1.81  % (1647199)Termination reason: Instruction limit
% 6.84/1.81  % (1647199)Termination phase: Saturation
% 6.84/1.81  % (1647199)Time elapsed: 0.120 s
% 6.84/1.81  % (1647199)Peak memory usage: 96 MB
% 6.84/1.81  % (1647199)Instructions burned: 249 (million)
% 6.84/1.81  % (1647200)Instruction limit reached! 
% 6.84/1.81  % (1647200)------------------------------
% 6.84/1.81  % (1647200)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.81  % (1647200)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.81  % (1647200)CaDiCaL version: 2.1.3
% 6.84/1.81  % (1647200)Termination reason: Instruction limit
% 6.84/1.81  % (1647200)Termination phase: Saturation
% 6.84/1.81  % (1647200)Time elapsed: 0.093 s
% 6.84/1.81  % (1647200)Peak memory usage: 90 MB
% 6.84/1.81  % (1647200)Instructions burned: 295 (million)
% 6.84/1.81  % (1647197)Instruction limit reached! 
% 6.84/1.81  % (1647197)------------------------------
% 6.84/1.81  % (1647197)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.81  % (1647197)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.81  % (1647197)CaDiCaL version: 2.1.3
% 6.84/1.81  % (1647197)Termination reason: Instruction limit
% 6.84/1.81  % (1647197)Termination phase: Saturation
% 6.84/1.81  % (1647197)Time elapsed: 0.199 s
% 6.84/1.81  % (1647197)Peak memory usage: 92 MB
% 6.84/1.81  % (1647197)Instructions burned: 326 (million)
% 6.84/1.81  % (1647205)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1083065755:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 6.84/1.81  % (1647207)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1790751765:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 6.84/1.81  % (1647206)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=4182577736:cts=off:i=113:fsr=off:ss=included:sgt=4_2995 on theBenchmark for (2995ds/113Mi)
% 6.84/1.81  % (1647207)Instruction limit reached! 
% 6.84/1.81  % (1647207)------------------------------
% 6.84/1.81  % (1647207)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.81  % (1647207)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.81  % (1647207)CaDiCaL version: 2.1.3
% 6.84/1.81  % (1647207)Termination reason: Instruction limit
% 6.84/1.81  % (1647207)Termination phase: Saturation
% 6.84/1.81  % (1647207)Time elapsed: 0.035 s
% 6.84/1.81  % (1647207)Peak memory usage: 90 MB
% 6.84/1.81  % (1647207)Instructions burned: 127 (million)
% 6.84/1.81  % (1647208)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=4009901744:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2994 on theBenchmark for (2994ds/114Mi)
% 6.84/1.81  % (1647206)Instruction limit reached! 
% 6.84/1.81  % (1647206)------------------------------
% 6.84/1.81  % (1647206)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.81  % (1647206)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.81  % (1647206)CaDiCaL version: 2.1.3
% 6.84/1.81  % (1647206)Termination reason: Instruction limit
% 6.84/1.81  % (1647206)Termination phase: Saturation
% 6.84/1.81  % (1647206)Time elapsed: 0.073 s
% 6.84/1.81  % (1647206)Peak memory usage: 90 MB
% 6.84/1.81  % (1647206)Instructions burned: 114 (million)
% 6.84/1.81  % (1647212)lrs+10_1_sil=8000:sp=occurrence:random_seed=2685935175:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2993 on theBenchmark for (2993ds/907Mi)
% 6.84/1.81  % (1647208)Instruction limit reached! 
% 6.84/1.81  % (1647208)------------------------------
% 6.84/1.81  % (1647208)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.81  % (1647208)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.81  % (1647208)CaDiCaL version: 2.1.3
% 6.84/1.81  % (1647208)Termination reason: Instruction limit
% 6.84/1.81  % (1647208)Termination phase: Saturation
% 6.84/1.81  % (1647208)Time elapsed: 0.067 s
% 6.84/1.81  % (1647208)Peak memory usage: 89 MB
% 6.84/1.81  % (1647208)Instructions burned: 116 (million)
% 6.84/1.81  % (1647214)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=543157863:i=437:sd=1:aac=none:ss=included_2993 on theBenchmark for (2993ds/437Mi)
% 6.84/1.81  % (1647216)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=2237804281:i=5202:ss=axioms:sgt=16_2992 on theBenchmark for (2992ds/5202Mi)
% 6.84/1.81  % (1647214)First to succeed.
% 6.84/1.81  % (1647214)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1647176"
% 6.84/1.81  % (1647212)Instruction limit reached! 
% 6.84/1.81  % (1647212)------------------------------
% 6.84/1.81  % (1647212)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.81  % (1647212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.81  % (1647212)CaDiCaL version: 2.1.3
% 6.84/1.81  % (1647212)Termination reason: Instruction limit
% 6.84/1.81  % (1647212)Termination phase: Saturation
% 6.84/1.81  % (1647212)Time elapsed: 0.260 s
% 6.84/1.81  % (1647212)Peak memory usage: 100 MB
% 6.84/1.81  % (1647212)Instructions burned: 909 (million)
% 6.84/1.81  % (1647219)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=1818458573:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2990 on theBenchmark for (2990ds/134Mi)
% 6.84/1.81  % (1647219)Instruction limit reached! 
% 6.84/1.81  % (1647219)------------------------------
% 6.84/1.81  % (1647219)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.84/1.81  % (1647219)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.84/1.81  % (1647219)CaDiCaL version: 2.1.3
% 6.84/1.81  % (1647219)Termination reason: Instruction limit
% 6.84/1.81  % (1647219)Termination phase: Saturation
% 6.84/1.81  % (1647219)Time elapsed: 0.034 s
% 6.84/1.81  % (1647219)Peak memory usage: 91 MB
% 6.84/1.81  % (1647219)Instructions burned: 137 (million)
% 6.84/1.81  % (1647214)Refutation found. Thanks to Tanya!
% 6.84/1.81  % SZS status Theorem for theBenchmark
% 6.84/1.81  % SZS output start Proof for theBenchmark
% See solution above
% 8.54/2.00  % (1647214)------------------------------
% 8.54/2.00  % (1647214)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.54/2.00  % (1647214)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.54/2.00  % (1647214)CaDiCaL version: 2.1.3
% 8.54/2.00  % (1647214)Termination reason: Refutation
% 8.54/2.00  % (1647214)Time elapsed: 0.069 s
% 8.54/2.00  % (1647214)Peak memory usage: 91 MB
% 8.54/2.00  % (1647214)Instructions burned: 110 (million)
% 8.54/2.00  % (1647214)------------------------------
% 8.54/2.00  % (1647214)------------------------------
% 8.54/2.00  % (1647176)Success in time 1.13 s
% 8.54/2.00  % Vampire exiting
%------------------------------------------------------------------------------