↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 7.79s 1.80s
% Output   : Refutation 7.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   41
%            Number of leaves      :   15
% Syntax   : Number of formulae    :  139 (  19 unt;   5 def)
%            Number of atoms       :  721 (  52 equ)
%            Maximal formula atoms :   19 (   5 avg)
%            Number of connectives : 1040 ( 458   ~; 447   |;  87   &)
%                                         (  12 <=>;  36  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   7 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :   15 (  13 usr;   6 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   8 con; 0-2 aty)
%            Number of variables   :  265 (   0 sgn 231   !;  34   ?)

% 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(f12,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( strictorderedP(X0)
      <=> ! [X1] :
            ( ssItem(X1)
           => ! [X2] :
                ( ssItem(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ! [X4] :
                        ( ssList(X4)
                       => ! [X5] :
                            ( ssList(X5)
                           => ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                             => lt(X1,X2) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax12) ).

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

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(f90,axiom,
    ! [X0] :
      ( ssItem(X0)
     => ~ lt(X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax90) ).

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

fof(f98,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & frontsegP(X3,X2)
                  & strictorderedP(X2)
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ~ neq(X2,X4)
                      | ~ frontsegP(X3,X4)
                      | ~ segmentP(X4,X2)
                      | ~ strictorderedP(X4) )
                  & ? [X5] :
                      ( ? [X6] :
                          ( ? [X7] :
                              ( app(app(X6,cons(X5,nil)),X7) = X0
                              & ( memberP(X6,X5)
                                | memberP(X7,X5) )
                              & ssList(X7) )
                          & ssList(X6) )
                      & ssItem(X5) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( X1 = X3
                  & X0 = X2
                  & frontsegP(X3,X2)
                  & strictorderedP(X2)
                  & ! [X4] :
                      ( ~ ssList(X4)
                      | ~ neq(X2,X4)
                      | ~ frontsegP(X3,X4)
                      | ~ segmentP(X4,X2)
                      | ~ strictorderedP(X4) )
                  & ? [X5] :
                      ( ? [X6] :
                          ( ? [X7] :
                              ( app(app(X6,cons(X5,nil)),X7) = X0
                              & ( memberP(X6,X5)
                                | memberP(X7,X5) )
                              & ssList(X7) )
                          & ssList(X6) )
                      & ssItem(X5) )
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f98]) ).

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

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

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

fof(f122,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( memberP(app(X1,X2),X0)
              <=> ( memberP(X1,X0)
                  | memberP(X2,X0) ) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f36]) ).

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

fof(f148,plain,
    ! [X0] :
      ( ( strictorderedP(X0)
      <=> ! [X1] :
            ( ! [X2] :
                ( ! [X3] :
                    ( ! [X4] :
                        ( ! [X5] :
                            ( lt(X1,X2)
                            | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                            | ~ ssList(X5) )
                        | ~ ssList(X4) )
                    | ~ ssList(X3) )
                | ~ ssItem(X2) )
            | ~ ssItem(X1) ) )
      | ~ ssList(X0) ),
    inference(flattening,[],[f147]) ).

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

fof(f215,plain,
    ( sK7 = sK9
    & sK6 = sK8
    & frontsegP(sK9,sK8)
    & strictorderedP(sK8)
    & ! [X4] :
        ( ~ ssList(X4)
        | ~ neq(sK8,X4)
        | ~ frontsegP(sK9,X4)
        | ~ segmentP(X4,sK8)
        | ~ strictorderedP(X4) )
    & sK6 = app(app(sK11,cons(sK10,nil)),sK12)
    & ( memberP(sK11,sK10)
      | memberP(sK12,sK10) )
    & ssList(sK12)
    & ssList(sK11)
    & ssItem(sK10)
    & ssList(sK9)
    & ssList(sK8)
    & ssList(sK7)
    & ssList(sK6) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11,sK12]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8),skolemize(X3,sK9),skolemize(X5,sK10),skolemize(X6,sK11),skolemize(X7,sK12)],[f99]) ).

fof(f224,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( ( memberP(app(X1,X2),X0)
                  | ( ~ memberP(X1,X0)
                    & ~ memberP(X2,X0) ) )
                & ( memberP(X1,X0)
                  | memberP(X2,X0)
                  | ~ memberP(app(X1,X2),X0) ) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssItem(X0) ),
    inference(nnf_transformation,[],[f122]) ).

fof(f225,plain,
    ! [X0] :
      ( ! [X1] :
          ( ! [X2] :
              ( ( ( memberP(app(X1,X2),X0)
                  | ( ~ memberP(X1,X0)
                    & ~ memberP(X2,X0) ) )
                & ( memberP(X1,X0)
                  | memberP(X2,X0)
                  | ~ memberP(app(X1,X2),X0) ) )
              | ~ ssList(X2) )
          | ~ ssList(X1) )
      | ~ ssItem(X0) ),
    inference(flattening,[],[f224]) ).

fof(f226,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,[],[f123]) ).

fof(f227,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,[],[f226]) ).

fof(f228,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( memberP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(X2,cons(X1,X3)) != X0 ) ) )
            & ( ( ssList(sK17(X0,X1))
                & ssList(sK18(X0,X1))
                & app(sK17(X0,X1),cons(X1,sK18(X0,X1))) = X0 )
              | ~ memberP(X0,X1) ) )
          | ~ ssItem(X1) )
      | ~ ssList(X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK17,sK18]),skolemize(X4,sK17(X0,X1)),skolemize(X5,sK18(X0,X1))],[f227]) ).

fof(f241,plain,
    ! [X0] :
      ( ( ( strictorderedP(X0)
          | ? [X1] :
              ( ? [X2] :
                  ( ? [X3] :
                      ( ? [X4] :
                          ( ? [X5] :
                              ( ~ lt(X1,X2)
                              & app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
                              & ssList(X5) )
                          & ssList(X4) )
                      & ssList(X3) )
                  & ssItem(X2) )
              & ssItem(X1) ) )
        & ( ! [X1] :
              ( ! [X2] :
                  ( ! [X3] :
                      ( ! [X4] :
                          ( ! [X5] :
                              ( lt(X1,X2)
                              | app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
                              | ~ ssList(X5) )
                          | ~ ssList(X4) )
                      | ~ ssList(X3) )
                  | ~ ssItem(X2) )
              | ~ ssItem(X1) )
          | ~ strictorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f148]) ).

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

fof(f243,plain,
    ! [X0] :
      ( ( ( strictorderedP(X0)
          | ( ~ lt(sK22(X0),sK23(X0))
            & app(app(sK24(X0),cons(sK22(X0),sK25(X0))),cons(sK23(X0),sK26(X0))) = X0
            & ssList(sK26(X0))
            & ssList(sK25(X0))
            & ssList(sK24(X0))
            & ssItem(sK23(X0))
            & ssItem(sK22(X0)) ) )
        & ( ! [X6] :
              ( ! [X7] :
                  ( ! [X8] :
                      ( ! [X9] :
                          ( ! [X10] :
                              ( lt(X6,X7)
                              | app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
                              | ~ ssList(X10) )
                          | ~ ssList(X9) )
                      | ~ ssList(X8) )
                  | ~ ssItem(X7) )
              | ~ ssItem(X6) )
          | ~ strictorderedP(X0) ) )
      | ~ ssList(X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK22,sK23,sK24,sK25,sK26]),skolemize(X1,sK22(X0)),skolemize(X2,sK23(X0)),skolemize(X3,sK24(X0)),skolemize(X4,sK25(X0)),skolemize(X5,sK26(X0))],[f242]) ).

fof(f267,plain,
    ssList(sK6),
    inference(cnf_transformation,[],[f215]) ).

fof(f271,plain,
    ssItem(sK10),
    inference(cnf_transformation,[],[f215]) ).

fof(f272,plain,
    ssList(sK11),
    inference(cnf_transformation,[],[f215]) ).

fof(f273,plain,
    ssList(sK12),
    inference(cnf_transformation,[],[f215]) ).

fof(f274,plain,
    ( memberP(sK11,sK10)
    | memberP(sK12,sK10) ),
    inference(cnf_transformation,[],[f215]) ).

fof(f275,plain,
    sK6 = app(app(sK11,cons(sK10,nil)),sK12),
    inference(cnf_transformation,[],[f215]) ).

fof(f277,plain,
    strictorderedP(sK8),
    inference(cnf_transformation,[],[f215]) ).

fof(f279,plain,
    sK6 = sK8,
    inference(cnf_transformation,[],[f215]) ).

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

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

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

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

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

fof(f314,plain,
    ! [X2,X0,X1] :
      ( memberP(app(X1,X2),X0)
      | ~ memberP(X1,X0)
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f225]) ).

fof(f315,plain,
    ! [X0,X1] :
      ( app(sK17(X0,X1),cons(X1,sK18(X0,X1))) = X0
      | ~ memberP(X0,X1)
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f228]) ).

fof(f316,plain,
    ! [X0,X1] :
      ( ssList(sK18(X0,X1))
      | ~ memberP(X0,X1)
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f228]) ).

fof(f317,plain,
    ! [X0,X1] :
      ( ssList(sK17(X0,X1))
      | ~ memberP(X0,X1)
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f228]) ).

fof(f318,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,[],[f228]) ).

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

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

fof(f447,plain,
    sK8 = app(app(sK11,cons(sK10,nil)),sK12),
    inference(definition_unfolding,[],[f275,f279]) ).

fof(f449,plain,
    ssList(sK8),
    inference(definition_unfolding,[],[f267,f279]) ).

fof(f455,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,[],[f318]) ).

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

fof(f478,definition,
    ( spl49_1
  <=> memberP(sK12,sK10) ),
    introduced(definition,[new_symbols(definition,[spl49_1])],[avatar_definition]) ).

fof(f480,plain,
    ( memberP(sK12,sK10)
    | ~ spl49_1 ),
    inference(avatar_component_clause,[],[f478]) ).

fof(f482,definition,
    ( spl49_2
  <=> memberP(sK11,sK10) ),
    introduced(definition,[new_symbols(definition,[spl49_2])],[avatar_definition]) ).

fof(f484,plain,
    ( memberP(sK11,sK10)
    | ~ spl49_2 ),
    inference(avatar_component_clause,[],[f482]) ).

fof(f485,plain,
    ( spl49_1
    | spl49_2 ),
    inference(avatar_split_clause,[],[f274,f482,f478]) ).

fof(f489,plain,
    ( sK8 = app(sK11,app(cons(sK10,nil),sK12))
    | ~ ssList(sK12)
    | ~ ssList(cons(sK10,nil))
    | ~ ssList(sK11) ),
    inference(superposition,[],[f296,f447]) ).

fof(f492,plain,
    ! [X2,X0,X1] :
      ( ssList(app(X0,app(X1,X2)))
      | ~ ssList(X2)
      | ~ ssList(app(X0,X1))
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(superposition,[],[f302,f296]) ).

fof(f494,plain,
    ! [X2,X0,X1] :
      ( ssList(app(X0,app(X1,X2)))
      | ~ ssList(X2)
      | ~ ssList(app(X0,X1))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(duplicate_literal_removal,[],[f492]) ).

fof(f498,plain,
    ! [X2,X0,X1] :
      ( ssList(app(X0,app(X1,X2)))
      | ~ ssList(X2)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f494,f302]) ).

fof(f501,plain,
    ( sK8 = app(sK11,app(cons(sK10,nil),sK12))
    | ~ ssList(cons(sK10,nil))
    | ~ ssList(sK11) ),
    inference(forward_subsumption_resolution,[],[f489,f273]) ).

fof(f507,plain,
    ( sK8 = app(sK11,app(cons(sK10,nil),sK12))
    | ~ ssList(cons(sK10,nil)) ),
    inference(forward_subsumption_resolution,[],[f501,f272]) ).

fof(f509,definition,
    ( spl49_3
  <=> ssList(app(sK11,cons(sK10,nil))) ),
    introduced(definition,[new_symbols(definition,[spl49_3])],[avatar_definition]) ).

fof(f510,plain,
    ( ssList(app(sK11,cons(sK10,nil)))
    | ~ spl49_3 ),
    inference(avatar_component_clause,[],[f509]) ).

fof(f511,plain,
    ( ~ ssList(app(sK11,cons(sK10,nil)))
    | spl49_3 ),
    inference(avatar_component_clause,[],[f509]) ).

fof(f517,definition,
    ( spl49_5
  <=> ssList(cons(sK10,nil)) ),
    introduced(definition,[new_symbols(definition,[spl49_5])],[avatar_definition]) ).

fof(f518,plain,
    ( ssList(cons(sK10,nil))
    | ~ spl49_5 ),
    inference(avatar_component_clause,[],[f517]) ).

fof(f519,plain,
    ( ~ ssList(cons(sK10,nil))
    | spl49_5 ),
    inference(avatar_component_clause,[],[f517]) ).

fof(f521,definition,
    ( spl49_6
  <=> sK8 = app(sK11,app(cons(sK10,nil),sK12)) ),
    introduced(definition,[new_symbols(definition,[spl49_6])],[avatar_definition]) ).

fof(f523,plain,
    ( sK8 = app(sK11,app(cons(sK10,nil),sK12))
    | ~ spl49_6 ),
    inference(avatar_component_clause,[],[f521]) ).

fof(f525,plain,
    ( ~ spl49_5
    | spl49_6 ),
    inference(avatar_split_clause,[],[f507,f521,f517]) ).

fof(f526,plain,
    ( ~ ssList(cons(sK10,nil))
    | ~ ssList(sK11)
    | spl49_3 ),
    inference(resolution,[],[f511,f302]) ).

fof(f527,plain,
    ( ~ ssItem(sK10)
    | ~ ssList(nil)
    | spl49_5 ),
    inference(resolution,[],[f519,f291]) ).

fof(f528,plain,
    ( ~ ssList(nil)
    | spl49_5 ),
    inference(forward_subsumption_resolution,[],[f527,f271]) ).

fof(f529,plain,
    ( $false
    | spl49_5 ),
    inference(forward_subsumption_resolution,[],[f528,f307]) ).

fof(f530,plain,
    spl49_5,
    inference(avatar_contradiction_clause,[],[f529]) ).

fof(f531,plain,
    ( ~ ssList(sK11)
    | spl49_3
    | ~ spl49_5 ),
    inference(forward_subsumption_resolution,[],[f526,f518]) ).

fof(f532,plain,
    ( $false
    | spl49_3
    | ~ spl49_5 ),
    inference(forward_subsumption_resolution,[],[f531,f272]) ).

fof(f533,plain,
    ( spl49_3
    | ~ spl49_5 ),
    inference(avatar_contradiction_clause,[],[f532]) ).

fof(f549,plain,
    ( sK8 = app(sK11,cons(sK10,sK12))
    | ~ ssItem(sK10)
    | ~ ssList(sK12)
    | ~ spl49_6 ),
    inference(superposition,[],[f523,f297]) ).

fof(f556,plain,
    ( sK8 = app(sK11,cons(sK10,sK12))
    | ~ ssList(sK12)
    | ~ spl49_6 ),
    inference(forward_subsumption_resolution,[],[f549,f271]) ).

fof(f557,plain,
    ( sK8 = app(sK11,cons(sK10,sK12))
    | ~ spl49_6 ),
    inference(forward_subsumption_resolution,[],[f556,f273]) ).

fof(f604,plain,
    ! [X2,X3,X0,X1] :
      ( ~ strictorderedP(app(X0,cons(X2,X3)))
      | ~ ssList(X3)
      | ~ ssList(sK18(X0,X1))
      | ~ ssList(sK17(X0,X1))
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | lt(X1,X2)
      | ~ ssList(app(X0,cons(X2,X3)))
      | ~ memberP(X0,X1)
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(superposition,[],[f463,f315]) ).

fof(f607,plain,
    ! [X2,X3,X0,X1] :
      ( ~ strictorderedP(app(X0,cons(X2,X3)))
      | ~ ssList(X3)
      | ~ ssList(sK18(X0,X1))
      | ~ ssList(sK17(X0,X1))
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | lt(X1,X2)
      | ~ ssList(app(X0,cons(X2,X3)))
      | ~ memberP(X0,X1)
      | ~ ssList(X0) ),
    inference(duplicate_literal_removal,[],[f604]) ).

fof(f609,plain,
    ! [X2,X3,X0,X1] :
      ( ~ strictorderedP(app(X0,cons(X2,X3)))
      | ~ ssList(X3)
      | ~ ssList(sK17(X0,X1))
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | lt(X1,X2)
      | ~ ssList(app(X0,cons(X2,X3)))
      | ~ memberP(X0,X1)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f607,f316]) ).

fof(f610,plain,
    ! [X2,X3,X0,X1] :
      ( ~ strictorderedP(app(X0,cons(X2,X3)))
      | ~ ssList(X3)
      | ~ ssItem(X2)
      | ~ ssItem(X1)
      | lt(X1,X2)
      | ~ ssList(app(X0,cons(X2,X3)))
      | ~ memberP(X0,X1)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f609,f317]) ).

fof(f612,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ strictorderedP(app(X0,app(X1,cons(X2,X3))))
      | ~ ssList(X3)
      | ~ ssItem(X2)
      | ~ ssItem(X4)
      | lt(X4,X2)
      | ~ ssList(app(X0,app(X1,cons(X2,X3))))
      | ~ memberP(app(X0,X1),X4)
      | ~ ssList(app(X0,X1))
      | ~ ssList(cons(X2,X3))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(superposition,[],[f610,f296]) ).

fof(f613,plain,
    ( ! [X0] :
        ( ~ strictorderedP(sK8)
        | ~ ssList(sK12)
        | ~ ssItem(sK10)
        | ~ ssItem(X0)
        | lt(X0,sK10)
        | ~ ssList(sK8)
        | ~ memberP(sK11,X0)
        | ~ ssList(sK11) )
    | ~ spl49_6 ),
    inference(superposition,[],[f610,f557]) ).

fof(f617,plain,
    ( ! [X0] :
        ( ~ ssList(sK12)
        | ~ ssItem(sK10)
        | ~ ssItem(X0)
        | lt(X0,sK10)
        | ~ ssList(sK8)
        | ~ memberP(sK11,X0)
        | ~ ssList(sK11) )
    | ~ spl49_6 ),
    inference(forward_subsumption_resolution,[],[f613,f277]) ).

fof(f618,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ strictorderedP(app(X0,app(X1,cons(X2,X3))))
      | ~ ssList(X3)
      | ~ ssItem(X2)
      | ~ ssItem(X4)
      | lt(X4,X2)
      | ~ ssList(app(X0,app(X1,cons(X2,X3))))
      | ~ memberP(app(X0,X1),X4)
      | ~ ssList(cons(X2,X3))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f612,f302]) ).

fof(f621,plain,
    ( ! [X0] :
        ( ~ ssItem(sK10)
        | ~ ssItem(X0)
        | lt(X0,sK10)
        | ~ ssList(sK8)
        | ~ memberP(sK11,X0)
        | ~ ssList(sK11) )
    | ~ spl49_6 ),
    inference(forward_subsumption_resolution,[],[f617,f273]) ).

fof(f622,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ strictorderedP(app(X0,app(X1,cons(X2,X3))))
      | ~ ssList(X3)
      | ~ ssItem(X2)
      | ~ ssItem(X4)
      | lt(X4,X2)
      | ~ memberP(app(X0,X1),X4)
      | ~ ssList(cons(X2,X3))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f618,f498]) ).

fof(f623,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | lt(X0,sK10)
        | ~ ssList(sK8)
        | ~ memberP(sK11,X0)
        | ~ ssList(sK11) )
    | ~ spl49_6 ),
    inference(forward_subsumption_resolution,[],[f621,f271]) ).

fof(f624,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ strictorderedP(app(X0,app(X1,cons(X2,X3))))
      | ~ ssList(X3)
      | ~ ssItem(X2)
      | ~ ssItem(X4)
      | lt(X4,X2)
      | ~ memberP(app(X0,X1),X4)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f622,f291]) ).

fof(f625,plain,
    ( ! [X0] :
        ( ~ ssItem(X0)
        | lt(X0,sK10)
        | ~ memberP(sK11,X0)
        | ~ ssList(sK11) )
    | ~ spl49_6 ),
    inference(forward_subsumption_resolution,[],[f623,f449]) ).

fof(f626,plain,
    ( ! [X0] :
        ( lt(X0,sK10)
        | ~ ssItem(X0)
        | ~ memberP(sK11,X0) )
    | ~ spl49_6 ),
    inference(forward_subsumption_resolution,[],[f625,f272]) ).

fof(f630,plain,
    ! [X2,X3,X0,X1] :
      ( ~ strictorderedP(app(X1,X0))
      | ~ ssList(sK18(X0,X2))
      | ~ ssItem(X2)
      | ~ ssItem(X3)
      | lt(X3,X2)
      | ~ memberP(app(X1,sK17(X0,X2)),X3)
      | ~ ssList(sK17(X0,X2))
      | ~ ssList(X1)
      | ~ memberP(X0,X2)
      | ~ ssItem(X2)
      | ~ ssList(X0) ),
    inference(superposition,[],[f624,f315]) ).

fof(f634,plain,
    ! [X2,X3,X0,X1] :
      ( ~ strictorderedP(app(X1,X0))
      | ~ ssList(sK18(X0,X2))
      | ~ ssItem(X2)
      | ~ ssItem(X3)
      | lt(X3,X2)
      | ~ memberP(app(X1,sK17(X0,X2)),X3)
      | ~ ssList(sK17(X0,X2))
      | ~ ssList(X1)
      | ~ memberP(X0,X2)
      | ~ ssList(X0) ),
    inference(duplicate_literal_removal,[],[f630]) ).

fof(f637,plain,
    ! [X2,X3,X0,X1] :
      ( ~ strictorderedP(app(X1,X0))
      | ~ ssItem(X2)
      | ~ ssItem(X3)
      | lt(X3,X2)
      | ~ memberP(app(X1,sK17(X0,X2)),X3)
      | ~ ssList(sK17(X0,X2))
      | ~ ssList(X1)
      | ~ memberP(X0,X2)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f634,f316]) ).

fof(f642,plain,
    ! [X2,X3,X0,X1] :
      ( ~ memberP(app(X1,sK17(X0,X2)),X3)
      | ~ ssItem(X2)
      | ~ ssItem(X3)
      | lt(X3,X2)
      | ~ strictorderedP(app(X1,X0))
      | ~ ssList(X1)
      | ~ memberP(X0,X2)
      | ~ ssList(X0) ),
    inference(forward_subsumption_resolution,[],[f637,f317]) ).

fof(f648,plain,
    ( ~ ssItem(sK10)
    | ~ ssItem(sK10)
    | ~ memberP(sK11,sK10)
    | ~ spl49_6 ),
    inference(resolution,[],[f375,f626]) ).

fof(f649,plain,
    ( ~ ssItem(sK10)
    | ~ memberP(sK11,sK10)
    | ~ spl49_6 ),
    inference(duplicate_literal_removal,[],[f648]) ).

fof(f650,plain,
    ( ~ memberP(sK11,sK10)
    | ~ spl49_6 ),
    inference(forward_subsumption_resolution,[],[f649,f271]) ).

fof(f651,plain,
    ( $false
    | ~ spl49_2
    | ~ spl49_6 ),
    inference(forward_subsumption_resolution,[],[f650,f484]) ).

fof(f652,plain,
    ( ~ spl49_2
    | ~ spl49_6 ),
    inference(avatar_contradiction_clause,[],[f651]) ).

fof(f1332,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssItem(X1)
      | lt(X1,X0)
      | ~ strictorderedP(app(X2,X3))
      | ~ ssList(X2)
      | ~ memberP(X3,X0)
      | ~ ssList(X3)
      | ~ memberP(X2,X1)
      | ~ ssList(sK17(X3,X0))
      | ~ ssList(X2)
      | ~ ssItem(X1) ),
    inference(resolution,[],[f642,f314]) ).

fof(f1336,plain,
    ! [X2,X3,X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssItem(X1)
      | lt(X1,X0)
      | ~ strictorderedP(app(X2,X3))
      | ~ ssList(X2)
      | ~ memberP(X3,X0)
      | ~ ssList(X3)
      | ~ memberP(X2,X1)
      | ~ ssList(sK17(X3,X0)) ),
    inference(duplicate_literal_removal,[],[f1332]) ).

fof(f1341,plain,
    ! [X2,X3,X0,X1] :
      ( ~ strictorderedP(app(X2,X3))
      | ~ ssItem(X1)
      | lt(X1,X0)
      | ~ ssItem(X0)
      | ~ ssList(X2)
      | ~ memberP(X3,X0)
      | ~ ssList(X3)
      | ~ memberP(X2,X1) ),
    inference(forward_subsumption_resolution,[],[f1336,f317]) ).

fof(f1348,plain,
    ! [X0,X1] :
      ( ~ strictorderedP(sK8)
      | ~ ssItem(X0)
      | lt(X0,X1)
      | ~ ssItem(X1)
      | ~ ssList(app(sK11,cons(sK10,nil)))
      | ~ memberP(sK12,X1)
      | ~ ssList(sK12)
      | ~ memberP(app(sK11,cons(sK10,nil)),X0) ),
    inference(superposition,[],[f1341,f447]) ).

fof(f1374,plain,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | lt(X0,X1)
      | ~ ssItem(X1)
      | ~ ssList(app(sK11,cons(sK10,nil)))
      | ~ memberP(sK12,X1)
      | ~ ssList(sK12)
      | ~ memberP(app(sK11,cons(sK10,nil)),X0) ),
    inference(forward_subsumption_resolution,[],[f1348,f277]) ).

fof(f1378,plain,
    ( ! [X0,X1] :
        ( ~ ssItem(X0)
        | lt(X0,X1)
        | ~ ssItem(X1)
        | ~ memberP(sK12,X1)
        | ~ ssList(sK12)
        | ~ memberP(app(sK11,cons(sK10,nil)),X0) )
    | ~ spl49_3 ),
    inference(forward_subsumption_resolution,[],[f1374,f510]) ).

fof(f1381,plain,
    ( ! [X0,X1] :
        ( ~ memberP(app(sK11,cons(sK10,nil)),X0)
        | lt(X0,X1)
        | ~ ssItem(X1)
        | ~ memberP(sK12,X1)
        | ~ ssItem(X0) )
    | ~ spl49_3 ),
    inference(forward_subsumption_resolution,[],[f1378,f273]) ).

fof(f1382,plain,
    ( ! [X0] :
        ( lt(sK10,X0)
        | ~ ssItem(X0)
        | ~ memberP(sK12,X0)
        | ~ ssItem(sK10)
        | ~ ssList(sK11)
        | ~ ssList(nil)
        | ~ ssItem(sK10)
        | ~ ssList(app(sK11,cons(sK10,nil))) )
    | ~ spl49_3 ),
    inference(resolution,[],[f1381,f455]) ).

fof(f1387,plain,
    ( ! [X0] :
        ( lt(sK10,X0)
        | ~ ssItem(X0)
        | ~ memberP(sK12,X0)
        | ~ ssItem(sK10)
        | ~ ssList(sK11)
        | ~ ssList(nil)
        | ~ ssList(app(sK11,cons(sK10,nil))) )
    | ~ spl49_3 ),
    inference(duplicate_literal_removal,[],[f1382]) ).

fof(f1390,plain,
    ( ! [X0] :
        ( lt(sK10,X0)
        | ~ ssItem(X0)
        | ~ memberP(sK12,X0)
        | ~ ssList(sK11)
        | ~ ssList(nil)
        | ~ ssList(app(sK11,cons(sK10,nil))) )
    | ~ spl49_3 ),
    inference(forward_subsumption_resolution,[],[f1387,f271]) ).

fof(f1393,plain,
    ( ! [X0] :
        ( lt(sK10,X0)
        | ~ ssItem(X0)
        | ~ memberP(sK12,X0)
        | ~ ssList(nil)
        | ~ ssList(app(sK11,cons(sK10,nil))) )
    | ~ spl49_3 ),
    inference(forward_subsumption_resolution,[],[f1390,f272]) ).

fof(f1394,plain,
    ( ! [X0] :
        ( lt(sK10,X0)
        | ~ ssItem(X0)
        | ~ memberP(sK12,X0)
        | ~ ssList(app(sK11,cons(sK10,nil))) )
    | ~ spl49_3 ),
    inference(forward_subsumption_resolution,[],[f1393,f307]) ).

fof(f1395,plain,
    ( ! [X0] :
        ( lt(sK10,X0)
        | ~ ssItem(X0)
        | ~ memberP(sK12,X0) )
    | ~ spl49_3 ),
    inference(forward_subsumption_resolution,[],[f1394,f510]) ).

fof(f1406,plain,
    ( ~ ssItem(sK10)
    | ~ memberP(sK12,sK10)
    | ~ ssItem(sK10)
    | ~ spl49_3 ),
    inference(resolution,[],[f1395,f375]) ).

fof(f1411,plain,
    ( ~ ssItem(sK10)
    | ~ memberP(sK12,sK10)
    | ~ spl49_3 ),
    inference(duplicate_literal_removal,[],[f1406]) ).

fof(f1415,plain,
    ( ~ memberP(sK12,sK10)
    | ~ spl49_3 ),
    inference(forward_subsumption_resolution,[],[f1411,f271]) ).

fof(f1416,plain,
    ( $false
    | ~ spl49_1
    | ~ spl49_3 ),
    inference(forward_subsumption_resolution,[],[f1415,f480]) ).

fof(f1417,plain,
    ( ~ spl49_1
    | ~ spl49_3 ),
    inference(avatar_contradiction_clause,[],[f1416]) ).

cnf(s1,plain,
    ( spl49_1
    | spl49_2 ),
    inference(sat_conversion,[],[f485]) ).

cnf(s4,plain,
    ( ~ spl49_5
    | spl49_6 ),
    inference(sat_conversion,[],[f525]) ).

cnf(s5,plain,
    spl49_5,
    inference(sat_conversion,[],[f530]) ).

cnf(s6,plain,
    ( spl49_3
    | ~ spl49_5 ),
    inference(sat_conversion,[],[f533]) ).

cnf(s11,plain,
    ( ~ spl49_2
    | ~ spl49_6 ),
    inference(sat_conversion,[],[f652]) ).

cnf(s38,plain,
    ( ~ spl49_1
    | ~ spl49_3 ),
    inference(sat_conversion,[],[f1417]) ).

cnf(s43,plain,
    spl49_3,
    inference(rat,[],[s6,s5]) ).

cnf(s44,plain,
    ~ spl49_1,
    inference(rat,[],[s38,s43]) ).

cnf(s46,plain,
    spl49_6,
    inference(rat,[],[s4,s5]) ).

cnf(s47,plain,
    ~ spl49_2,
    inference(rat,[],[s11,s46]) ).

cnf(s52,plain,
    $false,
    inference(rat,[],[s1,s47,s44]) ).

fof(f1418,plain,
    $false,
    inference(avatar_sat_refutation,[],[s52]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SWC186+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.31  % Computer : n012.cluster.edu
% 0.04/0.31  % Model    : x86_64 x86_64
% 0.04/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31  % Memory   : 8046.5625MB
% 0.04/0.31  % OS       : Linux 6.8.0-71-generic
% 0.04/0.31  % CPULimit : 300
% 0.04/0.31  % WCLimit  : 300
% 0.04/0.31  % DateTime : Mon Sep 28 08:20:49 UTC 2026
% 0.04/0.31  % CPUTime  : 
% 0.04/0.31  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.33  Running first-order theorem proving
% 0.07/0.33  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.93/1.68  % (3232121)Detected formulas, will run a generic FOF schedule.
% 6.93/1.68  % (3232128)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=2140760123:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.93/1.68  % (3232126)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=2314726614:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.93/1.68  % (3232127)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=1580590003:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.93/1.68  % (3232129)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1237734104:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.93/1.68  % (3232131)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3656686786:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.93/1.68  % (3232130)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3251526350:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.93/1.68  % (3232132)dis-21_1_sil=8000:lcm=predicate:random_seed=3501479160: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.93/1.68  % (3232129)Instruction limit reached! 
% 6.93/1.68  % (3232129)------------------------------
% 6.93/1.68  % (3232129)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.93/1.68  % (3232129)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.68  % (3232129)CaDiCaL version: 2.1.3
% 6.93/1.68  % (3232129)Termination reason: Instruction limit
% 6.93/1.68  % (3232129)Termination phase: Saturation
% 6.93/1.68  % (3232129)Time elapsed: 0.040 s
% 6.93/1.68  % (3232129)Peak memory usage: 89 MB
% 6.93/1.68  % (3232129)Instructions burned: 111 (million)
% 6.93/1.68  % (3232130)Instruction limit reached! 
% 6.93/1.68  % (3232130)------------------------------
% 6.93/1.68  % (3232130)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.93/1.68  % (3232130)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.68  % (3232130)CaDiCaL version: 2.1.3
% 6.93/1.68  % (3232130)Termination reason: Instruction limit
% 6.93/1.68  % (3232130)Termination phase: Saturation
% 6.93/1.68  % (3232130)Time elapsed: 0.039 s
% 6.93/1.68  % (3232130)Peak memory usage: 88 MB
% 6.93/1.68  % (3232130)Instructions burned: 121 (million)
% 6.93/1.68  % (3232132)Instruction limit reached! 
% 6.93/1.68  % (3232132)------------------------------
% 6.93/1.68  % (3232132)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.93/1.68  % (3232132)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.68  % (3232132)CaDiCaL version: 2.1.3
% 6.93/1.68  % (3232132)Termination reason: Instruction limit
% 6.93/1.68  % (3232132)Termination phase: Saturation
% 6.93/1.68  % (3232132)Time elapsed: 0.039 s
% 6.93/1.68  % (3232132)Peak memory usage: 90 MB
% 6.93/1.68  % (3232132)Instructions burned: 132 (million)
% 6.93/1.68  % (3232131)Instruction limit reached! 
% 6.93/1.68  % (3232131)------------------------------
% 6.93/1.68  % (3232131)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.93/1.68  % (3232131)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.93/1.68  % (3232131)CaDiCaL version: 2.1.3
% 6.93/1.68  % (3232131)Termination reason: Instruction limit
% 6.93/1.68  % (3232131)Termination phase: Saturation
% 6.93/1.68  % (3232131)Time elapsed: 0.050 s
% 6.93/1.68  % (3232131)Peak memory usage: 90 MB
% 6.93/1.68  % (3232131)Instructions burned: 141 (million)
% 6.93/1.68  % (3232140)lrs+10_1_sil=8000:sp=occurrence:random_seed=4037297808:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 6.93/1.68  % (3232142)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3590213506:i=325:sd=1:ss=axioms:sgt=32_2998 on theBenchmark for (2998ds/325Mi)
% 6.93/1.68  % (3232141)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1263715335:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 6.93/1.68  % (3232143)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=3003024327:s2a=on:i=248:s2at=1.23:gtg=position_2998 on theBenchmark for (2998ds/248Mi)
% 6.93/1.68  % (3232141)Instruction limit reached! 
% 7.79/1.80  % (3232141)------------------------------
% 7.79/1.80  % (3232141)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.80  % (3232141)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.80  % (3232141)CaDiCaL version: 2.1.3
% 7.79/1.80  % (3232141)Termination reason: Instruction limit
% 7.79/1.80  % (3232141)Termination phase: Saturation
% 7.79/1.80  % (3232141)Time elapsed: 0.046 s
% 7.79/1.80  % (3232141)Peak memory usage: 94 MB
% 7.79/1.80  % (3232141)Instructions burned: 159 (million)
% 7.79/1.80  % (3232143)Instruction limit reached! 
% 7.79/1.80  % (3232143)------------------------------
% 7.79/1.80  % (3232143)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.80  % (3232143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.80  % (3232143)CaDiCaL version: 2.1.3
% 7.79/1.80  % (3232143)Termination reason: Instruction limit
% 7.79/1.80  % (3232143)Termination phase: Saturation
% 7.79/1.80  % (3232143)Time elapsed: 0.066 s
% 7.79/1.80  % (3232143)Peak memory usage: 94 MB
% 7.79/1.80  % (3232143)Instructions burned: 251 (million)
% 7.79/1.80  % (3232140)Instruction limit reached! 
% 7.79/1.80  % (3232140)------------------------------
% 7.79/1.80  % (3232140)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.80  % (3232140)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.80  % (3232140)CaDiCaL version: 2.1.3
% 7.79/1.80  % (3232140)Termination reason: Instruction limit
% 7.79/1.80  % (3232140)Termination phase: Saturation
% 7.79/1.80  % (3232140)Time elapsed: 0.092 s
% 7.79/1.80  % (3232140)Peak memory usage: 93 MB
% 7.79/1.80  % (3232140)Instructions burned: 285 (million)
% 7.79/1.80  % (3232142)Instruction limit reached! 
% 7.79/1.80  % (3232142)------------------------------
% 7.79/1.80  % (3232142)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.80  % (3232142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.80  % (3232142)CaDiCaL version: 2.1.3
% 7.79/1.80  % (3232142)Termination reason: Instruction limit
% 7.79/1.80  % (3232142)Termination phase: Saturation
% 7.79/1.80  % (3232142)Time elapsed: 0.108 s
% 7.79/1.80  % (3232142)Peak memory usage: 92 MB
% 7.79/1.80  % (3232142)Instructions burned: 326 (million)
% 7.79/1.80  % (3232148)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1420834254:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2997 on theBenchmark for (2997ds/294Mi)
% 7.79/1.80  % (3232149)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=468437789:i=2350_2996 on theBenchmark for (2996ds/2350Mi)
% 7.79/1.80  % (3232150)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2562738263:cts=off:i=113:fsr=off:ss=included:sgt=4_2996 on theBenchmark for (2996ds/113Mi)
% 7.79/1.80  % (3232151)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=3233723366:i=127:av=off:fsr=off:sup=off_2996 on theBenchmark for (2996ds/127Mi)
% 7.79/1.80  % (3232150)Instruction limit reached! 
% 7.79/1.80  % (3232150)------------------------------
% 7.79/1.80  % (3232150)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.80  % (3232150)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.80  % (3232150)CaDiCaL version: 2.1.3
% 7.79/1.80  % (3232150)Termination reason: Instruction limit
% 7.79/1.80  % (3232150)Termination phase: Saturation
% 7.79/1.80  % (3232150)Time elapsed: 0.039 s
% 7.79/1.80  % (3232150)Peak memory usage: 90 MB
% 7.79/1.80  % (3232150)Instructions burned: 116 (million)
% 7.79/1.80  % (3232148)Instruction limit reached! 
% 7.79/1.80  % (3232148)------------------------------
% 7.79/1.80  % (3232148)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.80  % (3232148)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.80  % (3232148)CaDiCaL version: 2.1.3
% 7.79/1.80  % (3232148)Termination reason: Instruction limit
% 7.79/1.80  % (3232148)Termination phase: Saturation
% 7.79/1.80  % (3232148)Time elapsed: 0.093 s
% 7.79/1.80  % (3232148)Peak memory usage: 90 MB
% 7.79/1.80  % (3232148)Instructions burned: 297 (million)
% 7.79/1.80  % (3232151)Instruction limit reached! 
% 7.79/1.80  % (3232151)------------------------------
% 7.79/1.80  % (3232151)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.80  % (3232151)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.80  % (3232151)CaDiCaL version: 2.1.3
% 7.79/1.80  % (3232151)Termination reason: Instruction limit
% 7.79/1.80  % (3232151)Termination phase: Saturation
% 7.79/1.80  % (3232151)Time elapsed: 0.034 s
% 7.79/1.80  % (3232151)Peak memory usage: 90 MB
% 7.79/1.80  % (3232151)Instructions burned: 129 (million)
% 7.79/1.80  % (3232156)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=707020215:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2995 on theBenchmark for (2995ds/114Mi)
% 7.79/1.80  % (3232157)lrs+10_1_sil=8000:sp=occurrence:random_seed=3664753164:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2995 on theBenchmark for (2995ds/907Mi)
% 7.79/1.80  % (3232158)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=1134948100:i=437:sd=1:aac=none:ss=included_2995 on theBenchmark for (2995ds/437Mi)
% 7.79/1.80  % (3232156)Instruction limit reached! 
% 7.79/1.80  % (3232156)------------------------------
% 7.79/1.80  % (3232156)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.80  % (3232156)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.80  % (3232156)CaDiCaL version: 2.1.3
% 7.79/1.80  % (3232156)Termination reason: Instruction limit
% 7.79/1.80  % (3232156)Termination phase: Saturation
% 7.79/1.80  % (3232156)Time elapsed: 0.036 s
% 7.79/1.80  % (3232156)Peak memory usage: 89 MB
% 7.79/1.80  % (3232156)Instructions burned: 115 (million)
% 7.79/1.80  % (3232162)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3315027502:i=5202:ss=axioms:sgt=16_2994 on theBenchmark for (2994ds/5202Mi)
% 7.79/1.80  % (3232158)Instruction limit reached! 
% 7.79/1.80  % (3232158)------------------------------
% 7.79/1.80  % (3232158)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.80  % (3232158)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.80  % (3232158)CaDiCaL version: 2.1.3
% 7.79/1.80  % (3232158)Termination reason: Instruction limit
% 7.79/1.80  % (3232158)Termination phase: Saturation
% 7.79/1.80  % (3232158)Time elapsed: 0.147 s
% 7.79/1.80  % (3232158)Peak memory usage: 93 MB
% 7.79/1.80  % (3232158)Instructions burned: 439 (million)
% 7.79/1.80  % (3232164)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=523685979:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2992 on theBenchmark for (2992ds/134Mi)
% 7.79/1.80  % (3232157)Instruction limit reached! 
% 7.79/1.80  % (3232157)------------------------------
% 7.79/1.80  % (3232157)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.80  % (3232157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.80  % (3232157)CaDiCaL version: 2.1.3
% 7.79/1.80  % (3232157)Termination reason: Instruction limit
% 7.79/1.80  % (3232157)Termination phase: Saturation
% 7.79/1.80  % (3232157)Time elapsed: 0.274 s
% 7.79/1.80  % (3232157)Peak memory usage: 99 MB
% 7.79/1.80  % (3232157)Instructions burned: 907 (million)
% 7.79/1.80  % (3232164)Instruction limit reached! 
% 7.79/1.80  % (3232164)------------------------------
% 7.79/1.80  % (3232164)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.80  % (3232164)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.80  % (3232164)CaDiCaL version: 2.1.3
% 7.79/1.80  % (3232164)Termination reason: Instruction limit
% 7.79/1.80  % (3232164)Termination phase: Saturation
% 7.79/1.80  % (3232164)Time elapsed: 0.035 s
% 7.79/1.80  % (3232164)Peak memory usage: 91 MB
% 7.79/1.80  % (3232164)Instructions burned: 136 (million)
% 7.79/1.80  % (3232166)lrs+1002_8_sil=8000:sp=occurrence:sos=on:sac=on:random_seed=3717205350:st=8:i=592:sd=3:ep=RST:ss=axioms_2991 on theBenchmark for (2991ds/592Mi)
% 7.79/1.80  % (3232167)lrs+10_1_ncem=casc2026/models/loop6.pt:sil=32000:npcc=on:random_seed=3919154042:st=3:i=13193:sd=3:ss=axioms_2991 on theBenchmark for (2991ds/13193Mi)
% 7.79/1.80  % (3232166)Instruction limit reached! 
% 7.79/1.80  % (3232166)------------------------------
% 7.79/1.80  % (3232166)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.80  % (3232166)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.80  % (3232166)CaDiCaL version: 2.1.3
% 7.79/1.80  % (3232166)Termination reason: Instruction limit
% 7.79/1.80  % (3232166)Termination phase: Saturation
% 7.79/1.80  % (3232166)Time elapsed: 0.141 s
% 7.79/1.80  % (3232166)Peak memory usage: 91 MB
% 7.79/1.80  % (3232166)Instructions burned: 592 (million)
% 7.79/1.80  % (3232162)First to succeed.
% 7.79/1.80  % (3232162)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3232121"
% 7.79/1.80  % (3232170)lrs+1666_7_slsqr=4,1:sil=8000:plsq=on:plsqc=1:sos=on:urr=on:plsql=on:rp=on:alpa=false:sac=on:slsq=on:random_seed=3555900379:i=125:slsql=off:bs=unit_only:gtg=position:fdi=2:gsp=on:ss=axioms:sgt=8_2989 on theBenchmark for (2989ds/125Mi)
% 7.79/1.80  % (3232170)Instruction limit reached! 
% 7.79/1.80  % (3232170)------------------------------
% 7.79/1.80  % (3232170)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.80  % (3232170)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.80  % (3232170)CaDiCaL version: 2.1.3
% 7.79/1.80  % (3232170)Termination reason: Instruction limit
% 7.79/1.80  % (3232170)Termination phase: Saturation
% 7.79/1.80  % (3232170)Time elapsed: 0.039 s
% 7.79/1.80  % (3232170)Peak memory usage: 91 MB
% 7.79/1.80  % (3232170)Instructions burned: 125 (million)
% 7.79/1.80  % (3232149)Instruction limit reached! 
% 7.79/1.80  % (3232149)------------------------------
% 7.79/1.80  % (3232149)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.80  % (3232149)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.80  % (3232149)CaDiCaL version: 2.1.3
% 7.79/1.80  % (3232149)Termination reason: Instruction limit
% 7.79/1.80  % (3232149)Termination phase: Saturation
% 7.79/1.80  % (3232149)Time elapsed: 0.833 s
% 7.79/1.80  % (3232149)Peak memory usage: 143 MB
% 7.79/1.80  % (3232149)Instructions burned: 2352 (million)
% 7.79/1.80  % (3232162)Refutation found. Thanks to Tanya!
% 7.79/1.80  % SZS status Theorem for theBenchmark
% 7.79/1.80  % SZS output start Proof for theBenchmark
% See solution above
% 7.79/1.89  % (3232162)------------------------------
% 7.79/1.89  % (3232162)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 7.79/1.89  % (3232162)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.79/1.89  % (3232162)CaDiCaL version: 2.1.3
% 7.79/1.89  % (3232162)Termination reason: Refutation
% 7.79/1.89  % (3232162)Time elapsed: 0.406 s
% 7.79/1.89  % (3232162)Peak memory usage: 132 MB
% 7.79/1.89  % (3232162)Instructions burned: 1109 (million)
% 7.79/1.89  % (3232162)------------------------------
% 7.79/1.89  % (3232162)------------------------------
% 7.79/1.89  % (3232121)Success in time 1.271 s
% 7.79/1.89  % Vampire exiting
%------------------------------------------------------------------------------