TSTP Solution File: SET795+4 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET795+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n024.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 18:25:40 EDT 2022

% Result   : Theorem 0.11s 0.46s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   80 (   6 unt;   0 def)
%            Number of atoms       :  347 (  33 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  401 ( 134   ~; 131   |;  95   &)
%                                         (  13 <=>;  28  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   5 prp; 0-4 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-4 aty)
%            Number of variables   :  195 ( 172   !;  23   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f517,plain,
    $false,
    inference(avatar_sat_refutation,[],[f355,f367,f368,f377,f516]) ).

fof(f516,plain,
    ( ~ spl9_1
    | ~ spl9_8 ),
    inference(avatar_contradiction_clause,[],[f515]) ).

fof(f515,plain,
    ( $false
    | ~ spl9_1
    | ~ spl9_8 ),
    inference(subsumption_resolution,[],[f514,f133]) ).

fof(f133,plain,
    ! [X2,X1] : member(X1,unordered_pair(X2,X1)),
    inference(equality_resolution,[],[f121]) ).

fof(f121,plain,
    ! [X2,X0,X1] :
      ( member(X0,unordered_pair(X2,X1))
      | X0 != X1 ),
    inference(cnf_transformation,[],[f80]) ).

fof(f80,plain,
    ! [X0,X1,X2] :
      ( ( X0 = X1
        | X0 = X2
        | ~ member(X0,unordered_pair(X2,X1)) )
      & ( member(X0,unordered_pair(X2,X1))
        | ( X0 != X1
          & X0 != X2 ) ) ),
    inference(rectify,[],[f79]) ).

fof(f79,plain,
    ! [X1,X2,X0] :
      ( ( X1 = X2
        | X0 = X1
        | ~ member(X1,unordered_pair(X0,X2)) )
      & ( member(X1,unordered_pair(X0,X2))
        | ( X1 != X2
          & X0 != X1 ) ) ),
    inference(flattening,[],[f78]) ).

fof(f78,plain,
    ! [X1,X2,X0] :
      ( ( X1 = X2
        | X0 = X1
        | ~ member(X1,unordered_pair(X0,X2)) )
      & ( member(X1,unordered_pair(X0,X2))
        | ( X1 != X2
          & X0 != X1 ) ) ),
    inference(nnf_transformation,[],[f38]) ).

fof(f38,plain,
    ! [X1,X2,X0] :
      ( ( X1 = X2
        | X0 = X1 )
    <=> member(X1,unordered_pair(X0,X2)) ),
    inference(rectify,[],[f9]) ).

fof(f9,axiom,
    ! [X0,X2,X1] :
      ( ( X1 = X2
        | X0 = X2 )
    <=> member(X2,unordered_pair(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair) ).

fof(f514,plain,
    ( ~ member(sK2,unordered_pair(sK4,sK2))
    | ~ spl9_1
    | ~ spl9_8 ),
    inference(subsumption_resolution,[],[f513,f169]) ).

fof(f169,plain,
    ( upper_bound(sK2,sK3,unordered_pair(sK4,sK2))
    | ~ spl9_1 ),
    inference(avatar_component_clause,[],[f168]) ).

fof(f168,plain,
    ( spl9_1
  <=> upper_bound(sK2,sK3,unordered_pair(sK4,sK2)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).

fof(f513,plain,
    ( ~ upper_bound(sK2,sK3,unordered_pair(sK4,sK2))
    | ~ member(sK2,unordered_pair(sK4,sK2))
    | ~ spl9_8 ),
    inference(subsumption_resolution,[],[f503,f107]) ).

fof(f107,plain,
    ~ least_upper_bound(sK2,unordered_pair(sK4,sK2),sK3,sK5),
    inference(cnf_transformation,[],[f67]) ).

fof(f67,plain,
    ( ~ least_upper_bound(sK2,unordered_pair(sK4,sK2),sK3,sK5)
    & order(sK3,sK5)
    & member(sK4,sK5)
    & apply(sK3,sK4,sK2)
    & member(sK2,sK5) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f65,f66]) ).

fof(f66,plain,
    ( ? [X0,X1,X2,X3] :
        ( ~ least_upper_bound(X0,unordered_pair(X2,X0),X1,X3)
        & order(X1,X3)
        & member(X2,X3)
        & apply(X1,X2,X0)
        & member(X0,X3) )
   => ( ~ least_upper_bound(sK2,unordered_pair(sK4,sK2),sK3,sK5)
      & order(sK3,sK5)
      & member(sK4,sK5)
      & apply(sK3,sK4,sK2)
      & member(sK2,sK5) ) ),
    introduced(choice_axiom,[]) ).

fof(f65,plain,
    ? [X0,X1,X2,X3] :
      ( ~ least_upper_bound(X0,unordered_pair(X2,X0),X1,X3)
      & order(X1,X3)
      & member(X2,X3)
      & apply(X1,X2,X0)
      & member(X0,X3) ),
    inference(rectify,[],[f53]) ).

fof(f53,plain,
    ? [X2,X1,X3,X0] :
      ( ~ least_upper_bound(X2,unordered_pair(X3,X2),X1,X0)
      & order(X1,X0)
      & member(X3,X0)
      & apply(X1,X3,X2)
      & member(X2,X0) ),
    inference(flattening,[],[f52]) ).

fof(f52,plain,
    ? [X2,X0,X1,X3] :
      ( ~ least_upper_bound(X2,unordered_pair(X3,X2),X1,X0)
      & apply(X1,X3,X2)
      & member(X2,X0)
      & member(X3,X0)
      & order(X1,X0) ),
    inference(ennf_transformation,[],[f25]) ).

fof(f25,plain,
    ~ ! [X2,X0,X1,X3] :
        ( ( apply(X1,X3,X2)
          & member(X2,X0)
          & member(X3,X0)
          & order(X1,X0) )
       => least_upper_bound(X2,unordered_pair(X3,X2),X1,X0) ),
    inference(rectify,[],[f23]) ).

fof(f23,negated_conjecture,
    ~ ! [X3,X5,X1,X0] :
        ( ( member(X0,X3)
          & apply(X5,X0,X1)
          & member(X1,X3)
          & order(X5,X3) )
       => least_upper_bound(X1,unordered_pair(X0,X1),X5,X3) ),
    inference(negated_conjecture,[],[f22]) ).

fof(f22,conjecture,
    ! [X3,X5,X1,X0] :
      ( ( member(X0,X3)
        & apply(X5,X0,X1)
        & member(X1,X3)
        & order(X5,X3) )
     => least_upper_bound(X1,unordered_pair(X0,X1),X5,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV7) ).

fof(f503,plain,
    ( least_upper_bound(sK2,unordered_pair(sK4,sK2),sK3,sK5)
    | ~ member(sK2,unordered_pair(sK4,sK2))
    | ~ upper_bound(sK2,sK3,unordered_pair(sK4,sK2))
    | ~ spl9_8 ),
    inference(duplicate_literal_removal,[],[f499]) ).

fof(f499,plain,
    ( ~ upper_bound(sK2,sK3,unordered_pair(sK4,sK2))
    | ~ member(sK2,unordered_pair(sK4,sK2))
    | ~ member(sK2,unordered_pair(sK4,sK2))
    | least_upper_bound(sK2,unordered_pair(sK4,sK2),sK3,sK5)
    | ~ spl9_8 ),
    inference(resolution,[],[f411,f97]) ).

fof(f97,plain,
    ! [X2,X3,X0,X1] :
      ( ~ apply(X1,X2,sK1(X0,X1,X2,X3))
      | least_upper_bound(X2,X3,X1,X0)
      | ~ upper_bound(X2,X1,X3)
      | ~ member(X2,X3) ),
    inference(cnf_transformation,[],[f62]) ).

fof(f62,plain,
    ! [X0,X1,X2,X3] :
      ( ~ member(X2,X3)
      | ~ upper_bound(X2,X1,X3)
      | ( upper_bound(sK1(X0,X1,X2,X3),X1,X3)
        & ~ apply(X1,X2,sK1(X0,X1,X2,X3))
        & member(sK1(X0,X1,X2,X3),X0) )
      | least_upper_bound(X2,X3,X1,X0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f60,f61]) ).

fof(f61,plain,
    ! [X0,X1,X2,X3] :
      ( ? [X4] :
          ( upper_bound(X4,X1,X3)
          & ~ apply(X1,X2,X4)
          & member(X4,X0) )
     => ( upper_bound(sK1(X0,X1,X2,X3),X1,X3)
        & ~ apply(X1,X2,sK1(X0,X1,X2,X3))
        & member(sK1(X0,X1,X2,X3),X0) ) ),
    introduced(choice_axiom,[]) ).

fof(f60,plain,
    ! [X0,X1,X2,X3] :
      ( ~ member(X2,X3)
      | ~ upper_bound(X2,X1,X3)
      | ? [X4] :
          ( upper_bound(X4,X1,X3)
          & ~ apply(X1,X2,X4)
          & member(X4,X0) )
      | least_upper_bound(X2,X3,X1,X0) ),
    inference(rectify,[],[f49]) ).

fof(f49,plain,
    ! [X2,X3,X0,X1] :
      ( ~ member(X0,X1)
      | ~ upper_bound(X0,X3,X1)
      | ? [X4] :
          ( upper_bound(X4,X3,X1)
          & ~ apply(X3,X0,X4)
          & member(X4,X2) )
      | least_upper_bound(X0,X1,X3,X2) ),
    inference(flattening,[],[f48]) ).

fof(f48,plain,
    ! [X2,X1,X3,X0] :
      ( least_upper_bound(X0,X1,X3,X2)
      | ~ upper_bound(X0,X3,X1)
      | ? [X4] :
          ( ~ apply(X3,X0,X4)
          & member(X4,X2)
          & upper_bound(X4,X3,X1) )
      | ~ member(X0,X1) ),
    inference(ennf_transformation,[],[f45]) ).

fof(f45,plain,
    ! [X2,X1,X3,X0] :
      ( ( upper_bound(X0,X3,X1)
        & ! [X4] :
            ( ( member(X4,X2)
              & upper_bound(X4,X3,X1) )
           => apply(X3,X0,X4) )
        & member(X0,X1) )
     => least_upper_bound(X0,X1,X3,X2) ),
    inference(unused_predicate_definition_removal,[],[f30]) ).

fof(f30,plain,
    ! [X2,X1,X3,X0] :
      ( ( upper_bound(X0,X3,X1)
        & ! [X4] :
            ( ( member(X4,X2)
              & upper_bound(X4,X3,X1) )
           => apply(X3,X0,X4) )
        & member(X0,X1) )
    <=> least_upper_bound(X0,X1,X3,X2) ),
    inference(rectify,[],[f20]) ).

fof(f20,axiom,
    ! [X0,X2,X3,X5] :
      ( ( member(X0,X2)
        & ! [X7] :
            ( ( upper_bound(X7,X5,X2)
              & member(X7,X3) )
           => apply(X5,X0,X7) )
        & upper_bound(X0,X5,X2) )
    <=> least_upper_bound(X0,X2,X5,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',least_upper_bound) ).

fof(f411,plain,
    ( ! [X0] :
        ( apply(sK3,X0,sK1(sK5,sK3,sK2,unordered_pair(sK4,sK2)))
        | ~ member(X0,unordered_pair(sK4,sK2)) )
    | ~ spl9_8 ),
    inference(resolution,[],[f354,f123]) ).

fof(f123,plain,
    ! [X2,X0,X1,X4] :
      ( ~ upper_bound(X1,X2,X0)
      | apply(X2,X4,X1)
      | ~ member(X4,X0) ),
    inference(cnf_transformation,[],[f84]) ).

fof(f84,plain,
    ! [X0,X1,X2] :
      ( ( upper_bound(X1,X2,X0)
        | ( member(sK7(X0,X1,X2),X0)
          & ~ apply(X2,sK7(X0,X1,X2),X1) ) )
      & ( ! [X4] :
            ( ~ member(X4,X0)
            | apply(X2,X4,X1) )
        | ~ upper_bound(X1,X2,X0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f82,f83]) ).

fof(f83,plain,
    ! [X0,X1,X2] :
      ( ? [X3] :
          ( member(X3,X0)
          & ~ apply(X2,X3,X1) )
     => ( member(sK7(X0,X1,X2),X0)
        & ~ apply(X2,sK7(X0,X1,X2),X1) ) ),
    introduced(choice_axiom,[]) ).

fof(f82,plain,
    ! [X0,X1,X2] :
      ( ( upper_bound(X1,X2,X0)
        | ? [X3] :
            ( member(X3,X0)
            & ~ apply(X2,X3,X1) ) )
      & ( ! [X4] :
            ( ~ member(X4,X0)
            | apply(X2,X4,X1) )
        | ~ upper_bound(X1,X2,X0) ) ),
    inference(rectify,[],[f81]) ).

fof(f81,plain,
    ! [X0,X2,X1] :
      ( ( upper_bound(X2,X1,X0)
        | ? [X3] :
            ( member(X3,X0)
            & ~ apply(X1,X3,X2) ) )
      & ( ! [X3] :
            ( ~ member(X3,X0)
            | apply(X1,X3,X2) )
        | ~ upper_bound(X2,X1,X0) ) ),
    inference(nnf_transformation,[],[f55]) ).

fof(f55,plain,
    ! [X0,X2,X1] :
      ( upper_bound(X2,X1,X0)
    <=> ! [X3] :
          ( ~ member(X3,X0)
          | apply(X1,X3,X2) ) ),
    inference(ennf_transformation,[],[f37]) ).

fof(f37,plain,
    ! [X2,X0,X1] :
      ( ! [X3] :
          ( member(X3,X0)
         => apply(X1,X3,X2) )
    <=> upper_bound(X2,X1,X0) ),
    inference(rectify,[],[f14]) ).

fof(f14,axiom,
    ! [X3,X5,X7] :
      ( ! [X2] :
          ( member(X2,X3)
         => apply(X5,X2,X7) )
    <=> upper_bound(X7,X5,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',upper_bound) ).

fof(f354,plain,
    ( upper_bound(sK1(sK5,sK3,sK2,unordered_pair(sK4,sK2)),sK3,unordered_pair(sK4,sK2))
    | ~ spl9_8 ),
    inference(avatar_component_clause,[],[f352]) ).

fof(f352,plain,
    ( spl9_8
  <=> upper_bound(sK1(sK5,sK3,sK2,unordered_pair(sK4,sK2)),sK3,unordered_pair(sK4,sK2)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_8])]) ).

fof(f377,plain,
    ( spl9_1
    | ~ spl9_7 ),
    inference(avatar_contradiction_clause,[],[f376]) ).

fof(f376,plain,
    ( $false
    | spl9_1
    | ~ spl9_7 ),
    inference(subsumption_resolution,[],[f375,f103]) ).

fof(f103,plain,
    member(sK2,sK5),
    inference(cnf_transformation,[],[f67]) ).

fof(f375,plain,
    ( ~ member(sK2,sK5)
    | spl9_1
    | ~ spl9_7 ),
    inference(resolution,[],[f374,f106]) ).

fof(f106,plain,
    order(sK3,sK5),
    inference(cnf_transformation,[],[f67]) ).

fof(f374,plain,
    ( ! [X0] :
        ( ~ order(sK3,X0)
        | ~ member(sK2,X0) )
    | spl9_1
    | ~ spl9_7 ),
    inference(resolution,[],[f373,f119]) ).

fof(f119,plain,
    ! [X2,X0,X1] :
      ( apply(X0,X2,X2)
      | ~ member(X2,X1)
      | ~ order(X0,X1) ),
    inference(cnf_transformation,[],[f77]) ).

fof(f77,plain,
    ! [X0,X1] :
      ( ~ order(X0,X1)
      | ( ! [X2] :
            ( ~ member(X2,X1)
            | apply(X0,X2,X2) )
        & ! [X3,X4] :
            ( X3 = X4
            | ~ apply(X0,X3,X4)
            | ~ apply(X0,X4,X3)
            | ~ member(X4,X1)
            | ~ member(X3,X1) )
        & ! [X5,X6,X7] :
            ( ~ member(X7,X1)
            | ~ apply(X0,X7,X6)
            | ~ member(X5,X1)
            | apply(X0,X7,X5)
            | ~ apply(X0,X6,X5)
            | ~ member(X6,X1) ) ) ),
    inference(rectify,[],[f51]) ).

fof(f51,plain,
    ! [X0,X1] :
      ( ~ order(X0,X1)
      | ( ! [X7] :
            ( ~ member(X7,X1)
            | apply(X0,X7,X7) )
        & ! [X2,X3] :
            ( X2 = X3
            | ~ apply(X0,X2,X3)
            | ~ apply(X0,X3,X2)
            | ~ member(X3,X1)
            | ~ member(X2,X1) )
        & ! [X5,X6,X4] :
            ( ~ member(X4,X1)
            | ~ apply(X0,X4,X6)
            | ~ member(X5,X1)
            | apply(X0,X4,X5)
            | ~ apply(X0,X6,X5)
            | ~ member(X6,X1) ) ) ),
    inference(flattening,[],[f50]) ).

fof(f50,plain,
    ! [X1,X0] :
      ( ( ! [X7] :
            ( ~ member(X7,X1)
            | apply(X0,X7,X7) )
        & ! [X2,X3] :
            ( X2 = X3
            | ~ apply(X0,X2,X3)
            | ~ apply(X0,X3,X2)
            | ~ member(X3,X1)
            | ~ member(X2,X1) )
        & ! [X4,X5,X6] :
            ( apply(X0,X4,X5)
            | ~ apply(X0,X6,X5)
            | ~ apply(X0,X4,X6)
            | ~ member(X6,X1)
            | ~ member(X4,X1)
            | ~ member(X5,X1) ) )
      | ~ order(X0,X1) ),
    inference(ennf_transformation,[],[f46]) ).

fof(f46,plain,
    ! [X1,X0] :
      ( order(X0,X1)
     => ( ! [X7] :
            ( member(X7,X1)
           => apply(X0,X7,X7) )
        & ! [X2,X3] :
            ( ( member(X3,X1)
              & member(X2,X1) )
           => ( ( apply(X0,X2,X3)
                & apply(X0,X3,X2) )
             => X2 = X3 ) )
        & ! [X4,X5,X6] :
            ( ( member(X6,X1)
              & member(X4,X1)
              & member(X5,X1) )
           => ( ( apply(X0,X6,X5)
                & apply(X0,X4,X6) )
             => apply(X0,X4,X5) ) ) ) ),
    inference(unused_predicate_definition_removal,[],[f33]) ).

fof(f33,plain,
    ! [X1,X0] :
      ( order(X0,X1)
    <=> ( ! [X7] :
            ( member(X7,X1)
           => apply(X0,X7,X7) )
        & ! [X2,X3] :
            ( ( member(X3,X1)
              & member(X2,X1) )
           => ( ( apply(X0,X2,X3)
                & apply(X0,X3,X2) )
             => X2 = X3 ) )
        & ! [X4,X5,X6] :
            ( ( member(X6,X1)
              & member(X4,X1)
              & member(X5,X1) )
           => ( ( apply(X0,X6,X5)
                & apply(X0,X4,X6) )
             => apply(X0,X4,X5) ) ) ) ),
    inference(rectify,[],[f12]) ).

fof(f12,axiom,
    ! [X5,X3] :
      ( ( ! [X4,X2] :
            ( ( member(X4,X3)
              & member(X2,X3) )
           => ( ( apply(X5,X2,X4)
                & apply(X5,X4,X2) )
             => X2 = X4 ) )
        & ! [X2,X6,X4] :
            ( ( member(X2,X3)
              & member(X6,X3)
              & member(X4,X3) )
           => ( ( apply(X5,X2,X4)
                & apply(X5,X4,X6) )
             => apply(X5,X2,X6) ) )
        & ! [X2] :
            ( member(X2,X3)
           => apply(X5,X2,X2) ) )
    <=> order(X5,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).

fof(f373,plain,
    ( ~ apply(sK3,sK2,sK2)
    | spl9_1
    | ~ spl9_7 ),
    inference(subsumption_resolution,[],[f371,f170]) ).

fof(f170,plain,
    ( ~ upper_bound(sK2,sK3,unordered_pair(sK4,sK2))
    | spl9_1 ),
    inference(avatar_component_clause,[],[f168]) ).

fof(f371,plain,
    ( ~ apply(sK3,sK2,sK2)
    | upper_bound(sK2,sK3,unordered_pair(sK4,sK2))
    | ~ spl9_7 ),
    inference(superposition,[],[f124,f348]) ).

fof(f348,plain,
    ( sK2 = sK7(unordered_pair(sK4,sK2),sK2,sK3)
    | ~ spl9_7 ),
    inference(avatar_component_clause,[],[f346]) ).

fof(f346,plain,
    ( spl9_7
  <=> sK2 = sK7(unordered_pair(sK4,sK2),sK2,sK3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_7])]) ).

fof(f124,plain,
    ! [X2,X0,X1] :
      ( ~ apply(X2,sK7(X0,X1,X2),X1)
      | upper_bound(X1,X2,X0) ),
    inference(cnf_transformation,[],[f84]) ).

fof(f368,plain,
    ( spl9_7
    | spl9_6
    | spl9_1 ),
    inference(avatar_split_clause,[],[f356,f168,f342,f346]) ).

fof(f342,plain,
    ( spl9_6
  <=> sK4 = sK7(unordered_pair(sK4,sK2),sK2,sK3) ),
    introduced(avatar_definition,[new_symbols(naming,[spl9_6])]) ).

fof(f356,plain,
    ( sK4 = sK7(unordered_pair(sK4,sK2),sK2,sK3)
    | sK2 = sK7(unordered_pair(sK4,sK2),sK2,sK3)
    | spl9_1 ),
    inference(resolution,[],[f170,f248]) ).

fof(f248,plain,
    ! [X31,X28,X29,X30] :
      ( upper_bound(X28,X29,unordered_pair(X30,X31))
      | sK7(unordered_pair(X30,X31),X28,X29) = X31
      | sK7(unordered_pair(X30,X31),X28,X29) = X30 ),
    inference(resolution,[],[f125,f122]) ).

fof(f122,plain,
    ! [X2,X0,X1] :
      ( ~ member(X0,unordered_pair(X2,X1))
      | X0 = X2
      | X0 = X1 ),
    inference(cnf_transformation,[],[f80]) ).

fof(f125,plain,
    ! [X2,X0,X1] :
      ( member(sK7(X0,X1,X2),X0)
      | upper_bound(X1,X2,X0) ),
    inference(cnf_transformation,[],[f84]) ).

fof(f367,plain,
    ( spl9_1
    | ~ spl9_6 ),
    inference(avatar_contradiction_clause,[],[f366]) ).

fof(f366,plain,
    ( $false
    | spl9_1
    | ~ spl9_6 ),
    inference(subsumption_resolution,[],[f365,f104]) ).

fof(f104,plain,
    apply(sK3,sK4,sK2),
    inference(cnf_transformation,[],[f67]) ).

fof(f365,plain,
    ( ~ apply(sK3,sK4,sK2)
    | spl9_1
    | ~ spl9_6 ),
    inference(subsumption_resolution,[],[f363,f170]) ).

fof(f363,plain,
    ( upper_bound(sK2,sK3,unordered_pair(sK4,sK2))
    | ~ apply(sK3,sK4,sK2)
    | ~ spl9_6 ),
    inference(superposition,[],[f124,f344]) ).

fof(f344,plain,
    ( sK4 = sK7(unordered_pair(sK4,sK2),sK2,sK3)
    | ~ spl9_6 ),
    inference(avatar_component_clause,[],[f342]) ).

fof(f355,plain,
    ( ~ spl9_1
    | spl9_8 ),
    inference(avatar_split_clause,[],[f350,f352,f168]) ).

fof(f350,plain,
    ( upper_bound(sK1(sK5,sK3,sK2,unordered_pair(sK4,sK2)),sK3,unordered_pair(sK4,sK2))
    | ~ upper_bound(sK2,sK3,unordered_pair(sK4,sK2)) ),
    inference(subsumption_resolution,[],[f178,f133]) ).

fof(f178,plain,
    ( upper_bound(sK1(sK5,sK3,sK2,unordered_pair(sK4,sK2)),sK3,unordered_pair(sK4,sK2))
    | ~ member(sK2,unordered_pair(sK4,sK2))
    | ~ upper_bound(sK2,sK3,unordered_pair(sK4,sK2)) ),
    inference(resolution,[],[f98,f107]) ).

fof(f98,plain,
    ! [X2,X3,X0,X1] :
      ( least_upper_bound(X2,X3,X1,X0)
      | upper_bound(sK1(X0,X1,X2,X3),X1,X3)
      | ~ member(X2,X3)
      | ~ upper_bound(X2,X1,X3) ),
    inference(cnf_transformation,[],[f62]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07  % Problem    : SET795+4 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.08  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.07/0.26  % Computer : n024.cluster.edu
% 0.07/0.26  % Model    : x86_64 x86_64
% 0.07/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26  % Memory   : 8042.1875MB
% 0.07/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26  % CPULimit   : 300
% 0.07/0.26  % WCLimit    : 300
% 0.07/0.26  % DateTime   : Tue Aug 30 14:22:49 EDT 2022
% 0.07/0.26  % CPUTime    : 
% 0.11/0.34  % (1307)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.11/0.34  % (1293)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/191324Mi)
% 0.11/0.35  TRYING [1]
% 0.11/0.36  % (1309)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.11/0.36  TRYING [2]
% 0.11/0.36  % (1299)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.11/0.36  TRYING [3]
% 0.11/0.37  % (1302)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.11/0.37  % (1305)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.11/0.37  % (1303)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.11/0.37  % (1301)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.11/0.38  % (1301)Instruction limit reached!
% 0.11/0.38  % (1301)------------------------------
% 0.11/0.38  % (1301)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.11/0.38  % (1295)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/37Mi)
% 0.11/0.38  % (1301)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.11/0.38  % (1301)Termination reason: Unknown
% 0.11/0.38  % (1301)Termination phase: Preprocessing 3
% 0.11/0.38  
% 0.11/0.38  % (1301)Memory used [KB]: 895
% 0.11/0.38  % (1301)Time elapsed: 0.003 s
% 0.11/0.38  % (1301)Instructions burned: 2 (million)
% 0.11/0.38  % (1301)------------------------------
% 0.11/0.38  % (1301)------------------------------
% 0.11/0.39  TRYING [1]
% 0.11/0.39  TRYING [4]
% 0.11/0.39  TRYING [2]
% 0.11/0.39  TRYING [3]
% 0.11/0.39  % (1297)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.11/0.39  % (1298)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/48Mi)
% 0.11/0.39  % (1308)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.11/0.39  % (1304)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.11/0.39  % (1306)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.11/0.40  % (1317)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/482Mi)
% 0.11/0.40  % (1316)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/467Mi)
% 0.11/0.41  % (1321)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/439Mi)
% 0.11/0.41  % (1315)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.11/0.41  % (1322)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/355Mi)
% 0.11/0.41  % (1296)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.11/0.41  % (1319)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.11/0.41  % (1294)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.11/0.41  % (1313)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/176Mi)
% 0.11/0.41  % (1300)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.11/0.41  % (1314)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 0.11/0.41  % (1294)Refutation not found, incomplete strategy% (1294)------------------------------
% 0.11/0.41  % (1294)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.11/0.41  % (1294)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.11/0.41  % (1294)Termination reason: Refutation not found, incomplete strategy
% 0.11/0.41  
% 0.11/0.41  % (1294)Memory used [KB]: 5500
% 0.11/0.41  % (1294)Time elapsed: 0.110 s
% 0.11/0.41  % (1294)Instructions burned: 4 (million)
% 0.11/0.41  % (1294)------------------------------
% 0.11/0.41  % (1294)------------------------------
% 0.11/0.41  TRYING [4]
% 0.11/0.42  % (1300)Instruction limit reached!
% 0.11/0.42  % (1300)------------------------------
% 0.11/0.42  % (1300)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.11/0.42  % (1300)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.11/0.42  % (1300)Termination reason: Unknown
% 0.11/0.42  % (1300)Termination phase: Saturation
% 0.11/0.42  
% 0.11/0.42  % (1300)Memory used [KB]: 5500
% 0.11/0.42  % (1300)Time elapsed: 0.092 s
% 0.11/0.42  % (1300)Instructions burned: 7 (million)
% 0.11/0.42  % (1300)------------------------------
% 0.11/0.42  % (1300)------------------------------
% 0.11/0.42  % (1310)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/59Mi)
% 0.11/0.42  TRYING [1]
% 0.11/0.42  % (1311)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.11/0.43  TRYING [5]
% 0.11/0.43  % (1320)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/177Mi)
% 0.11/0.43  % (1312)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.11/0.43  TRYING [2]
% 0.11/0.43  % (1318)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/500Mi)
% 0.11/0.44  TRYING [3]
% 0.11/0.44  TRYING [4]
% 0.11/0.45  % (1299)Instruction limit reached!
% 0.11/0.45  % (1299)------------------------------
% 0.11/0.45  % (1299)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.11/0.45  % (1299)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.11/0.45  % (1299)Termination reason: Unknown
% 0.11/0.45  % (1299)Termination phase: Finite model building SAT solving
% 0.11/0.45  
% 0.11/0.45  % (1299)Memory used [KB]: 7675
% 0.11/0.45  % (1299)Time elapsed: 0.128 s
% 0.11/0.45  % (1299)Instructions burned: 51 (million)
% 0.11/0.45  % (1299)------------------------------
% 0.11/0.45  % (1299)------------------------------
% 0.11/0.46  % (1295)Instruction limit reached!
% 0.11/0.46  % (1295)------------------------------
% 0.11/0.46  % (1295)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.11/0.46  % (1295)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.11/0.46  % (1295)Termination reason: Unknown
% 0.11/0.46  % (1295)Termination phase: Saturation
% 0.11/0.46  
% 0.11/0.46  % (1295)Memory used [KB]: 1663
% 0.11/0.46  % (1295)Time elapsed: 0.161 s
% 0.11/0.46  % (1295)Instructions burned: 37 (million)
% 0.11/0.46  % (1295)------------------------------
% 0.11/0.46  % (1295)------------------------------
% 0.11/0.46  % (1313)First to succeed.
% 0.11/0.46  % (1313)Refutation found. Thanks to Tanya!
% 0.11/0.46  % SZS status Theorem for theBenchmark
% 0.11/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46  % (1313)------------------------------
% 0.11/0.46  % (1313)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.11/0.46  % (1313)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.11/0.46  % (1313)Termination reason: Refutation
% 0.11/0.46  
% 0.11/0.46  % (1313)Memory used [KB]: 5884
% 0.11/0.46  % (1313)Time elapsed: 0.167 s
% 0.11/0.46  % (1313)Instructions burned: 16 (million)
% 0.11/0.46  % (1313)------------------------------
% 0.11/0.46  % (1313)------------------------------
% 0.11/0.46  % (1291)Success in time 0.188 s
%------------------------------------------------------------------------------