↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC316+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 : n003.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:26 PM UTC 2026

% Result   : Theorem 4.56s 1.38s
% Output   : Refutation 5.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   20
% Syntax   : Number of formulae    :  156 (  21 unt;  11 def)
%            Number of atoms       :  628 ( 130 equ)
%            Maximal formula atoms :   25 (   4 avg)
%            Number of connectives :  832 ( 360   ~; 351   |;  83   &)
%                                         (  12 <=>;  26  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   16 (  14 usr;  11 prp; 0-4 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :  197 (   0 sgn 167   !;  30   ?)

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

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(f21,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => nil != cons(X1,X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax21) ).

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

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

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

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(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( X1 != X3
                    | X0 != X2
                    | ( ( ~ neq(X1,nil)
                        | ! [X4] :
                            ( ssItem(X4)
                           => ! [X5] :
                                ( ssList(X5)
                               => ( app(cons(X4,nil),X5) != X2
                                  | app(X5,cons(X4,nil)) != X3 ) ) )
                        | ( ? [X6] :
                              ( ssList(X6)
                              & X1 = X6
                              & ? [X7] :
                                  ( ssList(X7)
                                  & ? [X8] :
                                      ( ssList(X8)
                                      & tl(X0) = X7
                                      & app(X7,X8) = X6
                                      & ? [X9] :
                                          ( ssItem(X9)
                                          & cons(X9,nil) = X8
                                          & hd(X0) = X9
                                          & neq(nil,X0) )
                                      & neq(nil,X0) ) ) )
                          & neq(X0,nil) ) )
                      & ( ~ neq(X1,nil)
                        | neq(X3,nil) ) ) ) ) ) ) ),
    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
                      | ( ( ~ neq(X1,nil)
                          | ! [X4] :
                              ( ssItem(X4)
                             => ! [X5] :
                                  ( ssList(X5)
                                 => ( app(cons(X4,nil),X5) != X2
                                    | app(X5,cons(X4,nil)) != X3 ) ) )
                          | ( ? [X6] :
                                ( ssList(X6)
                                & X1 = X6
                                & ? [X7] :
                                    ( ssList(X7)
                                    & ? [X8] :
                                        ( ssList(X8)
                                        & tl(X0) = X7
                                        & app(X7,X8) = X6
                                        & ? [X9] :
                                            ( ssItem(X9)
                                            & cons(X9,nil) = X8
                                            & hd(X0) = X9
                                            & neq(nil,X0) )
                                        & neq(nil,X0) ) ) )
                            & neq(X0,nil) ) )
                        & ( ~ neq(X1,nil)
                          | neq(X3,nil) ) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

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

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

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

fof(f128,plain,
    ! [X0] :
      ( ! [X1] :
          ( hd(cons(X1,X0)) = X1
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f23]) ).

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(f131,plain,
    ! [X0] :
      ( ! [X1] :
          ( tl(cons(X1,X0)) = X0
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f25]) ).

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
                  & ( ( neq(X1,nil)
                      & ? [X4] :
                          ( ? [X5] :
                              ( app(cons(X4,nil),X5) = X2
                              & app(X5,cons(X4,nil)) = X3
                              & ssList(X5) )
                          & ssItem(X4) )
                      & ( ! [X6] :
                            ( ~ ssList(X6)
                            | X1 != X6
                            | ! [X7] :
                                ( ~ ssList(X7)
                                | ! [X8] :
                                    ( ~ ssList(X8)
                                    | tl(X0) != X7
                                    | app(X7,X8) != X6
                                    | ! [X9] :
                                        ( ~ ssItem(X9)
                                        | cons(X9,nil) != X8
                                        | hd(X0) != X9
                                        | ~ neq(nil,X0) )
                                    | ~ neq(nil,X0) ) ) )
                        | ~ neq(X0,nil) ) )
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f222,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ( ( neq(X1,nil)
                      & ? [X4] :
                          ( ? [X5] :
                              ( app(cons(X4,nil),X5) = X2
                              & app(X5,cons(X4,nil)) = X3
                              & ssList(X5) )
                          & ssItem(X4) )
                      & ( ! [X6] :
                            ( ~ ssList(X6)
                            | X1 != X6
                            | ! [X7] :
                                ( ~ ssList(X7)
                                | ! [X8] :
                                    ( ~ ssList(X8)
                                    | tl(X0) != X7
                                    | app(X7,X8) != X6
                                    | ! [X9] :
                                        ( ~ ssItem(X9)
                                        | cons(X9,nil) != X8
                                        | hd(X0) != X9
                                        | ~ neq(nil,X0) )
                                    | ~ neq(nil,X0) ) ) )
                        | ~ neq(X0,nil) ) )
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f221]) ).

fof(f232,definition,
    ! [X1,X2,X3,X0] :
      ( ( neq(X1,nil)
        & ? [X4] :
            ( ? [X5] :
                ( app(cons(X4,nil),X5) = X2
                & app(X5,cons(X4,nil)) = X3
                & ssList(X5) )
            & ssItem(X4) )
        & ( ! [X6] :
              ( ~ ssList(X6)
              | X1 != X6
              | ! [X7] :
                  ( ~ ssList(X7)
                  | ! [X8] :
                      ( ~ ssList(X8)
                      | tl(X0) != X7
                      | app(X7,X8) != X6
                      | ! [X9] :
                          ( ~ ssItem(X9)
                          | cons(X9,nil) != X8
                          | hd(X0) != X9
                          | ~ neq(nil,X0) )
                      | ~ neq(nil,X0) ) ) )
          | ~ neq(X0,nil) ) )
      | ~ sP6(X1,X2,X3,X0) ),
    introduced(definition,[new_symbols(definition,[sP6])],[predicate_definition_introduction]) ).

fof(f233,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & ( sP6(X1,X2,X3,X0)
                    | ( neq(X1,nil)
                      & ~ neq(X3,nil) ) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(definition_folding,[],[f222,f232]) ).

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

fof(f298,plain,
    ! [X1,X2,X3,X0] :
      ( ( neq(X1,nil)
        & ? [X4] :
            ( ? [X5] :
                ( app(cons(X4,nil),X5) = X2
                & app(X5,cons(X4,nil)) = X3
                & ssList(X5) )
            & ssItem(X4) )
        & ( ! [X6] :
              ( ~ ssList(X6)
              | X1 != X6
              | ! [X7] :
                  ( ~ ssList(X7)
                  | ! [X8] :
                      ( ~ ssList(X8)
                      | tl(X0) != X7
                      | app(X7,X8) != X6
                      | ! [X9] :
                          ( ~ ssItem(X9)
                          | cons(X9,nil) != X8
                          | hd(X0) != X9
                          | ~ neq(nil,X0) )
                      | ~ neq(nil,X0) ) ) )
          | ~ neq(X0,nil) ) )
      | ~ sP6(X1,X2,X3,X0) ),
    inference(nnf_transformation,[],[f232]) ).

fof(f299,plain,
    ! [X0,X1,X2,X3] :
      ( ( neq(X0,nil)
        & ? [X4] :
            ( ? [X5] :
                ( app(cons(X4,nil),X5) = X1
                & app(X5,cons(X4,nil)) = X2
                & ssList(X5) )
            & ssItem(X4) )
        & ( ! [X6] :
              ( ~ ssList(X6)
              | X0 != X6
              | ! [X7] :
                  ( ~ ssList(X7)
                  | ! [X8] :
                      ( ~ ssList(X8)
                      | tl(X3) != X7
                      | app(X7,X8) != X6
                      | ! [X9] :
                          ( ~ ssItem(X9)
                          | cons(X9,nil) != X8
                          | hd(X3) != X9
                          | ~ neq(nil,X3) )
                      | ~ neq(nil,X3) ) ) )
          | ~ neq(X3,nil) ) )
      | ~ sP6(X0,X1,X2,X3) ),
    inference(rectify,[],[f298]) ).

fof(f300,plain,
    ! [X0,X1,X2,X3] :
      ( ( neq(X0,nil)
        & app(cons(sK54(X1,X2),nil),sK55(X1,X2)) = X1
        & app(sK55(X1,X2),cons(sK54(X1,X2),nil)) = X2
        & ssList(sK55(X1,X2))
        & ssItem(sK54(X1,X2))
        & ( ! [X6] :
              ( ~ ssList(X6)
              | X0 != X6
              | ! [X7] :
                  ( ~ ssList(X7)
                  | ! [X8] :
                      ( ~ ssList(X8)
                      | tl(X3) != X7
                      | app(X7,X8) != X6
                      | ! [X9] :
                          ( ~ ssItem(X9)
                          | cons(X9,nil) != X8
                          | hd(X3) != X9
                          | ~ neq(nil,X3) )
                      | ~ neq(nil,X3) ) ) )
          | ~ neq(X3,nil) ) )
      | ~ sP6(X0,X1,X2,X3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK54,sK55]),skolemize(X4,sK54(X1,X2)),skolemize(X5,sK55(X1,X2))],[f299]) ).

fof(f301,plain,
    ( sK57 = sK59
    & sK56 = sK58
    & ( sP6(sK57,sK58,sK59,sK56)
      | ( neq(sK57,nil)
        & ~ neq(sK59,nil) ) )
    & ssList(sK59)
    & ssList(sK58)
    & ssList(sK57)
    & ssList(sK56) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK56,sK57,sK58,sK59]),skolemize(X0,sK56),skolemize(X1,sK57),skolemize(X2,sK58),skolemize(X3,sK59)],[f233]) ).

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

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

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

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

fof(f403,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssItem(X1)
      | hd(cons(X1,X0)) = X1 ),
    inference(cnf_transformation,[],[f128]) ).

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

fof(f405,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssItem(X1)
      | tl(cons(X1,X0)) = X0 ),
    inference(cnf_transformation,[],[f131]) ).

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

fof(f501,plain,
    ! [X2,X3,X0,X1,X8,X6,X9,X7] :
      ( ~ ssList(X6)
      | X0 != X6
      | ~ ssList(X7)
      | ~ ssList(X8)
      | tl(X3) != X7
      | app(X7,X8) != X6
      | ~ ssItem(X9)
      | cons(X9,nil) != X8
      | hd(X3) != X9
      | ~ neq(nil,X3)
      | ~ neq(nil,X3)
      | ~ neq(X3,nil)
      | ~ sP6(X0,X1,X2,X3) ),
    inference(cnf_transformation,[],[f300]) ).

fof(f502,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP6(X0,X1,X2,X3)
      | ssItem(sK54(X1,X2)) ),
    inference(cnf_transformation,[],[f300]) ).

fof(f503,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP6(X0,X1,X2,X3)
      | ssList(sK55(X1,X2)) ),
    inference(cnf_transformation,[],[f300]) ).

fof(f504,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP6(X0,X1,X2,X3)
      | app(sK55(X1,X2),cons(sK54(X1,X2),nil)) = X2 ),
    inference(cnf_transformation,[],[f300]) ).

fof(f505,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP6(X0,X1,X2,X3)
      | app(cons(sK54(X1,X2),nil),sK55(X1,X2)) = X1 ),
    inference(cnf_transformation,[],[f300]) ).

fof(f506,plain,
    ! [X2,X3,X0,X1] :
      ( ~ sP6(X0,X1,X2,X3)
      | neq(X0,nil) ),
    inference(cnf_transformation,[],[f300]) ).

fof(f507,plain,
    ssList(sK56),
    inference(cnf_transformation,[],[f301]) ).

fof(f508,plain,
    ssList(sK57),
    inference(cnf_transformation,[],[f301]) ).

fof(f511,plain,
    ( sP6(sK57,sK58,sK59,sK56)
    | ~ neq(sK59,nil) ),
    inference(cnf_transformation,[],[f301]) ).

fof(f512,plain,
    ( sP6(sK57,sK58,sK59,sK56)
    | neq(sK57,nil) ),
    inference(cnf_transformation,[],[f301]) ).

fof(f513,plain,
    sK56 = sK58,
    inference(cnf_transformation,[],[f301]) ).

fof(f514,plain,
    sK57 = sK59,
    inference(cnf_transformation,[],[f301]) ).

fof(f515,plain,
    ( sP6(sK59,sK58,sK59,sK58)
    | neq(sK59,nil) ),
    inference(definition_unfolding,[],[f512,f514,f513,f514]) ).

fof(f516,plain,
    ( sP6(sK59,sK58,sK59,sK58)
    | ~ neq(sK59,nil) ),
    inference(definition_unfolding,[],[f511,f514,f513]) ).

fof(f517,plain,
    ssList(sK59),
    inference(definition_unfolding,[],[f508,f514]) ).

fof(f518,plain,
    ssList(sK58),
    inference(definition_unfolding,[],[f507,f513]) ).

fof(f546,plain,
    ! [X2,X3,X1,X8,X6,X9,X7] :
      ( ~ ssList(X6)
      | ~ ssList(X7)
      | ~ ssList(X8)
      | tl(X3) != X7
      | app(X7,X8) != X6
      | ~ ssItem(X9)
      | cons(X9,nil) != X8
      | hd(X3) != X9
      | ~ neq(nil,X3)
      | ~ neq(nil,X3)
      | ~ neq(X3,nil)
      | ~ sP6(X6,X1,X2,X3) ),
    inference(equality_resolution,[],[f501]) ).

fof(f547,plain,
    ! [X2,X3,X1,X8,X6,X9] :
      ( ~ ssList(X6)
      | ~ ssList(tl(X3))
      | ~ ssList(X8)
      | app(tl(X3),X8) != X6
      | ~ ssItem(X9)
      | cons(X9,nil) != X8
      | hd(X3) != X9
      | ~ neq(nil,X3)
      | ~ neq(nil,X3)
      | ~ neq(X3,nil)
      | ~ sP6(X6,X1,X2,X3) ),
    inference(equality_resolution,[],[f546]) ).

fof(f548,plain,
    ! [X2,X3,X1,X8,X9] :
      ( ~ ssList(app(tl(X3),X8))
      | ~ ssList(tl(X3))
      | ~ ssList(X8)
      | ~ ssItem(X9)
      | cons(X9,nil) != X8
      | hd(X3) != X9
      | ~ neq(nil,X3)
      | ~ neq(nil,X3)
      | ~ neq(X3,nil)
      | ~ sP6(app(tl(X3),X8),X1,X2,X3) ),
    inference(equality_resolution,[],[f547]) ).

fof(f549,plain,
    ! [X2,X3,X1,X9] :
      ( ~ ssList(app(tl(X3),cons(X9,nil)))
      | ~ ssList(tl(X3))
      | ~ ssList(cons(X9,nil))
      | ~ ssItem(X9)
      | hd(X3) != X9
      | ~ neq(nil,X3)
      | ~ neq(nil,X3)
      | ~ neq(X3,nil)
      | ~ sP6(app(tl(X3),cons(X9,nil)),X1,X2,X3) ),
    inference(equality_resolution,[],[f548]) ).

fof(f550,plain,
    ! [X2,X3,X1] :
      ( ~ ssList(app(tl(X3),cons(hd(X3),nil)))
      | ~ ssList(tl(X3))
      | ~ ssList(cons(hd(X3),nil))
      | ~ ssItem(hd(X3))
      | ~ neq(nil,X3)
      | ~ neq(nil,X3)
      | ~ neq(X3,nil)
      | ~ sP6(app(tl(X3),cons(hd(X3),nil)),X1,X2,X3) ),
    inference(equality_resolution,[],[f549]) ).

fof(f551,plain,
    ! [X2,X3,X1] :
      ( ~ sP6(app(tl(X3),cons(hd(X3),nil)),X1,X2,X3)
      | ~ ssList(tl(X3))
      | ~ ssList(cons(hd(X3),nil))
      | ~ ssItem(hd(X3))
      | ~ neq(nil,X3)
      | ~ neq(X3,nil)
      | ~ ssList(app(tl(X3),cons(hd(X3),nil))) ),
    inference(duplicate_literal_removal,[],[f550]) ).

fof(f560,definition,
    ( spl60_1
  <=> neq(sK59,nil) ),
    introduced(definition,[new_symbols(definition,[spl60_1])],[avatar_definition]) ).

fof(f564,definition,
    ( spl60_2
  <=> sP6(sK59,sK58,sK59,sK58) ),
    introduced(definition,[new_symbols(definition,[spl60_2])],[avatar_definition]) ).

fof(f566,plain,
    ( sP6(sK59,sK58,sK59,sK58)
    | ~ spl60_2 ),
    inference(avatar_component_clause,[],[f564]) ).

fof(f567,plain,
    ( ~ spl60_1
    | spl60_2 ),
    inference(avatar_split_clause,[],[f516,f564,f560]) ).

fof(f568,plain,
    ( spl60_1
    | spl60_2 ),
    inference(avatar_split_clause,[],[f515,f564,f560]) ).

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

fof(f571,plain,
    ( ssList(nil)
    | ~ spl60_3 ),
    inference(avatar_component_clause,[],[f570]) ).

fof(f598,plain,
    spl60_3,
    inference(avatar_split_clause,[],[f394,f570]) ).

fof(f601,plain,
    ( sK58 = app(cons(sK54(sK58,sK59),nil),sK55(sK58,sK59))
    | ~ spl60_2 ),
    inference(resolution,[],[f566,f505]) ).

fof(f602,plain,
    ( neq(sK59,nil)
    | ~ spl60_2 ),
    inference(resolution,[],[f506,f566]) ).

fof(f603,plain,
    ( spl60_1
    | ~ spl60_2 ),
    inference(avatar_split_clause,[],[f602,f564,f560]) ).

fof(f604,plain,
    ( ssItem(sK54(sK58,sK59))
    | ~ spl60_2 ),
    inference(resolution,[],[f502,f566]) ).

fof(f605,plain,
    ( sK59 = app(sK55(sK58,sK59),cons(sK54(sK58,sK59),nil))
    | ~ spl60_2 ),
    inference(resolution,[],[f504,f566]) ).

fof(f606,plain,
    ( ssList(sK55(sK58,sK59))
    | ~ spl60_2 ),
    inference(resolution,[],[f503,f566]) ).

fof(f625,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | cons(X0,sK55(sK58,sK59)) = app(cons(X0,nil),sK55(sK58,sK59)) )
    | ~ spl60_2 ),
    inference(resolution,[],[f482,f606]) ).

fof(f628,plain,
    ( app(cons(sK54(sK58,sK59),nil),sK55(sK58,sK59)) = cons(sK54(sK58,sK59),sK55(sK58,sK59))
    | ~ spl60_2 ),
    inference(resolution,[],[f625,f604]) ).

fof(f630,plain,
    ( sK58 = cons(sK54(sK58,sK59),sK55(sK58,sK59))
    | ~ spl60_2 ),
    inference(forward_demodulation,[],[f628,f601]) ).

fof(f653,definition,
    ( spl60_12
  <=> nil = sK58 ),
    introduced(definition,[new_symbols(definition,[spl60_12])],[avatar_definition]) ).

fof(f654,plain,
    ( nil != sK58
    | spl60_12 ),
    inference(avatar_component_clause,[],[f653]) ).

fof(f655,plain,
    ( nil = sK58
    | ~ spl60_12 ),
    inference(avatar_component_clause,[],[f653]) ).

fof(f691,definition,
    ( spl60_18
  <=> ssList(tl(sK58)) ),
    introduced(definition,[new_symbols(definition,[spl60_18])],[avatar_definition]) ).

fof(f692,plain,
    ( ssList(tl(sK58))
    | ~ spl60_18 ),
    inference(avatar_component_clause,[],[f691]) ).

fof(f693,plain,
    ( ~ ssList(tl(sK58))
    | spl60_18 ),
    inference(avatar_component_clause,[],[f691]) ).

fof(f695,definition,
    ( spl60_19
  <=> ssItem(hd(sK58)) ),
    introduced(definition,[new_symbols(definition,[spl60_19])],[avatar_definition]) ).

fof(f696,plain,
    ( ssItem(hd(sK58))
    | ~ spl60_19 ),
    inference(avatar_component_clause,[],[f695]) ).

fof(f755,definition,
    ( spl60_23
  <=> ssList(cons(sK54(sK58,sK59),nil)) ),
    introduced(definition,[new_symbols(definition,[spl60_23])],[avatar_definition]) ).

fof(f756,plain,
    ( ssList(cons(sK54(sK58,sK59),nil))
    | ~ spl60_23 ),
    inference(avatar_component_clause,[],[f755]) ).

fof(f757,plain,
    ( ~ ssList(cons(sK54(sK58,sK59),nil))
    | spl60_23 ),
    inference(avatar_component_clause,[],[f755]) ).

fof(f763,plain,
    ( ~ ssItem(sK54(sK58,sK59))
    | ~ ssList(nil)
    | spl60_23 ),
    inference(resolution,[],[f757,f393]) ).

fof(f764,plain,
    ( ~ ssList(nil)
    | ~ spl60_2
    | spl60_23 ),
    inference(forward_subsumption_resolution,[],[f763,f604]) ).

fof(f765,plain,
    ( $false
    | ~ spl60_2
    | ~ spl60_3
    | spl60_23 ),
    inference(forward_subsumption_resolution,[],[f764,f571]) ).

fof(f766,plain,
    ( ~ spl60_2
    | ~ spl60_3
    | spl60_23 ),
    inference(avatar_contradiction_clause,[],[f765]) ).

fof(f798,plain,
    ( nil = sK58
    | ~ ssList(sK58)
    | spl60_18 ),
    inference(resolution,[],[f693,f404]) ).

fof(f799,plain,
    ( nil = sK58
    | spl60_18 ),
    inference(forward_subsumption_resolution,[],[f798,f518]) ).

fof(f800,plain,
    ( spl60_12
    | spl60_18 ),
    inference(avatar_split_clause,[],[f799,f691,f653]) ).

fof(f836,plain,
    ( nil != sK58
    | ~ ssItem(sK54(sK58,sK59))
    | ~ ssList(sK55(sK58,sK59))
    | ~ spl60_2 ),
    inference(superposition,[],[f401,f630]) ).

fof(f840,plain,
    ( ~ ssItem(sK54(sK58,sK59))
    | ~ ssList(sK55(sK58,sK59))
    | ~ spl60_2
    | ~ spl60_12 ),
    inference(forward_subsumption_resolution,[],[f836,f655]) ).

fof(f842,plain,
    ( ~ ssList(sK55(sK58,sK59))
    | ~ spl60_2
    | ~ spl60_12 ),
    inference(forward_subsumption_resolution,[],[f840,f604]) ).

fof(f844,plain,
    ( $false
    | ~ spl60_2
    | ~ spl60_12 ),
    inference(forward_subsumption_resolution,[],[f842,f606]) ).

fof(f845,plain,
    ( ~ spl60_2
    | ~ spl60_12 ),
    inference(avatar_contradiction_clause,[],[f844]) ).

fof(f858,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | hd(cons(X0,sK55(sK58,sK59))) = X0 )
    | ~ spl60_2 ),
    inference(resolution,[],[f403,f606]) ).

fof(f861,plain,
    ( sK54(sK58,sK59) = hd(cons(sK54(sK58,sK59),sK55(sK58,sK59)))
    | ~ spl60_2 ),
    inference(resolution,[],[f858,f604]) ).

fof(f863,plain,
    ( sK54(sK58,sK59) = hd(sK58)
    | ~ spl60_2 ),
    inference(forward_demodulation,[],[f861,f630]) ).

fof(f865,plain,
    ( ssItem(hd(sK58))
    | ~ spl60_2 ),
    inference(superposition,[],[f604,f863]) ).

fof(f866,plain,
    ( sK59 = app(sK55(sK58,sK59),cons(hd(sK58),nil))
    | ~ spl60_2 ),
    inference(superposition,[],[f605,f863]) ).

fof(f867,plain,
    ( sK58 = cons(hd(sK58),sK55(sK58,sK59))
    | ~ spl60_2 ),
    inference(superposition,[],[f630,f863]) ).

fof(f869,plain,
    ( ssList(cons(hd(sK58),nil))
    | ~ spl60_2
    | ~ spl60_23 ),
    inference(superposition,[],[f756,f863]) ).

fof(f871,plain,
    ( spl60_19
    | ~ spl60_2 ),
    inference(avatar_split_clause,[],[f865,f564,f695]) ).

fof(f920,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | sK55(sK58,sK59) = tl(cons(X0,sK55(sK58,sK59))) )
    | ~ spl60_2 ),
    inference(resolution,[],[f405,f606]) ).

fof(f927,plain,
    ( sK55(sK58,sK59) = tl(cons(hd(sK58),sK55(sK58,sK59)))
    | ~ spl60_2
    | ~ spl60_19 ),
    inference(resolution,[],[f920,f696]) ).

fof(f928,plain,
    ( sK55(sK58,sK59) = tl(sK58)
    | ~ spl60_2
    | ~ spl60_19 ),
    inference(forward_demodulation,[],[f927,f867]) ).

fof(f939,plain,
    ( sK59 = app(tl(sK58),cons(hd(sK58),nil))
    | ~ spl60_2
    | ~ spl60_19 ),
    inference(superposition,[],[f866,f928]) ).

fof(f944,plain,
    ( ! [X0,X1] :
        ( ~ sP6(sK59,X0,X1,sK58)
        | ~ ssList(tl(sK58))
        | ~ ssList(cons(hd(sK58),nil))
        | ~ ssItem(hd(sK58))
        | ~ neq(nil,sK58)
        | ~ neq(sK58,nil)
        | ~ ssList(sK59) )
    | ~ spl60_2
    | ~ spl60_19 ),
    inference(superposition,[],[f551,f939]) ).

fof(f946,plain,
    ( ! [X0,X1] :
        ( ~ sP6(sK59,X0,X1,sK58)
        | ~ ssList(cons(hd(sK58),nil))
        | ~ ssItem(hd(sK58))
        | ~ neq(nil,sK58)
        | ~ neq(sK58,nil)
        | ~ ssList(sK59) )
    | ~ spl60_2
    | ~ spl60_18
    | ~ spl60_19 ),
    inference(forward_subsumption_resolution,[],[f944,f692]) ).

fof(f947,plain,
    ( ! [X0,X1] :
        ( ~ sP6(sK59,X0,X1,sK58)
        | ~ ssItem(hd(sK58))
        | ~ neq(nil,sK58)
        | ~ neq(sK58,nil)
        | ~ ssList(sK59) )
    | ~ spl60_2
    | ~ spl60_18
    | ~ spl60_19
    | ~ spl60_23 ),
    inference(forward_subsumption_resolution,[],[f946,f869]) ).

fof(f948,plain,
    ( ! [X0,X1] :
        ( ~ sP6(sK59,X0,X1,sK58)
        | ~ neq(nil,sK58)
        | ~ neq(sK58,nil)
        | ~ ssList(sK59) )
    | ~ spl60_2
    | ~ spl60_18
    | ~ spl60_19
    | ~ spl60_23 ),
    inference(forward_subsumption_resolution,[],[f947,f696]) ).

fof(f949,plain,
    ( ! [X0,X1] :
        ( ~ sP6(sK59,X0,X1,sK58)
        | ~ neq(nil,sK58)
        | ~ neq(sK58,nil) )
    | ~ spl60_2
    | ~ spl60_18
    | ~ spl60_19
    | ~ spl60_23 ),
    inference(forward_subsumption_resolution,[],[f948,f517]) ).

fof(f951,definition,
    ( spl60_33
  <=> neq(sK58,nil) ),
    introduced(definition,[new_symbols(definition,[spl60_33])],[avatar_definition]) ).

fof(f953,plain,
    ( ~ neq(sK58,nil)
    | spl60_33 ),
    inference(avatar_component_clause,[],[f951]) ).

fof(f955,definition,
    ( spl60_34
  <=> neq(nil,sK58) ),
    introduced(definition,[new_symbols(definition,[spl60_34])],[avatar_definition]) ).

fof(f957,plain,
    ( ~ neq(nil,sK58)
    | spl60_34 ),
    inference(avatar_component_clause,[],[f955]) ).

fof(f959,definition,
    ( spl60_35
  <=> ! [X0,X1] : ~ sP6(sK59,X0,X1,sK58) ),
    introduced(definition,[new_symbols(definition,[spl60_35])],[avatar_definition]) ).

fof(f960,plain,
    ( ! [X0,X1] : ~ sP6(sK59,X0,X1,sK58)
    | ~ spl60_35 ),
    inference(avatar_component_clause,[],[f959]) ).

fof(f961,plain,
    ( ~ spl60_33
    | ~ spl60_34
    | spl60_35
    | ~ spl60_2
    | ~ spl60_18
    | ~ spl60_19
    | ~ spl60_23 ),
    inference(avatar_split_clause,[],[f949,f755,f695,f691,f564,f959,f955,f951]) ).

fof(f963,plain,
    ( nil = sK58
    | ~ ssList(nil)
    | ~ ssList(sK58)
    | spl60_33 ),
    inference(resolution,[],[f953,f392]) ).

fof(f964,plain,
    ( ~ ssList(nil)
    | ~ ssList(sK58)
    | spl60_12
    | spl60_33 ),
    inference(forward_subsumption_resolution,[],[f963,f654]) ).

fof(f965,plain,
    ( ~ ssList(sK58)
    | ~ spl60_3
    | spl60_12
    | spl60_33 ),
    inference(forward_subsumption_resolution,[],[f964,f571]) ).

fof(f966,plain,
    ( $false
    | ~ spl60_3
    | spl60_12
    | spl60_33 ),
    inference(forward_subsumption_resolution,[],[f965,f518]) ).

fof(f967,plain,
    ( ~ spl60_3
    | spl60_12
    | spl60_33 ),
    inference(avatar_contradiction_clause,[],[f966]) ).

fof(f968,plain,
    ( nil = sK58
    | ~ ssList(sK58)
    | ~ ssList(nil)
    | spl60_34 ),
    inference(resolution,[],[f957,f392]) ).

fof(f969,plain,
    ( ~ ssList(sK58)
    | ~ ssList(nil)
    | spl60_12
    | spl60_34 ),
    inference(forward_subsumption_resolution,[],[f968,f654]) ).

fof(f970,plain,
    ( ~ ssList(nil)
    | spl60_12
    | spl60_34 ),
    inference(forward_subsumption_resolution,[],[f969,f518]) ).

fof(f971,plain,
    ( $false
    | ~ spl60_3
    | spl60_12
    | spl60_34 ),
    inference(forward_subsumption_resolution,[],[f970,f571]) ).

fof(f972,plain,
    ( ~ spl60_3
    | spl60_12
    | spl60_34 ),
    inference(avatar_contradiction_clause,[],[f971]) ).

fof(f973,plain,
    ( $false
    | ~ spl60_2
    | ~ spl60_35 ),
    inference(resolution,[],[f960,f566]) ).

fof(f974,plain,
    ( ~ spl60_2
    | ~ spl60_35 ),
    inference(avatar_contradiction_clause,[],[f973]) ).

cnf(s1,plain,
    ( ~ spl60_1
    | spl60_2 ),
    inference(sat_conversion,[],[f567]) ).

cnf(s2,plain,
    ( spl60_1
    | spl60_2 ),
    inference(sat_conversion,[],[f568]) ).

cnf(s10,plain,
    spl60_3,
    inference(sat_conversion,[],[f598]) ).

cnf(s11,plain,
    ( spl60_1
    | ~ spl60_2 ),
    inference(sat_conversion,[],[f603]) ).

cnf(s21,plain,
    ( ~ spl60_2
    | ~ spl60_3
    | spl60_23 ),
    inference(sat_conversion,[],[f766]) ).

cnf(s24,plain,
    ( spl60_12
    | spl60_18 ),
    inference(sat_conversion,[],[f800]) ).

cnf(s26,plain,
    ( ~ spl60_2
    | ~ spl60_12 ),
    inference(sat_conversion,[],[f845]) ).

cnf(s27,plain,
    ( ~ spl60_2
    | spl60_19 ),
    inference(sat_conversion,[],[f871]) ).

cnf(s29,plain,
    ( ~ spl60_2
    | ~ spl60_18
    | ~ spl60_19
    | ~ spl60_23
    | ~ spl60_33
    | ~ spl60_34
    | spl60_35 ),
    inference(sat_conversion,[],[f961]) ).

cnf(s30,plain,
    ( ~ spl60_3
    | spl60_12
    | spl60_33 ),
    inference(sat_conversion,[],[f967]) ).

cnf(s31,plain,
    ( ~ spl60_3
    | spl60_12
    | spl60_34 ),
    inference(sat_conversion,[],[f972]) ).

cnf(s32,plain,
    ( ~ spl60_2
    | ~ spl60_35 ),
    inference(sat_conversion,[],[f974]) ).

cnf(s36,plain,
    spl60_1,
    inference(rat,[],[s2,s11]) ).

cnf(s38,plain,
    spl60_2,
    inference(rat,[],[s1,s36]) ).

cnf(s41,plain,
    ~ spl60_35,
    inference(rat,[],[s32,s38]) ).

cnf(s42,plain,
    spl60_19,
    inference(rat,[],[s27,s38]) ).

cnf(s43,plain,
    ~ spl60_12,
    inference(rat,[],[s26,s38]) ).

cnf(s44,plain,
    spl60_23,
    inference(rat,[],[s21,s10,s38]) ).

cnf(s46,plain,
    spl60_34,
    inference(rat,[],[s31,s10,s43]) ).

cnf(s47,plain,
    spl60_33,
    inference(rat,[],[s30,s10,s43]) ).

cnf(s48,plain,
    spl60_18,
    inference(rat,[],[s24,s43]) ).

cnf(s50,plain,
    $false,
    inference(rat,[],[s29,s41,s46,s42,s44,s38,s47,s48]) ).

fof(f975,plain,
    $false,
    inference(avatar_sat_refutation,[],[s50]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC316+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.19  % Computer : n003.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 09:03:12 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.23  Running first-order theorem proving
% 0.08/0.23  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
% 4.56/1.38  % (1447906)Detected formulas, will run a generic FOF schedule.
% 4.56/1.38  % (1447911)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=122979365:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.56/1.38  % (1447912)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=2111430750:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.56/1.38  % (1447913)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=1193345925:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.56/1.38  % (1447914)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4139912332:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.56/1.38  % (1447916)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2167303172:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.56/1.38  % (1447915)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3498180604:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.56/1.38  % (1447917)dis-21_1_sil=8000:lcm=predicate:random_seed=2194994941: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)
% 4.56/1.38  % (1447915)Instruction limit reached! 
% 4.56/1.38  % (1447915)------------------------------
% 4.56/1.38  % (1447915)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.56/1.38  % (1447915)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.56/1.38  % (1447915)CaDiCaL version: 2.1.3
% 4.56/1.38  % (1447915)Termination reason: Instruction limit
% 4.56/1.38  % (1447915)Termination phase: Saturation
% 4.56/1.38  % (1447915)Time elapsed: 0.066 s
% 4.56/1.38  % (1447915)Peak memory usage: 88 MB
% 4.56/1.38  % (1447915)Instructions burned: 119 (million)
% 4.56/1.38  % (1447914)Instruction limit reached! 
% 4.56/1.38  % (1447914)------------------------------
% 4.56/1.38  % (1447914)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.56/1.38  % (1447914)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.56/1.38  % (1447914)CaDiCaL version: 2.1.3
% 4.56/1.38  % (1447914)Termination reason: Instruction limit
% 4.56/1.38  % (1447914)Termination phase: Saturation
% 4.56/1.38  % (1447914)Time elapsed: 0.069 s
% 4.56/1.38  % (1447914)Peak memory usage: 89 MB
% 4.56/1.38  % (1447914)Instructions burned: 110 (million)
% 4.56/1.38  % (1447917)Instruction limit reached! 
% 4.56/1.38  % (1447917)------------------------------
% 4.56/1.38  % (1447917)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.56/1.38  % (1447917)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.56/1.38  % (1447917)CaDiCaL version: 2.1.3
% 4.56/1.38  % (1447917)Termination reason: Instruction limit
% 4.56/1.38  % (1447917)Termination phase: Saturation
% 4.56/1.38  % (1447917)Time elapsed: 0.073 s
% 4.56/1.38  % (1447917)Peak memory usage: 90 MB
% 4.56/1.38  % (1447917)Instructions burned: 131 (million)
% 4.56/1.38  % (1447916)Instruction limit reached! 
% 4.56/1.38  % (1447916)------------------------------
% 4.56/1.38  % (1447916)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.56/1.38  % (1447916)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.56/1.38  % (1447916)CaDiCaL version: 2.1.3
% 4.56/1.38  % (1447916)Termination reason: Instruction limit
% 4.56/1.38  % (1447916)Termination phase: Saturation
% 4.56/1.38  % (1447916)Time elapsed: 0.089 s
% 4.56/1.38  % (1447916)Peak memory usage: 90 MB
% 4.56/1.38  % (1447916)Instructions burned: 139 (million)
% 4.56/1.38  % (1447925)lrs+10_1_sil=8000:sp=occurrence:random_seed=2489904131:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.56/1.38  % (1447927)lrs+1011_1_sil=32000:sp=occurrence:random_seed=58450365:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.56/1.38  % (1447926)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3806995457:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.56/1.38  % (1447928)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=4107043003:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 4.56/1.38  % (1447926)Instruction limit reached! 
% 4.56/1.38  % (1447926)------------------------------
% 4.56/1.38  % (1447926)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.56/1.38  % (1447926)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.56/1.38  % (1447926)CaDiCaL version: 2.1.3
% 4.56/1.38  % (1447926)Termination reason: Instruction limit
% 4.56/1.38  % (1447926)Termination phase: Saturation
% 4.56/1.38  % (1447926)Time elapsed: 0.075 s
% 4.56/1.38  % (1447926)Peak memory usage: 92 MB
% 4.56/1.38  % (1447926)Instructions burned: 159 (million)
% 4.56/1.38  % (1447911)First to succeed.
% 4.56/1.38  % (1447911)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1447906"
% 4.56/1.38  % (1447928)Instruction limit reached! 
% 4.56/1.38  % (1447928)------------------------------
% 4.56/1.38  % (1447928)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.56/1.38  % (1447928)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.56/1.38  % (1447928)CaDiCaL version: 2.1.3
% 4.56/1.38  % (1447928)Termination reason: Instruction limit
% 4.56/1.38  % (1447928)Termination phase: Saturation
% 4.56/1.38  % (1447928)Time elapsed: 0.113 s
% 4.56/1.38  % (1447928)Peak memory usage: 94 MB
% 4.56/1.38  % (1447928)Instructions burned: 248 (million)
% 4.56/1.38  % (1447925)Instruction limit reached! 
% 4.56/1.38  % (1447925)------------------------------
% 4.56/1.38  % (1447925)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.56/1.38  % (1447925)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.56/1.38  % (1447925)CaDiCaL version: 2.1.3
% 4.56/1.38  % (1447925)Termination reason: Instruction limit
% 4.56/1.38  % (1447925)Termination phase: Saturation
% 4.56/1.38  % (1447925)Time elapsed: 0.163 s
% 4.56/1.38  % (1447925)Peak memory usage: 92 MB
% 4.56/1.38  % (1447925)Instructions burned: 286 (million)
% 4.56/1.38  % (1447927)Instruction limit reached! 
% 4.56/1.38  % (1447927)------------------------------
% 4.56/1.38  % (1447927)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.56/1.38  % (1447927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.56/1.38  % (1447927)CaDiCaL version: 2.1.3
% 4.56/1.38  % (1447927)Termination reason: Instruction limit
% 4.56/1.38  % (1447927)Termination phase: Saturation
% 4.56/1.38  % (1447927)Time elapsed: 0.197 s
% 4.56/1.38  % (1447927)Peak memory usage: 92 MB
% 4.56/1.38  % (1447927)Instructions burned: 325 (million)
% 4.56/1.38  % (1447933)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=2127493153:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.56/1.38  % (1447933)Refutation not found, incomplete strategy
% 4.56/1.38  % (1447933)------------------------------
% 4.56/1.38  % (1447933)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.56/1.38  % (1447933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.56/1.38  % (1447933)CaDiCaL version: 2.1.3
% 4.56/1.38  % (1447933)Termination reason: Refutation not found, incomplete strategy
% 4.56/1.38  % (1447933)Time elapsed: 0.006 s
% 4.56/1.38  % (1447933)Peak memory usage: 88 MB
% 4.56/1.38  % (1447933)Instructions burned: 8 (million)
% 4.56/1.38  % (1447934)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=272212902:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 4.56/1.38  % (1447911)Refutation found. Thanks to Tanya!
% 4.56/1.38  % SZS status Theorem for theBenchmark
% 4.56/1.38  % SZS output start Proof for theBenchmark
% See solution above
% 5.53/1.56  % (1447911)------------------------------
% 5.53/1.56  % (1447911)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.53/1.56  % (1447911)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.53/1.56  % (1447911)CaDiCaL version: 2.1.3
% 5.53/1.56  % (1447911)Termination reason: Refutation
% 5.53/1.56  % (1447911)Time elapsed: 0.404 s
% 5.53/1.56  % (1447911)Peak memory usage: 132 MB
% 5.53/1.56  % (1447911)Instructions burned: 1057 (million)
% 5.53/1.56  % (1447911)------------------------------
% 5.53/1.56  % (1447911)------------------------------
% 5.53/1.56  % (1447906)Success in time 0.701 s
% 5.53/1.56  % Vampire exiting
%------------------------------------------------------------------------------