↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SEU648^2 : TPTP v9.3.1. Released v3.7.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 : Wed Sep 30 08:30:30 AM UTC 2026

% Result   : Theorem 0.21s 0.27s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   65 (  22 unt;   0 typ;   7 def)
%            Number of atoms       :  390 (  81 equ;   0 cnn)
%            Maximal formula atoms :    6 (   6 avg)
%            Number of connectives :  656 (  60   ~;  50   |;  12   &; 514   @)
%                                         (   9 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   26 (  23 usr;  19 con; 0-4 aty)
%            Number of variables   :   94 (   0 sgn  64   !;  16   ?;  94   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_1,type,
    setadjoin: $i > $i > $i ).

thf(func_def_2,type,
    kpair: $i > $i > $i ).

thf(func_def_4,type,
    setukpairinjL2: $o ).

thf(func_def_5,type,
    db1: 
      !>[X0: $tType] : X0 ).

thf(func_def_6,type,
    db0: 
      !>[X0: $tType] : X0 ).

thf(func_def_7,type,
    vLAM: 
      !>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).

thf(f1,axiom,
    ( ( ^ [X0: $i,X1: $i] : ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) ) )
    = kpair ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kpair) ).

thf(f2,axiom,
    ( setukpairinjL2
    = ( ! [X1: $i,X0: $i,X3: $i,X2: $i] :
          ( ( ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) )
            = ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) ) )
         => ( X0 = X2 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjL2) ).

thf(f3,conjecture,
    ( setukpairinjL2
   => ! [X3: $i,X0: $i,X2: $i,X1: $i] :
        ( ( ( kpair @ X0 @ X1 )
          = ( kpair @ X2 @ X3 ) )
       => ( X0 = X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairinjL) ).

thf(f4,negated_conjecture,
    ~ ( setukpairinjL2
     => ! [X3: $i,X0: $i,X2: $i,X1: $i] :
          ( ( ( kpair @ X0 @ X1 )
            = ( kpair @ X2 @ X3 ) )
         => ( X0 = X2 ) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

thf(f5,plain,
    ( kpair
    = ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) ) ),
    inference(fool_elimination,[],[f1]) ).

thf(f6,plain,
    ( setukpairinjL2
    = ( ! [X0: $i,X1: $i,X2: $i,X3: $i] :
          ( ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X0 @ emptyset ) ) @ emptyset ) )
            = ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
         => ( X1 = X3 ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f7,plain,
    ( ! [X1: $i,X3: $i,X0: $i,X2: $i] :
        ( ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X0 @ emptyset ) ) @ emptyset ) )
          = ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
       => ( X1 = X3 ) )
  <=> ( setukpairinjL2 = $true ) ),
    inference(fool_elimination,[],[f6]) ).

thf(f8,plain,
    ~ ( setukpairinjL2
     => ! [X0: $i,X1: $i,X2: $i,X3: $i] :
          ( ( ( kpair @ X2 @ X0 )
            = ( kpair @ X1 @ X3 ) )
         => ( X1 = X2 ) ) ),
    inference(rectify,[],[f4]) ).

thf(f9,plain,
    ~ ( ( setukpairinjL2 = $true )
     => ! [X1: $i,X0: $i,X2: $i,X3: $i] :
          ( ( ( kpair @ X2 @ X0 )
            = ( kpair @ X1 @ X3 ) )
         => ( X1 = X2 ) ) ),
    inference(fool_elimination,[],[f8]) ).

thf(f10,plain,
    ( ? [X3: $i,X0: $i,X1: $i,X2: $i] :
        ( ( ( kpair @ X2 @ X0 )
          = ( kpair @ X1 @ X3 ) )
        & ( X1 != X2 ) )
    & ( setukpairinjL2 = $true ) ),
    inference(ennf_transformation,[],[f9]) ).

thf(f11,plain,
    ( ! [X1: $i,X3: $i,X0: $i,X2: $i] :
        ( ( X1 = X3 )
        | ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X0 @ emptyset ) ) @ emptyset ) )
         != ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) )
  <=> ( setukpairinjL2 = $true ) ),
    inference(ennf_transformation,[],[f7]) ).

thf(f12,plain,
    ( ? [X0: $i,X1: $i,X2: $i,X3: $i] :
        ( ( ( kpair @ X2 @ X0 )
          = ( kpair @ X3 @ X1 ) )
        & ( X2 != X3 ) )
    & ( setukpairinjL2 = $true ) ),
    inference(rectify,[],[f10]) ).

thf(f13,plain,
    ( ( ( kpair @ sK3 @ sK1 )
      = ( kpair @ sK2 @ sK0 ) )
    & ( sK2 != sK3 )
    & ( setukpairinjL2 = $true ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f12]) ).

thf(f14,plain,
    ( ( ! [X1: $i,X3: $i,X0: $i,X2: $i] :
          ( ( X1 = X3 )
          | ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X0 @ emptyset ) ) @ emptyset ) )
           != ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) )
      | ( setukpairinjL2 != $true ) )
    & ( ( setukpairinjL2 = $true )
      | ? [X1: $i,X3: $i,X0: $i,X2: $i] :
          ( ( X1 != X3 )
          & ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X0 @ emptyset ) ) @ emptyset ) )
            = ( setadjoin @ ( setadjoin @ X3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X3 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) ) ) ),
    inference(nnf_transformation,[],[f11]) ).

thf(f15,plain,
    ( ( ! [X0: $i,X1: $i,X2: $i,X3: $i] :
          ( ( X0 = X1 )
          | ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) )
           != ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) )
      | ( setukpairinjL2 != $true ) )
    & ( ( setukpairinjL2 = $true )
      | ? [X4: $i,X5: $i,X6: $i,X7: $i] :
          ( ( X4 != X5 )
          & ( ( setadjoin @ ( setadjoin @ X4 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X4 @ ( setadjoin @ X6 @ emptyset ) ) @ emptyset ) )
            = ( setadjoin @ ( setadjoin @ X5 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X5 @ ( setadjoin @ X7 @ emptyset ) ) @ emptyset ) ) ) ) ) ),
    inference(rectify,[],[f14]) ).

thf(f16,plain,
    ( ( ! [X0: $i,X1: $i,X2: $i,X3: $i] :
          ( ( X0 = X1 )
          | ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) )
           != ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) ) )
      | ( setukpairinjL2 != $true ) )
    & ( ( setukpairinjL2 = $true )
      | ( ( sK4 != sK5 )
        & ( ( setadjoin @ ( setadjoin @ sK5 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK5 @ ( setadjoin @ sK7 @ emptyset ) ) @ emptyset ) )
          = ( setadjoin @ ( setadjoin @ sK4 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK4 @ ( setadjoin @ sK6 @ emptyset ) ) @ emptyset ) ) ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6),skolemize(X7,sK7)],[f15]) ).

thf(f17,plain,
    ( kpair
    = ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) ) ),
    inference(cnf_transformation,[],[f5]) ).

thf(f18,plain,
    setukpairinjL2 = $true,
    inference(cnf_transformation,[],[f13]) ).

thf(f19,plain,
    sK2 != sK3,
    inference(cnf_transformation,[],[f13]) ).

thf(f20,plain,
    ( ( kpair @ sK3 @ sK1 )
    = ( kpair @ sK2 @ sK0 ) ),
    inference(cnf_transformation,[],[f13]) ).

thf(f23,plain,
    ! [X2: $i,X3: $i,X0: $i,X1: $i] :
      ( ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) )
       != ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
      | ( X0 = X1 )
      | ( setukpairinjL2 != $true ) ),
    inference(cnf_transformation,[],[f16]) ).

thf(f26,definition,
    ( spl8_1
  <=> ( setukpairinjL2 = $true ) ),
    introduced(definition,[new_symbols(definition,[spl8_1])],[avatar_definition]) ).

thf(f29,plain,
    spl8_1,
    inference(avatar_split_clause,[],[f18,f26]) ).

thf(f36,definition,
    ( spl8_3
  <=> ( kpair
      = ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) ) ) ),
    introduced(definition,[new_symbols(definition,[spl8_3])],[avatar_definition]) ).

thf(f38,plain,
    ( ( kpair
      = ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) ) ) )
    | ~ spl8_3 ),
    inference(avatar_component_clause,[],[f36]) ).

thf(f39,plain,
    spl8_3,
    inference(avatar_split_clause,[],[f17,f36]) ).

thf(f41,definition,
    ( spl8_4
  <=> ( sK2 = sK3 ) ),
    introduced(definition,[new_symbols(definition,[spl8_4])],[avatar_definition]) ).

thf(f43,plain,
    ( ( sK2 != sK3 )
    | spl8_4 ),
    inference(avatar_component_clause,[],[f41]) ).

thf(f44,plain,
    ~ spl8_4,
    inference(avatar_split_clause,[],[f19,f41]) ).

thf(f51,definition,
    ( spl8_6
  <=> ! [X0: $i,X3: $i,X2: $i,X1: $i] :
        ( ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) )
         != ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
        | ( X0 = X1 ) ) ),
    introduced(definition,[new_symbols(definition,[spl8_6])],[avatar_definition]) ).

thf(f52,plain,
    ( ! [X2: $i,X3: $i,X0: $i,X1: $i] :
        ( ( ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X3 @ emptyset ) ) @ emptyset ) )
         != ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
        | ( X0 = X1 ) )
    | ~ spl8_6 ),
    inference(avatar_component_clause,[],[f51]) ).

thf(f53,plain,
    ( ~ spl8_1
    | spl8_6 ),
    inference(avatar_split_clause,[],[f23,f51,f26]) ).

thf(f55,definition,
    ( spl8_7
  <=> ( ( kpair @ sK3 @ sK1 )
      = ( kpair @ sK2 @ sK0 ) ) ),
    introduced(definition,[new_symbols(definition,[spl8_7])],[avatar_definition]) ).

thf(f57,plain,
    ( ( ( kpair @ sK3 @ sK1 )
      = ( kpair @ sK2 @ sK0 ) )
    | ~ spl8_7 ),
    inference(avatar_component_clause,[],[f55]) ).

thf(f58,plain,
    spl8_7,
    inference(avatar_split_clause,[],[f20,f55]) ).

thf(f61,plain,
    ( ! [X1: $i] :
        ( ( ^ [Y0: $i,Y1: $i] : ( setadjoin @ ( setadjoin @ Y0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ Y0 @ ( setadjoin @ Y1 @ emptyset ) ) @ emptyset ) )
          @ X1 )
        = ( kpair @ X1 ) )
    | ~ spl8_3 ),
    inference(argument_congruence,[],[f38]) ).

thf(f62,plain,
    ( ! [X1: $i] :
        ( ( kpair @ X1 )
        = ( ^ [Y0: $i] : ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) ) ) )
    | ~ spl8_3 ),
    inference(beta-eta_normalization,[],[f61]) ).

thf(f63,plain,
    ( ! [X2: $i,X1: $i] :
        ( ( kpair @ X1 @ X2 )
        = ( ^ [Y0: $i] : ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ Y0 @ emptyset ) ) @ emptyset ) )
          @ X2 ) )
    | ~ spl8_3 ),
    inference(argument_congruence,[],[f62]) ).

thf(f64,plain,
    ( ! [X2: $i,X1: $i] :
        ( ( kpair @ X1 @ X2 )
        = ( setadjoin @ ( setadjoin @ X1 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X1 @ ( setadjoin @ X2 @ emptyset ) ) @ emptyset ) ) )
    | ~ spl8_3 ),
    inference(beta-eta_normalization,[],[f63]) ).

thf(f65,plain,
    ( ( ( kpair @ sK2 @ sK0 )
      = ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) ) )
    | ~ spl8_3
    | ~ spl8_7 ),
    inference(superposition,[],[f64,f57]) ).

thf(f73,definition,
    ( spl8_8
  <=> ( ( kpair @ sK2 @ sK0 )
      = ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) ) ) ),
    introduced(definition,[new_symbols(definition,[spl8_8])],[avatar_definition]) ).

thf(f75,plain,
    ( ( ( kpair @ sK2 @ sK0 )
      = ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) ) )
    | ~ spl8_8 ),
    inference(avatar_component_clause,[],[f73]) ).

thf(f76,plain,
    ( spl8_8
    | ~ spl8_3
    | ~ spl8_7 ),
    inference(avatar_split_clause,[],[f65,f55,f36,f73]) ).

thf(f78,plain,
    ( ( ( setadjoin @ ( setadjoin @ sK2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK2 @ ( setadjoin @ sK0 @ emptyset ) ) @ emptyset ) )
      = ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) ) )
    | ~ spl8_3
    | ~ spl8_8 ),
    inference(superposition,[],[f64,f75]) ).

thf(f80,definition,
    ( spl8_9
  <=> ( ( setadjoin @ ( setadjoin @ sK2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK2 @ ( setadjoin @ sK0 @ emptyset ) ) @ emptyset ) )
      = ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) ) ) ),
    introduced(definition,[new_symbols(definition,[spl8_9])],[avatar_definition]) ).

thf(f82,plain,
    ( ( ( setadjoin @ ( setadjoin @ sK2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK2 @ ( setadjoin @ sK0 @ emptyset ) ) @ emptyset ) )
      = ( setadjoin @ ( setadjoin @ sK3 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK3 @ ( setadjoin @ sK1 @ emptyset ) ) @ emptyset ) ) )
    | ~ spl8_9 ),
    inference(avatar_component_clause,[],[f80]) ).

thf(f83,plain,
    ( spl8_9
    | ~ spl8_3
    | ~ spl8_8 ),
    inference(avatar_split_clause,[],[f78,f73,f36,f80]) ).

thf(f110,plain,
    ( ! [X0: $i,X1: $i] :
        ( ( ( setadjoin @ ( setadjoin @ X0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X0 @ ( setadjoin @ X1 @ emptyset ) ) @ emptyset ) )
         != ( setadjoin @ ( setadjoin @ sK2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ sK2 @ ( setadjoin @ sK0 @ emptyset ) ) @ emptyset ) ) )
        | ( sK3 = X0 ) )
    | ~ spl8_6
    | ~ spl8_9 ),
    inference(superposition,[],[f52,f82]) ).

thf(f152,plain,
    ( ( sK2 = sK3 )
    | ~ spl8_6
    | ~ spl8_9 ),
    inference(equality_resolution,[],[f110]) ).

thf(f162,plain,
    ( $false
    | spl8_4
    | ~ spl8_6
    | ~ spl8_9 ),
    inference(forward_subsumption_resolution,[],[f152,f43]) ).

thf(f163,plain,
    ( spl8_4
    | ~ spl8_6
    | ~ spl8_9 ),
    inference(avatar_contradiction_clause,[],[f162]) ).

cnf(s1,plain,
    spl8_1,
    inference(sat_conversion,[],[f29]) ).

cnf(s3,plain,
    spl8_3,
    inference(sat_conversion,[],[f39]) ).

cnf(s4,plain,
    ~ spl8_4,
    inference(sat_conversion,[],[f44]) ).

cnf(s6,plain,
    ( ~ spl8_1
    | spl8_6 ),
    inference(sat_conversion,[],[f53]) ).

cnf(s7,plain,
    spl8_7,
    inference(sat_conversion,[],[f58]) ).

cnf(s8,plain,
    ( ~ spl8_3
    | ~ spl8_7
    | spl8_8 ),
    inference(sat_conversion,[],[f76]) ).

cnf(s10,plain,
    ( ~ spl8_3
    | ~ spl8_8
    | spl8_9 ),
    inference(sat_conversion,[],[f83]) ).

cnf(s14,plain,
    ( spl8_4
    | ~ spl8_6
    | ~ spl8_9 ),
    inference(sat_conversion,[],[f163]) ).

cnf(s15,plain,
    spl8_8,
    inference(rat,[],[s8,s7,s3]) ).

cnf(s16,plain,
    spl8_9,
    inference(rat,[],[s10,s3,s15]) ).

cnf(s18,plain,
    ~ spl8_6,
    inference(rat,[],[s14,s4,s16]) ).

cnf(s19,plain,
    ~ spl8_1,
    inference(rat,[],[s6,s18]) ).

cnf(s22,plain,
    $false,
    inference(rat,[],[s1,s19]) ).

thf(f164,plain,
    $false,
    inference(avatar_sat_refutation,[],[s22]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU648^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n018.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Tue Sep 29 14:04:41 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21  Running higher-order theorem proving
% 0.08/0.23  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.27  % (124458)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.21/0.27  % (124466)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=3690652384:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.21/0.27  % (124466) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-124458-124466"...
% 0.21/0.27  % (124467)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3143710292:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.21/0.27  % (124463)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1397377053:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.21/0.27  % (124464)lrs+10_16_si=on:nwc=1.5:random_seed=2824239187:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.21/0.27  % (124465)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=224540660:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.21/0.27  % (124466)...printing done.
% 0.21/0.27  % (124466)Refutation found. Thanks to Tanya!
% 0.21/0.27  % SZS status Theorem for theBenchmark
% 0.21/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.27  % (124466)------------------------------
% 0.21/0.27  % (124466)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.27  % (124466)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.27  % (124466)CaDiCaL version: 2.1.3
% 0.21/0.27  % (124466)Termination reason: Refutation
% 0.21/0.27  % (124466)Time elapsed: 0.007 s
% 0.21/0.27  % (124466)Peak memory usage: 13 MB
% 0.21/0.27  % (124466)Instructions burned: 23 (million)
% 0.21/0.27  % (124458)Success in time 0.033 s
% 0.21/0.27  % Vampire exiting
%------------------------------------------------------------------------------