↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Result   : Theorem 3.40s 1.41s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   15
% Syntax   : Number of formulae    :  104 (  17 unt;   9 def)
%            Number of atoms       :  378 (  55 equ)
%            Maximal formula atoms :   21 (   3 avg)
%            Number of connectives :  449 ( 175   ~; 171   |;  79   &)
%                                         (  10 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   17 (  15 usr;   9 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   5 con; 0-2 aty)
%            Number of variables   :  103 (   0 sgn  71   !;  32   ?)

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

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

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

fof(f73,axiom,
    ! [X0] :
      ( ssItem(X0)
     => equalelemsP(cons(X0,nil)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax73) ).

fof(f74,axiom,
    equalelemsP(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax74) ).

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)
                                | cons(X4,nil) != X2
                                | app(app(X5,X2),X6) != X3
                                | ? [X7] :
                                    ( ssItem(X7)
                                    & memberP(X5,X7)
                                    & lt(X4,X7) )
                                | ? [X8] :
                                    ( ssItem(X8)
                                    & memberP(X6,X8)
                                    & lt(X8,X4) ) ) ) )
                    & ( nil != X3
                      | nil != X2 ) )
                  | ( segmentP(X1,X0)
                    & equalelemsP(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)
                                  | cons(X4,nil) != X2
                                  | app(app(X5,X2),X6) != X3
                                  | ? [X7] :
                                      ( ssItem(X7)
                                      & memberP(X5,X7)
                                      & lt(X4,X7) )
                                  | ? [X8] :
                                      ( ssItem(X8)
                                      & memberP(X6,X8)
                                      & lt(X8,X4) ) ) ) )
                      & ( nil != X3
                        | nil != X2 ) )
                    | ( segmentP(X1,X0)
                      & equalelemsP(X0) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

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

fof(f102,plain,
    ! [X0] :
      ( equalelemsP(cons(X0,nil))
      | ~ ssItem(X0) ),
    inference(ennf_transformation,[],[f73]) ).

fof(f159,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( segmentP(X0,X1)
          <=> ? [X2] :
                ( ssList(X2)
                & ? [X3] :
                    ( ssList(X3)
                    & app(app(X2,X1),X3) = X0 ) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f164,plain,
    ! [X0] :
      ( segmentP(X0,nil)
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f57]) ).

fof(f181,definition,
    ! [X2,X3] :
      ( ? [X4] :
          ( ? [X5] :
              ( ? [X6] :
                  ( ssList(X6)
                  & cons(X4,nil) = X2
                  & app(app(X5,X2),X6) = X3
                  & ! [X7] :
                      ( ~ ssItem(X7)
                      | ~ memberP(X5,X7)
                      | ~ lt(X4,X7) )
                  & ! [X8] :
                      ( ~ ssItem(X8)
                      | ~ memberP(X6,X8)
                      | ~ lt(X8,X4) ) )
              & ssList(X5) )
          & ssItem(X4) )
      | ~ sP0(X2,X3) ),
    introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).

fof(f182,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ssList(X3)
                  & X1 = X3
                  & X0 = X2
                  & ( sP0(X2,X3)
                    | ( nil = X3
                      & nil = X2 ) )
                  & ( ~ segmentP(X1,X0)
                    | ~ equalelemsP(X0) ) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(definition_folding,[],[f98,f181]) ).

fof(f192,plain,
    ! [X2,X3] :
      ( ? [X4] :
          ( ? [X5] :
              ( ? [X6] :
                  ( ssList(X6)
                  & cons(X4,nil) = X2
                  & app(app(X5,X2),X6) = X3
                  & ! [X7] :
                      ( ~ ssItem(X7)
                      | ~ memberP(X5,X7)
                      | ~ lt(X4,X7) )
                  & ! [X8] :
                      ( ~ ssItem(X8)
                      | ~ memberP(X6,X8)
                      | ~ lt(X8,X4) ) )
              & ssList(X5) )
          & ssItem(X4) )
      | ~ sP0(X2,X3) ),
    inference(nnf_transformation,[],[f181]) ).

fof(f193,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ? [X3] :
              ( ? [X4] :
                  ( ssList(X4)
                  & cons(X2,nil) = X0
                  & app(app(X3,X0),X4) = X1
                  & ! [X5] :
                      ( ~ ssItem(X5)
                      | ~ memberP(X3,X5)
                      | ~ lt(X2,X5) )
                  & ! [X6] :
                      ( ~ ssItem(X6)
                      | ~ memberP(X4,X6)
                      | ~ lt(X6,X2) ) )
              & ssList(X3) )
          & ssItem(X2) )
      | ~ sP0(X0,X1) ),
    inference(rectify,[],[f192]) ).

fof(f194,plain,
    ! [X0,X1] :
      ( ( ssList(sK9(X0,X1))
        & cons(sK7(X0,X1),nil) = X0
        & app(app(sK8(X0,X1),X0),sK9(X0,X1)) = X1
        & ! [X5] :
            ( ~ ssItem(X5)
            | ~ memberP(sK8(X0,X1),X5)
            | ~ lt(sK7(X0,X1),X5) )
        & ! [X6] :
            ( ~ ssItem(X6)
            | ~ memberP(sK9(X0,X1),X6)
            | ~ lt(X6,sK7(X0,X1)) )
        & ssList(sK8(X0,X1))
        & ssItem(sK7(X0,X1)) )
      | ~ sP0(X0,X1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8,sK9]),skolemize(X2,sK7(X0,X1)),skolemize(X3,sK8(X0,X1)),skolemize(X4,sK9(X0,X1))],[f193]) ).

fof(f195,plain,
    ( ssList(sK13)
    & sK11 = sK13
    & sK10 = sK12
    & ( sP0(sK12,sK13)
      | ( nil = sK13
        & nil = sK12 ) )
    & ( ~ segmentP(sK11,sK10)
      | ~ equalelemsP(sK10) )
    & ssList(sK12)
    & ssList(sK11)
    & ssList(sK10) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13]),skolemize(X0,sK10),skolemize(X1,sK11),skolemize(X2,sK12),skolemize(X3,sK13)],[f182]) ).

fof(f240,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(app(X2,X1),X3) != X0 ) ) )
            & ( ? [X2] :
                  ( ssList(X2)
                  & ? [X3] :
                      ( ssList(X3)
                      & app(app(X2,X1),X3) = X0 ) )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f159]) ).

fof(f241,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(app(X2,X1),X3) != X0 ) ) )
            & ( ? [X4] :
                  ( ssList(X4)
                  & ? [X5] :
                      ( ssList(X5)
                      & app(app(X4,X1),X5) = X0 ) )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(rectify,[],[f240]) ).

fof(f242,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( segmentP(X0,X1)
              | ! [X2] :
                  ( ~ ssList(X2)
                  | ! [X3] :
                      ( ~ ssList(X3)
                      | app(app(X2,X1),X3) != X0 ) ) )
            & ( ( ssList(sK55(X0,X1))
                & ssList(sK56(X0,X1))
                & app(app(sK55(X0,X1),X1),sK56(X0,X1)) = X0 )
              | ~ segmentP(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK55,sK56]),skolemize(X4,sK55(X0,X1)),skolemize(X5,sK56(X0,X1))],[f241]) ).

fof(f253,plain,
    ! [X0,X1] :
      ( ssItem(sK7(X0,X1))
      | ~ sP0(X0,X1) ),
    inference(cnf_transformation,[],[f194]) ).

fof(f254,plain,
    ! [X0,X1] :
      ( ssList(sK8(X0,X1))
      | ~ sP0(X0,X1) ),
    inference(cnf_transformation,[],[f194]) ).

fof(f257,plain,
    ! [X0,X1] :
      ( ~ sP0(X0,X1)
      | app(app(sK8(X0,X1),X0),sK9(X0,X1)) = X1 ),
    inference(cnf_transformation,[],[f194]) ).

fof(f258,plain,
    ! [X0,X1] :
      ( ~ sP0(X0,X1)
      | cons(sK7(X0,X1),nil) = X0 ),
    inference(cnf_transformation,[],[f194]) ).

fof(f259,plain,
    ! [X0,X1] :
      ( ssList(sK9(X0,X1))
      | ~ sP0(X0,X1) ),
    inference(cnf_transformation,[],[f194]) ).

fof(f260,plain,
    ssList(sK10),
    inference(cnf_transformation,[],[f195]) ).

fof(f261,plain,
    ssList(sK11),
    inference(cnf_transformation,[],[f195]) ).

fof(f263,plain,
    ( ~ segmentP(sK11,sK10)
    | ~ equalelemsP(sK10) ),
    inference(cnf_transformation,[],[f195]) ).

fof(f264,plain,
    ( sP0(sK12,sK13)
    | nil = sK12 ),
    inference(cnf_transformation,[],[f195]) ).

fof(f265,plain,
    ( sP0(sK12,sK13)
    | nil = sK13 ),
    inference(cnf_transformation,[],[f195]) ).

fof(f266,plain,
    sK10 = sK12,
    inference(cnf_transformation,[],[f195]) ).

fof(f267,plain,
    sK11 = sK13,
    inference(cnf_transformation,[],[f195]) ).

fof(f274,plain,
    ! [X0] :
      ( equalelemsP(cons(X0,nil))
      | ~ ssItem(X0) ),
    inference(cnf_transformation,[],[f102]) ).

fof(f402,plain,
    ! [X2,X3,X0,X1] :
      ( segmentP(X0,X1)
      | ~ ssList(X2)
      | ~ ssList(X3)
      | app(app(X2,X1),X3) != X0
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f242]) ).

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

fof(f413,plain,
    ! [X0] :
      ( segmentP(X0,nil)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f164]) ).

fof(f427,plain,
    equalelemsP(nil),
    inference(cnf_transformation,[],[f74]) ).

fof(f428,plain,
    ( ~ segmentP(sK13,sK12)
    | ~ equalelemsP(sK12) ),
    inference(definition_unfolding,[],[f263,f267,f266,f266]) ).

fof(f429,plain,
    ssList(sK13),
    inference(definition_unfolding,[],[f261,f267]) ).

fof(f430,plain,
    ssList(sK12),
    inference(definition_unfolding,[],[f260,f266]) ).

fof(f449,plain,
    ! [X2,X3,X1] :
      ( ~ ssList(app(app(X2,X1),X3))
      | ~ ssList(X2)
      | ~ ssList(X3)
      | ~ ssList(X1)
      | segmentP(app(app(X2,X1),X3),X1) ),
    inference(equality_resolution,[],[f402]) ).

fof(f460,definition,
    ( spl59_1
  <=> equalelemsP(sK12) ),
    introduced(definition,[new_symbols(definition,[spl59_1])],[avatar_definition]) ).

fof(f462,plain,
    ( ~ equalelemsP(sK12)
    | spl59_1 ),
    inference(avatar_component_clause,[],[f460]) ).

fof(f464,definition,
    ( spl59_2
  <=> segmentP(sK13,sK12) ),
    introduced(definition,[new_symbols(definition,[spl59_2])],[avatar_definition]) ).

fof(f466,plain,
    ( ~ segmentP(sK13,sK12)
    | spl59_2 ),
    inference(avatar_component_clause,[],[f464]) ).

fof(f467,plain,
    ( ~ spl59_1
    | ~ spl59_2 ),
    inference(avatar_split_clause,[],[f428,f464,f460]) ).

fof(f469,definition,
    ( spl59_3
  <=> nil = sK12 ),
    introduced(definition,[new_symbols(definition,[spl59_3])],[avatar_definition]) ).

fof(f471,plain,
    ( nil = sK12
    | ~ spl59_3 ),
    inference(avatar_component_clause,[],[f469]) ).

fof(f473,definition,
    ( spl59_4
  <=> sP0(sK12,sK13) ),
    introduced(definition,[new_symbols(definition,[spl59_4])],[avatar_definition]) ).

fof(f475,plain,
    ( sP0(sK12,sK13)
    | ~ spl59_4 ),
    inference(avatar_component_clause,[],[f473]) ).

fof(f476,plain,
    ( spl59_3
    | spl59_4 ),
    inference(avatar_split_clause,[],[f264,f473,f469]) ).

fof(f478,definition,
    ( spl59_5
  <=> nil = sK13 ),
    introduced(definition,[new_symbols(definition,[spl59_5])],[avatar_definition]) ).

fof(f480,plain,
    ( nil = sK13
    | ~ spl59_5 ),
    inference(avatar_component_clause,[],[f478]) ).

fof(f481,plain,
    ( spl59_5
    | spl59_4 ),
    inference(avatar_split_clause,[],[f265,f473,f478]) ).

fof(f490,plain,
    ( sK12 = cons(sK7(sK12,sK13),nil)
    | ~ spl59_4 ),
    inference(resolution,[],[f258,f475]) ).

fof(f491,plain,
    ( equalelemsP(sK12)
    | ~ ssItem(sK7(sK12,sK13))
    | ~ spl59_4 ),
    inference(superposition,[],[f274,f490]) ).

fof(f506,definition,
    ( spl59_6
  <=> ssItem(sK7(sK12,sK13)) ),
    introduced(definition,[new_symbols(definition,[spl59_6])],[avatar_definition]) ).

fof(f508,plain,
    ( ~ ssItem(sK7(sK12,sK13))
    | spl59_6 ),
    inference(avatar_component_clause,[],[f506]) ).

fof(f539,plain,
    ( ~ ssItem(sK7(sK12,sK13))
    | spl59_1
    | ~ spl59_4 ),
    inference(forward_subsumption_resolution,[],[f491,f462]) ).

fof(f547,plain,
    ( ~ spl59_6
    | spl59_1
    | ~ spl59_4 ),
    inference(avatar_split_clause,[],[f539,f473,f460,f506]) ).

fof(f549,plain,
    ( ~ sP0(sK12,sK13)
    | spl59_6 ),
    inference(resolution,[],[f508,f253]) ).

fof(f550,plain,
    ( $false
    | ~ spl59_4
    | spl59_6 ),
    inference(forward_subsumption_resolution,[],[f549,f475]) ).

fof(f551,plain,
    ( ~ spl59_4
    | spl59_6 ),
    inference(avatar_contradiction_clause,[],[f550]) ).

fof(f609,plain,
    ( ~ segmentP(sK13,nil)
    | spl59_2
    | ~ spl59_3 ),
    inference(superposition,[],[f466,f471]) ).

fof(f621,plain,
    ( ~ segmentP(nil,nil)
    | spl59_2
    | ~ spl59_3
    | ~ spl59_5 ),
    inference(forward_demodulation,[],[f609,f480]) ).

fof(f657,plain,
    ( ~ ssList(nil)
    | spl59_2
    | ~ spl59_3
    | ~ spl59_5 ),
    inference(resolution,[],[f621,f413]) ).

fof(f661,plain,
    ( $false
    | spl59_2
    | ~ spl59_3
    | ~ spl59_5 ),
    inference(forward_subsumption_resolution,[],[f657,f409]) ).

fof(f662,plain,
    ( spl59_2
    | ~ spl59_3
    | ~ spl59_5 ),
    inference(avatar_contradiction_clause,[],[f661]) ).

fof(f663,plain,
    ( ~ equalelemsP(nil)
    | spl59_1
    | ~ spl59_3 ),
    inference(forward_demodulation,[],[f462,f471]) ).

fof(f665,plain,
    ( $false
    | spl59_1
    | ~ spl59_3 ),
    inference(forward_subsumption_resolution,[],[f663,f427]) ).

fof(f666,plain,
    ( spl59_1
    | ~ spl59_3 ),
    inference(avatar_contradiction_clause,[],[f665]) ).

fof(f1289,plain,
    ( sK13 = app(app(sK8(sK12,sK13),sK12),sK9(sK12,sK13))
    | ~ spl59_4 ),
    inference(resolution,[],[f475,f257]) ).

fof(f1876,plain,
    ( ~ ssList(sK13)
    | ~ ssList(sK8(sK12,sK13))
    | ~ ssList(sK9(sK12,sK13))
    | ~ ssList(sK12)
    | segmentP(sK13,sK12)
    | ~ spl59_4 ),
    inference(superposition,[],[f449,f1289]) ).

fof(f1896,definition,
    ( spl59_50
  <=> ssList(sK9(sK12,sK13)) ),
    introduced(definition,[new_symbols(definition,[spl59_50])],[avatar_definition]) ).

fof(f1898,plain,
    ( ~ ssList(sK9(sK12,sK13))
    | spl59_50 ),
    inference(avatar_component_clause,[],[f1896]) ).

fof(f1944,plain,
    ( ~ ssList(sK8(sK12,sK13))
    | ~ ssList(sK9(sK12,sK13))
    | ~ ssList(sK12)
    | segmentP(sK13,sK12)
    | ~ spl59_4 ),
    inference(forward_subsumption_resolution,[],[f1876,f429]) ).

fof(f1957,definition,
    ( spl59_63
  <=> ssList(sK8(sK12,sK13)) ),
    introduced(definition,[new_symbols(definition,[spl59_63])],[avatar_definition]) ).

fof(f1959,plain,
    ( ~ ssList(sK8(sK12,sK13))
    | spl59_63 ),
    inference(avatar_component_clause,[],[f1957]) ).

fof(f1965,plain,
    ( ~ ssList(sK8(sK12,sK13))
    | ~ ssList(sK9(sK12,sK13))
    | segmentP(sK13,sK12)
    | ~ spl59_4 ),
    inference(forward_subsumption_resolution,[],[f1944,f430]) ).

fof(f1967,plain,
    ( ~ ssList(sK8(sK12,sK13))
    | ~ ssList(sK9(sK12,sK13))
    | spl59_2
    | ~ spl59_4 ),
    inference(forward_subsumption_resolution,[],[f1965,f466]) ).

fof(f1968,plain,
    ( ~ spl59_50
    | ~ spl59_63
    | spl59_2
    | ~ spl59_4 ),
    inference(avatar_split_clause,[],[f1967,f473,f464,f1957,f1896]) ).

fof(f2017,plain,
    ( ~ sP0(sK12,sK13)
    | spl59_50 ),
    inference(resolution,[],[f1898,f259]) ).

fof(f2018,plain,
    ( $false
    | ~ spl59_4
    | spl59_50 ),
    inference(forward_subsumption_resolution,[],[f2017,f475]) ).

fof(f2019,plain,
    ( ~ spl59_4
    | spl59_50 ),
    inference(avatar_contradiction_clause,[],[f2018]) ).

fof(f2060,plain,
    ( ~ sP0(sK12,sK13)
    | spl59_63 ),
    inference(resolution,[],[f1959,f254]) ).

fof(f2061,plain,
    ( $false
    | ~ spl59_4
    | spl59_63 ),
    inference(forward_subsumption_resolution,[],[f2060,f475]) ).

fof(f2062,plain,
    ( ~ spl59_4
    | spl59_63 ),
    inference(avatar_contradiction_clause,[],[f2061]) ).

cnf(s1,plain,
    ( ~ spl59_1
    | ~ spl59_2 ),
    inference(sat_conversion,[],[f467]) ).

cnf(s2,plain,
    ( spl59_3
    | spl59_4 ),
    inference(sat_conversion,[],[f476]) ).

cnf(s3,plain,
    ( spl59_4
    | spl59_5 ),
    inference(sat_conversion,[],[f481]) ).

cnf(s13,plain,
    ( spl59_1
    | ~ spl59_4
    | ~ spl59_6 ),
    inference(sat_conversion,[],[f547]) ).

cnf(s14,plain,
    ( ~ spl59_4
    | spl59_6 ),
    inference(sat_conversion,[],[f551]) ).

cnf(s19,plain,
    ( spl59_2
    | ~ spl59_3
    | ~ spl59_5 ),
    inference(sat_conversion,[],[f662]) ).

cnf(s20,plain,
    ( spl59_1
    | ~ spl59_3 ),
    inference(sat_conversion,[],[f666]) ).

cnf(s77,plain,
    ( spl59_2
    | ~ spl59_4
    | ~ spl59_50
    | ~ spl59_63 ),
    inference(sat_conversion,[],[f1968]) ).

cnf(s78,plain,
    ( ~ spl59_4
    | spl59_50 ),
    inference(sat_conversion,[],[f2019]) ).

cnf(s79,plain,
    ( ~ spl59_4
    | spl59_63 ),
    inference(sat_conversion,[],[f2062]) ).

cnf(s98,plain,
    spl59_1,
    inference(rat,[],[s13,s14,s2,s20]) ).

cnf(s99,plain,
    ~ spl59_2,
    inference(rat,[],[s1,s98]) ).

cnf(s100,plain,
    ~ spl59_4,
    inference(rat,[],[s77,s78,s79,s99]) ).

cnf(s101,plain,
    spl59_5,
    inference(rat,[],[s3,s100]) ).

cnf(s102,plain,
    spl59_3,
    inference(rat,[],[s2,s100]) ).

cnf(s103,plain,
    $false,
    inference(rat,[],[s19,s99,s102,s101]) ).

fof(f2063,plain,
    $false,
    inference(avatar_sat_refutation,[],[s103]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC330+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  % Computer : n018.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Mon Sep 28 09:08:40 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running first-order theorem proving
% 0.08/0.23  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.40/1.41  % (3243503)Detected formulas, will run a generic FOF schedule.
% 3.40/1.41  % (3243509)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=3251973056:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.40/1.41  % (3243513)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3421596849:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.40/1.41  % (3243512)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3641755678:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.40/1.41  % (3243514)dis-21_1_sil=8000:lcm=predicate:random_seed=2305571957: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)
% 3.40/1.41  % (3243511)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2330025097:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.40/1.41  % (3243508)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=3412003719:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.40/1.41  % (3243510)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=3037456996:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.40/1.41  % (3243511)Refutation not found, incomplete strategy
% 3.40/1.41  % (3243511)------------------------------
% 3.40/1.41  % (3243511)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.41  % (3243511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.41  % (3243511)CaDiCaL version: 2.1.3
% 3.40/1.41  % (3243511)Termination reason: Refutation not found, incomplete strategy
% 3.40/1.41  % (3243511)Time elapsed: 0.005 s
% 3.40/1.41  % (3243511)Peak memory usage: 88 MB
% 3.40/1.41  % (3243511)Instructions burned: 6 (million)
% 3.40/1.41  % (3243512)Instruction limit reached! 
% 3.40/1.41  % (3243512)------------------------------
% 3.40/1.41  % (3243512)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.41  % (3243512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.41  % (3243512)CaDiCaL version: 2.1.3
% 3.40/1.41  % (3243512)Termination reason: Instruction limit
% 3.40/1.41  % (3243512)Termination phase: Saturation
% 3.40/1.41  % (3243512)Time elapsed: 0.054 s
% 3.40/1.41  % (3243512)Peak memory usage: 88 MB
% 3.40/1.41  % (3243512)Instructions burned: 119 (million)
% 3.40/1.41  % (3243514)Instruction limit reached! 
% 3.40/1.41  % (3243514)------------------------------
% 3.40/1.41  % (3243514)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.41  % (3243514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.41  % (3243514)CaDiCaL version: 2.1.3
% 3.40/1.41  % (3243514)Termination reason: Instruction limit
% 3.40/1.41  % (3243514)Termination phase: Saturation
% 3.40/1.41  % (3243514)Time elapsed: 0.071 s
% 3.40/1.41  % (3243514)Peak memory usage: 90 MB
% 3.40/1.41  % (3243514)Instructions burned: 129 (million)
% 3.40/1.41  % (3243513)Instruction limit reached! 
% 3.40/1.41  % (3243513)------------------------------
% 3.40/1.41  % (3243513)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.41  % (3243513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.41  % (3243513)CaDiCaL version: 2.1.3
% 3.40/1.41  % (3243513)Termination reason: Instruction limit
% 3.40/1.41  % (3243513)Termination phase: Saturation
% 3.40/1.41  % (3243513)Time elapsed: 0.095 s
% 3.40/1.41  % (3243513)Peak memory usage: 90 MB
% 3.40/1.41  % (3243513)Instructions burned: 140 (million)
% 3.40/1.41  % (3243522)lrs+10_1_sil=8000:sp=occurrence:random_seed=2745835812:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.40/1.41  % (3243523)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2279937399:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.40/1.41  % (3243511)------------------------------
% 3.40/1.41  % (3243511)------------------------------
% 3.40/1.41  % (3243524)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3037598576:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.40/1.41  % (3243523)Instruction limit reached! 
% 3.40/1.41  % (3243523)------------------------------
% 3.40/1.41  % (3243523)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.41  % (3243523)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.41  % (3243523)CaDiCaL version: 2.1.3
% 3.40/1.41  % (3243523)Termination reason: Instruction limit
% 3.40/1.41  % (3243523)Termination phase: Saturation
% 3.40/1.41  % (3243523)Time elapsed: 0.082 s
% 3.40/1.41  % (3243523)Peak memory usage: 94 MB
% 3.40/1.41  % (3243523)Instructions burned: 158 (million)
% 3.40/1.41  % (3243524)First to succeed.
% 3.40/1.41  % (3243524)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3243503"
% 3.40/1.41  % (3243509)Also succeeded, but the first one will report.
% 3.40/1.41  % (3243522)Also succeeded, but the first one will report.
% 3.40/1.41  % (3243527)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=946911727:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 3.40/1.41  % (3243529)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1983284595:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 3.40/1.41  % (3243527)Instruction limit reached! 
% 3.40/1.41  % (3243527)------------------------------
% 3.40/1.41  % (3243527)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.41  % (3243527)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.41  % (3243527)CaDiCaL version: 2.1.3
% 3.40/1.41  % (3243527)Termination reason: Instruction limit
% 3.40/1.41  % (3243527)Termination phase: Saturation
% 3.40/1.41  % (3243527)Time elapsed: 0.123 s
% 3.40/1.41  % (3243527)Peak memory usage: 94 MB
% 3.40/1.41  % (3243527)Instructions burned: 250 (million)
% 3.40/1.41  % (3243524)Refutation found. Thanks to Tanya!
% 3.40/1.41  % SZS status Theorem for theBenchmark
% 3.40/1.41  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/1.60  % (3243524)------------------------------
% 0.20/1.60  % (3243524)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.20/1.60  % (3243524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/1.60  % (3243524)CaDiCaL version: 2.1.3
% 0.20/1.60  % (3243524)Termination reason: Refutation
% 0.20/1.60  % (3243524)Time elapsed: 0.046 s
% 0.20/1.60  % (3243524)Peak memory usage: 91 MB
% 0.20/1.60  % (3243524)Instructions burned: 69 (million)
% 0.20/1.60  % (3243524)------------------------------
% 0.20/1.60  % (3243524)------------------------------
% 0.20/1.60  % (3243503)Success in time 0.74 s
% 0.20/1.60  % Vampire exiting
%------------------------------------------------------------------------------