↑ 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  : SYO542^1 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n004.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:50:23 AM UTC 2026

% Result   : Theorem 28.71s 4.39s
% Output   : Refutation 28.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   48
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   99 (  21 unt;   0 typ;   0 def)
%            Number of atoms       :  657 ( 385 equ;   8 cnn)
%            Maximal formula atoms :    6 (   6 avg)
%            Number of connectives :  874 ( 223   ~; 223   |;  76   &; 349   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :  164 ( 164   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   80 (  76 usr;   6 con; 0-5 aty)
%            Number of variables   :  254 (  96   ^; 152   !;   6   ?; 254   :)

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

thf(func_def_0,type,
    epsii: ( ( $i > $i ) > $o ) > $i > $i ).

thf(func_def_2,type,
    if: $o > ( $i > $i ) > ( $i > $i ) > $i > $i ).

thf(func_def_5,type,
    vOR: $o > $o > $o ).

thf(func_def_6,type,
    vAND: $o > $o > $o ).

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

thf(func_def_8,type,
    db2: 
      !>[X0: $tType] : X0 ).

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

thf(func_def_10,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

thf(func_def_11,type,
    vNOT: $o > $o ).

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

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

thf(func_def_14,type,
    sK0: $o ).

thf(func_def_15,type,
    sK1: $i > $i ).

thf(func_def_16,type,
    sK2: $i > $i ).

thf(func_def_19,type,
    sK5: ( $i > $i ) > $i > $i ).

thf(func_def_20,type,
    sK6: ( $i > $i ) > $i > $i ).

thf(func_def_21,type,
    sK7: $i > ( $i > ( $i > $i ) > $o ) > $i > $i ).

thf(func_def_22,type,
    sK8: $i > ( $i > ( $i > $i ) > $o ) > $i > $i ).

thf(func_def_23,type,
    sK9: ( $i > $i ) > $i > $i ).

thf(func_def_24,type,
    sK10: $i > ( $i > ( $i > $i ) > $o ) > $i > $i ).

thf(func_def_25,type,
    sK11: ( $i > $i ) > $i ).

thf(func_def_26,type,
    sK12: $i > ( $i > ( $i > $i ) > $o ) > $i > $i ).

thf(func_def_27,type,
    sK13: ( $i > $i ) > $i ).

thf(func_def_28,type,
    sK14: ( $i > $i ) > $i > $i ).

thf(func_def_29,type,
    sK15: ( $i > $i ) > $i > $i ).

thf(func_def_30,type,
    sK16: $i > ( $i > ( $i > $i ) > $i > $i ) > $i > $i ).

thf(func_def_31,type,
    db4: 
      !>[X0: $tType] : X0 ).

thf(func_def_32,type,
    sK17: ( $i > ( $i > $i ) > $i > $i ) > $i > $i > $i ).

thf(func_def_33,type,
    sK18: ( $i > $i ) > $i > $i ).

thf(func_def_34,type,
    sK19: ( $i > $i ) > $i > $i ).

thf(func_def_35,type,
    sK20: $i > ( $i > ( $i > $i ) > $o ) > $i > $i ).

thf(func_def_37,type,
    sK22: $i > ( $i > ( $i > $i ) > $o ) > $i > $i ).

thf(func_def_38,type,
    sK23: $i > ( $i > ( $i > $i ) > $o ) > $i > $i ).

thf(func_def_39,type,
    sK24: $i > ( $i > ( $i > $i ) > $o ) > $i > $i ).

thf(func_def_40,type,
    sK25: ( $i > ( $i > $i ) > $o ) > $i > $i > $i ).

thf(func_def_41,type,
    sK26: ( $i > ( $i > $i ) > $o ) > $i > $i > $i ).

thf(func_def_42,type,
    sK27: ( $i > ( $i > $i ) > $o ) > $i > $i > $i ).

thf(func_def_44,type,
    sK29: ( $i > ( $i > $i ) > $o ) > $i > $i > $i ).

thf(func_def_45,type,
    sK30: ( ( $i > $i ) > $o ) > ( $i > $i ) > $i > $i ).

thf(func_def_46,type,
    sK31: ( $i > $i ) > $i ).

thf(func_def_47,type,
    sK32: ( $i > $i ) > $i > $i ).

thf(func_def_48,type,
    sK33: ( $i > $i ) > ( ( $i > $i ) > $o ) > $i > $i ).

thf(func_def_49,type,
    sK34: ( $i > $i ) > $i ).

thf(func_def_51,type,
    sK36: ( $i > $i ) > $i > $i ).

thf(func_def_52,type,
    sK37: ( $i > $i ) > $i > $i ).

thf(func_def_54,type,
    sK39: ( $i > ( $i > $i ) > $i > $i ) > ( $i > $i ) > ( $i > $i ) > $i > $i ).

thf(func_def_55,type,
    sK40: ( $i > ( $i > $i ) > $i > $i ) > ( $i > $i ) > ( $i > $i ) > $i > $i ).

thf(func_def_56,type,
    sK41: $i > $i > $i ).

thf(func_def_57,type,
    sK42: $i > $i > $i ).

thf(func_def_58,type,
    sK43: ( $i > $i ) > $i > $i ).

thf(func_def_59,type,
    sK44: ( $i > ( $i > $i ) > $i > $i ) > $i > $i > $i ).

thf(func_def_60,type,
    sK45: $i > ( $i > ( $i > $i ) > $i > $i ) > $i > $i ).

thf(func_def_61,type,
    sK46: ( $i > ( $i > $i ) > $i > $i ) > ( $i > ( $i > $i ) > $i > $i ) > ( $i > $i ) > ( $i > $i ) > $i > $i ).

thf(func_def_63,type,
    sK48: ( $i > ( $i > $i ) > $i > $i ) > ( $i > $i ) > ( $i > ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).

thf(func_def_65,type,
    sK50: ( $i > $i ) > $i > $i ).

thf(func_def_67,type,
    sK52: ( $i > $i ) > $i > $i ).

thf(func_def_69,type,
    sK54: ( $i > $i ) > $i > $i ).

thf(func_def_70,type,
    sK55: ( $i > $i ) > $i > $i ).

thf(func_def_72,type,
    sK57: ( $i > $i ) > $i > $i ).

thf(func_def_73,type,
    sK58: ( $i > $i ) > $i > $i ).

thf(func_def_75,type,
    sK60: ( $i > $i ) > $i > $i ).

thf(func_def_76,type,
    sK61: ( $i > $i ) > $i > $i ).

thf(func_def_77,type,
    sK62: ( $i > $i ) > $i > $i ).

thf(func_def_78,type,
    sK63: ( $i > $i ) > $i > $i ).

thf(func_def_79,type,
    sK64: ( $i > $i ) > $i > $i ).

thf(func_def_80,type,
    sK65: ( $i > $i ) > $i > $i ).

thf(func_def_81,type,
    sK66: ( $i > $i ) > $i ).

thf(func_def_82,type,
    sK67: ( $i > $i ) > $i ).

thf(func_def_83,type,
    sK68: ( $i > $i ) > $i ).

thf(func_def_84,type,
    sK69: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > $i > $i ).

thf(func_def_85,type,
    sK70: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > $i > $i ).

thf(func_def_86,type,
    sK71: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > $i > $i ).

thf(func_def_87,type,
    sK72: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > $i > $i ).

thf(f1,axiom,
    ! [X0: ( $i > $i ) > $o] :
      ( ? [X1: $i > $i] : ( X0 @ X1 )
     => ( X0 @ ( epsii @ X0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceaxii) ).

thf(f2,axiom,
    ( if
    = ( ^ [X0: $o,X1: $i > $i,X2: $i > $i] :
          ( epsii
          @ ^ [X3: $i > $i] :
              ( ( ( X3 = X2 )
                & ~ X0 )
              | ( ( X3 = X1 )
                & X0 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifd) ).

thf(f3,conjecture,
    ! [X0: $o,X1: $i > $i,X2: $i > $i] :
      ( ( ( if @ X0 @ X1 @ X2 )
        = X2 )
      | ( ( if @ X0 @ X1 @ X2 )
        = X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

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

thf(f5,plain,
    ! [X0: ( $i > $i ) > $o] :
      ( ? [X1: $i > $i] : ( X0 @ X1 )
     => ( X0 @ ( epsii @ X0 ) ) ),
    inference(rectify,[],[f1]) ).

thf(f6,plain,
    ! [X0: ( $i > $i ) > $o] :
      ( ? [X1: $i > $i] :
          ( ( X0 @ X1 )
          = $true )
     => ( ( X0 @ ( epsii @ X0 ) )
        = $true ) ),
    inference(fool_elimination,[],[f5]) ).

thf(f7,plain,
    ( if
    = ( ^ [X0: $o,X1: $i > $i,X2: $i > $i] :
          ( epsii
          @ ^ [X3: $i > $i] :
              ( ( ( X3 = X2 )
                & ~ X0 )
              | ( ( X3 = X1 )
                & X0 ) ) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f8,plain,
    ( if
    = ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
          ( epsii
          @ ^ [Y3: $i > $i] :
              ( ( Y0
                & ( Y1 = Y3 ) )
              | ( ~ Y0
                & ( Y2 = Y3 ) ) ) ) ) ),
    inference(fool_elimination,[],[f7]) ).

thf(f9,plain,
    ! [X0: ( $i > $i ) > $o] :
      ( ( ( X0 @ ( epsii @ X0 ) )
        = $true )
      | ! [X1: $i > $i] :
          ( ( X0 @ X1 )
         != $true ) ),
    inference(ennf_transformation,[],[f6]) ).

thf(f10,plain,
    ? [X0: $o,X1: $i > $i,X2: $i > $i] :
      ( ( ( if @ X0 @ X1 @ X2 )
       != X2 )
      & ( ( if @ X0 @ X1 @ X2 )
       != X1 ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f11,plain,
    ( ( sK2
     != ( if @ sK0 @ sK1 @ sK2 ) )
    & ( sK1
     != ( if @ sK0 @ sK1 @ sK2 ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f10]) ).

thf(f12,plain,
    ! [X0: ( $i > $i ) > $o,X1: $i > $i] :
      ( ( ( X0 @ X1 )
       != $true )
      | ( ( X0 @ ( epsii @ X0 ) )
        = $true ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f13,plain,
    ( if
    = ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
          ( epsii
          @ ^ [Y3: $i > $i] :
              ( ( Y0
                & ( Y1 = Y3 ) )
              | ( ~ Y0
                & ( Y2 = Y3 ) ) ) ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f14,plain,
    ( sK1
   != ( if @ sK0 @ sK1 @ sK2 ) ),
    inference(cnf_transformation,[],[f11]) ).

thf(f15,plain,
    ( sK2
   != ( if @ sK0 @ sK1 @ sK2 ) ),
    inference(cnf_transformation,[],[f11]) ).

thf(f18,plain,
    ( sK2
   != ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
          ( epsii
          @ ^ [Y3: $i > $i] :
              ( ( Y0
                & ( Y1 = Y3 ) )
              | ( ~ Y0
                & ( Y2 = Y3 ) ) ) )
      @ sK0
      @ sK1
      @ sK2 ) ),
    inference(definition_unfolding,[],[f15,f13]) ).

thf(f19,plain,
    ( sK1
   != ( ^ [Y0: $o,Y1: $i > $i,Y2: $i > $i] :
          ( epsii
          @ ^ [Y3: $i > $i] :
              ( ( Y0
                & ( Y1 = Y3 ) )
              | ( ~ Y0
                & ( Y2 = Y3 ) ) ) )
      @ sK0
      @ sK1
      @ sK2 ) ),
    inference(definition_unfolding,[],[f14,f13]) ).

thf(f20,plain,
    ( sK1
   != ( epsii
      @ ^ [Y0: $i > $i] :
          ( ( sK0
            & ( sK1 = Y0 ) )
          | ( ~ sK0
            & ( sK2 = Y0 ) ) ) ) ),
    inference(beta-eta_normalization,[],[f19]) ).

thf(f21,plain,
    ( sK2
   != ( epsii
      @ ^ [Y0: $i > $i] :
          ( ( sK0
            & ( sK1 = Y0 ) )
          | ( ~ sK0
            & ( sK2 = Y0 ) ) ) ) ),
    inference(beta-eta_normalization,[],[f18]) ).

thf(f29,plain,
    ( ( sK1 @ sK3 )
   != ( epsii
      @ ^ [Y0: $i > $i] :
          ( ( sK0
            & ( sK1 = Y0 ) )
          | ( ~ sK0
            & ( sK2 = Y0 ) ) )
      @ sK3 ) ),
    inference(negative_extensionality,[],[f20]) ).

thf(f30,plain,
    ( ( sK2 @ sK4 )
   != ( epsii
      @ ^ [Y0: $i > $i] :
          ( ( sK0
            & ( sK1 = Y0 ) )
          | ( ~ sK0
            & ( sK2 = Y0 ) ) )
      @ sK4 ) ),
    inference(negative_extensionality,[],[f21]) ).

thf(f31,plain,
    ! [X0: $i > $i] :
      ( ( epsii @ ( (=) @ X0 ) )
      = X0 ),
    inference(leibniz_equality_elimination,[],[f12]) ).

thf(f34,plain,
    ! [X2: ( $i > $i ) > $o,X1: $i > $i] :
      ( ( $true
       != ( ^ [Y0: $i > $i] :
              ~ ( X2 @ Y0 )
          @ X1 ) )
      | ( $true
        = ( ^ [Y0: $i > $i] :
              ~ ( X2 @ Y0 )
          @ ( epsii
            @ ^ [Y0: $i > $i] :
                ~ ( X2 @ Y0 ) ) ) ) ),
    inference(primitive_instantiation,[],[f12]) ).

thf(f41,plain,
    ! [X2: ( $i > $i ) > $o,X1: $i > $i] :
      ( ( $true
       != ( ~ ( X2 @ X1 ) ) )
      | ( $true
        = ( ~ ( X2
              @ ( epsii
                @ ^ [Y0: $i > $i] :
                    ~ ( X2 @ Y0 ) ) ) ) ) ),
    inference(beta-eta_normalization,[],[f34]) ).

thf(f42,plain,
    ! [X2: ( $i > $i ) > $o,X1: $i > $i] :
      ( ( $true
        = ( X2 @ X1 ) )
      | ( $true
        = ( ~ ( X2
              @ ( epsii
                @ ^ [Y0: $i > $i] :
                    ~ ( X2 @ Y0 ) ) ) ) ) ),
    inference(not_proxy_clausification,[],[f41]) ).

thf(f43,plain,
    ! [X2: ( $i > $i ) > $o,X1: $i > $i] :
      ( ( $true
        = ( X2 @ X1 ) )
      | ( $false
        = ( X2
          @ ( epsii
            @ ^ [Y0: $i > $i] :
                ~ ( X2 @ Y0 ) ) ) ) ),
    inference(not_proxy_clausification,[],[f42]) ).

thf(f46,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( epsii @ ( (=) @ X0 ) @ X1 )
      = ( X0 @ X1 ) ),
    inference(argument_congruence,[],[f31]) ).

thf(f111,plain,
    ! [X0: $i > $i] :
      ( ( epsii
        @ ^ [Y0: $i > $i] :
            ~ ( ^ [Y1: $i > $i] : ( Y1 != X0 )
              @ Y0 ) )
      = X0 ),
    inference(leibniz_equality_elimination,[],[f43]) ).

thf(f194,plain,
    ! [X0: $i > $i] :
      ( ( epsii
        @ ^ [Y0: $i > $i] :
            ~ ( ( Y0 != X0 ) ) )
      = X0 ),
    inference(beta-eta_normalization,[],[f111]) ).

thf(f195,plain,
    ! [X0: $i > $i] :
      ( ( epsii
        @ ^ [Y0: $i > $i] : ( Y0 = X0 ) )
      = X0 ),
    inference(boolean_simplification,[],[f194]) ).

thf(f232,plain,
    ! [X0: $i > $i,X1: $i > $i] :
      ( ( X0 = X1 )
      | ( ( ^ [Y0: $i > $i] : X0 )
       != ( ^ [Y0: $i > $i] : X1 ) ) ),
    inference(constrained_superposition,[],[f195,f195]) ).

thf(f277,plain,
    ! [X2: $i,X0: $i > $i,X1: $i > $i] :
      ( ( ( X0 @ X2 )
        = ( X1 @ X2 ) )
      | ( ( ^ [Y0: $i > $i] : X0 )
       != ( ^ [Y0: $i > $i] : X1 ) ) ),
    inference(argument_congruence,[],[f232]) ).

thf(f327,plain,
    ! [X2: $i,X0: $i > $i,X1: ( $i > $i ) > $o] :
      ( ( ( ^ [Y0: $i > $i] : X0 )
       != ( ^ [Y0: $i > $i,Y1: $i] : Y1 ) )
      | ( ( sK1 @ sK3 )
       != ( X0 @ ( epsii @ X1 @ X2 ) ) )
      | ( ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) ) )
       != X1 )
      | ( sK3 != X2 ) ),
    inference(constrained_superposition,[],[f29,f277]) ).

thf(f330,plain,
    ! [X2: $i,X0: $i > $i,X1: ( $i > $i ) > $o] :
      ( ( ( ^ [Y0: $i > $i] : X0 )
       != ( ^ [Y0: $i > $i,Y1: $i] : Y1 ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ ( epsii @ X1 @ X2 ) ) )
      | ( ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) ) )
       != X1 )
      | ( sK4 != X2 ) ),
    inference(constrained_superposition,[],[f30,f277]) ).

thf(f333,plain,
    ! [X2: $i,X3: $i > $i,X0: $i > $i,X1: ( $i > $i ) > $o,X4: $i] :
      ( ( ( ^ [Y0: $i > $i] : X0 )
       != ( ^ [Y0: $i > $i,Y1: $i] : Y1 ) )
      | ( ( X0 @ ( epsii @ X1 @ X2 ) )
        = ( X3 @ X4 ) )
      | ( ( (=) @ X3 )
       != X1 )
      | ( X2 != X4 ) ),
    inference(constrained_superposition,[],[f46,f277]) ).

thf(f361,plain,
    ! [X0: ( $i > $i ) > $o,X1: $i] :
      ( ( ( sK1 @ sK3 )
       != ( ^ [Y0: $i] : Y0
          @ ( epsii @ X0 @ X1 ) ) )
      | ( ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) ) )
       != X0 )
      | ( sK3 != X1 ) ),
    inference(equality_resolution,[],[f327]) ).

thf(f362,plain,
    ! [X0: ( $i > $i ) > $o,X1: $i] :
      ( ( ( sK1 @ sK3 )
       != ( epsii @ X0 @ X1 ) )
      | ( ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) ) )
       != X0 )
      | ( sK3 != X1 ) ),
    inference(beta-eta_normalization,[],[f361]) ).

thf(f365,plain,
    ! [X0: ( $i > $i ) > $o,X1: $i] :
      ( ( ( sK2 @ sK4 )
       != ( ^ [Y0: $i] : Y0
          @ ( epsii @ X0 @ X1 ) ) )
      | ( ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) ) )
       != X0 )
      | ( sK4 != X1 ) ),
    inference(equality_resolution,[],[f330]) ).

thf(f366,plain,
    ! [X0: ( $i > $i ) > $o,X1: $i] :
      ( ( ( sK2 @ sK4 )
       != ( epsii @ X0 @ X1 ) )
      | ( ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) ) )
       != X0 )
      | ( sK4 != X1 ) ),
    inference(beta-eta_normalization,[],[f365]) ).

thf(f368,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) ) )
       != ( (=) @ X0 ) )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 ) ),
    inference(constrained_superposition,[],[f362,f46]) ).

thf(f399,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) ) )
       != ( (=) @ X0 ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 ) ),
    inference(constrained_superposition,[],[f366,f46]) ).

thf(f430,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) )
          @ ( sK9 @ X0 ) )
       != ( X0
          = ( sK9 @ X0 ) ) )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 ) ),
    inference(negative_extensionality,[],[f368]) ).

thf(f431,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $true
        = ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) )
          @ ( sK9 @ X0 ) ) )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 )
      | ( $true
        = ( X0
          = ( sK9 @ X0 ) ) ) ),
    inference(xor_proxy_clausification,[],[f430]) ).

thf(f432,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $false
        = ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) )
          @ ( sK9 @ X0 ) ) )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 )
      | ( $false
        = ( X0
          = ( sK9 @ X0 ) ) ) ),
    inference(xor_proxy_clausification,[],[f430]) ).

thf(f433,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $false
        = ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) )
          @ ( sK9 @ X0 ) ) )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 )
      | ( ( sK9 @ X0 )
       != X0 ) ),
    inference(equality_proxy_clausification,[],[f432]) ).

thf(f434,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $false
        = ( ( sK0
            & ( sK1
              = ( sK9 @ X0 ) ) )
          | ( ~ sK0
            & ( sK2
              = ( sK9 @ X0 ) ) ) ) )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 )
      | ( ( sK9 @ X0 )
       != X0 ) ),
    inference(beta-eta_normalization,[],[f433]) ).

thf(f436,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $false
        = ( sK0
          & ( sK1
            = ( sK9 @ X0 ) ) ) )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 )
      | ( ( sK9 @ X0 )
       != X0 ) ),
    inference(or_proxy_clausification,[],[f434]) ).

thf(f437,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $false
        = ( sK1
          = ( sK9 @ X0 ) ) )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 )
      | ( ( sK9 @ X0 )
       != X0 )
      | ( sK0 = $false ) ),
    inference(and_proxy_clausification,[],[f436]) ).

thf(f438,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( sK1
       != ( sK9 @ X0 ) )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 )
      | ( ( sK9 @ X0 )
       != X0 )
      | ( sK0 = $false ) ),
    inference(equality_proxy_clausification,[],[f437]) ).

thf(f442,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $true
        = ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) )
          @ ( sK9 @ X0 ) ) )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 )
      | ( ( sK9 @ X0 )
        = X0 ) ),
    inference(equality_proxy_clausification,[],[f431]) ).

thf(f443,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $true
        = ( ( sK0
            & ( sK1
              = ( sK9 @ X0 ) ) )
          | ( ~ sK0
            & ( sK2
              = ( sK9 @ X0 ) ) ) ) )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 )
      | ( ( sK9 @ X0 )
        = X0 ) ),
    inference(beta-eta_normalization,[],[f442]) ).

thf(f444,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $true
        = ( ~ sK0
          & ( sK2
            = ( sK9 @ X0 ) ) ) )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 )
      | ( ( sK9 @ X0 )
        = X0 )
      | ( $true
        = ( sK0
          & ( sK1
            = ( sK9 @ X0 ) ) ) ) ),
    inference(or_proxy_clausification,[],[f443]) ).

thf(f446,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $true = ( ~ sK0 ) )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 )
      | ( ( sK9 @ X0 )
        = X0 )
      | ( $true
        = ( sK0
          & ( sK1
            = ( sK9 @ X0 ) ) ) ) ),
    inference(and_proxy_clausification,[],[f444]) ).

thf(f447,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( sK0 = $false )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 )
      | ( ( sK9 @ X0 )
        = X0 )
      | ( $true
        = ( sK0
          & ( sK1
            = ( sK9 @ X0 ) ) ) ) ),
    inference(not_proxy_clausification,[],[f446]) ).

thf(f448,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( sK0 = $false )
      | ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK3 != X1 )
      | ( ( sK9 @ X0 )
        = X0 )
      | ( $true
        = ( sK1
          = ( sK9 @ X0 ) ) ) ),
    inference(and_proxy_clausification,[],[f447]) ).

thf(f450,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( ( sK1 @ sK3 )
       != ( X0 @ X1 ) )
      | ( sK0 = $false )
      | ( sK3 != X1 )
      | ( ( sK9 @ X0 )
        = X0 )
      | ( sK1
        = ( sK9 @ X0 ) ) ),
    inference(equality_proxy_clausification,[],[f448]) ).

thf(f590,plain,
    ! [X1: $i] :
      ( ( sK0 = $false )
      | ( sK3 != X1 )
      | ( ( ^ [Y0: $i] :
              ( sK1
              @ ( ^ [Y1: $i] : Y1
                @ Y0 ) ) )
        = ( sK9
          @ ^ [Y0: $i] :
              ( sK1
              @ ( ^ [Y1: $i] : Y1
                @ Y0 ) ) ) )
      | ( sK1
        = ( sK9
          @ ^ [Y0: $i] :
              ( sK1
              @ ( ^ [Y1: $i] : Y1
                @ Y0 ) ) ) )
      | ( sK3 != X1 ) ),
    inference(equality_resolution,[],[f450]) ).

thf(f593,plain,
    ! [X1: $i] :
      ( ( sK0 = $false )
      | ( sK3 != X1 )
      | ( ( ^ [Y0: $i] :
              ( sK1
              @ ( ^ [Y1: $i] : Y1
                @ Y0 ) ) )
        = ( sK9
          @ ^ [Y0: $i] :
              ( sK1
              @ ( ^ [Y1: $i] : Y1
                @ Y0 ) ) ) )
      | ( sK1
        = ( sK9
          @ ^ [Y0: $i] :
              ( sK1
              @ ( ^ [Y1: $i] : Y1
                @ Y0 ) ) ) ) ),
    inference(duplicate_literal_removal,[],[f590]) ).

thf(f594,plain,
    ! [X1: $i] :
      ( ( sK0 = $false )
      | ( sK3 != X1 )
      | ( sK1
        = ( sK9 @ sK1 ) )
      | ( sK1
        = ( sK9 @ sK1 ) ) ),
    inference(beta-eta_normalization,[],[f593]) ).

thf(f595,plain,
    ! [X1: $i] :
      ( ( sK3 != X1 )
      | ( sK0 = $false )
      | ( sK1
        = ( sK9 @ sK1 ) ) ),
    inference(duplicate_literal_removal,[],[f594]) ).

thf(f607,plain,
    ! [X2: $i > $i,X3: $i,X0: ( $i > $i ) > $o,X1: $i] :
      ( ( ( X2 @ X3 )
        = ( ^ [Y0: $i] : Y0
          @ ( epsii @ X0 @ X1 ) ) )
      | ( ( (=) @ X2 )
       != X0 )
      | ( X1 != X3 ) ),
    inference(equality_resolution,[],[f333]) ).

thf(f608,plain,
    ! [X2: $i > $i,X3: $i,X0: ( $i > $i ) > $o,X1: $i] :
      ( ( ( (=) @ X2 )
       != X0 )
      | ( ( X2 @ X3 )
        = ( epsii @ X0 @ X1 ) )
      | ( X1 != X3 ) ),
    inference(beta-eta_normalization,[],[f607]) ).

thf(f610,plain,
    ( ( sK1
      = ( sK9 @ sK1 ) )
    | ( sK0 = $false ) ),
    inference(equality_resolution,[],[f595]) ).

thf(f617,plain,
    ! [X0: $i] :
      ( ( sK1 != sK1 )
      | ( ( sK1 @ sK3 )
       != ( sK1 @ X0 ) )
      | ( sK3 != X0 )
      | ( sK1 != sK1 )
      | ( sK0 = $false )
      | ( sK0 = $false ) ),
    inference(constrained_superposition,[],[f438,f610]) ).

thf(f618,plain,
    ! [X0: $i] :
      ( ( sK1 != sK1 )
      | ( ( sK1 @ sK3 )
       != ( sK1 @ X0 ) )
      | ( sK3 != X0 )
      | ( sK0 = $false ) ),
    inference(duplicate_literal_removal,[],[f617]) ).

thf(f619,plain,
    ! [X0: $i] :
      ( ( ( sK1 @ sK3 )
       != ( sK1 @ X0 ) )
      | ( sK3 != X0 )
      | ( sK0 = $false ) ),
    inference(trivial_inequality_removal,[],[f618]) ).

thf(f645,plain,
    ( ( sK3 != sK3 )
    | ( sK0 = $false ) ),
    inference(equality_resolution,[],[f619]) ).

thf(f646,plain,
    sK0 = $false,
    inference(trivial_inequality_removal,[],[f645]) ).

thf(f1176,plain,
    ! [X2: $i,X0: $i > $i,X1: $i] :
      ( ( ( X0 @ X1 )
        = ( epsii @ ( (=) @ X0 ) @ X2 ) )
      | ( X1 != X2 ) ),
    inference(equality_resolution,[],[f608]) ).

thf(f1181,plain,
    ! [X2: $i,X0: $i > $i,X1: $i] :
      ( ( ( X0 @ X1 )
        = ( X0 @ X2 ) )
      | ( X1 != X2 ) ),
    inference(forward_demodulation,[],[f1176,f46]) ).

thf(f2246,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) )
          @ ( sK52 @ X0 ) )
       != ( X0
          = ( sK52 @ X0 ) ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 ) ),
    inference(negative_extensionality,[],[f399]) ).

thf(f2247,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $true
        = ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) )
          @ ( sK52 @ X0 ) ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( $true
        = ( X0
          = ( sK52 @ X0 ) ) ) ),
    inference(xor_proxy_clausification,[],[f2246]) ).

thf(f2248,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $false
        = ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) )
          @ ( sK52 @ X0 ) ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( $false
        = ( X0
          = ( sK52 @ X0 ) ) ) ),
    inference(xor_proxy_clausification,[],[f2246]) ).

thf(f2249,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $false
        = ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) )
          @ ( sK52 @ X0 ) ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
       != X0 ) ),
    inference(equality_proxy_clausification,[],[f2248]) ).

thf(f2250,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $false
        = ( ( sK0
            & ( sK1
              = ( sK52 @ X0 ) ) )
          | ( ~ sK0
            & ( sK2
              = ( sK52 @ X0 ) ) ) ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
       != X0 ) ),
    inference(beta-eta_normalization,[],[f2249]) ).

thf(f2251,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $false
        = ( ~ sK0
          & ( sK2
            = ( sK52 @ X0 ) ) ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
       != X0 ) ),
    inference(or_proxy_clausification,[],[f2250]) ).

thf(f2255,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $false
        = ( sK2
          = ( sK52 @ X0 ) ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
       != X0 )
      | ( $false = ( ~ sK0 ) ) ),
    inference(and_proxy_clausification,[],[f2251]) ).

thf(f2256,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( sK2
       != ( sK52 @ X0 ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
       != X0 )
      | ( $false = ( ~ sK0 ) ) ),
    inference(equality_proxy_clausification,[],[f2255]) ).

thf(f2257,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( sK2
       != ( sK52 @ X0 ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
       != X0 )
      | ( $true = sK0 ) ),
    inference(not_proxy_clausification,[],[f2256]) ).

thf(f2258,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $true
        = ( ^ [Y0: $i > $i] :
              ( ( sK0
                & ( sK1 = Y0 ) )
              | ( ~ sK0
                & ( sK2 = Y0 ) ) )
          @ ( sK52 @ X0 ) ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
        = X0 ) ),
    inference(equality_proxy_clausification,[],[f2247]) ).

thf(f2259,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $true
        = ( ( sK0
            & ( sK1
              = ( sK52 @ X0 ) ) )
          | ( ~ sK0
            & ( sK2
              = ( sK52 @ X0 ) ) ) ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
        = X0 ) ),
    inference(beta-eta_normalization,[],[f2258]) ).

thf(f2260,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $true
        = ( ~ sK0
          & ( sK2
            = ( sK52 @ X0 ) ) ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
        = X0 )
      | ( $true
        = ( sK0
          & ( sK1
            = ( sK52 @ X0 ) ) ) ) ),
    inference(or_proxy_clausification,[],[f2259]) ).

thf(f2261,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $true
        = ( sK2
          = ( sK52 @ X0 ) ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
        = X0 )
      | ( $true
        = ( sK0
          & ( sK1
            = ( sK52 @ X0 ) ) ) ) ),
    inference(and_proxy_clausification,[],[f2260]) ).

thf(f2267,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( sK2
        = ( sK52 @ X0 ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
        = X0 )
      | ( $true
        = ( sK0
          & ( sK1
            = ( sK52 @ X0 ) ) ) ) ),
    inference(equality_proxy_clausification,[],[f2261]) ).

thf(f2269,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( sK2
        = ( sK52 @ X0 ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
        = X0 )
      | ( $true = sK0 ) ),
    inference(and_proxy_clausification,[],[f2267]) ).

thf(f2271,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $true = $false )
      | ( sK2
       != ( sK52 @ X0 ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
       != X0 ) ),
    inference(forward_demodulation,[],[f2257,f646]) ).

thf(f2272,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( sK2
       != ( sK52 @ X0 ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
       != X0 ) ),
    inference(trivial_inequality_removal,[],[f2271]) ).

thf(f2273,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( $true = $false )
      | ( sK2
        = ( sK52 @ X0 ) )
      | ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
        = X0 ) ),
    inference(forward_demodulation,[],[f2269,f646]) ).

thf(f2274,plain,
    ! [X0: $i > $i,X1: $i] :
      ( ( ( sK2 @ sK4 )
       != ( X0 @ X1 ) )
      | ( sK2
        = ( sK52 @ X0 ) )
      | ( sK4 != X1 )
      | ( ( sK52 @ X0 )
        = X0 ) ),
    inference(trivial_inequality_removal,[],[f2273]) ).

thf(f3659,plain,
    ! [X1: $i] :
      ( ( sK2
        = ( sK52
          @ ^ [Y0: $i] :
              ( sK2
              @ ( ^ [Y1: $i] : Y1
                @ Y0 ) ) ) )
      | ( sK4 != X1 )
      | ( ( ^ [Y0: $i] :
              ( sK2
              @ ( ^ [Y1: $i] : Y1
                @ Y0 ) ) )
        = ( sK52
          @ ^ [Y0: $i] :
              ( sK2
              @ ( ^ [Y1: $i] : Y1
                @ Y0 ) ) ) )
      | ( sK4 != X1 ) ),
    inference(equality_resolution,[],[f2274]) ).

thf(f3662,plain,
    ! [X1: $i] :
      ( ( sK2
        = ( sK52
          @ ^ [Y0: $i] :
              ( sK2
              @ ( ^ [Y1: $i] : Y1
                @ Y0 ) ) ) )
      | ( sK4 != X1 )
      | ( ( ^ [Y0: $i] :
              ( sK2
              @ ( ^ [Y1: $i] : Y1
                @ Y0 ) ) )
        = ( sK52
          @ ^ [Y0: $i] :
              ( sK2
              @ ( ^ [Y1: $i] : Y1
                @ Y0 ) ) ) ) ),
    inference(duplicate_literal_removal,[],[f3659]) ).

thf(f3663,plain,
    ! [X1: $i] :
      ( ( sK2
        = ( sK52 @ sK2 ) )
      | ( sK4 != X1 )
      | ( sK2
        = ( sK52 @ sK2 ) ) ),
    inference(beta-eta_normalization,[],[f3662]) ).

thf(f3664,plain,
    ! [X1: $i] :
      ( ( sK4 != X1 )
      | ( sK2
        = ( sK52 @ sK2 ) ) ),
    inference(duplicate_literal_removal,[],[f3663]) ).

thf(f3720,plain,
    ( sK2
    = ( sK52 @ sK2 ) ),
    inference(equality_resolution,[],[f3664]) ).

thf(f3753,plain,
    ! [X0: $i] :
      ( ( sK2 != sK2 )
      | ( ( sK2 @ sK4 )
       != ( sK2 @ X0 ) )
      | ( sK4 != X0 )
      | ( sK2 != sK2 ) ),
    inference(constrained_superposition,[],[f2272,f3720]) ).

thf(f3754,plain,
    ! [X0: $i] :
      ( ( sK2 != sK2 )
      | ( ( sK2 @ sK4 )
       != ( sK2 @ X0 ) )
      | ( sK4 != X0 ) ),
    inference(duplicate_literal_removal,[],[f3753]) ).

thf(f3755,plain,
    ! [X0: $i] :
      ( ( ( sK2 @ sK4 )
       != ( sK2 @ X0 ) )
      | ( sK4 != X0 ) ),
    inference(trivial_inequality_removal,[],[f3754]) ).

thf(f3756,plain,
    ! [X0: $i] : ( sK4 != X0 ),
    inference(forward_subsumption_resolution,[],[f3755,f1181]) ).

thf(f3784,plain,
    $false,
    inference(equality_resolution,[],[f3756]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO542^1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19  % Computer : n004.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 17:13:52 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22  Running first-order model finding
% 0.08/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
% 6.82/1.24  % (1591310)Will run a generic schedule for satisfiability detection.
% 6.82/1.24  % (1591316)% WARNING: option uhcvi not known.
% 6.82/1.24  % (1591316)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2721745511:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.82/1.24  % (1591316)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.82/1.24  % (1591316)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.82/1.24  % (1591317)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=790858157:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.82/1.24  % (1591315)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=492765988_2999 on theBenchmark for (2999ds/0Mi)
% 6.82/1.24  % (1591318)dis+10_1_sil=32000:sp=arity:random_seed=542721174:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.82/1.24  % Exception at run slice level
% 6.82/1.24  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.82/1.24  % (1591319)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2450809712:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.82/1.24  % (1591320)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1617667616:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.82/1.24  % (1591326)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3645577318:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 6.82/1.24  % (1591319)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.82/1.24  % (1591321)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=141755557:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.82/1.24  % Exception at run slice level
% 6.82/1.24  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.82/1.24  % (1591331)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=502931758:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 6.82/1.24  % (1591318)Instruction limit reached! 
% 6.82/1.24  % (1591318)------------------------------
% 6.82/1.24  % (1591318)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.24  % (1591318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.24  % (1591318)CaDiCaL version: 2.1.3
% 6.82/1.24  % (1591318)Termination reason: Instruction limit
% 6.82/1.24  % (1591318)Termination phase: Saturation
% 6.82/1.24  % (1591318)Time elapsed: 0.052 s
% 6.82/1.24  % (1591318)Peak memory usage: 12 MB
% 6.82/1.24  % (1591318)Instructions burned: 104 (million)
% 6.82/1.24  % (1591333)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2365490410:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 6.82/1.24  % (1591333)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 6.82/1.24  % (1591333)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 6.82/1.24  % (1591319)Instruction limit reached! 
% 6.82/1.24  % (1591319)------------------------------
% 6.82/1.24  % (1591319)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.24  % (1591319)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.24  % (1591319)CaDiCaL version: 2.1.3
% 6.82/1.24  % (1591319)Termination reason: Instruction limit
% 6.82/1.24  % (1591319)Termination phase: Saturation
% 6.82/1.24  % (1591319)Time elapsed: 0.056 s
% 6.82/1.24  % (1591319)Peak memory usage: 12 MB
% 6.82/1.24  % (1591319)Instructions burned: 117 (million)
% 6.82/1.24  % (1591320)Instruction limit reached! 
% 6.82/1.24  % (1591320)------------------------------
% 6.82/1.24  % (1591320)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.82/1.24  % (1591320)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.82/1.24  % (1591320)CaDiCaL version: 2.1.3
% 6.82/1.24  % (1591320)Termination reason: Instruction limit
% 6.82/1.24  % (1591320)Termination phase: Saturation
% 6.82/1.24  % (1591320)Time elapsed: 0.062 s
% 6.82/1.24  % (1591320)Peak memory usage: 12 MB
% 6.82/1.24  % (1591320)Instructions burned: 132 (million)
% 6.82/1.24  % (1591335)ott-21_1_sil=16000:fs=off:random_seed=4041804780:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 6.82/1.24  % (1591331)Instruction limit reached! 
% 17.73/2.87  % (1591331)------------------------------
% 17.73/2.87  % (1591331)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.73/2.87  % (1591331)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.73/2.87  % (1591331)CaDiCaL version: 2.1.3
% 17.73/2.87  % (1591331)Termination reason: Instruction limit
% 17.73/2.87  % (1591331)Termination phase: Saturation
% 17.73/2.87  % (1591331)Time elapsed: 0.066 s
% 17.73/2.87  % (1591331)Peak memory usage: 12 MB
% 17.73/2.87  % (1591331)Instructions burned: 131 (million)
% 17.73/2.87  % (1591336)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3311948240:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 17.73/2.87  % (1591338)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2395734936:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 17.73/2.87  % Exception at run slice level
% 17.73/2.87  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 17.73/2.87  % (1591341)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=4236258105:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 17.73/2.87  % (1591321)Instruction limit reached! 
% 17.73/2.87  % (1591321)------------------------------
% 17.73/2.87  % (1591321)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.73/2.87  % (1591321)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.73/2.87  % (1591321)CaDiCaL version: 2.1.3
% 17.73/2.87  % (1591321)Termination reason: Instruction limit
% 17.73/2.87  % (1591321)Termination phase: Saturation
% 17.73/2.87  % (1591321)Time elapsed: 0.148 s
% 17.73/2.87  % (1591321)Peak memory usage: 13 MB
% 17.73/2.87  % (1591321)Instructions burned: 159 (million)
% 17.73/2.87  % (1591335)Instruction limit reached! 
% 17.73/2.87  % (1591335)------------------------------
% 17.73/2.87  % (1591335)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.73/2.87  % (1591335)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.73/2.87  % (1591335)CaDiCaL version: 2.1.3
% 17.73/2.87  % (1591335)Termination reason: Instruction limit
% 17.73/2.87  % (1591335)Termination phase: Saturation
% 17.73/2.87  % (1591335)Time elapsed: 0.084 s
% 17.73/2.87  % (1591335)Peak memory usage: 12 MB
% 17.73/2.87  % (1591335)Instructions burned: 183 (million)
% 17.73/2.87  % (1591344)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=2400240823:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2997 on theBenchmark for (2997ds/692Mi)
% 17.73/2.87  % (1591344)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 17.73/2.87  % (1591343)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1285775739:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 17.73/2.87  % Exception at run slice level
% 17.73/2.87  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 17.73/2.87  % (1591347)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2490680400:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 17.73/2.87  % (1591347)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 17.73/2.87  % (1591333)Instruction limit reached! 
% 17.73/2.87  % (1591333)------------------------------
% 17.73/2.87  % (1591333)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 17.73/2.87  % (1591333)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.73/2.87  % (1591333)CaDiCaL version: 2.1.3
% 17.73/2.87  % (1591333)Termination reason: Instruction limit
% 17.73/2.87  % (1591333)Termination phase: Saturation
% 17.73/2.87  % (1591333)Time elapsed: 0.351 s
% 17.73/2.87  % (1591333)Peak memory usage: 15 MB
% 17.73/2.87  % (1591333)Instructions burned: 684 (million)
% 17.73/2.87  % (1591349)fmb+10_1_sil=64000:random_seed=4115908460:i=22061:nm=2:gsp=on_2995 on theBenchmark for (2995ds/22061Mi)
% 17.73/2.87  % (1591349)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 17.73/2.87  % Exception at run slice level
% 17.73/2.87  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 17.73/2.87  % (1591351)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3733573141:i=9515:nm=5_2995 on theBenchmark for (2995ds/9515Mi)
% 17.73/2.87  % Exception at run slice level
% 17.73/2.87  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 28.71/4.39  % (1591336)Instruction limit reached! 
% 28.71/4.39  % (1591336)------------------------------
% 28.71/4.39  % (1591336)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.71/4.39  % (1591336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.71/4.39  % (1591336)CaDiCaL version: 2.1.3
% 28.71/4.39  % (1591336)Termination reason: Instruction limit
% 28.71/4.39  % (1591336)Termination phase: Saturation
% 28.71/4.39  % (1591336)Time elapsed: 0.355 s
% 28.71/4.39  % (1591336)Peak memory usage: 14 MB
% 28.71/4.39  % (1591336)Instructions burned: 477 (million)
% 28.71/4.39  % (1591353)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3358337672:fmbsr=1.7:i=920_2995 on theBenchmark for (2995ds/920Mi)
% 28.71/4.39  % Exception at run slice level
% 28.71/4.39  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 28.71/4.39  % (1591354)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=230210161:i=5131_2994 on theBenchmark for (2994ds/5131Mi)
% 28.71/4.39  % (1591354)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 28.71/4.39  % (1591356)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3052255134:i=1472:ins=7:fdi=8:gsp=on_2994 on theBenchmark for (2994ds/1472Mi)
% 28.71/4.39  % (1591356)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 28.71/4.39  % (1591356)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 28.71/4.39  % (1591344)Instruction limit reached! 
% 28.71/4.39  % (1591344)------------------------------
% 28.71/4.39  % (1591344)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.71/4.39  % (1591344)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.71/4.39  % (1591344)CaDiCaL version: 2.1.3
% 28.71/4.39  % (1591344)Termination reason: Instruction limit
% 28.71/4.39  % (1591344)Termination phase: Saturation
% 28.71/4.39  % (1591344)Time elapsed: 0.318 s
% 28.71/4.39  % (1591344)Peak memory usage: 15 MB
% 28.71/4.39  % (1591344)Instructions burned: 694 (million)
% 28.71/4.39  % (1591359)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1378141463:i=6324_2994 on theBenchmark for (2994ds/6324Mi)
% 28.71/4.39  % Exception at run slice level
% 28.71/4.39  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 28.71/4.39  % (1591361)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=626706527:fmbsr=2.30978:i=2174_2994 on theBenchmark for (2994ds/2174Mi)
% 28.71/4.39  % Exception at run slice level
% 28.71/4.39  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 28.71/4.39  % (1591363)ott-2_1_sil=16000:newcnf=on:random_seed=1912688178:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2994 on theBenchmark for (2994ds/869Mi)
% 28.71/4.39  % (1591363)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 28.71/4.39  % (1591341)Instruction limit reached! 
% 28.71/4.39  % (1591341)------------------------------
% 28.71/4.39  % (1591341)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.71/4.39  % (1591341)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.71/4.39  % (1591341)CaDiCaL version: 2.1.3
% 28.71/4.39  % (1591341)Termination reason: Instruction limit
% 28.71/4.39  % (1591341)Termination phase: Saturation
% 28.71/4.39  % (1591341)Time elapsed: 0.513 s
% 28.71/4.39  % (1591341)Peak memory usage: 15 MB
% 28.71/4.39  % (1591341)Instructions burned: 1180 (million)
% 28.71/4.39  % (1591365)ott+10_1_sil=32000:tgt=ground:random_seed=1094506393:i=5114:av=off_2993 on theBenchmark for (2993ds/5114Mi)
% 28.71/4.39  % (1591347)Instruction limit reached! 
% 28.71/4.39  % (1591347)------------------------------
% 28.71/4.39  % (1591347)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.71/4.39  % (1591347)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.71/4.39  % (1591347)CaDiCaL version: 2.1.3
% 28.71/4.39  % (1591347)Termination reason: Instruction limit
% 28.71/4.39  % (1591347)Termination phase: Saturation
% 28.71/4.39  % (1591347)Time elapsed: 0.714 s
% 28.71/4.39  % (1591347)Peak memory usage: 15 MB
% 28.71/4.39  % (1591347)Instructions burned: 883 (million)
% 28.71/4.39  % (1591367)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=2285459101:i=54282_2990 on theBenchmark for (2990ds/54282Mi)
% 28.71/4.39  % Exception at run slice level
% 28.71/4.39  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 28.71/4.39  % (1591369)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=484163968:i=3512:aac=none_2989 on theBenchmark for (2989ds/3512Mi)
% 28.71/4.39  % (1591363)Instruction limit reached! 
% 28.71/4.39  % (1591363)------------------------------
% 28.71/4.39  % (1591363)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.71/4.39  % (1591363)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.71/4.39  % (1591363)CaDiCaL version: 2.1.3
% 28.71/4.39  % (1591363)Termination reason: Instruction limit
% 28.71/4.39  % (1591363)Termination phase: Saturation
% 28.71/4.39  % (1591363)Time elapsed: 0.443 s
% 28.71/4.39  % (1591363)Peak memory usage: 16 MB
% 28.71/4.39  % (1591363)Instructions burned: 869 (million)
% 28.71/4.39  % (1591369)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 28.71/4.39  % (1591371)dis+21_1_sil=32000:sas=cadical:random_seed=2787577537:i=3773:amm=off_2989 on theBenchmark for (2989ds/3773Mi)
% 28.71/4.39  % (1591356)Instruction limit reached! 
% 28.71/4.39  % (1591356)------------------------------
% 28.71/4.39  % (1591356)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.71/4.39  % (1591356)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.71/4.39  % (1591356)CaDiCaL version: 2.1.3
% 28.71/4.39  % (1591356)Termination reason: Instruction limit
% 28.71/4.39  % (1591356)Termination phase: Saturation
% 28.71/4.39  % (1591356)Time elapsed: 0.756 s
% 28.71/4.39  % (1591356)Peak memory usage: 21 MB
% 28.71/4.39  % (1591356)Instructions burned: 1473 (million)
% 28.71/4.39  % (1591373)ott+11_1_sil=16000:gs=on:random_seed=1775787184:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2987 on theBenchmark for (2987ds/2251Mi)
% 28.71/4.39  % (1591373)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 28.71/4.39  % (1591373)Instruction limit reached! 
% 28.71/4.39  % (1591373)------------------------------
% 28.71/4.39  % (1591373)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.71/4.39  % (1591373)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.71/4.39  % (1591373)CaDiCaL version: 2.1.3
% 28.71/4.39  % (1591373)Termination reason: Instruction limit
% 28.71/4.39  % (1591373)Termination phase: Saturation
% 28.71/4.39  % (1591373)Time elapsed: 0.972 s
% 28.71/4.39  % (1591373)Peak memory usage: 17 MB
% 28.71/4.39  % (1591373)Instructions burned: 2253 (million)
% 28.71/4.39  % (1591375)fmb+10_1_fmbas=predicate:sil=64000:tgt=ground:fmbss=7:random_seed=839294866:fmbsr=1.6:i=67534_2977 on theBenchmark for (2977ds/67534Mi)
% 28.71/4.39  % Exception at run slice level
% 28.71/4.39  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 28.71/4.39  % (1591377)ott-22_32_sil=16000:tgt=full:fdtod=off:sp=weighted_frequency:rnwc=on:alpa=false:random_seed=3326019471:avsq=on:i=4591:add=off:avsqr=1,16:kws=inv_arity:nm=10:ins=9:fdi=4_2976 on theBenchmark for (2976ds/4591Mi)
% 28.71/4.39  % (1591354)Instruction limit reached! 
% 28.71/4.39  % (1591354)------------------------------
% 28.71/4.39  % (1591354)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.71/4.39  % (1591354)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.71/4.39  % (1591354)CaDiCaL version: 2.1.3
% 28.71/4.39  % (1591354)Termination reason: Instruction limit
% 28.71/4.39  % (1591354)Termination phase: Saturation
% 28.71/4.39  % (1591354)Time elapsed: 1.940 s
% 28.71/4.39  % (1591354)Peak memory usage: 17 MB
% 28.71/4.39  % (1591354)Instructions burned: 5134 (million)
% 28.71/4.39  % (1591379)dis+10_64_to=lpo:sil=32000:spb=intro:urr=on:sac=on:random_seed=539440713:i=29340_2975 on theBenchmark for (2975ds/29340Mi)
% 28.71/4.39  % (1591371)Instruction limit reached! 
% 28.71/4.39  % (1591371)------------------------------
% 28.71/4.39  % (1591371)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.71/4.39  % (1591371)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.71/4.39  % (1591371)CaDiCaL version: 2.1.3
% 28.71/4.39  % (1591371)Termination reason: Instruction limit
% 28.71/4.39  % (1591371)Termination phase: Saturation
% 28.71/4.39  % (1591371)Time elapsed: 1.551 s
% 28.71/4.39  % (1591371)Peak memory usage: 17 MB
% 28.71/4.39  % (1591371)Instructions burned: 3773 (million)
% 28.71/4.39  % (1591381)dis-10_1_sil=64000:sas=cadical:cn=on:random_seed=1013585022:i=5211_2973 on theBenchmark for (2973ds/5211Mi)
% 28.71/4.39  % (1591369)Instruction limit reached! 
% 28.71/4.39  % (1591369)------------------------------
% 28.71/4.39  % (1591369)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.71/4.39  % (1591369)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.71/4.39  % (1591369)CaDiCaL version: 2.1.3
% 28.71/4.39  % (1591369)Termination reason: Instruction limit
% 28.71/4.39  % (1591369)Termination phase: Saturation
% 28.71/4.39  % (1591369)Time elapsed: 1.767 s
% 28.71/4.39  % (1591369)Peak memory usage: 15 MB
% 28.71/4.39  % (1591369)Instructions burned: 3513 (million)
% 28.71/4.39  % (1591383)fmb+10_1_sil=32000:sas=cadical:bce=on:fmbss=17:random_seed=3852841899:i=5497:nm=2_2971 on theBenchmark for (2971ds/5497Mi)
% 28.71/4.39  % Exception at run slice level
% 28.71/4.39  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 28.71/4.39  % (1591385)fmb+10_1_fmbas=predicate:sil=64000:tgt=full:sas=cadical:fmbss=15:random_seed=1714327279:fmbsr=2:i=46332_2971 on theBenchmark for (2971ds/46332Mi)
% 28.71/4.39  % Exception at run slice level
% 28.71/4.39  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 28.71/4.39  % (1591387)fmb+10_1_sil=128000:tgt=full:sas=cadical:fmbss=12:random_seed=376667791:i=14071_2971 on theBenchmark for (2971ds/14071Mi)
% 28.71/4.39  % Exception at run slice level
% 28.71/4.39  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 28.71/4.39  % (1591389)dis+10_161_sil=128000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1656597279:i=22565:add=on:rawr=on_2971 on theBenchmark for (2971ds/22565Mi)
% 28.71/4.39  % (1591365)Instruction limit reached! 
% 28.71/4.39  % (1591365)------------------------------
% 28.71/4.39  % (1591365)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.71/4.39  % (1591365)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.71/4.39  % (1591365)CaDiCaL version: 2.1.3
% 28.71/4.39  % (1591365)Termination reason: Instruction limit
% 28.71/4.39  % (1591365)Termination phase: Saturation
% 28.71/4.39  % (1591365)Time elapsed: 2.852 s
% 28.71/4.39  % (1591365)Peak memory usage: 20 MB
% 28.71/4.39  % (1591365)Instructions burned: 5114 (million)
% 28.71/4.39  % (1591391)ott+4_1_sil=16000:sp=arity:gs=on:random_seed=3941464647:i=8173:av=off_2964 on theBenchmark for (2964ds/8173Mi)
% 28.71/4.39  % (1591391) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1591310-1591391"...
% 28.71/4.39  % (1591391)...printing done.
% 28.71/4.39  % (1591391)Refutation found. Thanks to Tanya!
% 28.71/4.39  % SZS status Theorem for theBenchmark
% 28.71/4.39  % SZS output start Proof for theBenchmark
% See solution above
% 28.71/4.40  % (1591391)------------------------------
% 28.71/4.40  % (1591391)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 28.71/4.40  % (1591391)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 28.71/4.40  % (1591391)CaDiCaL version: 2.1.3
% 28.71/4.40  % (1591391)Termination reason: Refutation
% 28.71/4.40  % (1591391)Time elapsed: 0.546 s
% 28.71/4.40  % (1591391)Peak memory usage: 16 MB
% 28.71/4.40  % (1591391)Instructions burned: 1228 (million)
% 28.71/4.40  % (1591310)Success in time 4.162 s
% 28.71/4.40  % Vampire exiting
%------------------------------------------------------------------------------