↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 6.00s 1.68s
% Output   : Refutation 7.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   16
% Syntax   : Number of formulae    :  115 (  21 unt;   8 def)
%            Number of atoms       :  501 (  47 equ)
%            Maximal formula atoms :   17 (   4 avg)
%            Number of connectives :  663 ( 277   ~; 285   |;  64   &)
%                                         (  13 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   6 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   15 (  13 usr;   9 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   5 con; 0-2 aty)
%            Number of variables   :  174 (   0 sgn 144   !;  30   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => ( memberP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( ssList(X3)
                    & app(X2,cons(X1,X3)) = X0 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).

fof(f11,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( totalorderedP(X0)
      <=> ! [X1] :
            ( ssItem(X1)
           => ! [X2] :
                ( ssItem(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ! [X4] :
                        ( ssList(X4)
                       => ! [X5] :
                            ( ssList(X5)
                           => ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                             => leq(X1,X2) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax11) ).

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(f26,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ssList(app(X0,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).

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(f82,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => app(app(X0,X1),X2) = app(X0,app(X1,X2)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax82) ).

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

fof(f98,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ssList(X3)
                  & X1 = X3
                  & X0 = X2
                  & ! [X4] :
                      ( ~ ssItem(X4)
                      | ! [X5] :
                          ( ~ ssList(X5)
                          | ! [X6] :
                              ( ~ ssList(X6)
                              | app(app(X5,cons(X4,nil)),X6) != X2
                              | ! [X7] :
                                  ( ~ ssItem(X7)
                                  | ( ( leq(X4,X7)
                                      | ~ memberP(X6,X7) )
                                    & ( leq(X7,X4)
                                      | ~ memberP(X5,X7) ) ) ) ) ) )
                  & ~ totalorderedP(X0) )
              & 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(f120,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( memberP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( ssList(X3)
                    & app(X2,cons(X1,X3)) = X0 ) ) )
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f128,plain,
    ! [X0] :
      ( ( totalorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( leq(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f129,plain,
    ! [X0] :
      ( ( totalorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( leq(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f128]) ).

fof(f130,plain,
    ( ssList(sK3)
    & sK1 = sK3
    & sK0 = sK2
    & ! [X4] :
        ( ~ ssItem(X4)
        | ! [X5] :
            ( ~ ssList(X5)
            | ! [X6] :
                ( ~ ssList(X6)
                | app(app(X5,cons(X4,nil)),X6) != sK2
                | ! [X7] :
                    ( ~ ssItem(X7)
                    | ( ( leq(X4,X7)
                        | ~ memberP(X6,X7) )
                      & ( leq(X7,X4)
                        | ~ memberP(X5,X7) ) ) ) ) ) )
    & ~ totalorderedP(sK0)
    & ssList(sK2)
    & ssList(sK1)
    & ssList(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f98]) ).

fof(f139,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( memberP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(X2,cons(X1,X3)) != X0 ) ) )
            & ( ? [X2] :
                  ( ssList(X2)
                  & ? [X3] :
                      ( ssList(X3)
                      & app(X2,cons(X1,X3)) = X0 ) )
              | ~ memberP(X0,X1) ) )
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f120]) ).

fof(f140,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( memberP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(X2,cons(X1,X3)) != X0 ) ) )
            & ( ? [X4] :
                  ( ssList(X4)
                  & ? [X5] :
                      ( ssList(X5)
                      & app(X4,cons(X1,X5)) = X0 ) )
              | ~ memberP(X0,X1) ) )
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(rectify,[],[f139]) ).

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

fof(f144,plain,
    ! [X0] :
      ( ( ( totalorderedP(X0)
          | ? [X1] :
              ( ? [X2] :
                  ( ? [X3] :
                      ( ? [X4] :
                          ( ? [X5] :
                              ( ~ leq(X1,X2)
                              & app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                              & ssList(X5) )
                          & ssList(X4) )
                      & ssList(X3) )
                  & ssItem(X2) )
              & ssItem(X1) ) )
        & ( ! [X1] :
              ( ! [X2] :
                  ( ! [X3] :
                      ( ! [X4] :
                          ( ! [X5] :
                              ( leq(X1,X2)
                              | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                              | ~ ssList(X5) )
                          | ~ ssList(X4) )
                      | ~ ssList(X3) )
                  | ~ ssItem(X2) )
              | ~ ssItem(X1) )
          | ~ totalorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f129]) ).

fof(f145,plain,
    ! [X0] :
      ( ( ( totalorderedP(X0)
          | ? [X1] :
              ( ? [X2] :
                  ( ? [X3] :
                      ( ? [X4] :
                          ( ? [X5] :
                              ( ~ leq(X1,X2)
                              & app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                              & ssList(X5) )
                          & ssList(X4) )
                      & ssList(X3) )
                  & ssItem(X2) )
              & ssItem(X1) ) )
        & ( ! [X6] :
              ( ! [X7] :
                  ( ! [X8] :
                      ( ! [X9] :
                          ( ! [X10] :
                              ( leq(X6,X7)
                              | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
                              | ~ ssList(X10) )
                          | ~ ssList(X9) )
                      | ~ ssList(X8) )
                  | ~ ssItem(X7) )
              | ~ ssItem(X6) )
          | ~ totalorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(rectify,[],[f144]) ).

fof(f146,plain,
    ! [X0] :
      ( ( ( totalorderedP(X0)
          | ( ~ leq(sK10(X0),sK11(X0))
            & app(app(sK12(X0),cons(sK10(X0),sK13(X0))),cons(sK11(X0),sK14(X0))) = X0
            & ssList(sK14(X0))
            & ssList(sK13(X0))
            & ssList(sK12(X0))
            & ssItem(sK11(X0))
            & ssItem(sK10(X0)) ) )
        & ( ! [X6] :
              ( ! [X7] :
                  ( ! [X8] :
                      ( ! [X9] :
                          ( ! [X10] :
                              ( leq(X6,X7)
                              | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
                              | ~ ssList(X10) )
                          | ~ ssList(X9) )
                      | ~ ssList(X8) )
                  | ~ ssItem(X7) )
              | ~ ssItem(X6) )
          | ~ totalorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13,sK14]),skolemize(X1,sK10(X0)),skolemize(X2,sK11(X0)),skolemize(X3,sK12(X0)),skolemize(X4,sK13(X0)),skolemize(X5,sK14(X0))],[f145]) ).

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

fof(f150,plain,
    ~ totalorderedP(sK0),
    inference(cnf_transformation,[],[f130]) ).

fof(f151,plain,
    ! [X6,X7,X4,X5] :
      ( ~ ssItem(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(app(X5,cons(X4,nil)),X6) != sK2
      | ~ ssItem(X7)
      | leq(X7,X4)
      | ~ memberP(X5,X7) ),
    inference(cnf_transformation,[],[f130]) ).

fof(f153,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f130]) ).

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

fof(f171,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(f172,plain,
    ! [X0,X1] :
      ( cons(X1,X0) = app(cons(X1,nil),X0)
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f109]) ).

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

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

fof(f189,plain,
    ! [X2,X3,X0,X1] :
      ( memberP(X0,X1)
      | ~ ssList(X2)
      | ~ ssList(X3)
      | app(X2,cons(X1,X3)) != X0
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f141]) ).

fof(f201,plain,
    ! [X0] :
      ( ssItem(sK10(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f146]) ).

fof(f202,plain,
    ! [X0] :
      ( ssItem(sK11(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f146]) ).

fof(f203,plain,
    ! [X0] :
      ( ssList(sK12(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f146]) ).

fof(f204,plain,
    ! [X0] :
      ( ssList(sK13(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f146]) ).

fof(f205,plain,
    ! [X0] :
      ( ssList(sK14(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f146]) ).

fof(f206,plain,
    ! [X0] :
      ( app(app(sK12(X0),cons(sK10(X0),sK13(X0))),cons(sK11(X0),sK14(X0))) = X0
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f146]) ).

fof(f207,plain,
    ! [X0] :
      ( ~ leq(sK10(X0),sK11(X0))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f146]) ).

fof(f211,plain,
    ! [X2,X3,X1] :
      ( memberP(app(X2,cons(X1,X3)),X1)
      | ~ ssList(X2)
      | ~ ssList(X3)
      | ~ ssItem(X1)
      | ~ ssList(app(X2,cons(X1,X3))) ),
    inference(equality_resolution,[],[f189]) ).

fof(f219,plain,
    ! [X6,X7,X4,X5] :
      ( app(app(X5,cons(X4,nil)),X6) != sK0
      | ~ ssItem(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | ~ ssItem(X7)
      | leq(X7,X4)
      | ~ memberP(X5,X7) ),
    inference(forward_demodulation,[],[f151,f153]) ).

fof(f225,plain,
    ! [X2,X3,X0,X1] :
      ( sK0 != app(X0,app(cons(X1,nil),X2))
      | ~ ssItem(X1)
      | ~ ssList(X0)
      | ~ ssList(X2)
      | ~ ssItem(X3)
      | leq(X3,X1)
      | ~ memberP(X0,X3)
      | ~ ssList(X2)
      | ~ ssList(cons(X1,nil))
      | ~ ssList(X0) ),
    inference(superposition,[],[f219,f171]) ).

fof(f227,plain,
    ! [X2,X3,X0,X1] :
      ( sK0 != app(X0,app(cons(X1,nil),X2))
      | ~ ssItem(X1)
      | ~ ssList(X0)
      | ~ ssList(X2)
      | ~ ssItem(X3)
      | leq(X3,X1)
      | ~ memberP(X0,X3)
      | ~ ssList(cons(X1,nil)) ),
    inference(duplicate_literal_removal,[],[f225]) ).

fof(f265,plain,
    ! [X2,X3,X0,X1] :
      ( sK0 != app(X2,cons(X0,X1))
      | ~ ssItem(X0)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssItem(X3)
      | leq(X3,X0)
      | ~ memberP(X2,X3)
      | ~ ssList(cons(X0,nil))
      | ~ ssItem(X0)
      | ~ ssList(X1) ),
    inference(superposition,[],[f227,f172]) ).

fof(f274,plain,
    ! [X2,X3,X0,X1] :
      ( sK0 != app(X2,cons(X0,X1))
      | ~ ssItem(X0)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssItem(X3)
      | leq(X3,X0)
      | ~ memberP(X2,X3)
      | ~ ssList(cons(X0,nil)) ),
    inference(duplicate_literal_removal,[],[f265]) ).

fof(f444,plain,
    ! [X0,X1] :
      ( sK0 != X0
      | ~ ssItem(sK11(X0))
      | ~ ssList(app(sK12(X0),cons(sK10(X0),sK13(X0))))
      | ~ ssList(sK14(X0))
      | ~ ssItem(X1)
      | leq(X1,sK11(X0))
      | ~ memberP(app(sK12(X0),cons(sK10(X0),sK13(X0))),X1)
      | ~ ssList(cons(sK11(X0),nil))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(superposition,[],[f274,f206]) ).

fof(f453,plain,
    ! [X0,X1] :
      ( sK0 != X0
      | ~ ssList(app(sK12(X0),cons(sK10(X0),sK13(X0))))
      | ~ ssList(sK14(X0))
      | ~ ssItem(X1)
      | leq(X1,sK11(X0))
      | ~ memberP(app(sK12(X0),cons(sK10(X0),sK13(X0))),X1)
      | ~ ssList(cons(sK11(X0),nil))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f444,f202]) ).

fof(f458,plain,
    ! [X0,X1] :
      ( sK0 != X0
      | ~ ssList(app(sK12(X0),cons(sK10(X0),sK13(X0))))
      | ~ ssItem(X1)
      | leq(X1,sK11(X0))
      | ~ memberP(app(sK12(X0),cons(sK10(X0),sK13(X0))),X1)
      | ~ ssList(cons(sK11(X0),nil))
      | totalorderedP(X0)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f453,f205]) ).

fof(f1422,definition,
    ( spl15_10
  <=> ssList(cons(sK11(sK0),nil)) ),
    introduced(definition,[new_symbols(definition,[spl15_10])],[avatar_definition]) ).

fof(f1423,plain,
    ( ~ ssList(cons(sK11(sK0),nil))
    | spl15_10 ),
    inference(avatar_component_clause,[],[f1422]) ).

fof(f1428,definition,
    ( spl15_12
  <=> ssList(app(sK12(sK0),cons(sK10(sK0),sK13(sK0)))) ),
    introduced(definition,[new_symbols(definition,[spl15_12])],[avatar_definition]) ).

fof(f1429,plain,
    ( ~ ssList(app(sK12(sK0),cons(sK10(sK0),sK13(sK0))))
    | spl15_12 ),
    inference(avatar_component_clause,[],[f1428]) ).

fof(f1431,plain,
    ( ~ ssItem(sK11(sK0))
    | ~ ssList(nil)
    | spl15_10 ),
    inference(resolution,[],[f1423,f166]) ).

fof(f1432,plain,
    ( ~ ssItem(sK11(sK0))
    | spl15_10 ),
    inference(forward_subsumption_resolution,[],[f1431,f178]) ).

fof(f1433,plain,
    ( totalorderedP(sK0)
    | ~ ssList(sK0)
    | spl15_10 ),
    inference(resolution,[],[f1432,f202]) ).

fof(f1434,plain,
    ( ~ ssList(sK0)
    | spl15_10 ),
    inference(forward_subsumption_resolution,[],[f1433,f150]) ).

fof(f1435,plain,
    ( $false
    | spl15_10 ),
    inference(forward_subsumption_resolution,[],[f1434,f147]) ).

fof(f1436,plain,
    spl15_10,
    inference(avatar_contradiction_clause,[],[f1435]) ).

fof(f1449,plain,
    ( ~ ssList(cons(sK10(sK0),sK13(sK0)))
    | ~ ssList(sK12(sK0))
    | spl15_12 ),
    inference(resolution,[],[f1429,f177]) ).

fof(f1451,definition,
    ( spl15_13
  <=> ssList(sK12(sK0)) ),
    introduced(definition,[new_symbols(definition,[spl15_13])],[avatar_definition]) ).

fof(f1452,plain,
    ( ~ ssList(sK12(sK0))
    | spl15_13 ),
    inference(avatar_component_clause,[],[f1451]) ).

fof(f1454,definition,
    ( spl15_14
  <=> ssList(cons(sK10(sK0),sK13(sK0))) ),
    introduced(definition,[new_symbols(definition,[spl15_14])],[avatar_definition]) ).

fof(f1455,plain,
    ( ~ ssList(cons(sK10(sK0),sK13(sK0)))
    | spl15_14 ),
    inference(avatar_component_clause,[],[f1454]) ).

fof(f1456,plain,
    ( ~ spl15_13
    | ~ spl15_14
    | spl15_12 ),
    inference(avatar_split_clause,[],[f1449,f1428,f1454,f1451]) ).

fof(f1475,plain,
    ( totalorderedP(sK0)
    | ~ ssList(sK0)
    | spl15_13 ),
    inference(resolution,[],[f1452,f203]) ).

fof(f1476,plain,
    ( ~ ssList(sK0)
    | spl15_13 ),
    inference(forward_subsumption_resolution,[],[f1475,f150]) ).

fof(f1477,plain,
    ( $false
    | spl15_13 ),
    inference(forward_subsumption_resolution,[],[f1476,f147]) ).

fof(f1478,plain,
    spl15_13,
    inference(avatar_contradiction_clause,[],[f1477]) ).

fof(f1479,plain,
    ( ~ ssItem(sK10(sK0))
    | ~ ssList(sK13(sK0))
    | spl15_14 ),
    inference(resolution,[],[f1455,f166]) ).

fof(f1481,definition,
    ( spl15_15
  <=> ssList(sK13(sK0)) ),
    introduced(definition,[new_symbols(definition,[spl15_15])],[avatar_definition]) ).

fof(f1482,plain,
    ( ~ ssList(sK13(sK0))
    | spl15_15 ),
    inference(avatar_component_clause,[],[f1481]) ).

fof(f1484,definition,
    ( spl15_16
  <=> ssItem(sK10(sK0)) ),
    introduced(definition,[new_symbols(definition,[spl15_16])],[avatar_definition]) ).

fof(f1485,plain,
    ( ~ ssItem(sK10(sK0))
    | spl15_16 ),
    inference(avatar_component_clause,[],[f1484]) ).

fof(f1486,plain,
    ( ~ spl15_15
    | ~ spl15_16
    | spl15_14 ),
    inference(avatar_split_clause,[],[f1479,f1454,f1484,f1481]) ).

fof(f1487,plain,
    ( totalorderedP(sK0)
    | ~ ssList(sK0)
    | spl15_15 ),
    inference(resolution,[],[f1482,f204]) ).

fof(f1488,plain,
    ( ~ ssList(sK0)
    | spl15_15 ),
    inference(forward_subsumption_resolution,[],[f1487,f150]) ).

fof(f1489,plain,
    ( $false
    | spl15_15 ),
    inference(forward_subsumption_resolution,[],[f1488,f147]) ).

fof(f1490,plain,
    spl15_15,
    inference(avatar_contradiction_clause,[],[f1489]) ).

fof(f1491,plain,
    ( totalorderedP(sK0)
    | ~ ssList(sK0)
    | spl15_16 ),
    inference(resolution,[],[f1485,f201]) ).

fof(f1492,plain,
    ( ~ ssList(sK0)
    | spl15_16 ),
    inference(forward_subsumption_resolution,[],[f1491,f150]) ).

fof(f1493,plain,
    ( $false
    | spl15_16 ),
    inference(forward_subsumption_resolution,[],[f1492,f147]) ).

fof(f1494,plain,
    spl15_16,
    inference(avatar_contradiction_clause,[],[f1493]) ).

fof(f2852,plain,
    ! [X0] :
      ( ~ ssList(app(sK12(sK0),cons(sK10(sK0),sK13(sK0))))
      | ~ ssItem(X0)
      | leq(X0,sK11(sK0))
      | ~ memberP(app(sK12(sK0),cons(sK10(sK0),sK13(sK0))),X0)
      | ~ ssList(cons(sK11(sK0),nil))
      | totalorderedP(sK0)
      | ~ ssList(sK0) ),
    inference(equality_resolution,[],[f458]) ).

fof(f2853,plain,
    ! [X0] :
      ( ~ ssList(app(sK12(sK0),cons(sK10(sK0),sK13(sK0))))
      | ~ ssItem(X0)
      | leq(X0,sK11(sK0))
      | ~ memberP(app(sK12(sK0),cons(sK10(sK0),sK13(sK0))),X0)
      | ~ ssList(cons(sK11(sK0),nil))
      | ~ ssList(sK0) ),
    inference(forward_subsumption_resolution,[],[f2852,f150]) ).

fof(f2854,plain,
    ! [X0] :
      ( ~ ssList(app(sK12(sK0),cons(sK10(sK0),sK13(sK0))))
      | ~ ssItem(X0)
      | leq(X0,sK11(sK0))
      | ~ memberP(app(sK12(sK0),cons(sK10(sK0),sK13(sK0))),X0)
      | ~ ssList(cons(sK11(sK0),nil)) ),
    inference(forward_subsumption_resolution,[],[f2853,f147]) ).

fof(f2856,definition,
    ( spl15_134
  <=> ! [X0] :
        ( ~ ssItem(X0)
        | ~ memberP(app(sK12(sK0),cons(sK10(sK0),sK13(sK0))),X0)
        | leq(X0,sK11(sK0)) ) ),
    introduced(definition,[new_symbols(definition,[spl15_134])],[avatar_definition]) ).

fof(f2857,plain,
    ( ! [X0] :
        ( ~ memberP(app(sK12(sK0),cons(sK10(sK0),sK13(sK0))),X0)
        | ~ ssItem(X0)
        | leq(X0,sK11(sK0)) )
    | ~ spl15_134 ),
    inference(avatar_component_clause,[],[f2856]) ).

fof(f2858,plain,
    ( ~ spl15_10
    | spl15_134
    | ~ spl15_12 ),
    inference(avatar_split_clause,[],[f2854,f1428,f2856,f1422]) ).

fof(f2861,plain,
    ( ~ ssItem(sK10(sK0))
    | leq(sK10(sK0),sK11(sK0))
    | ~ ssList(sK12(sK0))
    | ~ ssList(sK13(sK0))
    | ~ ssItem(sK10(sK0))
    | ~ ssList(app(sK12(sK0),cons(sK10(sK0),sK13(sK0))))
    | ~ spl15_134 ),
    inference(resolution,[],[f2857,f211]) ).

fof(f2862,plain,
    ( ~ ssItem(sK10(sK0))
    | leq(sK10(sK0),sK11(sK0))
    | ~ ssList(sK12(sK0))
    | ~ ssList(sK13(sK0))
    | ~ ssList(app(sK12(sK0),cons(sK10(sK0),sK13(sK0))))
    | ~ spl15_134 ),
    inference(duplicate_literal_removal,[],[f2861]) ).

fof(f2866,definition,
    ( spl15_135
  <=> leq(sK10(sK0),sK11(sK0)) ),
    introduced(definition,[new_symbols(definition,[spl15_135])],[avatar_definition]) ).

fof(f2867,plain,
    ( leq(sK10(sK0),sK11(sK0))
    | ~ spl15_135 ),
    inference(avatar_component_clause,[],[f2866]) ).

fof(f2868,plain,
    ( ~ spl15_12
    | ~ spl15_15
    | ~ spl15_13
    | spl15_135
    | ~ spl15_16
    | ~ spl15_134 ),
    inference(avatar_split_clause,[],[f2862,f2856,f1484,f2866,f1451,f1481,f1428]) ).

fof(f2877,plain,
    ( totalorderedP(sK0)
    | ~ ssList(sK0)
    | ~ spl15_135 ),
    inference(resolution,[],[f2867,f207]) ).

fof(f2906,plain,
    ( ~ ssList(sK0)
    | ~ spl15_135 ),
    inference(forward_subsumption_resolution,[],[f2877,f150]) ).

fof(f2907,plain,
    ( $false
    | ~ spl15_135 ),
    inference(forward_subsumption_resolution,[],[f2906,f147]) ).

fof(f2908,plain,
    ~ spl15_135,
    inference(avatar_contradiction_clause,[],[f2907]) ).

cnf(s11,plain,
    spl15_10,
    inference(sat_conversion,[],[f1436]) ).

cnf(s12,plain,
    ( spl15_12
    | ~ spl15_13
    | ~ spl15_14 ),
    inference(sat_conversion,[],[f1456]) ).

cnf(s13,plain,
    spl15_13,
    inference(sat_conversion,[],[f1478]) ).

cnf(s14,plain,
    ( spl15_14
    | ~ spl15_15
    | ~ spl15_16 ),
    inference(sat_conversion,[],[f1486]) ).

cnf(s15,plain,
    spl15_15,
    inference(sat_conversion,[],[f1490]) ).

cnf(s16,plain,
    spl15_16,
    inference(sat_conversion,[],[f1494]) ).

cnf(s139,plain,
    ( ~ spl15_10
    | ~ spl15_12
    | spl15_134 ),
    inference(sat_conversion,[],[f2858]) ).

cnf(s140,plain,
    ( ~ spl15_12
    | ~ spl15_13
    | ~ spl15_15
    | ~ spl15_16
    | ~ spl15_134
    | spl15_135 ),
    inference(sat_conversion,[],[f2868]) ).

cnf(s148,plain,
    ~ spl15_135,
    inference(sat_conversion,[],[f2908]) ).

cnf(s149,plain,
    ( ~ spl15_12
    | ~ spl15_13
    | ~ spl15_15
    | ~ spl15_16
    | ~ spl15_134 ),
    inference(rat,[],[s140,s148]) ).

cnf(s154,plain,
    spl15_14,
    inference(rat,[],[s14,s16,s15]) ).

cnf(s155,plain,
    spl15_12,
    inference(rat,[],[s12,s154,s13]) ).

cnf(s156,plain,
    ~ spl15_134,
    inference(rat,[],[s149,s13,s16,s15,s155]) ).

cnf(s157,plain,
    ~ spl15_10,
    inference(rat,[],[s139,s156,s155]) ).

cnf(s158,plain,
    $false,
    inference(rat,[],[s11,s157]) ).

fof(f2909,plain,
    $false,
    inference(avatar_sat_refutation,[],[s158]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC263+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.07/0.19  % Computer : n014.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Mon Sep 28 08:45:46 UTC 2026
% 0.07/0.20  % CPUTime  : 
% 0.07/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23  Running first-order theorem proving
% 0.07/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
% 6.00/1.68  % (1638701)Detected formulas, will run a generic FOF schedule.
% 6.00/1.68  % (1638708)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=335571590:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.00/1.68  % (1638709)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2597346960:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.00/1.68  % (1638711)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2610192732:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.00/1.68  % (1638710)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4268029547:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.00/1.68  % (1638707)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=3603952793:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.00/1.68  % (1638706)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=2070644692:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.00/1.68  % (1638712)dis-21_1_sil=8000:lcm=predicate:random_seed=3000727505: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.00/1.68  % (1638709)Instruction limit reached! 
% 6.00/1.68  % (1638709)------------------------------
% 6.00/1.68  % (1638709)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.00/1.68  % (1638709)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.00/1.68  % (1638709)CaDiCaL version: 2.1.3
% 6.00/1.68  % (1638709)Termination reason: Instruction limit
% 6.00/1.68  % (1638709)Termination phase: Saturation
% 6.00/1.68  % (1638709)Time elapsed: 0.068 s
% 6.00/1.68  % (1638709)Peak memory usage: 89 MB
% 6.00/1.68  % (1638709)Instructions burned: 110 (million)
% 6.00/1.68  % (1638710)Instruction limit reached! 
% 6.00/1.68  % (1638710)------------------------------
% 6.00/1.68  % (1638710)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.00/1.68  % (1638710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.00/1.68  % (1638710)CaDiCaL version: 2.1.3
% 6.00/1.68  % (1638710)Termination reason: Instruction limit
% 6.00/1.68  % (1638710)Termination phase: Saturation
% 6.00/1.68  % (1638710)Time elapsed: 0.069 s
% 6.00/1.68  % (1638710)Peak memory usage: 88 MB
% 6.00/1.68  % (1638710)Instructions burned: 119 (million)
% 6.00/1.68  % (1638712)Instruction limit reached! 
% 6.00/1.68  % (1638712)------------------------------
% 6.00/1.68  % (1638712)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.00/1.68  % (1638712)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.00/1.68  % (1638712)CaDiCaL version: 2.1.3
% 6.00/1.68  % (1638712)Termination reason: Instruction limit
% 6.00/1.68  % (1638712)Termination phase: Saturation
% 6.00/1.68  % (1638712)Time elapsed: 0.068 s
% 6.00/1.68  % (1638712)Peak memory usage: 91 MB
% 6.00/1.68  % (1638712)Instructions burned: 129 (million)
% 6.00/1.68  % (1638711)Instruction limit reached! 
% 6.00/1.68  % (1638711)------------------------------
% 6.00/1.68  % (1638711)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.00/1.68  % (1638711)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.00/1.68  % (1638711)CaDiCaL version: 2.1.3
% 6.00/1.68  % (1638711)Termination reason: Instruction limit
% 6.00/1.68  % (1638711)Termination phase: Saturation
% 6.00/1.68  % (1638711)Time elapsed: 0.094 s
% 6.00/1.68  % (1638711)Peak memory usage: 90 MB
% 6.00/1.68  % (1638711)Instructions burned: 140 (million)
% 6.00/1.68  % (1638720)lrs+10_1_sil=8000:sp=occurrence:random_seed=3766947654:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 6.00/1.68  % (1638721)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2081241512:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 6.00/1.68  % (1638722)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3172319738:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 6.00/1.68  % (1638723)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=4198470600:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 6.00/1.68  % (1638721)Instruction limit reached! 
% 6.00/1.68  % (1638721)------------------------------
% 6.00/1.68  % (1638721)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.00/1.68  % (1638721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.00/1.68  % (1638721)CaDiCaL version: 2.1.3
% 6.00/1.68  % (1638721)Termination reason: Instruction limit
% 6.00/1.68  % (1638721)Termination phase: Saturation
% 6.00/1.68  % (1638721)Time elapsed: 0.076 s
% 6.00/1.68  % (1638721)Peak memory usage: 91 MB
% 6.00/1.68  % (1638721)Instructions burned: 158 (million)
% 6.00/1.68  % (1638723)Instruction limit reached! 
% 6.00/1.68  % (1638723)------------------------------
% 6.00/1.68  % (1638723)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.00/1.68  % (1638723)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.00/1.68  % (1638723)CaDiCaL version: 2.1.3
% 6.00/1.68  % (1638723)Termination reason: Instruction limit
% 6.00/1.68  % (1638723)Termination phase: Saturation
% 6.00/1.68  % (1638723)Time elapsed: 0.118 s
% 6.00/1.68  % (1638723)Peak memory usage: 94 MB
% 6.00/1.68  % (1638723)Instructions burned: 249 (million)
% 6.00/1.68  % (1638720)Instruction limit reached! 
% 6.00/1.68  % (1638720)------------------------------
% 6.00/1.68  % (1638720)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.00/1.68  % (1638720)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.00/1.68  % (1638720)CaDiCaL version: 2.1.3
% 6.00/1.68  % (1638720)Termination reason: Instruction limit
% 6.00/1.68  % (1638720)Termination phase: Saturation
% 6.00/1.68  % (1638720)Time elapsed: 0.163 s
% 6.00/1.68  % (1638720)Peak memory usage: 93 MB
% 6.00/1.68  % (1638720)Instructions burned: 285 (million)
% 6.00/1.68  % (1638728)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1345665686:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 6.00/1.68  % (1638722)Instruction limit reached! 
% 6.00/1.68  % (1638722)------------------------------
% 6.00/1.68  % (1638722)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.00/1.68  % (1638722)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.00/1.68  % (1638722)CaDiCaL version: 2.1.3
% 6.00/1.68  % (1638722)Termination reason: Instruction limit
% 6.00/1.68  % (1638722)Termination phase: Saturation
% 6.00/1.68  % (1638722)Time elapsed: 0.204 s
% 6.00/1.68  % (1638722)Peak memory usage: 92 MB
% 6.00/1.68  % (1638722)Instructions burned: 326 (million)
% 6.00/1.68  % (1638728)Instruction limit reached! 
% 6.00/1.68  % (1638728)------------------------------
% 6.00/1.68  % (1638728)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.00/1.68  % (1638728)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.00/1.68  % (1638728)CaDiCaL version: 2.1.3
% 6.00/1.68  % (1638728)Termination reason: Instruction limit
% 6.00/1.68  % (1638728)Termination phase: Saturation
% 6.00/1.68  % (1638728)Time elapsed: 0.088 s
% 6.00/1.68  % (1638728)Peak memory usage: 89 MB
% 6.00/1.68  % (1638728)Instructions burned: 297 (million)
% 6.00/1.68  % (1638729)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1740659353:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 6.00/1.68  % (1638731)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=62229550:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 6.00/1.68  % (1638733)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=4051243083:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2994 on theBenchmark for (2994ds/114Mi)
% 6.00/1.68  % (1638732)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=816139792:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 6.00/1.68  % (1638731)Instruction limit reached! 
% 6.00/1.68  % (1638731)------------------------------
% 6.00/1.68  % (1638731)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.00/1.68  % (1638731)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.00/1.68  % (1638731)CaDiCaL version: 2.1.3
% 6.00/1.68  % (1638731)Termination reason: Instruction limit
% 6.00/1.68  % (1638731)Termination phase: Saturation
% 6.00/1.68  % (1638731)Time elapsed: 0.073 s
% 6.00/1.68  % (1638731)Peak memory usage: 90 MB
% 6.00/1.68  % (1638731)Instructions burned: 113 (million)
% 6.00/1.68  % (1638733)Instruction limit reached! 
% 6.00/1.68  % (1638733)------------------------------
% 6.00/1.68  % (1638733)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.00/1.68  % (1638733)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.00/1.68  % (1638733)CaDiCaL version: 2.1.3
% 6.00/1.68  % (1638733)Termination reason: Instruction limit
% 6.00/1.68  % (1638733)Termination phase: Saturation
% 6.00/1.68  % (1638733)Time elapsed: 0.036 s
% 6.00/1.68  % (1638733)Peak memory usage: 89 MB
% 6.00/1.68  % (1638733)Instructions burned: 117 (million)
% 6.00/1.68  % (1638732)Instruction limit reached! 
% 6.00/1.68  % (1638732)------------------------------
% 6.00/1.68  % (1638732)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.00/1.68  % (1638732)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.00/1.68  % (1638732)CaDiCaL version: 2.1.3
% 6.00/1.68  % (1638732)Termination reason: Instruction limit
% 6.00/1.68  % (1638732)Termination phase: Saturation
% 6.00/1.68  % (1638732)Time elapsed: 0.064 s
% 6.00/1.68  % (1638732)Peak memory usage: 90 MB
% 6.00/1.68  % (1638732)Instructions burned: 127 (million)
% 6.00/1.68  % (1638739)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=1877038273:i=437:sd=1:aac=none:ss=included_2992 on theBenchmark for (2992ds/437Mi)
% 6.00/1.68  % (1638738)lrs+10_1_sil=8000:sp=occurrence:random_seed=2873037736:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2992 on theBenchmark for (2992ds/907Mi)
% 6.00/1.68  % (1638739)First to succeed.
% 6.00/1.68  % (1638739)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1638701"
% 6.00/1.68  % (1638740)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=1520981350:i=5202:ss=axioms:sgt=16_2992 on theBenchmark for (2992ds/5202Mi)
% 6.00/1.68  % (1638706)Also succeeded, but the first one will report.
% 6.00/1.68  % (1638739)Refutation found. Thanks to Tanya!
% 6.00/1.68  % SZS status Theorem for theBenchmark
% 6.00/1.68  % SZS output start Proof for theBenchmark
% See solution above
% 7.73/1.87  % (1638739)------------------------------
% 7.73/1.87  % (1638739)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.73/1.87  % (1638739)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.73/1.87  % (1638739)CaDiCaL version: 2.1.3
% 7.73/1.87  % (1638739)Termination reason: Refutation
% 7.73/1.87  % (1638739)Time elapsed: 0.050 s
% 7.73/1.87  % (1638739)Peak memory usage: 91 MB
% 7.73/1.87  % (1638739)Instructions burned: 162 (million)
% 7.73/1.87  % (1638739)------------------------------
% 7.73/1.87  % (1638739)------------------------------
% 7.73/1.87  % (1638701)Success in time 1.014 s
% 7.73/1.87  % Vampire exiting
%------------------------------------------------------------------------------