↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

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

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

% Result   : Theorem 0.56s 0.53s
% Output   : Refutation 0.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   20
% Syntax   : Number of formulae    :  144 (  20 unt;  13 def)
%            Number of atoms       :  470 (  88 equ)
%            Maximal formula atoms :   24 (   3 avg)
%            Number of connectives :  504 ( 178   ~; 251   |;  36   &)
%                                         (  19 <=>;  20  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   21 (  19 usr;  14 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   86 (   0 sgn  71   !;  15   ?)

% 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/Axioms/SWC001+0.ax',ax7) ).

fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).

fof(f18,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssItem(X1)
         => cons(X1,X0) != X0 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).

fof(f26,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ssList(app(X0,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).

fof(f83,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( nil = app(X0,X1)
          <=> ( nil = X1
              & nil = X0 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).

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 ) )
                  | ( ( nil != X1
                      | nil = X0 )
                    & ( ~ neq(X1,nil)
                      | ( neq(X0,nil)
                        & segmentP(X1,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 ) )
                    | ( ( nil != X1
                        | nil = X0 )
                      & ( ~ neq(X1,nil)
                        | ( neq(X0,nil)
                          & segmentP(X1,X0) ) ) ) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f96]) ).

fof(f103,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(f118,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( neq(X0,X1)
          <=> X0 != X1 )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f15]) ).

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

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

fof(f200,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( nil = app(X0,X1)
          <=> ( nil = X1
              & nil = X0 ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f83]) ).

fof(f221,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 ) )
                  & ( ( nil = X1
                      & nil != X0 )
                    | ( neq(X1,nil)
                      & ( ~ neq(X0,nil)
                        | ~ segmentP(X1,X0) ) ) ) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

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

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

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

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

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

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

fof(f393,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | nil = X0
      | nil != app(X0,X1) ),
    inference(cnf_transformation,[],[f200]) ).

fof(f394,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | nil = X1
      | nil != app(X0,X1) ),
    inference(cnf_transformation,[],[f200]) ).

fof(f415,plain,
    ( nil = sK50
    | sK49 = cons(sK51,nil) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f417,plain,
    ( nil = sK49
    | sK50 = app(app(sK52,sK49),sK53) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f419,plain,
    ( nil = sK49
    | ssList(sK53) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f420,plain,
    ( nil = sK49
    | ssList(sK52) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f422,plain,
    ( nil = sK50
    | ssItem(sK51) ),
    inference(cnf_transformation,[],[f221]) ).

fof(f424,plain,
    ( ~ segmentP(sK48,sK47)
    | ~ neq(sK47,nil)
    | nil = sK48 ),
    inference(cnf_transformation,[],[f221]) ).

fof(f426,plain,
    ( neq(sK48,nil)
    | nil != sK47 ),
    inference(cnf_transformation,[],[f221]) ).

fof(f428,plain,
    sK47 = sK49,
    inference(cnf_transformation,[],[f221]) ).

fof(f429,plain,
    sK48 = sK50,
    inference(cnf_transformation,[],[f221]) ).

fof(f432,plain,
    ssList(sK48),
    inference(cnf_transformation,[],[f221]) ).

fof(f433,plain,
    ssList(sK47),
    inference(cnf_transformation,[],[f221]) ).

fof(f434,plain,
    ssList(sK49),
    inference(definition_unfolding,[],[f433,f428]) ).

fof(f435,plain,
    ssList(sK50),
    inference(definition_unfolding,[],[f432,f429]) ).

fof(f437,plain,
    ( neq(sK50,nil)
    | nil != sK49 ),
    inference(definition_unfolding,[],[f426,f429,f428]) ).

fof(f439,plain,
    ( ~ segmentP(sK50,sK49)
    | ~ neq(sK49,nil)
    | nil = sK50 ),
    inference(definition_unfolding,[],[f424,f429,f428,f428,f429]) ).

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

fof(f454,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | ~ ssList(X1)
      | ~ neq(X1,X1) ),
    inference(equality_resolution,[],[f303]) ).

fof(f481,plain,
    ! [X2,X3,X1] :
      ( segmentP(app(app(X2,X1),X3),X1)
      | ssList(X1)
      | ssList(X3)
      | ssList(X2)
      | ssList(app(app(X2,X1),X3)) ),
    inference(consistent_polarity_flipping,[],[f445]) ).

fof(f540,plain,
    ! [X1] :
      ( ssList(X1)
      | ssList(X1)
      | ~ neq(X1,X1) ),
    inference(consistent_polarity_flipping,[],[f454]) ).

fof(f541,plain,
    ! [X0,X1] :
      ( neq(X0,X1)
      | ssList(X1)
      | X0 = X1
      | ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f302]) ).

fof(f543,plain,
    ~ ssList(nil),
    inference(consistent_polarity_flipping,[],[f305]) ).

fof(f544,plain,
    ! [X0,X1] :
      ( cons(X1,X0) != X0
      | ~ ssItem(X1)
      | ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f306]) ).

fof(f555,plain,
    ! [X0,X1] :
      ( ~ ssList(app(X0,X1))
      | ssList(X1)
      | ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f317]) ).

fof(f620,plain,
    ! [X0,X1] :
      ( nil != app(X0,X1)
      | ssList(X1)
      | nil = X1
      | ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f394]) ).

fof(f621,plain,
    ! [X0,X1] :
      ( nil != app(X0,X1)
      | ssList(X1)
      | nil = X0
      | ssList(X0) ),
    inference(consistent_polarity_flipping,[],[f393]) ).

fof(f629,plain,
    ~ ssList(sK49),
    inference(consistent_polarity_flipping,[],[f434]) ).

fof(f630,plain,
    ~ ssList(sK50),
    inference(consistent_polarity_flipping,[],[f435]) ).

fof(f634,plain,
    ( nil = sK49
    | ~ ssList(sK52) ),
    inference(consistent_polarity_flipping,[],[f420]) ).

fof(f635,plain,
    ( nil = sK49
    | ~ ssList(sK53) ),
    inference(consistent_polarity_flipping,[],[f419]) ).

fof(f645,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ssList(X1) ),
    inference(duplicate_literal_removal,[],[f540]) ).

fof(f652,definition,
    ( spl54_2
  <=> nil = sK49 ),
    introduced(definition,[new_symbols(definition,[spl54_2])],[avatar_definition]) ).

fof(f653,plain,
    ( nil != sK49
    | spl54_2 ),
    inference(avatar_component_clause,[],[f652]) ).

fof(f654,plain,
    ( nil = sK49
    | ~ spl54_2 ),
    inference(avatar_component_clause,[],[f652]) ).

fof(f657,definition,
    ( spl54_3
  <=> nil = sK50 ),
    introduced(definition,[new_symbols(definition,[spl54_3])],[avatar_definition]) ).

fof(f659,plain,
    ( nil = sK50
    | ~ spl54_3 ),
    inference(avatar_component_clause,[],[f657]) ).

fof(f667,definition,
    ( spl54_5
  <=> sK50 = app(app(sK52,sK49),sK53) ),
    introduced(definition,[new_symbols(definition,[spl54_5])],[avatar_definition]) ).

fof(f669,plain,
    ( sK50 = app(app(sK52,sK49),sK53)
    | ~ spl54_5 ),
    inference(avatar_component_clause,[],[f667]) ).

fof(f672,definition,
    ( spl54_6
  <=> sK49 = cons(sK51,nil) ),
    introduced(definition,[new_symbols(definition,[spl54_6])],[avatar_definition]) ).

fof(f674,plain,
    ( sK49 = cons(sK51,nil)
    | ~ spl54_6 ),
    inference(avatar_component_clause,[],[f672]) ).

fof(f675,plain,
    ( spl54_6
    | spl54_3 ),
    inference(avatar_split_clause,[],[f415,f657,f672]) ).

fof(f677,definition,
    ( spl54_7
  <=> ssList(sK53) ),
    introduced(definition,[new_symbols(definition,[spl54_7])],[avatar_definition]) ).

fof(f679,plain,
    ( ~ ssList(sK53)
    | spl54_7 ),
    inference(avatar_component_clause,[],[f677]) ).

fof(f681,plain,
    ( spl54_5
    | spl54_2 ),
    inference(avatar_split_clause,[],[f417,f652,f667]) ).

fof(f683,plain,
    ( ~ spl54_7
    | spl54_2 ),
    inference(avatar_split_clause,[],[f635,f652,f677]) ).

fof(f685,definition,
    ( spl54_8
  <=> ssList(sK52) ),
    introduced(definition,[new_symbols(definition,[spl54_8])],[avatar_definition]) ).

fof(f687,plain,
    ( ~ ssList(sK52)
    | spl54_8 ),
    inference(avatar_component_clause,[],[f685]) ).

fof(f688,plain,
    ( ~ spl54_8
    | spl54_2 ),
    inference(avatar_split_clause,[],[f634,f652,f685]) ).

fof(f691,definition,
    ( spl54_9
  <=> ssItem(sK51) ),
    introduced(definition,[new_symbols(definition,[spl54_9])],[avatar_definition]) ).

fof(f693,plain,
    ( ssItem(sK51)
    | ~ spl54_9 ),
    inference(avatar_component_clause,[],[f691]) ).

fof(f694,plain,
    ( spl54_9
    | spl54_3 ),
    inference(avatar_split_clause,[],[f422,f657,f691]) ).

fof(f697,definition,
    ( spl54_10
  <=> neq(sK49,nil) ),
    introduced(definition,[new_symbols(definition,[spl54_10])],[avatar_definition]) ).

fof(f699,plain,
    ( ~ neq(sK49,nil)
    | spl54_10 ),
    inference(avatar_component_clause,[],[f697]) ).

fof(f701,definition,
    ( spl54_11
  <=> segmentP(sK50,sK49) ),
    introduced(definition,[new_symbols(definition,[spl54_11])],[avatar_definition]) ).

fof(f703,plain,
    ( ~ segmentP(sK50,sK49)
    | spl54_11 ),
    inference(avatar_component_clause,[],[f701]) ).

fof(f704,plain,
    ( spl54_3
    | ~ spl54_10
    | ~ spl54_11 ),
    inference(avatar_split_clause,[],[f439,f701,f697,f657]) ).

fof(f707,definition,
    ( spl54_12
  <=> neq(sK50,nil) ),
    introduced(definition,[new_symbols(definition,[spl54_12])],[avatar_definition]) ).

fof(f709,plain,
    ( neq(sK50,nil)
    | ~ spl54_12 ),
    inference(avatar_component_clause,[],[f707]) ).

fof(f710,plain,
    ( ~ spl54_2
    | spl54_12 ),
    inference(avatar_split_clause,[],[f437,f707,f652]) ).

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

fof(f718,plain,
    ( ~ ssList(nil)
    | spl54_14 ),
    inference(avatar_component_clause,[],[f717]) ).

fof(f746,plain,
    ~ spl54_14,
    inference(avatar_split_clause,[],[f543,f717]) ).

fof(f752,plain,
    ( neq(nil,nil)
    | ~ spl54_3
    | ~ spl54_12 ),
    inference(forward_demodulation,[],[f709,f659]) ).

fof(f760,plain,
    ( nil = cons(sK51,nil)
    | ~ spl54_2
    | ~ spl54_6 ),
    inference(forward_demodulation,[],[f674,f654]) ).

fof(f862,plain,
    ( nil != nil
    | ~ ssItem(sK51)
    | ssList(nil)
    | ~ spl54_2
    | ~ spl54_6 ),
    inference(superposition,[],[f544,f760]) ).

fof(f863,plain,
    ( ~ ssItem(sK51)
    | ssList(nil)
    | ~ spl54_2
    | ~ spl54_6 ),
    inference(trivial_inequality_removal,[],[f862]) ).

fof(f864,plain,
    ( ssList(nil)
    | ~ spl54_2
    | ~ spl54_6
    | ~ spl54_9 ),
    inference(forward_subsumption_resolution,[],[f863,f693]) ).

fof(f865,plain,
    ( $false
    | ~ spl54_2
    | ~ spl54_6
    | ~ spl54_9
    | spl54_14 ),
    inference(forward_subsumption_resolution,[],[f864,f718]) ).

fof(f866,plain,
    ( ~ spl54_2
    | ~ spl54_6
    | ~ spl54_9
    | spl54_14 ),
    inference(avatar_contradiction_clause,[],[f865]) ).

fof(f916,plain,
    ( ssList(nil)
    | nil = sK49
    | ssList(sK49)
    | spl54_10 ),
    inference(resolution,[],[f541,f699]) ).

fof(f919,plain,
    ( nil = sK49
    | ssList(sK49)
    | spl54_10
    | spl54_14 ),
    inference(forward_subsumption_resolution,[],[f916,f718]) ).

fof(f920,plain,
    ( ssList(sK49)
    | spl54_2
    | spl54_10
    | spl54_14 ),
    inference(forward_subsumption_resolution,[],[f919,f653]) ).

fof(f921,plain,
    ( $false
    | spl54_2
    | spl54_10
    | spl54_14 ),
    inference(forward_subsumption_resolution,[],[f920,f629]) ).

fof(f922,plain,
    ( spl54_2
    | spl54_10
    | spl54_14 ),
    inference(avatar_contradiction_clause,[],[f921]) ).

fof(f929,plain,
    ( ssList(nil)
    | ~ spl54_3
    | ~ spl54_12 ),
    inference(resolution,[],[f752,f645]) ).

fof(f930,plain,
    ( $false
    | ~ spl54_3
    | ~ spl54_12
    | spl54_14 ),
    inference(forward_subsumption_resolution,[],[f929,f718]) ).

fof(f931,plain,
    ( ~ spl54_3
    | ~ spl54_12
    | spl54_14 ),
    inference(avatar_contradiction_clause,[],[f930]) ).

fof(f1208,plain,
    ( nil != sK50
    | ssList(sK53)
    | nil = app(sK52,sK49)
    | ssList(app(sK52,sK49))
    | ~ spl54_5 ),
    inference(superposition,[],[f621,f669]) ).

fof(f1233,definition,
    ( spl54_30
  <=> ssList(app(sK52,sK49)) ),
    introduced(definition,[new_symbols(definition,[spl54_30])],[avatar_definition]) ).

fof(f1235,plain,
    ( ssList(app(sK52,sK49))
    | ~ spl54_30 ),
    inference(avatar_component_clause,[],[f1233]) ).

fof(f1237,definition,
    ( spl54_31
  <=> nil = app(sK52,sK49) ),
    introduced(definition,[new_symbols(definition,[spl54_31])],[avatar_definition]) ).

fof(f1239,plain,
    ( nil = app(sK52,sK49)
    | ~ spl54_31 ),
    inference(avatar_component_clause,[],[f1237]) ).

fof(f1331,plain,
    ( nil != nil
    | ssList(sK49)
    | nil = sK49
    | ssList(sK52)
    | ~ spl54_31 ),
    inference(superposition,[],[f620,f1239]) ).

fof(f1333,plain,
    ( ssList(sK49)
    | nil = sK49
    | ssList(sK52)
    | ~ spl54_31 ),
    inference(trivial_inequality_removal,[],[f1331]) ).

fof(f1335,plain,
    ( nil = sK49
    | ssList(sK52)
    | ~ spl54_31 ),
    inference(forward_subsumption_resolution,[],[f1333,f629]) ).

fof(f1340,plain,
    ( ssList(sK52)
    | spl54_2
    | ~ spl54_31 ),
    inference(forward_subsumption_resolution,[],[f1335,f653]) ).

fof(f1345,plain,
    ( $false
    | spl54_2
    | spl54_8
    | ~ spl54_31 ),
    inference(forward_subsumption_resolution,[],[f1340,f687]) ).

fof(f1346,plain,
    ( spl54_2
    | spl54_8
    | ~ spl54_31 ),
    inference(avatar_contradiction_clause,[],[f1345]) ).

fof(f1349,plain,
    ( ssList(sK49)
    | ssList(sK52)
    | ~ spl54_30 ),
    inference(resolution,[],[f1235,f555]) ).

fof(f1350,plain,
    ( ssList(sK52)
    | ~ spl54_30 ),
    inference(forward_subsumption_resolution,[],[f1349,f629]) ).

fof(f1351,plain,
    ( $false
    | spl54_8
    | ~ spl54_30 ),
    inference(forward_subsumption_resolution,[],[f1350,f687]) ).

fof(f1352,plain,
    ( spl54_8
    | ~ spl54_30 ),
    inference(avatar_contradiction_clause,[],[f1351]) ).

fof(f1373,plain,
    ( nil != sK50
    | nil = app(sK52,sK49)
    | ssList(app(sK52,sK49))
    | ~ spl54_5
    | spl54_7 ),
    inference(forward_subsumption_resolution,[],[f1208,f679]) ).

fof(f1384,plain,
    ( spl54_30
    | spl54_31
    | ~ spl54_3
    | ~ spl54_5
    | spl54_7 ),
    inference(avatar_split_clause,[],[f1373,f677,f667,f657,f1237,f1233]) ).

fof(f2486,plain,
    ( segmentP(sK50,sK49)
    | ssList(sK49)
    | ssList(sK53)
    | ssList(sK52)
    | ssList(sK50)
    | ~ spl54_5 ),
    inference(superposition,[],[f481,f669]) ).

fof(f2494,plain,
    ( ssList(sK49)
    | ssList(sK53)
    | ssList(sK52)
    | ssList(sK50)
    | ~ spl54_5
    | spl54_11 ),
    inference(forward_subsumption_resolution,[],[f2486,f703]) ).

fof(f2500,plain,
    ( ssList(sK53)
    | ssList(sK52)
    | ssList(sK50)
    | ~ spl54_5
    | spl54_11 ),
    inference(forward_subsumption_resolution,[],[f2494,f629]) ).

fof(f2506,plain,
    ( ssList(sK52)
    | ssList(sK50)
    | ~ spl54_5
    | spl54_7
    | spl54_11 ),
    inference(forward_subsumption_resolution,[],[f2500,f679]) ).

fof(f2507,plain,
    ( ssList(sK50)
    | ~ spl54_5
    | spl54_7
    | spl54_8
    | spl54_11 ),
    inference(forward_subsumption_resolution,[],[f2506,f687]) ).

fof(f2508,plain,
    ( $false
    | ~ spl54_5
    | spl54_7
    | spl54_8
    | spl54_11 ),
    inference(forward_subsumption_resolution,[],[f2507,f630]) ).

fof(f2509,plain,
    ( ~ spl54_5
    | spl54_7
    | spl54_8
    | spl54_11 ),
    inference(avatar_contradiction_clause,[],[f2508]) ).

cnf(s6,plain,
    ( spl54_3
    | spl54_6 ),
    inference(sat_conversion,[],[f675]) ).

cnf(s8,plain,
    ( spl54_2
    | spl54_5 ),
    inference(sat_conversion,[],[f681]) ).

cnf(s10,plain,
    ( spl54_2
    | ~ spl54_7 ),
    inference(sat_conversion,[],[f683]) ).

cnf(s11,plain,
    ( spl54_2
    | ~ spl54_8 ),
    inference(sat_conversion,[],[f688]) ).

cnf(s13,plain,
    ( spl54_3
    | spl54_9 ),
    inference(sat_conversion,[],[f694]) ).

cnf(s15,plain,
    ( spl54_3
    | ~ spl54_10
    | ~ spl54_11 ),
    inference(sat_conversion,[],[f704]) ).

cnf(s17,plain,
    ( ~ spl54_2
    | spl54_12 ),
    inference(sat_conversion,[],[f710]) ).

cnf(s27,plain,
    ~ spl54_14,
    inference(sat_conversion,[],[f746]) ).

cnf(s33,plain,
    ( ~ spl54_2
    | ~ spl54_6
    | ~ spl54_9
    | spl54_14 ),
    inference(sat_conversion,[],[f866]) ).

cnf(s35,plain,
    ( spl54_2
    | spl54_10
    | spl54_14 ),
    inference(sat_conversion,[],[f922]) ).

cnf(s36,plain,
    ( ~ spl54_3
    | ~ spl54_12
    | spl54_14 ),
    inference(sat_conversion,[],[f931]) ).

cnf(s48,plain,
    ( spl54_2
    | spl54_8
    | ~ spl54_31 ),
    inference(sat_conversion,[],[f1346]) ).

cnf(s50,plain,
    ( spl54_8
    | ~ spl54_30 ),
    inference(sat_conversion,[],[f1352]) ).

cnf(s57,plain,
    ( ~ spl54_3
    | ~ spl54_5
    | spl54_7
    | spl54_30
    | spl54_31 ),
    inference(sat_conversion,[],[f1384]) ).

cnf(s119,plain,
    ( ~ spl54_5
    | spl54_7
    | spl54_8
    | spl54_11 ),
    inference(sat_conversion,[],[f2509]) ).

cnf(s129,plain,
    spl54_2,
    inference(rat,[],[s15,s57,s119,s48,s50,s8,s10,s11,s35,s27]) ).

cnf(s131,plain,
    spl54_12,
    inference(rat,[],[s17,s129]) ).

cnf(s133,plain,
    ~ spl54_3,
    inference(rat,[],[s36,s27,s131]) ).

cnf(s138,plain,
    spl54_9,
    inference(rat,[],[s13,s133]) ).

cnf(s141,plain,
    spl54_6,
    inference(rat,[],[s6,s133]) ).

cnf(s144,plain,
    $false,
    inference(rat,[],[s33,s27,s129,s138,s141]) ).

fof(f2510,plain,
    $false,
    inference(avatar_sat_refutation,[],[s144]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC109+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.36  % Computer : n003.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 28 07:55:58 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.41  Running first-order model finding
% 0.13/0.41  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.56/0.53  % (1416616)Will run a generic schedule for satisfiability detection.
% 0.56/0.53  % (1416623)% WARNING: option uhcvi not known.
% 0.56/0.53  % (1416625)dis+10_1_sil=32000:sp=arity:random_seed=3662156771:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.56/0.53  % (1416623)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2877810296:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.56/0.53  % (1416622)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3681413413_2999 on theBenchmark for (2999ds/0Mi)
% 0.56/0.53  % (1416626)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2496877247:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.56/0.53  % (1416627)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2220726352:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.56/0.53  % (1416628)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3055226255:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.56/0.53  % (1416624)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2834192638:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.56/0.53  % TRYING [1]
% 0.56/0.53  % TRYING [2]
% 0.56/0.53  % TRYING [3]
% 0.56/0.53  % (1416625)Instruction limit reached! 
% 0.56/0.53  % (1416625)------------------------------
% 0.56/0.53  % (1416625)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.53  % (1416625)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.53  % (1416625)CaDiCaL version: 2.1.3
% 0.56/0.53  % (1416625)Termination reason: Instruction limit
% 0.56/0.53  % (1416625)Termination phase: Saturation
% 0.56/0.53  % (1416625)Time elapsed: 0.054 s
% 0.56/0.53  % (1416625)Peak memory usage: 13 MB
% 0.56/0.53  % (1416625)Instructions burned: 103 (million)
% 0.56/0.53  % (1416638)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=588931948:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.56/0.53  % (1416623) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1416616-1416623"...
% 0.56/0.53  % TRYING [1]
% 0.56/0.53  % (1416623)...printing done.
% 0.56/0.53  % TRYING [4]
% 0.56/0.53  % TRYING [2]
% 0.56/0.53  % (1416623)Refutation found. Thanks to Tanya!
% 0.56/0.53  % SZS status Theorem for theBenchmark
% 0.56/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.54  % (1416623)------------------------------
% 0.56/0.54  % (1416623)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.56/0.54  % (1416623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.56/0.54  % (1416623)CaDiCaL version: 2.1.3
% 0.56/0.54  % (1416623)Termination reason: Refutation
% 0.56/0.54  % (1416623)Time elapsed: 0.080 s
% 0.56/0.54  % (1416623)Peak memory usage: 13 MB
% 0.56/0.54  % (1416623)Instructions burned: 77 (million)
% 0.56/0.54  % (1416616)Success in time 0.111 s
% 0.56/0.54  % Vampire exiting
%------------------------------------------------------------------------------