↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 01:03:04 PM UTC 2026

% Result   : Theorem 7.13s 1.88s
% Output   : Refutation 9.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   17
% Syntax   : Number of formulae    :  112 (  23 unt;   8 def)
%            Number of atoms       :  465 ( 129 equ)
%            Maximal formula atoms :   32 (   4 avg)
%            Number of connectives :  572 ( 219   ~; 243   |;  80   &)
%                                         (   4 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   5 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;   7 con; 0-3 aty)
%            Number of variables   :  158 (   0 sgn 126   !;  32   ?)

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

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

fof(f22,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => ssItem(hd(X0)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax22) ).

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

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

fof(f38,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ~ memberP(nil,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).

fof(f78,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( nil != X0
       => cons(hd(X0),tl(X0)) = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).

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

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

fof(f126,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f22]) ).

fof(f127,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(flattening,[],[f126]) ).

fof(f129,plain,
    ! [X0] :
      ( ssList(tl(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f130,plain,
    ! [X0] :
      ( ssList(tl(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(flattening,[],[f129]) ).

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

fof(f148,plain,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f38]) ).

fof(f192,plain,
    ! [X0] :
      ( cons(hd(X0),tl(X0)) = X0
      | nil = X0
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f78]) ).

fof(f193,plain,
    ! [X0] :
      ( cons(hd(X0),tl(X0)) = X0
      | nil = X0
      | ~ ssList(X0) ),
    inference(flattening,[],[f192]) ).

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

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

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & nil != X0
                  & ! [X4] :
                      ( ~ ssItem(X4)
                      | ! [X5] :
                          ( ~ ssList(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | app(app(X5,cons(X4,nil)),X6) != X0
                              | ? [X7] :
                                  ( memberP(X5,X7)
                                  & memberP(X6,X7)
                                  & leq(X4,X7)
                                  & ~ lt(X4,X7)
                                  & ssItem(X7) ) ) ) )
                  & ? [X8] :
                      ( ? [X9] :
                          ( app(app(X8,X2),X9) = X3
                          & equalelemsP(X2)
                          & ! [X10] :
                              ( ~ ssItem(X10)
                              | ! [X11] :
                                  ( ~ ssList(X11)
                                  | app(X11,cons(X10,nil)) != X8
                                  | ! [X12] :
                                      ( ~ ssList(X12)
                                      | app(cons(X10,nil),X12) != X2 ) ) )
                          & ! [X13] :
                              ( ~ ssItem(X13)
                              | ! [X14] :
                                  ( ~ ssList(X14)
                                  | app(cons(X13,nil),X14) != X9
                                  | ! [X15] :
                                      ( ~ ssList(X15)
                                      | app(X15,cons(X13,nil)) != X2 ) ) )
                          & ssList(X9) )
                      & ssList(X8) )
                  & ( nil = X3
                    | nil != X2 )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

fof(f296,plain,
    ( sK54 = sK56
    & sK53 = sK55
    & nil != sK53
    & ! [X4] :
        ( ~ ssItem(X4)
        | ! [X5] :
            ( ~ ssList(X5)
            | ! [X6] :
                ( ~ ssList(X6)
                | app(app(X5,cons(X4,nil)),X6) != sK53
                | ( memberP(X5,sK57(X4,X5,X6))
                  & memberP(X6,sK57(X4,X5,X6))
                  & leq(X4,sK57(X4,X5,X6))
                  & ~ lt(X4,sK57(X4,X5,X6))
                  & ssItem(sK57(X4,X5,X6)) ) ) ) )
    & sK56 = app(app(sK58,sK55),sK59)
    & equalelemsP(sK55)
    & ! [X10] :
        ( ~ ssItem(X10)
        | ! [X11] :
            ( ~ ssList(X11)
            | app(X11,cons(X10,nil)) != sK58
            | ! [X12] :
                ( ~ ssList(X12)
                | app(cons(X10,nil),X12) != sK55 ) ) )
    & ! [X13] :
        ( ~ ssItem(X13)
        | ! [X14] :
            ( ~ ssList(X14)
            | app(cons(X13,nil),X14) != sK59
            | ! [X15] :
                ( ~ ssList(X15)
                | app(X15,cons(X13,nil)) != sK55 ) ) )
    & ssList(sK59)
    & ssList(sK58)
    & ( nil = sK56
      | nil != sK55 )
    & ssList(sK56)
    & ssList(sK55)
    & ssList(sK54)
    & ssList(sK53) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X7,sK57(X4,X5,X6)),skolemize(X8,sK58),skolemize(X9,sK59)],[f222]) ).

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

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

fof(f397,plain,
    ! [X0] :
      ( ssItem(hd(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f127]) ).

fof(f399,plain,
    ! [X0] :
      ( ssList(tl(X0))
      | nil = X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f130]) ).

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

fof(f419,plain,
    ! [X0] :
      ( ~ memberP(nil,X0)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f148]) ).

fof(f474,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | nil = X0
      | cons(hd(X0),tl(X0)) = X0 ),
    inference(cnf_transformation,[],[f193]) ).

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

fof(f496,plain,
    ssList(sK53),
    inference(cnf_transformation,[],[f296]) ).

fof(f507,plain,
    ! [X6,X4,X5] :
      ( ~ ssItem(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(app(X5,cons(X4,nil)),X6) != sK53
      | ssItem(sK57(X4,X5,X6)) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f511,plain,
    ! [X6,X4,X5] :
      ( ~ ssItem(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(app(X5,cons(X4,nil)),X6) != sK53
      | memberP(X5,sK57(X4,X5,X6)) ),
    inference(cnf_transformation,[],[f296]) ).

fof(f512,plain,
    nil != sK53,
    inference(cnf_transformation,[],[f296]) ).

fof(f513,plain,
    sK53 = sK55,
    inference(cnf_transformation,[],[f296]) ).

fof(f515,plain,
    nil != sK55,
    inference(definition_unfolding,[],[f512,f513]) ).

fof(f516,plain,
    ! [X6,X4,X5] :
      ( ~ ssItem(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(app(X5,cons(X4,nil)),X6) != sK55
      | memberP(X5,sK57(X4,X5,X6)) ),
    inference(definition_unfolding,[],[f511,f513]) ).

fof(f520,plain,
    ! [X6,X4,X5] :
      ( ~ ssItem(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(app(X5,cons(X4,nil)),X6) != sK55
      | ssItem(sK57(X4,X5,X6)) ),
    inference(definition_unfolding,[],[f507,f513]) ).

fof(f522,plain,
    ssList(sK55),
    inference(definition_unfolding,[],[f496,f513]) ).

fof(f550,definition,
    ! [X4] : sF60(X4) = cons(X4,nil),
    introduced(definition,[new_symbols(definition,[sF60])],[function_definition]) ).

fof(f551,plain,
    ! [X4] : cons(X4,nil) = sF60(X4),
    inference(reorient_equations,[],[f550]) ).

fof(f552,definition,
    ! [X4,X5] : sF61(X5,X4) = app(X5,sF60(X4)),
    introduced(definition,[new_symbols(definition,[sF61])],[function_definition]) ).

fof(f553,plain,
    ! [X4,X5] : app(X5,sF60(X4)) = sF61(X5,X4),
    inference(reorient_equations,[],[f552]) ).

fof(f554,definition,
    ! [X6,X4,X5] : sF62(X5,X4,X6) = app(sF61(X5,X4),X6),
    introduced(definition,[new_symbols(definition,[sF62])],[function_definition]) ).

fof(f555,plain,
    ! [X6,X4,X5] : app(sF61(X5,X4),X6) = sF62(X5,X4,X6),
    inference(reorient_equations,[],[f554]) ).

fof(f556,plain,
    ! [X6,X4,X5] :
      ( sK55 != sF62(X5,X4,X6)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | ~ ssItem(X4)
      | memberP(X5,sK57(X4,X5,X6)) ),
    inference(definition_folding,[],[f516,f555,f553,f551]) ).

fof(f560,plain,
    ! [X6,X4,X5] :
      ( sK55 != sF62(X5,X4,X6)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | ~ ssItem(X4)
      | ssItem(sK57(X4,X5,X6)) ),
    inference(definition_folding,[],[f520,f555,f553,f551]) ).

fof(f566,definition,
    ! [X10,X12] : sF65(X10,X12) = app(sF60(X10),X12),
    introduced(definition,[new_symbols(definition,[sF65])],[function_definition]) ).

fof(f567,plain,
    ! [X10,X12] : app(sF60(X10),X12) = sF65(X10,X12),
    inference(reorient_equations,[],[f566]) ).

fof(f578,definition,
    ( spl66_1
  <=> nil = sK55 ),
    introduced(definition,[new_symbols(definition,[spl66_1])],[avatar_definition]) ).

fof(f580,plain,
    ( nil != sK55
    | spl66_1 ),
    inference(avatar_component_clause,[],[f578]) ).

fof(f586,plain,
    ~ spl66_1,
    inference(avatar_split_clause,[],[f515,f578]) ).

fof(f588,definition,
    ( spl66_3
  <=> ssList(nil) ),
    introduced(definition,[new_symbols(definition,[spl66_3])],[avatar_definition]) ).

fof(f589,plain,
    ( ssList(nil)
    | ~ spl66_3 ),
    inference(avatar_component_clause,[],[f588]) ).

fof(f616,plain,
    spl66_3,
    inference(avatar_split_clause,[],[f389,f588]) ).

fof(f627,plain,
    ! [X0] :
      ( ssList(sF60(X0))
      | ~ ssItem(X0)
      | ~ ssList(nil) ),
    inference(superposition,[],[f388,f551]) ).

fof(f628,plain,
    ( ! [X0] :
        ( ssList(sF60(X0))
        | ~ ssItem(X0) )
    | ~ spl66_3 ),
    inference(forward_subsumption_resolution,[],[f627,f589]) ).

fof(f631,plain,
    ( nil = sK55
    | sK55 = cons(hd(sK55),tl(sK55)) ),
    inference(resolution,[],[f474,f522]) ).

fof(f652,plain,
    ( sK55 = cons(hd(sK55),tl(sK55))
    | spl66_1 ),
    inference(forward_subsumption_resolution,[],[f631,f580]) ).

fof(f669,plain,
    ! [X0,X1] :
      ( nil = X0
      | ~ ssList(X0)
      | ~ ssItem(X1)
      | cons(X1,tl(X0)) = app(cons(X1,nil),tl(X0)) ),
    inference(resolution,[],[f399,f477]) ).

fof(f672,plain,
    ! [X0,X1] :
      ( cons(X1,tl(X0)) = app(sF60(X1),tl(X0))
      | nil = X0
      | ~ ssList(X0)
      | ~ ssItem(X1) ),
    inference(forward_demodulation,[],[f669,f551]) ).

fof(f673,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | nil = X0
      | cons(X1,tl(X0)) = sF65(X1,tl(X0))
      | ~ ssItem(X1) ),
    inference(forward_demodulation,[],[f672,f567]) ).

fof(f681,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | sF60(X0) = app(nil,sF60(X0)) )
    | ~ spl66_3 ),
    inference(resolution,[],[f628,f403]) ).

fof(f682,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | sF60(X0) = sF61(nil,X0) )
    | ~ spl66_3 ),
    inference(forward_demodulation,[],[f681,f553]) ).

fof(f768,plain,
    ! [X0] :
      ( nil = sK55
      | cons(X0,tl(sK55)) = sF65(X0,tl(sK55))
      | ~ ssItem(X0) ),
    inference(resolution,[],[f673,f522]) ).

fof(f775,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | cons(X0,tl(sK55)) = sF65(X0,tl(sK55)) )
    | spl66_1 ),
    inference(forward_subsumption_resolution,[],[f768,f580]) ).

fof(f780,plain,
    ( ! [X0] :
        ( ~ ssList(X0)
        | nil = X0
        | cons(hd(X0),tl(sK55)) = sF65(hd(X0),tl(sK55)) )
    | spl66_1 ),
    inference(resolution,[],[f775,f397]) ).

fof(f1004,plain,
    ( nil = sK55
    | cons(hd(sK55),tl(sK55)) = sF65(hd(sK55),tl(sK55))
    | spl66_1 ),
    inference(resolution,[],[f780,f522]) ).

fof(f1013,plain,
    ( cons(hd(sK55),tl(sK55)) = sF65(hd(sK55),tl(sK55))
    | spl66_1 ),
    inference(forward_subsumption_resolution,[],[f1004,f580]) ).

fof(f1016,plain,
    ( sK55 = sF65(hd(sK55),tl(sK55))
    | spl66_1 ),
    inference(forward_demodulation,[],[f1013,f652]) ).

fof(f1166,definition,
    ( spl66_31
  <=> ssList(tl(sK55)) ),
    introduced(definition,[new_symbols(definition,[spl66_31])],[avatar_definition]) ).

fof(f1167,plain,
    ( ssList(tl(sK55))
    | ~ spl66_31 ),
    inference(avatar_component_clause,[],[f1166]) ).

fof(f1168,plain,
    ( ~ ssList(tl(sK55))
    | spl66_31 ),
    inference(avatar_component_clause,[],[f1166]) ).

fof(f1170,definition,
    ( spl66_32
  <=> ssItem(hd(sK55)) ),
    introduced(definition,[new_symbols(definition,[spl66_32])],[avatar_definition]) ).

fof(f1171,plain,
    ( ssItem(hd(sK55))
    | ~ spl66_32 ),
    inference(avatar_component_clause,[],[f1170]) ).

fof(f1172,plain,
    ( ~ ssItem(hd(sK55))
    | spl66_32 ),
    inference(avatar_component_clause,[],[f1170]) ).

fof(f1233,plain,
    ( nil = sK55
    | ~ ssList(sK55)
    | spl66_31 ),
    inference(resolution,[],[f1168,f399]) ).

fof(f1234,plain,
    ( ~ ssList(sK55)
    | spl66_1
    | spl66_31 ),
    inference(forward_subsumption_resolution,[],[f1233,f580]) ).

fof(f1235,plain,
    ( $false
    | spl66_1
    | spl66_31 ),
    inference(forward_subsumption_resolution,[],[f1234,f522]) ).

fof(f1236,plain,
    ( spl66_1
    | spl66_31 ),
    inference(avatar_contradiction_clause,[],[f1235]) ).

fof(f1285,plain,
    ( nil = sK55
    | ~ ssList(sK55)
    | spl66_32 ),
    inference(resolution,[],[f1172,f397]) ).

fof(f1286,plain,
    ( ~ ssList(sK55)
    | spl66_1
    | spl66_32 ),
    inference(forward_subsumption_resolution,[],[f1285,f580]) ).

fof(f1287,plain,
    ( $false
    | spl66_1
    | spl66_32 ),
    inference(forward_subsumption_resolution,[],[f1286,f522]) ).

fof(f1288,plain,
    ( spl66_1
    | spl66_32 ),
    inference(avatar_contradiction_clause,[],[f1287]) ).

fof(f1294,plain,
    ( sF60(hd(sK55)) = sF61(nil,hd(sK55))
    | ~ spl66_3
    | ~ spl66_32 ),
    inference(resolution,[],[f1171,f682]) ).

fof(f1311,plain,
    ( ! [X0] : sF62(nil,hd(sK55),X0) = app(sF60(hd(sK55)),X0)
    | ~ spl66_3
    | ~ spl66_32 ),
    inference(superposition,[],[f555,f1294]) ).

fof(f1312,plain,
    ( ! [X0] : sF65(hd(sK55),X0) = sF62(nil,hd(sK55),X0)
    | ~ spl66_3
    | ~ spl66_32 ),
    inference(forward_demodulation,[],[f1311,f567]) ).

fof(f1382,plain,
    ( ! [X0] :
        ( sK55 != sF65(hd(sK55),X0)
        | ~ ssList(nil)
        | ~ ssList(X0)
        | ~ ssItem(hd(sK55))
        | ssItem(sK57(hd(sK55),nil,X0)) )
    | ~ spl66_3
    | ~ spl66_32 ),
    inference(superposition,[],[f560,f1312]) ).

fof(f1383,plain,
    ( ! [X0] :
        ( sK55 != sF65(hd(sK55),X0)
        | ~ ssList(nil)
        | ~ ssList(X0)
        | ~ ssItem(hd(sK55))
        | memberP(nil,sK57(hd(sK55),nil,X0)) )
    | ~ spl66_3
    | ~ spl66_32 ),
    inference(superposition,[],[f556,f1312]) ).

fof(f1388,plain,
    ( ! [X0] :
        ( sK55 != sF65(hd(sK55),X0)
        | ~ ssList(X0)
        | ~ ssItem(hd(sK55))
        | memberP(nil,sK57(hd(sK55),nil,X0)) )
    | ~ spl66_3
    | ~ spl66_32 ),
    inference(forward_subsumption_resolution,[],[f1383,f589]) ).

fof(f1389,plain,
    ( ! [X0] :
        ( sK55 != sF65(hd(sK55),X0)
        | ~ ssList(X0)
        | ~ ssItem(hd(sK55))
        | ssItem(sK57(hd(sK55),nil,X0)) )
    | ~ spl66_3
    | ~ spl66_32 ),
    inference(forward_subsumption_resolution,[],[f1382,f589]) ).

fof(f1394,plain,
    ( ! [X0] :
        ( sK55 != sF65(hd(sK55),X0)
        | ~ ssList(X0)
        | memberP(nil,sK57(hd(sK55),nil,X0)) )
    | ~ spl66_3
    | ~ spl66_32 ),
    inference(forward_subsumption_resolution,[],[f1388,f1171]) ).

fof(f1395,plain,
    ( ! [X0] :
        ( sK55 != sF65(hd(sK55),X0)
        | ~ ssList(X0)
        | ssItem(sK57(hd(sK55),nil,X0)) )
    | ~ spl66_3
    | ~ spl66_32 ),
    inference(forward_subsumption_resolution,[],[f1389,f1171]) ).

fof(f1398,plain,
    ( sK55 != sK55
    | ~ ssList(tl(sK55))
    | memberP(nil,sK57(hd(sK55),nil,tl(sK55)))
    | spl66_1
    | ~ spl66_3
    | ~ spl66_32 ),
    inference(superposition,[],[f1394,f1016]) ).

fof(f1400,plain,
    ( ~ ssList(tl(sK55))
    | memberP(nil,sK57(hd(sK55),nil,tl(sK55)))
    | spl66_1
    | ~ spl66_3
    | ~ spl66_32 ),
    inference(trivial_inequality_removal,[],[f1398]) ).

fof(f1401,plain,
    ( memberP(nil,sK57(hd(sK55),nil,tl(sK55)))
    | spl66_1
    | ~ spl66_3
    | ~ spl66_31
    | ~ spl66_32 ),
    inference(forward_subsumption_resolution,[],[f1400,f1167]) ).

fof(f1408,plain,
    ( sK55 != sK55
    | ~ ssList(tl(sK55))
    | ssItem(sK57(hd(sK55),nil,tl(sK55)))
    | spl66_1
    | ~ spl66_3
    | ~ spl66_32 ),
    inference(superposition,[],[f1395,f1016]) ).

fof(f1410,plain,
    ( ~ ssList(tl(sK55))
    | ssItem(sK57(hd(sK55),nil,tl(sK55)))
    | spl66_1
    | ~ spl66_3
    | ~ spl66_32 ),
    inference(trivial_inequality_removal,[],[f1408]) ).

fof(f1411,plain,
    ( ssItem(sK57(hd(sK55),nil,tl(sK55)))
    | spl66_1
    | ~ spl66_3
    | ~ spl66_31
    | ~ spl66_32 ),
    inference(forward_subsumption_resolution,[],[f1410,f1167]) ).

fof(f1415,plain,
    ( ~ ssItem(sK57(hd(sK55),nil,tl(sK55)))
    | spl66_1
    | ~ spl66_3
    | ~ spl66_31
    | ~ spl66_32 ),
    inference(resolution,[],[f1401,f419]) ).

fof(f1420,plain,
    ( $false
    | spl66_1
    | ~ spl66_3
    | ~ spl66_31
    | ~ spl66_32 ),
    inference(forward_subsumption_resolution,[],[f1415,f1411]) ).

fof(f1421,plain,
    ( spl66_1
    | ~ spl66_3
    | ~ spl66_31
    | ~ spl66_32 ),
    inference(avatar_contradiction_clause,[],[f1420]) ).

cnf(s2,plain,
    ~ spl66_1,
    inference(sat_conversion,[],[f586]) ).

cnf(s10,plain,
    spl66_3,
    inference(sat_conversion,[],[f616]) ).

cnf(s32,plain,
    ( spl66_1
    | spl66_31 ),
    inference(sat_conversion,[],[f1236]) ).

cnf(s40,plain,
    ( spl66_1
    | spl66_32 ),
    inference(sat_conversion,[],[f1288]) ).

cnf(s51,plain,
    ( spl66_1
    | ~ spl66_3
    | ~ spl66_31
    | ~ spl66_32 ),
    inference(sat_conversion,[],[f1421]) ).

cnf(s56,plain,
    spl66_32,
    inference(rat,[],[s40,s2]) ).

cnf(s57,plain,
    spl66_31,
    inference(rat,[],[s32,s2]) ).

cnf(s61,plain,
    $false,
    inference(rat,[],[s51,s2,s10,s56,s57]) ).

fof(f1424,plain,
    $false,
    inference(avatar_sat_refutation,[],[s61]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC235+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.08/0.19  % Computer : n008.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Mon Sep 28 08:38:24 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running first-order theorem proving
% 0.08/0.23  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.13/1.88  % (2102089)Detected formulas, will run a generic FOF schedule.
% 7.13/1.88  % (2102098)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=921760323:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 7.13/1.88  % (2102098)Instruction limit reached! 
% 7.13/1.88  % (2102098)------------------------------
% 7.13/1.88  % (2102098)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.13/1.88  % (2102098)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.13/1.88  % (2102098)CaDiCaL version: 2.1.3
% 7.13/1.88  % (2102098)Termination reason: Instruction limit
% 7.13/1.88  % (2102098)Termination phase: Saturation
% 7.13/1.88  % (2102098)Time elapsed: 0.038 s
% 7.13/1.88  % (2102098)Peak memory usage: 88 MB
% 7.13/1.88  % (2102098)Instructions burned: 121 (million)
% 7.13/1.88  % (2102099)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1563355115:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 7.13/1.88  % (2102095)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=2146834133:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 7.13/1.88  % (2102100)dis-21_1_sil=8000:lcm=predicate:random_seed=976460620: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)
% 7.13/1.88  % (2102097)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3633174292:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 7.13/1.88  % (2102094)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=799549377:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 7.13/1.88  % (2102096)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=730975261:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 7.13/1.88  % (2102097)Instruction limit reached! 
% 7.13/1.88  % (2102097)------------------------------
% 7.13/1.88  % (2102097)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.13/1.88  % (2102097)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.13/1.88  % (2102097)CaDiCaL version: 2.1.3
% 7.13/1.88  % (2102097)Termination reason: Instruction limit
% 7.13/1.88  % (2102097)Termination phase: Saturation
% 7.13/1.88  % (2102097)Time elapsed: 0.068 s
% 7.13/1.88  % (2102097)Peak memory usage: 89 MB
% 7.13/1.88  % (2102097)Instructions burned: 110 (million)
% 7.13/1.88  % (2102100)Instruction limit reached! 
% 7.13/1.88  % (2102100)------------------------------
% 7.13/1.88  % (2102100)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.13/1.88  % (2102100)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.13/1.88  % (2102100)CaDiCaL version: 2.1.3
% 7.13/1.88  % (2102100)Termination reason: Instruction limit
% 7.13/1.88  % (2102100)Termination phase: Saturation
% 7.13/1.88  % (2102100)Time elapsed: 0.070 s
% 7.13/1.88  % (2102100)Peak memory usage: 91 MB
% 7.13/1.88  % (2102100)Instructions burned: 131 (million)
% 7.13/1.88  % (2102099)Instruction limit reached! 
% 7.13/1.88  % (2102099)------------------------------
% 7.13/1.88  % (2102099)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.13/1.88  % (2102099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.13/1.88  % (2102099)CaDiCaL version: 2.1.3
% 7.13/1.88  % (2102099)Termination reason: Instruction limit
% 7.13/1.88  % (2102099)Termination phase: Saturation
% 7.13/1.88  % (2102099)Time elapsed: 0.096 s
% 7.13/1.88  % (2102099)Peak memory usage: 90 MB
% 7.13/1.88  % (2102099)Instructions burned: 139 (million)
% 7.13/1.88  % (2102102)lrs+10_1_sil=8000:sp=occurrence:random_seed=2264863802:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 7.13/1.88  % (2102102)Instruction limit reached! 
% 7.13/1.88  % (2102102)------------------------------
% 7.13/1.88  % (2102102)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.13/1.88  % (2102102)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.13/1.88  % (2102102)CaDiCaL version: 2.1.3
% 7.13/1.88  % (2102102)Termination reason: Instruction limit
% 7.13/1.88  % (2102102)Termination phase: Saturation
% 7.13/1.88  % (2102102)Time elapsed: 0.089 s
% 7.13/1.88  % (2102102)Peak memory usage: 92 MB
% 7.13/1.88  % (2102102)Instructions burned: 287 (million)
% 7.13/1.88  % (2102109)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1440318417:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 7.13/1.88  % (2102110)lrs+1011_1_sil=32000:sp=occurrence:random_seed=657656032:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 7.13/1.88  % (2102111)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=452317231:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 7.13/1.88  % (2102109)Instruction limit reached! 
% 7.13/1.88  % (2102109)------------------------------
% 7.13/1.88  % (2102109)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.13/1.88  % (2102109)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.13/1.88  % (2102109)CaDiCaL version: 2.1.3
% 7.13/1.88  % (2102109)Termination reason: Instruction limit
% 7.13/1.88  % (2102109)Termination phase: Saturation
% 7.13/1.88  % (2102109)Time elapsed: 0.085 s
% 7.13/1.88  % (2102109)Peak memory usage: 94 MB
% 7.13/1.88  % (2102109)Instructions burned: 158 (million)
% 7.13/1.88  % (2102113)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1038290381:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2996 on theBenchmark for (2996ds/294Mi)
% 7.13/1.88  % (2102111)Instruction limit reached! 
% 7.13/1.88  % (2102111)------------------------------
% 7.13/1.88  % (2102111)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.13/1.88  % (2102111)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.13/1.88  % (2102111)CaDiCaL version: 2.1.3
% 7.13/1.88  % (2102111)Termination reason: Instruction limit
% 7.13/1.88  % (2102111)Termination phase: Saturation
% 7.13/1.88  % (2102111)Time elapsed: 0.120 s
% 7.13/1.88  % (2102111)Peak memory usage: 94 MB
% 7.13/1.88  % (2102111)Instructions burned: 250 (million)
% 7.13/1.88  % (2102113)Instruction limit reached! 
% 7.13/1.88  % (2102113)------------------------------
% 7.13/1.88  % (2102113)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.13/1.88  % (2102113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.13/1.88  % (2102113)CaDiCaL version: 2.1.3
% 7.13/1.88  % (2102113)Termination reason: Instruction limit
% 7.13/1.88  % (2102113)Termination phase: Saturation
% 7.13/1.88  % (2102113)Time elapsed: 0.091 s
% 7.13/1.88  % (2102113)Peak memory usage: 90 MB
% 7.13/1.88  % (2102113)Instructions burned: 295 (million)
% 7.13/1.88  % (2102110)Instruction limit reached! 
% 7.13/1.88  % (2102110)------------------------------
% 7.13/1.88  % (2102110)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.13/1.88  % (2102110)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.13/1.88  % (2102110)CaDiCaL version: 2.1.3
% 7.13/1.88  % (2102110)Termination reason: Instruction limit
% 7.13/1.88  % (2102110)Termination phase: Saturation
% 7.13/1.88  % (2102110)Time elapsed: 0.199 s
% 7.13/1.88  % (2102110)Peak memory usage: 92 MB
% 7.13/1.88  % (2102110)Instructions burned: 326 (million)
% 7.13/1.88  % (2102117)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1527506262:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 7.13/1.88  % (2102120)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=499001690:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 7.13/1.88  % (2102119)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=1653818052:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 7.13/1.88  % (2102120)Instruction limit reached! 
% 7.13/1.88  % (2102120)------------------------------
% 7.13/1.88  % (2102120)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.13/1.88  % (2102120)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.13/1.88  % (2102120)CaDiCaL version: 2.1.3
% 7.13/1.88  % (2102120)Termination reason: Instruction limit
% 7.13/1.88  % (2102120)Termination phase: Saturation
% 7.13/1.88  % (2102120)Time elapsed: 0.034 s
% 7.13/1.88  % (2102120)Peak memory usage: 89 MB
% 7.13/1.88  % (2102120)Instructions burned: 127 (million)
% 7.13/1.88  % (2102121)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=971213097:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2994 on theBenchmark for (2994ds/114Mi)
% 7.13/1.88  % (2102119)Instruction limit reached! 
% 7.13/1.88  % (2102119)------------------------------
% 7.13/1.88  % (2102119)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.13/1.88  % (2102119)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.13/1.88  % (2102119)CaDiCaL version: 2.1.3
% 7.13/1.88  % (2102119)Termination reason: Instruction limit
% 7.13/1.88  % (2102119)Termination phase: Saturation
% 7.13/1.88  % (2102119)Time elapsed: 0.075 s
% 7.13/1.88  % (2102119)Peak memory usage: 90 MB
% 7.13/1.88  % (2102119)Instructions burned: 113 (million)
% 7.13/1.88  % (2102121)Instruction limit reached! 
% 7.13/1.88  % (2102121)------------------------------
% 7.13/1.88  % (2102121)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.13/1.88  % (2102121)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.13/1.88  % (2102121)CaDiCaL version: 2.1.3
% 7.13/1.88  % (2102121)Termination reason: Instruction limit
% 7.13/1.88  % (2102121)Termination phase: Saturation
% 7.13/1.88  % (2102121)Time elapsed: 0.067 s
% 7.13/1.88  % (2102121)Peak memory usage: 89 MB
% 7.13/1.88  % (2102121)Instructions burned: 114 (million)
% 7.13/1.88  % (2102125)lrs+10_1_sil=8000:sp=occurrence:random_seed=1021857929:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2992 on theBenchmark for (2992ds/907Mi)
% 7.13/1.88  % (2102127)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=1271676250:i=437:sd=1:aac=none:ss=included_2992 on theBenchmark for (2992ds/437Mi)
% 7.13/1.88  % (2102094)First to succeed.
% 7.13/1.88  % (2102094)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2102089"
% 7.13/1.88  % (2102128)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=2768187149:i=5202:ss=axioms:sgt=16_2991 on theBenchmark for (2991ds/5202Mi)
% 7.13/1.88  % (2102096)Also succeeded, but the first one will report.
% 7.13/1.88  % (2102125)Instruction limit reached! 
% 7.13/1.88  % (2102125)------------------------------
% 7.13/1.88  % (2102125)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.13/1.88  % (2102125)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.13/1.88  % (2102125)CaDiCaL version: 2.1.3
% 7.13/1.88  % (2102125)Termination reason: Instruction limit
% 7.13/1.88  % (2102125)Termination phase: Saturation
% 7.13/1.88  % (2102125)Time elapsed: 0.265 s
% 7.13/1.88  % (2102125)Peak memory usage: 100 MB
% 7.13/1.88  % (2102125)Instructions burned: 909 (million)
% 7.13/1.88  % (2102127)Also succeeded, but the first one will report.
% 7.13/1.88  % (2102094)Refutation found. Thanks to Tanya!
% 7.13/1.88  % SZS status Theorem for theBenchmark
% 7.13/1.88  % SZS output start Proof for theBenchmark
% See solution above
% 9.15/2.08  % (2102094)------------------------------
% 9.15/2.08  % (2102094)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 9.15/2.08  % (2102094)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 9.15/2.08  % (2102094)CaDiCaL version: 2.1.3
% 9.15/2.08  % (2102094)Termination reason: Refutation
% 9.15/2.08  % (2102094)Time elapsed: 0.771 s
% 9.15/2.08  % (2102094)Peak memory usage: 131 MB
% 9.15/2.08  % (2102094)Instructions burned: 1171 (million)
% 9.15/2.08  % (2102094)------------------------------
% 9.15/2.08  % (2102094)------------------------------
% 9.15/2.08  % (2102089)Success in time 1.21 s
% 9.15/2.08  % Vampire exiting
%------------------------------------------------------------------------------