↑ 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  : SWC389+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 : n005.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:05:50 PM UTC 2026

% Result   : Theorem 0.18s 0.31s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   19
% Syntax   : Number of formulae    :  124 (  15 unt;  12 def)
%            Number of atoms       :  385 (  55 equ)
%            Maximal formula atoms :   22 (   3 avg)
%            Number of connectives :  453 ( 192   ~; 190   |;  33   &)
%                                         (  20 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   21 (  19 usr;  13 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   68 (   0 sgn  51   !;  17   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( singletonP(X0)
      <=> ? [X1] :
            ( ssItem(X1)
            & cons(X1,nil) = X0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).

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(f58,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( segmentP(nil,X0)
      <=> nil = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).

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

fof(f100,plain,
    ! [X0] :
      ( ( singletonP(X0)
      <=> ? [X1] :
            ( ssItem(X1)
            & cons(X1,nil) = X0 ) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f4]) ).

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(f176,plain,
    ! [X0] :
      ( ( segmentP(nil,X0)
      <=> nil = X0 )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f58]) ).

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

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

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(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] :
      ( cons(X1,X0) != X0
      | ~ ssItem(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f120]) ).

fof(f359,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | nil != X0
      | segmentP(nil,X0) ),
    inference(cnf_transformation,[],[f176]) ).

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(f418,plain,
    ( nil = sK49
    | sK49 = cons(sK51,nil) ),
    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(f423,plain,
    ( nil = sK49
    | ssItem(sK51) ),
    inference(cnf_transformation,[],[f221]) ).

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

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

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

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

fof(f428,plain,
    ssList(sK50),
    inference(cnf_transformation,[],[f221]) ).

fof(f429,plain,
    ssList(sK49),
    inference(cnf_transformation,[],[f221]) ).

fof(f434,plain,
    ( neq(sK50,nil)
    | ~ segmentP(sK50,sK49) ),
    inference(definition_unfolding,[],[f425,f427,f427,f426]) ).

fof(f435,plain,
    ( ~ singletonP(sK49)
    | ~ segmentP(sK50,sK49) ),
    inference(definition_unfolding,[],[f424,f426,f427,f426]) ).

fof(f438,plain,
    ! [X1] :
      ( ~ ssList(cons(X1,nil))
      | ~ ssItem(X1)
      | singletonP(cons(X1,nil)) ),
    inference(equality_resolution,[],[f233]) ).

fof(f441,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(f450,plain,
    ! [X1] :
      ( ~ ssList(X1)
      | ~ ssList(X1)
      | ~ neq(X1,X1) ),
    inference(equality_resolution,[],[f303]) ).

fof(f455,plain,
    ( ~ ssList(nil)
    | segmentP(nil,nil) ),
    inference(equality_resolution,[],[f359]) ).

fof(f463,plain,
    ! [X1] :
      ( ~ singletonP(cons(X1,nil))
      | ~ ssItem(X1)
      | ~ ssList(cons(X1,nil)) ),
    inference(consistent_polarity_flipping,[],[f438]) ).

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

fof(f525,plain,
    ( ~ neq(sK50,nil)
    | ~ segmentP(sK50,sK49) ),
    inference(consistent_polarity_flipping,[],[f434]) ).

fof(f526,plain,
    ( singletonP(sK49)
    | ~ segmentP(sK50,sK49) ),
    inference(consistent_polarity_flipping,[],[f435]) ).

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

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

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

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

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

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

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

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

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

fof(f561,plain,
    ( spl54_6
    | spl54_3 ),
    inference(avatar_split_clause,[],[f415,f543,f558]) ).

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

fof(f565,plain,
    ( ssList(sK53)
    | ~ spl54_7 ),
    inference(avatar_component_clause,[],[f563]) ).

fof(f567,plain,
    ( spl54_5
    | spl54_2 ),
    inference(avatar_split_clause,[],[f417,f538,f553]) ).

fof(f568,plain,
    ( spl54_6
    | spl54_2 ),
    inference(avatar_split_clause,[],[f418,f538,f558]) ).

fof(f569,plain,
    ( spl54_7
    | spl54_2 ),
    inference(avatar_split_clause,[],[f419,f538,f563]) ).

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

fof(f573,plain,
    ( ssList(sK52)
    | ~ spl54_8 ),
    inference(avatar_component_clause,[],[f571]) ).

fof(f574,plain,
    ( spl54_8
    | spl54_2 ),
    inference(avatar_split_clause,[],[f420,f538,f571]) ).

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

fof(f579,plain,
    ( ssItem(sK51)
    | ~ spl54_9 ),
    inference(avatar_component_clause,[],[f577]) ).

fof(f580,plain,
    ( spl54_9
    | spl54_3 ),
    inference(avatar_split_clause,[],[f422,f543,f577]) ).

fof(f581,plain,
    ( spl54_9
    | spl54_2 ),
    inference(avatar_split_clause,[],[f423,f538,f577]) ).

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

fof(f585,plain,
    ( ~ segmentP(sK50,sK49)
    | spl54_10 ),
    inference(avatar_component_clause,[],[f583]) ).

fof(f587,definition,
    ( spl54_11
  <=> singletonP(sK49) ),
    introduced(definition,[new_symbols(definition,[spl54_11])],[avatar_definition]) ).

fof(f590,plain,
    ( ~ spl54_10
    | spl54_11 ),
    inference(avatar_split_clause,[],[f526,f587,f583]) ).

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

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

fof(f595,plain,
    ( ~ spl54_10
    | ~ spl54_12 ),
    inference(avatar_split_clause,[],[f525,f592,f583]) ).

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

fof(f602,plain,
    ( ssList(nil)
    | ~ spl54_14 ),
    inference(avatar_component_clause,[],[f601]) ).

fof(f616,definition,
    ( spl54_17
  <=> segmentP(nil,nil) ),
    introduced(definition,[new_symbols(definition,[spl54_17])],[avatar_definition]) ).

fof(f619,plain,
    ( spl54_17
    | ~ spl54_14 ),
    inference(avatar_split_clause,[],[f455,f601,f616]) ).

fof(f630,plain,
    spl54_14,
    inference(avatar_split_clause,[],[f305,f601]) ).

fof(f635,plain,
    ( ~ segmentP(sK50,nil)
    | ~ spl54_2
    | spl54_10 ),
    inference(forward_demodulation,[],[f585,f540]) ).

fof(f636,plain,
    ( ~ segmentP(nil,nil)
    | ~ spl54_2
    | ~ spl54_3
    | spl54_10 ),
    inference(forward_demodulation,[],[f635,f545]) ).

fof(f637,plain,
    ( ~ spl54_17
    | ~ spl54_2
    | ~ spl54_3
    | spl54_10 ),
    inference(avatar_split_clause,[],[f636,f583,f543,f538,f616]) ).

fof(f640,plain,
    ( ~ neq(nil,nil)
    | ~ spl54_3
    | spl54_12 ),
    inference(forward_demodulation,[],[f594,f545]) ).

fof(f643,plain,
    ( ~ ssList(nil)
    | ~ spl54_3
    | spl54_12 ),
    inference(resolution,[],[f531,f640]) ).

fof(f644,plain,
    ( $false
    | ~ spl54_3
    | spl54_12
    | ~ spl54_14 ),
    inference(forward_subsumption_resolution,[],[f643,f602]) ).

fof(f645,plain,
    ( ~ spl54_3
    | spl54_12
    | ~ spl54_14 ),
    inference(avatar_contradiction_clause,[],[f644]) ).

fof(f647,plain,
    ( nil = cons(sK51,nil)
    | ~ spl54_2
    | ~ spl54_6 ),
    inference(forward_demodulation,[],[f560,f540]) ).

fof(f732,plain,
    ( nil != nil
    | ~ ssItem(sK51)
    | ~ ssList(nil)
    | ~ spl54_2
    | ~ spl54_6 ),
    inference(superposition,[],[f306,f647]) ).

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

fof(f734,plain,
    ( ~ ssList(nil)
    | ~ spl54_2
    | ~ spl54_6
    | ~ spl54_9 ),
    inference(forward_subsumption_resolution,[],[f733,f579]) ).

fof(f735,plain,
    ( $false
    | ~ spl54_2
    | ~ spl54_6
    | ~ spl54_9
    | ~ spl54_14 ),
    inference(forward_subsumption_resolution,[],[f734,f602]) ).

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

fof(f886,plain,
    ( ~ singletonP(sK49)
    | ~ ssItem(sK51)
    | ~ ssList(sK49)
    | ~ spl54_6 ),
    inference(superposition,[],[f463,f560]) ).

fof(f891,plain,
    ( ~ singletonP(sK49)
    | ~ ssList(sK49)
    | ~ spl54_6
    | ~ spl54_9 ),
    inference(forward_subsumption_resolution,[],[f886,f579]) ).

fof(f892,plain,
    ( ~ singletonP(sK49)
    | ~ spl54_6
    | ~ spl54_9 ),
    inference(forward_subsumption_resolution,[],[f891,f429]) ).

fof(f893,plain,
    ( ~ spl54_11
    | ~ spl54_6
    | ~ spl54_9 ),
    inference(avatar_split_clause,[],[f892,f577,f558,f587]) ).

fof(f2168,plain,
    ( ~ ssList(sK50)
    | ~ ssList(sK49)
    | ~ ssList(sK53)
    | ~ ssList(sK52)
    | segmentP(sK50,sK49)
    | ~ spl54_5 ),
    inference(superposition,[],[f441,f555]) ).

fof(f2171,plain,
    ( ~ ssList(sK49)
    | ~ ssList(sK53)
    | ~ ssList(sK52)
    | segmentP(sK50,sK49)
    | ~ spl54_5 ),
    inference(forward_subsumption_resolution,[],[f2168,f428]) ).

fof(f2178,plain,
    ( ~ ssList(sK53)
    | ~ ssList(sK52)
    | segmentP(sK50,sK49)
    | ~ spl54_5 ),
    inference(forward_subsumption_resolution,[],[f2171,f429]) ).

fof(f2184,plain,
    ( ~ ssList(sK52)
    | segmentP(sK50,sK49)
    | ~ spl54_5
    | ~ spl54_7 ),
    inference(forward_subsumption_resolution,[],[f2178,f565]) ).

fof(f2187,plain,
    ( segmentP(sK50,sK49)
    | ~ spl54_5
    | ~ spl54_7
    | ~ spl54_8 ),
    inference(forward_subsumption_resolution,[],[f2184,f573]) ).

fof(f2189,plain,
    ( $false
    | ~ spl54_5
    | ~ spl54_7
    | ~ spl54_8
    | spl54_10 ),
    inference(forward_subsumption_resolution,[],[f2187,f585]) ).

fof(f2190,plain,
    ( ~ spl54_5
    | ~ spl54_7
    | ~ spl54_8
    | spl54_10 ),
    inference(avatar_contradiction_clause,[],[f2189]) ).

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

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

cnf(s9,plain,
    ( spl54_2
    | spl54_6 ),
    inference(sat_conversion,[],[f568]) ).

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

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

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

cnf(s14,plain,
    ( spl54_2
    | spl54_9 ),
    inference(sat_conversion,[],[f581]) ).

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

cnf(s16,plain,
    ( ~ spl54_10
    | ~ spl54_12 ),
    inference(sat_conversion,[],[f595]) ).

cnf(s22,plain,
    ( ~ spl54_14
    | spl54_17 ),
    inference(sat_conversion,[],[f619]) ).

cnf(s25,plain,
    spl54_14,
    inference(sat_conversion,[],[f630]) ).

cnf(s28,plain,
    ( ~ spl54_2
    | ~ spl54_3
    | spl54_10
    | ~ spl54_17 ),
    inference(sat_conversion,[],[f637]) ).

cnf(s30,plain,
    ( ~ spl54_3
    | spl54_12
    | ~ spl54_14 ),
    inference(sat_conversion,[],[f645]) ).

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

cnf(s36,plain,
    ( ~ spl54_6
    | ~ spl54_9
    | ~ spl54_11 ),
    inference(sat_conversion,[],[f893]) ).

cnf(s95,plain,
    ( ~ spl54_5
    | ~ spl54_7
    | ~ spl54_8
    | spl54_10 ),
    inference(sat_conversion,[],[f2190]) ).

cnf(s98,plain,
    spl54_17,
    inference(rat,[],[s22,s25]) ).

cnf(s101,plain,
    spl54_2,
    inference(rat,[],[s15,s95,s36,s8,s9,s10,s11,s14]) ).

cnf(s102,plain,
    ~ spl54_3,
    inference(rat,[],[s16,s28,s30,s101,s98,s25]) ).

cnf(s104,plain,
    spl54_9,
    inference(rat,[],[s13,s102]) ).

cnf(s107,plain,
    spl54_6,
    inference(rat,[],[s6,s102]) ).

cnf(s110,plain,
    $false,
    inference(rat,[],[s31,s25,s101,s104,s107]) ).

fof(f2191,plain,
    $false,
    inference(avatar_sat_refutation,[],[s110]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC389+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19  % Computer : n005.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Mon Sep 28 09:25:32 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22  Running first-order model finding
% 0.07/0.22  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.18/0.31  % (664072)Will run a generic schedule for satisfiability detection.
% 0.18/0.31  % (664080)dis+10_1_sil=32000:sp=arity:random_seed=1935709744:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.31  % (664078)% WARNING: option uhcvi not known.
% 0.18/0.31  % (664077)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2293534201_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.31  % (664078)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1795080347:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.31  % (664079)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3632254770:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.31  % (664081)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3812163304:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.31  % (664082)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3509091151:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.31  % (664083)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2181868658:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.31  % TRYING [1]
% 0.18/0.31  % TRYING [2]
% 0.18/0.31  % TRYING [3]
% 0.18/0.31  % (664080)Instruction limit reached! 
% 0.18/0.31  % (664080)------------------------------
% 0.18/0.31  % (664080)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.31  % (664080)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.31  % (664080)CaDiCaL version: 2.1.3
% 0.18/0.31  % (664080)Termination reason: Instruction limit
% 0.18/0.31  % (664080)Termination phase: Saturation
% 0.18/0.31  % (664080)Time elapsed: 0.034 s
% 0.18/0.31  % (664080)Peak memory usage: 13 MB
% 0.18/0.31  % (664080)Instructions burned: 106 (million)
% 0.18/0.31  % (664091)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2600553453:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.18/0.31  % TRYING [4]
% 0.18/0.31  % (664078) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-664072-664078"...
% 0.18/0.31  % (664078)...printing done.
% 0.18/0.31  % TRYING [1]
% 0.18/0.31  % TRYING [2]
% 0.18/0.31  % (664078)Refutation found. Thanks to Tanya!
% 0.18/0.31  % SZS status Theorem for theBenchmark
% 0.18/0.31  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.31  % (664078)------------------------------
% 0.18/0.31  % (664078)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.31  % (664078)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.31  % (664078)CaDiCaL version: 2.1.3
% 0.18/0.31  % (664078)Termination reason: Refutation
% 0.18/0.31  % (664078)Time elapsed: 0.044 s
% 0.18/0.31  % (664078)Peak memory usage: 14 MB
% 0.18/0.31  % (664078)Instructions burned: 67 (million)
% 0.18/0.31  % (664072)Success in time 0.084 s
% 0.18/0.31  % Vampire exiting
%------------------------------------------------------------------------------