↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 6.52s 1.96s
% Output   : Refutation 8.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   89 (  23 unt;   4 def)
%            Number of atoms       :  422 (  76 equ)
%            Maximal formula atoms :   32 (   4 avg)
%            Number of connectives :  551 ( 218   ~; 207   |;  84   &)
%                                         (   9 <=>;  33  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   26 (   6 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   5 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;  11 con; 0-2 aty)
%            Number of variables   :  157 (   0 sgn 121   !;  36   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).

fof(f12,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( strictorderedP(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
                             => lt(X1,X2) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax12) ).

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(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(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ~ ssList(X3)
                  | X1 != X3
                  | X0 != X2
                  | ! [X4] :
                      ( ssList(X4)
                     => ! [X5] :
                          ( ~ ssList(X5)
                          | app(app(X4,X2),X5) != X3
                          | ~ strictorderedP(X2)
                          | ? [X6] :
                              ( ssItem(X6)
                              & ? [X7] :
                                  ( ssList(X7)
                                  & app(X7,cons(X6,nil)) = X4
                                  & ? [X8] :
                                      ( ssItem(X8)
                                      & ? [X9] :
                                          ( ssList(X9)
                                          & app(cons(X8,nil),X9) = X2
                                          & lt(X6,X8) ) ) ) )
                          | ? [X10] :
                              ( ssItem(X10)
                              & ? [X11] :
                                  ( ssList(X11)
                                  & app(cons(X10,nil),X11) = X5
                                  & ? [X12] :
                                      ( ssItem(X12)
                                      & ? [X13] :
                                          ( ssList(X13)
                                          & app(X13,cons(X12,nil)) = X2
                                          & lt(X12,X10) ) ) ) ) ) )
                  | ! [X14] :
                      ( ssItem(X14)
                     => ! [X15] :
                          ( ssItem(X15)
                         => ! [X16] :
                              ( ssList(X16)
                             => ! [X17] :
                                  ( ~ ssList(X17)
                                  | app(app(app(X16,cons(X14,nil)),cons(X15,nil)),X17) != X0
                                  | neq(X14,X15) ) ) ) )
                  | ( 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)
                    | X1 != X3
                    | X0 != X2
                    | ! [X4] :
                        ( ssList(X4)
                       => ! [X5] :
                            ( ~ ssList(X5)
                            | app(app(X4,X2),X5) != X3
                            | ~ strictorderedP(X2)
                            | ? [X6] :
                                ( ssItem(X6)
                                & ? [X7] :
                                    ( ssList(X7)
                                    & app(X7,cons(X6,nil)) = X4
                                    & ? [X8] :
                                        ( ssItem(X8)
                                        & ? [X9] :
                                            ( ssList(X9)
                                            & app(cons(X8,nil),X9) = X2
                                            & lt(X6,X8) ) ) ) )
                            | ? [X10] :
                                ( ssItem(X10)
                                & ? [X11] :
                                    ( ssList(X11)
                                    & app(cons(X10,nil),X11) = X5
                                    & ? [X12] :
                                        ( ssItem(X12)
                                        & ? [X13] :
                                            ( ssList(X13)
                                            & app(X13,cons(X12,nil)) = X2
                                            & lt(X12,X10) ) ) ) ) ) )
                    | ! [X14] :
                        ( ssItem(X14)
                       => ! [X15] :
                            ( ssItem(X15)
                           => ! [X16] :
                                ( ssList(X16)
                               => ! [X17] :
                                    ( ~ ssList(X17)
                                    | app(app(app(X16,cons(X14,nil)),cons(X15,nil)),X17) != X0
                                    | neq(X14,X15) ) ) ) )
                    | ( nil != X3
                      & nil = X2 ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f98,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ssList(X3)
                  & X1 = X3
                  & X0 = X2
                  & ? [X4] :
                      ( ? [X5] :
                          ( ssList(X5)
                          & app(app(X4,X2),X5) = X3
                          & strictorderedP(X2)
                          & ! [X6] :
                              ( ~ ssItem(X6)
                              | ! [X7] :
                                  ( ~ ssList(X7)
                                  | app(X7,cons(X6,nil)) != X4
                                  | ! [X8] :
                                      ( ~ ssItem(X8)
                                      | ! [X9] :
                                          ( ~ ssList(X9)
                                          | app(cons(X8,nil),X9) != X2
                                          | ~ lt(X6,X8) ) ) ) )
                          & ! [X10] :
                              ( ~ ssItem(X10)
                              | ! [X11] :
                                  ( ~ ssList(X11)
                                  | app(cons(X10,nil),X11) != X5
                                  | ! [X12] :
                                      ( ~ ssItem(X12)
                                      | ! [X13] :
                                          ( ~ ssList(X13)
                                          | app(X13,cons(X12,nil)) != X2
                                          | ~ lt(X12,X10) ) ) ) ) )
                      & ssList(X4) )
                  & ? [X14] :
                      ( ? [X15] :
                          ( ? [X16] :
                              ( ? [X17] :
                                  ( ssList(X17)
                                  & app(app(app(X16,cons(X14,nil)),cons(X15,nil)),X17) = X0
                                  & ~ neq(X14,X15) )
                              & ssList(X16) )
                          & ssItem(X15) )
                      & ssItem(X14) )
                  & ( 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(f118,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( neq(X0,X1)
          <=> X0 != X1 )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f1]) ).

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

fof(f131,plain,
    ! [X0] :
      ( ( strictorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( lt(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,[],[f12]) ).

fof(f132,plain,
    ! [X0] :
      ( ( strictorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( lt(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,[],[f131]) ).

fof(f133,plain,
    ( ssList(sK3)
    & sK1 = sK3
    & sK0 = sK2
    & ssList(sK5)
    & sK3 = app(app(sK4,sK2),sK5)
    & strictorderedP(sK2)
    & ! [X6] :
        ( ~ ssItem(X6)
        | ! [X7] :
            ( ~ ssList(X7)
            | app(X7,cons(X6,nil)) != sK4
            | ! [X8] :
                ( ~ ssItem(X8)
                | ! [X9] :
                    ( ~ ssList(X9)
                    | app(cons(X8,nil),X9) != sK2
                    | ~ lt(X6,X8) ) ) ) )
    & ! [X10] :
        ( ~ ssItem(X10)
        | ! [X11] :
            ( ~ ssList(X11)
            | app(cons(X10,nil),X11) != sK5
            | ! [X12] :
                ( ~ ssItem(X12)
                | ! [X13] :
                    ( ~ ssList(X13)
                    | app(X13,cons(X12,nil)) != sK2
                    | ~ lt(X12,X10) ) ) ) )
    & ssList(sK4)
    & ssList(sK9)
    & sK0 = app(app(app(sK8,cons(sK6,nil)),cons(sK7,nil)),sK9)
    & ~ neq(sK6,sK7)
    & ssList(sK8)
    & ssItem(sK7)
    & ssItem(sK6)
    & ( 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(X5,sK5),skolemize(X14,sK6),skolemize(X15,sK7),skolemize(X16,sK8),skolemize(X17,sK9)],[f98]) ).

fof(f139,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( neq(X0,X1)
              | X0 = X1 )
            & ( X0 != X1
              | ~ neq(X0,X1) ) )
          | ~ ssItem(X1) )
      | ~ ssItem(X0) ),
    inference(nnf_transformation,[],[f118]) ).

fof(f144,plain,
    ! [X0] :
      ( ( ( strictorderedP(X0)
          | ? [X1] :
              ( ? [X2] :
                  ( ? [X3] :
                      ( ? [X4] :
                          ( ? [X5] :
                              ( ~ lt(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] :
                              ( lt(X1,X2)
                              | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                              | ~ ssList(X5) )
                          | ~ ssList(X4) )
                      | ~ ssList(X3) )
                  | ~ ssItem(X2) )
              | ~ ssItem(X1) )
          | ~ strictorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f132]) ).

fof(f145,plain,
    ! [X0] :
      ( ( ( strictorderedP(X0)
          | ? [X1] :
              ( ? [X2] :
                  ( ? [X3] :
                      ( ? [X4] :
                          ( ? [X5] :
                              ( ~ lt(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] :
                              ( lt(X6,X7)
                              | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
                              | ~ ssList(X10) )
                          | ~ ssList(X9) )
                      | ~ ssList(X8) )
                  | ~ ssItem(X7) )
              | ~ ssItem(X6) )
          | ~ strictorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(rectify,[],[f144]) ).

fof(f146,plain,
    ! [X0] :
      ( ( ( strictorderedP(X0)
          | ( ~ lt(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] :
                              ( lt(X6,X7)
                              | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
                              | ~ ssList(X10) )
                          | ~ ssList(X9) )
                      | ~ ssList(X8) )
                  | ~ ssItem(X7) )
              | ~ ssItem(X6) )
          | ~ strictorderedP(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))],[f145]) ).

fof(f147,plain,
    ssList(sK0),
    inference(cnf_transformation,[],[f133]) ).

fof(f151,plain,
    ssItem(sK6),
    inference(cnf_transformation,[],[f133]) ).

fof(f152,plain,
    ssItem(sK7),
    inference(cnf_transformation,[],[f133]) ).

fof(f153,plain,
    ssList(sK8),
    inference(cnf_transformation,[],[f133]) ).

fof(f154,plain,
    ~ neq(sK6,sK7),
    inference(cnf_transformation,[],[f133]) ).

fof(f155,plain,
    sK0 = app(app(app(sK8,cons(sK6,nil)),cons(sK7,nil)),sK9),
    inference(cnf_transformation,[],[f133]) ).

fof(f156,plain,
    ssList(sK9),
    inference(cnf_transformation,[],[f133]) ).

fof(f160,plain,
    strictorderedP(sK2),
    inference(cnf_transformation,[],[f133]) ).

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

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(f191,plain,
    ! [X0,X1] :
      ( neq(X0,X1)
      | X0 = X1
      | ~ ssItem(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f139]) ).

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

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

fof(f208,plain,
    ! [X10,X0,X8,X6,X9,X7] :
      ( lt(X6,X7)
      | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
      | ~ ssList(X10)
      | ~ ssList(X9)
      | ~ ssList(X8)
      | ~ ssItem(X7)
      | ~ ssItem(X6)
      | ~ strictorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f146]) ).

fof(f223,plain,
    ! [X10,X8,X6,X9,X7] :
      ( ~ strictorderedP(app(app(X8,cons(X6,X9)),cons(X7,X10)))
      | ~ ssList(X10)
      | ~ ssList(X9)
      | ~ ssList(X8)
      | ~ ssItem(X7)
      | ~ ssItem(X6)
      | lt(X6,X7)
      | ~ ssList(app(app(X8,cons(X6,X9)),cons(X7,X10))) ),
    inference(equality_resolution,[],[f208]) ).

fof(f235,plain,
    ( sK6 = sK7
    | ~ ssItem(sK7)
    | ~ ssItem(sK6) ),
    inference(resolution,[],[f154,f191]) ).

fof(f244,definition,
    ( spl19_5
  <=> sK6 = sK7 ),
    introduced(definition,[new_symbols(definition,[spl19_5])],[avatar_definition]) ).

fof(f245,plain,
    ( sK6 = sK7
    | ~ spl19_5 ),
    inference(avatar_component_clause,[],[f244]) ).

fof(f247,plain,
    ( sK6 = sK7
    | ~ ssItem(sK6) ),
    inference(forward_subsumption_resolution,[],[f235,f152]) ).

fof(f248,plain,
    sK6 = sK7,
    inference(forward_subsumption_resolution,[],[f247,f151]) ).

fof(f249,plain,
    spl19_5,
    inference(avatar_split_clause,[],[f248,f244]) ).

fof(f250,plain,
    strictorderedP(sK0),
    inference(superposition,[],[f160,f163]) ).

fof(f313,plain,
    ( sK0 = app(app(app(sK8,cons(sK6,nil)),cons(sK6,nil)),sK9)
    | ~ spl19_5 ),
    inference(forward_demodulation,[],[f155,f245]) ).

fof(f319,plain,
    ( sK0 = app(app(sK8,cons(sK6,nil)),app(cons(sK6,nil),sK9))
    | ~ ssList(sK9)
    | ~ ssList(cons(sK6,nil))
    | ~ ssList(app(sK8,cons(sK6,nil)))
    | ~ spl19_5 ),
    inference(superposition,[],[f313,f181]) ).

fof(f336,plain,
    ( sK0 = app(app(sK8,cons(sK6,nil)),app(cons(sK6,nil),sK9))
    | ~ ssList(cons(sK6,nil))
    | ~ ssList(app(sK8,cons(sK6,nil)))
    | ~ spl19_5 ),
    inference(forward_subsumption_resolution,[],[f319,f156]) ).

fof(f339,definition,
    ( spl19_13
  <=> ssList(app(sK8,cons(sK6,nil))) ),
    introduced(definition,[new_symbols(definition,[spl19_13])],[avatar_definition]) ).

fof(f340,plain,
    ( ~ ssList(app(sK8,cons(sK6,nil)))
    | spl19_13 ),
    inference(avatar_component_clause,[],[f339]) ).

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

fof(f343,plain,
    ( ~ ssList(cons(sK6,nil))
    | spl19_14 ),
    inference(avatar_component_clause,[],[f342]) ).

fof(f345,definition,
    ( spl19_15
  <=> sK0 = app(app(sK8,cons(sK6,nil)),app(cons(sK6,nil),sK9)) ),
    introduced(definition,[new_symbols(definition,[spl19_15])],[avatar_definition]) ).

fof(f346,plain,
    ( sK0 = app(app(sK8,cons(sK6,nil)),app(cons(sK6,nil),sK9))
    | ~ spl19_15 ),
    inference(avatar_component_clause,[],[f345]) ).

fof(f365,plain,
    ( ~ spl19_13
    | ~ spl19_14
    | spl19_15
    | ~ spl19_5 ),
    inference(avatar_split_clause,[],[f336,f244,f345,f342,f339]) ).

fof(f371,plain,
    ( ~ ssItem(sK6)
    | ~ ssList(nil)
    | spl19_14 ),
    inference(resolution,[],[f343,f176]) ).

fof(f372,plain,
    ( ~ ssList(nil)
    | spl19_14 ),
    inference(forward_subsumption_resolution,[],[f371,f151]) ).

fof(f373,plain,
    ( $false
    | spl19_14 ),
    inference(forward_subsumption_resolution,[],[f372,f192]) ).

fof(f374,plain,
    spl19_14,
    inference(avatar_contradiction_clause,[],[f373]) ).

fof(f376,plain,
    ( ~ ssList(cons(sK6,nil))
    | ~ ssList(sK8)
    | spl19_13 ),
    inference(resolution,[],[f340,f187]) ).

fof(f377,plain,
    ( ~ ssList(cons(sK6,nil))
    | spl19_13 ),
    inference(forward_subsumption_resolution,[],[f376,f153]) ).

fof(f378,plain,
    ( ~ spl19_14
    | spl19_13 ),
    inference(avatar_split_clause,[],[f377,f339,f342]) ).

fof(f536,plain,
    ( sK0 = app(app(sK8,cons(sK6,nil)),cons(sK6,sK9))
    | ~ ssItem(sK6)
    | ~ ssList(sK9)
    | ~ spl19_15 ),
    inference(superposition,[],[f346,f182]) ).

fof(f568,plain,
    ( sK0 = app(app(sK8,cons(sK6,nil)),cons(sK6,sK9))
    | ~ ssList(sK9)
    | ~ spl19_15 ),
    inference(forward_subsumption_resolution,[],[f536,f151]) ).

fof(f575,plain,
    ( sK0 = app(app(sK8,cons(sK6,nil)),cons(sK6,sK9))
    | ~ spl19_15 ),
    inference(forward_subsumption_resolution,[],[f568,f156]) ).

fof(f858,plain,
    ( ~ strictorderedP(sK0)
    | ~ ssList(sK9)
    | ~ ssList(nil)
    | ~ ssList(sK8)
    | ~ ssItem(sK6)
    | ~ ssItem(sK6)
    | lt(sK6,sK6)
    | ~ ssList(sK0)
    | ~ spl19_15 ),
    inference(superposition,[],[f223,f575]) ).

fof(f869,plain,
    ( ~ strictorderedP(sK0)
    | ~ ssList(sK9)
    | ~ ssList(nil)
    | ~ ssList(sK8)
    | ~ ssItem(sK6)
    | lt(sK6,sK6)
    | ~ ssList(sK0)
    | ~ spl19_15 ),
    inference(duplicate_literal_removal,[],[f858]) ).

fof(f889,plain,
    ( ~ ssList(sK9)
    | ~ ssList(nil)
    | ~ ssList(sK8)
    | ~ ssItem(sK6)
    | lt(sK6,sK6)
    | ~ ssList(sK0)
    | ~ spl19_15 ),
    inference(forward_subsumption_resolution,[],[f869,f250]) ).

fof(f896,plain,
    ( ~ ssList(nil)
    | ~ ssList(sK8)
    | ~ ssItem(sK6)
    | lt(sK6,sK6)
    | ~ ssList(sK0)
    | ~ spl19_15 ),
    inference(forward_subsumption_resolution,[],[f889,f156]) ).

fof(f902,plain,
    ( ~ ssList(sK8)
    | ~ ssItem(sK6)
    | lt(sK6,sK6)
    | ~ ssList(sK0)
    | ~ spl19_15 ),
    inference(forward_subsumption_resolution,[],[f896,f192]) ).

fof(f903,plain,
    ( ~ ssItem(sK6)
    | lt(sK6,sK6)
    | ~ ssList(sK0)
    | ~ spl19_15 ),
    inference(forward_subsumption_resolution,[],[f902,f153]) ).

fof(f904,plain,
    ( lt(sK6,sK6)
    | ~ ssList(sK0)
    | ~ spl19_15 ),
    inference(forward_subsumption_resolution,[],[f903,f151]) ).

fof(f905,plain,
    ( lt(sK6,sK6)
    | ~ spl19_15 ),
    inference(forward_subsumption_resolution,[],[f904,f147]) ).

fof(f906,plain,
    ( ~ ssItem(sK6)
    | ~ spl19_15 ),
    inference(resolution,[],[f905,f198]) ).

fof(f912,plain,
    ( $false
    | ~ spl19_15 ),
    inference(forward_subsumption_resolution,[],[f906,f151]) ).

fof(f913,plain,
    ~ spl19_15,
    inference(avatar_contradiction_clause,[],[f912]) ).

cnf(s3,plain,
    spl19_5,
    inference(sat_conversion,[],[f249]) ).

cnf(s18,plain,
    ( ~ spl19_5
    | ~ spl19_13
    | ~ spl19_14
    | spl19_15 ),
    inference(sat_conversion,[],[f365]) ).

cnf(s20,plain,
    spl19_14,
    inference(sat_conversion,[],[f374]) ).

cnf(s21,plain,
    ( spl19_13
    | ~ spl19_14 ),
    inference(sat_conversion,[],[f378]) ).

cnf(s89,plain,
    ~ spl19_15,
    inference(sat_conversion,[],[f913]) ).

cnf(s94,plain,
    spl19_13,
    inference(rat,[],[s21,s20]) ).

cnf(s98,plain,
    ~ spl19_5,
    inference(rat,[],[s18,s89,s20,s94]) ).

cnf(s109,plain,
    $false,
    inference(rat,[],[s3,s98]) ).

fof(f914,plain,
    $false,
    inference(avatar_sat_refutation,[],[s109]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC168+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.11/0.37  % Computer : n026.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 28 08:18:12 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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.52/1.96  % (3689959)Detected formulas, will run a generic FOF schedule.
% 6.52/1.96  % (3689968)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2714483309:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.52/1.96  % (3689969)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3917018180:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.52/1.96  % (3689970)dis-21_1_sil=8000:lcm=predicate:random_seed=3277529529: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.52/1.96  % (3689964)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=4256209258:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.52/1.96  % (3689967)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2387014476:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.52/1.96  % (3689965)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=1756128169:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.52/1.96  % (3689966)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=3350076169:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.52/1.96  % (3689968)Instruction limit reached! 
% 6.52/1.96  % (3689968)------------------------------
% 6.52/1.96  % (3689968)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.52/1.96  % (3689968)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.52/1.96  % (3689968)CaDiCaL version: 2.1.3
% 6.52/1.96  % (3689968)Termination reason: Instruction limit
% 6.52/1.96  % (3689968)Termination phase: Saturation
% 6.52/1.96  % (3689968)Time elapsed: 0.039 s
% 6.52/1.96  % (3689968)Peak memory usage: 89 MB
% 6.52/1.96  % (3689968)Instructions burned: 126 (million)
% 6.52/1.96  % (3689967)Instruction limit reached! 
% 6.52/1.96  % (3689967)------------------------------
% 6.52/1.96  % (3689967)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.52/1.96  % (3689967)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.52/1.96  % (3689967)CaDiCaL version: 2.1.3
% 6.52/1.96  % (3689967)Termination reason: Instruction limit
% 6.52/1.96  % (3689967)Termination phase: Saturation
% 6.52/1.96  % (3689967)Time elapsed: 0.070 s
% 6.52/1.96  % (3689967)Peak memory usage: 90 MB
% 6.52/1.96  % (3689967)Instructions burned: 110 (million)
% 6.52/1.96  % (3689970)Instruction limit reached! 
% 6.52/1.96  % (3689970)------------------------------
% 6.52/1.96  % (3689970)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.52/1.96  % (3689970)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.52/1.96  % (3689970)CaDiCaL version: 2.1.3
% 6.52/1.96  % (3689970)Termination reason: Instruction limit
% 6.52/1.96  % (3689970)Termination phase: Saturation
% 6.52/1.96  % (3689970)Time elapsed: 0.074 s
% 6.52/1.96  % (3689970)Peak memory usage: 91 MB
% 6.52/1.96  % (3689970)Instructions burned: 129 (million)
% 6.52/1.96  % (3689969)Instruction limit reached! 
% 6.52/1.96  % (3689969)------------------------------
% 6.52/1.96  % (3689969)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.52/1.96  % (3689969)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.52/1.96  % (3689969)CaDiCaL version: 2.1.3
% 6.52/1.96  % (3689969)Termination reason: Instruction limit
% 6.52/1.96  % (3689969)Termination phase: Saturation
% 6.52/1.96  % (3689969)Time elapsed: 0.098 s
% 6.52/1.96  % (3689969)Peak memory usage: 90 MB
% 6.52/1.96  % (3689969)Instructions burned: 140 (million)
% 6.52/1.96  % (3689978)lrs+10_1_sil=8000:sp=occurrence:random_seed=3820618971:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 6.52/1.96  % (3689978)Instruction limit reached! 
% 6.52/1.96  % (3689978)------------------------------
% 6.52/1.96  % (3689978)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.52/1.96  % (3689978)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.52/1.96  % (3689978)CaDiCaL version: 2.1.3
% 6.52/1.96  % (3689978)Termination reason: Instruction limit
% 6.52/1.96  % (3689978)Termination phase: Saturation
% 6.52/1.96  % (3689978)Time elapsed: 0.090 s
% 6.52/1.96  % (3689978)Peak memory usage: 92 MB
% 6.52/1.96  % (3689978)Instructions burned: 286 (million)
% 6.52/1.96  % (3689979)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1027671176:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 6.52/1.96  % (3689980)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1450866312:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 6.52/1.96  % (3689982)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=1870178991:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 6.52/1.96  % (3689979)Instruction limit reached! 
% 6.52/1.96  % (3689979)------------------------------
% 6.52/1.96  % (3689979)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.52/1.96  % (3689979)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.52/1.96  % (3689979)CaDiCaL version: 2.1.3
% 6.52/1.96  % (3689979)Termination reason: Instruction limit
% 6.52/1.96  % (3689979)Termination phase: Saturation
% 6.52/1.96  % (3689979)Time elapsed: 0.079 s
% 6.52/1.96  % (3689979)Peak memory usage: 94 MB
% 6.52/1.96  % (3689979)Instructions burned: 157 (million)
% 6.52/1.96  % (3689985)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=4222125488:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2996 on theBenchmark for (2996ds/294Mi)
% 6.52/1.96  % (3689982)Instruction limit reached! 
% 6.52/1.96  % (3689982)------------------------------
% 6.52/1.96  % (3689982)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.52/1.96  % (3689982)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.52/1.96  % (3689982)CaDiCaL version: 2.1.3
% 6.52/1.96  % (3689982)Termination reason: Instruction limit
% 6.52/1.96  % (3689982)Termination phase: Saturation
% 6.52/1.96  % (3689982)Time elapsed: 0.124 s
% 6.52/1.96  % (3689982)Peak memory usage: 97 MB
% 6.52/1.96  % (3689982)Instructions burned: 248 (million)
% 6.52/1.96  % (3689985)Instruction limit reached! 
% 6.52/1.96  % (3689985)------------------------------
% 6.52/1.96  % (3689985)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.52/1.96  % (3689985)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.52/1.96  % (3689985)CaDiCaL version: 2.1.3
% 6.52/1.96  % (3689985)Termination reason: Instruction limit
% 6.52/1.96  % (3689985)Termination phase: Saturation
% 6.52/1.96  % (3689985)Time elapsed: 0.094 s
% 6.52/1.96  % (3689985)Peak memory usage: 90 MB
% 6.52/1.96  % (3689985)Instructions burned: 296 (million)
% 6.52/1.96  % (3689980)Instruction limit reached! 
% 6.52/1.96  % (3689980)------------------------------
% 6.52/1.96  % (3689980)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.52/1.96  % (3689980)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.52/1.96  % (3689980)CaDiCaL version: 2.1.3
% 6.52/1.96  % (3689980)Termination reason: Instruction limit
% 6.52/1.96  % (3689980)Termination phase: Saturation
% 6.52/1.96  % (3689980)Time elapsed: 0.203 s
% 6.52/1.96  % (3689980)Peak memory usage: 92 MB
% 6.52/1.96  % (3689980)Instructions burned: 326 (million)
% 6.52/1.96  % (3689988)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=3004220169:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 6.52/1.96  % (3689990)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1505772635:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 6.52/1.96  % (3689989)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3201689134:cts=off:i=113:fsr=off:ss=included:sgt=4_2995 on theBenchmark for (2995ds/113Mi)
% 6.52/1.96  % (3689990)Instruction limit reached! 
% 6.52/1.96  % (3689990)------------------------------
% 6.52/1.96  % (3689990)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.52/1.96  % (3689990)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.52/1.96  % (3689990)CaDiCaL version: 2.1.3
% 6.52/1.96  % (3689990)Termination reason: Instruction limit
% 6.52/1.96  % (3689990)Termination phase: Saturation
% 6.52/1.96  % (3689990)Time elapsed: 0.035 s
% 6.52/1.96  % (3689990)Peak memory usage: 90 MB
% 6.52/1.96  % (3689990)Instructions burned: 129 (million)
% 6.52/1.96  % (3689992)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=2379186750:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2994 on theBenchmark for (2994ds/114Mi)
% 6.52/1.96  % (3689989)Instruction limit reached! 
% 6.52/1.96  % (3689989)------------------------------
% 6.52/1.96  % (3689989)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.52/1.96  % (3689989)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.52/1.96  % (3689989)CaDiCaL version: 2.1.3
% 6.52/1.96  % (3689989)Termination reason: Instruction limit
% 6.52/1.96  % (3689989)Termination phase: Saturation
% 6.52/1.96  % (3689989)Time elapsed: 0.074 s
% 6.52/1.96  % (3689989)Peak memory usage: 91 MB
% 6.52/1.96  % (3689989)Instructions burned: 114 (million)
% 6.52/1.96  % (3689995)lrs+10_1_sil=8000:sp=occurrence:random_seed=2505212977:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2993 on theBenchmark for (2993ds/907Mi)
% 6.52/1.96  % (3689992)Instruction limit reached! 
% 6.52/1.96  % (3689992)------------------------------
% 6.52/1.96  % (3689992)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.52/1.96  % (3689992)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.52/1.96  % (3689992)CaDiCaL version: 2.1.3
% 6.52/1.96  % (3689992)Termination reason: Instruction limit
% 6.52/1.96  % (3689992)Termination phase: Saturation
% 6.52/1.96  % (3689992)Time elapsed: 0.067 s
% 6.52/1.96  % (3689992)Peak memory usage: 89 MB
% 6.52/1.96  % (3689992)Instructions burned: 115 (million)
% 6.52/1.96  % (3689997)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=21558737:i=437:sd=1:aac=none:ss=included_2992 on theBenchmark for (2992ds/437Mi)
% 6.52/1.96  % (3689997)First to succeed.
% 6.52/1.96  % (3689997)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3689959"
% 6.52/1.96  % (3689999)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1815827632:i=5202:ss=axioms:sgt=16_2992 on theBenchmark for (2992ds/5202Mi)
% 6.52/1.96  % (3689966)Also succeeded, but the first one will report.
% 6.52/1.96  % (3689964)Also succeeded, but the first one will report.
% 6.52/1.96  % (3689995)Instruction limit reached! 
% 6.52/1.96  % (3689995)------------------------------
% 6.52/1.96  % (3689995)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.52/1.96  % (3689995)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.52/1.96  % (3689995)CaDiCaL version: 2.1.3
% 6.52/1.96  % (3689995)Termination reason: Instruction limit
% 6.52/1.96  % (3689995)Termination phase: Saturation
% 6.52/1.96  % (3689995)Time elapsed: 0.259 s
% 6.52/1.96  % (3689995)Peak memory usage: 100 MB
% 6.52/1.96  % (3689995)Instructions burned: 911 (million)
% 6.52/1.96  % (3690002)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=757658660:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2990 on theBenchmark for (2990ds/134Mi)
% 6.52/1.96  % (3689997)Refutation found. Thanks to Tanya!
% 6.52/1.96  % SZS status Theorem for theBenchmark
% 6.52/1.96  % SZS output start Proof for theBenchmark
% See solution above
% 8.45/2.15  % (3689997)------------------------------
% 8.45/2.15  % (3689997)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.45/2.15  % (3689997)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.45/2.15  % (3689997)CaDiCaL version: 2.1.3
% 8.45/2.15  % (3689997)Termination reason: Refutation
% 8.45/2.15  % (3689997)Time elapsed: 0.019 s
% 8.45/2.15  % (3689997)Peak memory usage: 90 MB
% 8.45/2.15  % (3689997)Instructions burned: 27 (million)
% 8.45/2.15  % (3689997)------------------------------
% 8.45/2.15  % (3689997)------------------------------
% 8.45/2.15  % (3689959)Success in time 1.113 s
% 8.45/2.15  % Vampire exiting
%------------------------------------------------------------------------------