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

% Computer : n014.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:39:31 AM UTC 2026

% Result   : Theorem 56.64s 8.22s
% Output   : Refutation 56.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   26
%            Number of leaves      :    8
% Syntax   : Number of formulae    :  108 (  23 unt;   0 typ;   4 def)
%            Number of atoms       :  624 ( 172 equ;   0 cnn)
%            Maximal formula atoms :    4 (   5 avg)
%            Number of connectives :  644 (  50   ~; 105   |;  16   &; 451   @)
%                                         (   4 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   86 (  86   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   94 (  90 usr;  16 con; 0-4 aty)
%                                         (   4  !!;   0  ??;   0 @@+;   0 @@-)
%            Number of variables   :  153 (   0 sgn 135   !;   8   ?; 153   :)

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

thf(type_def_6,type,
    sK0: $tType ).

thf(func_def_0,type,
    'const/sets/SUBSET': 
      !>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > $o ) ).

thf(func_def_1,type,
    'const/sets/PSUBSET': 
      !>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > $o ) ).

thf(func_def_2,type,
    'const/sets/IN': 
      !>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).

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

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

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

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

thf(func_def_8,type,
    vIMP: $o > $o > $o ).

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

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

thf(func_def_13,type,
    sK1: sK0 > $o ).

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

thf(func_def_15,type,
    sK3: sK0 > $o ).

thf(func_def_16,type,
    sK4: 
      !>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).

thf(func_def_17,type,
    sK5: 
      !>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 ) ).

thf(func_def_18,type,
    sK6: sK0 ).

thf(func_def_20,type,
    sK8: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

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

thf(func_def_22,type,
    sK9: ( ( sK0 > $o ) > $o ) > sK0 ).

thf(func_def_23,type,
    sK10: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(func_def_24,type,
    sK11: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(func_def_25,type,
    sK12: sK0 > $o ).

thf(func_def_26,type,
    sK13: sK0 > $o ).

thf(func_def_27,type,
    sK14: sK0 > $o ).

thf(func_def_28,type,
    sK15: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(func_def_29,type,
    sK16: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(func_def_30,type,
    sK17: ( ( ( sK0 > $o ) > $o ) > $o ) > ( sK0 > $o ) > $o ).

thf(func_def_31,type,
    sK18: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(func_def_32,type,
    sK19: sK0 > $o ).

thf(func_def_33,type,
    sK20: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(func_def_34,type,
    sK21: ( sK0 > $o ) > $o ).

thf(func_def_35,type,
    sK22: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(func_def_36,type,
    sK23: ( sK0 > $o ) > sK0 ).

thf(func_def_37,type,
    sK24: ( sK0 > $o ) > sK0 ).

thf(func_def_38,type,
    sK25: ( sK0 > $o ) > sK0 ).

thf(func_def_39,type,
    sK26: ( sK0 > $o ) > sK0 ).

thf(func_def_40,type,
    sK27: ( sK0 > $o ) > sK0 ).

thf(func_def_41,type,
    sK28: ( sK0 > $o ) > sK0 ).

thf(func_def_42,type,
    sK29: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(func_def_43,type,
    sK30: sK0 > $o ).

thf(func_def_44,type,
    sK31: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(func_def_45,type,
    sK32: ( sK0 > $o ) > sK0 ).

thf(func_def_46,type,
    sK33: ( sK0 > $o ) > sK0 ).

thf(func_def_47,type,
    sK34: ( sK0 > $o ) > sK0 ).

thf(func_def_48,type,
    sK35: ( sK0 > $o ) > sK0 ).

thf(func_def_49,type,
    sK36: ( sK0 > $o ) > sK0 ).

thf(func_def_50,type,
    sK37: ( sK0 > $o ) > sK0 ).

thf(func_def_51,type,
    sK38: ( sK0 > $o ) > sK0 ).

thf(func_def_52,type,
    sK39: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(func_def_53,type,
    sK40: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(func_def_54,type,
    sK41: ( sK0 > $o ) > sK0 ).

thf(func_def_55,type,
    sK42: ( sK0 > $o ) > sK0 ).

thf(func_def_56,type,
    sK43: ( sK0 > $o ) > sK0 ).

thf(func_def_57,type,
    sK44: ( sK0 > $o ) > sK0 ).

thf(func_def_58,type,
    sK45: ( sK0 > $o ) > sK0 ).

thf(func_def_59,type,
    sK46: ( sK0 > $o ) > sK0 ).

thf(func_def_60,type,
    sK47: ( sK0 > $o ) > sK0 ).

thf(func_def_61,type,
    sK48: ( sK0 > $o ) > sK0 ).

thf(func_def_62,type,
    sK49: ( sK0 > $o ) > sK0 ).

thf(func_def_63,type,
    sK50: sK0 ).

thf(func_def_64,type,
    sK51: ( sK0 > $o ) > sK0 ).

thf(func_def_65,type,
    sK52: sK0 ).

thf(func_def_66,type,
    sK53: ( sK0 > $o ) > sK0 ).

thf(func_def_67,type,
    sK54: ( sK0 > $o ) > sK0 ).

thf(func_def_68,type,
    sK55: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(func_def_69,type,
    sK56: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(func_def_70,type,
    sK57: sK0 ).

thf(func_def_71,type,
    sK58: sK0 ).

thf(func_def_72,type,
    sK59: sK0 ).

thf(func_def_73,type,
    sK60: sK0 ).

thf(func_def_74,type,
    sK61: ( sK0 > $o ) > sK0 ).

thf(func_def_75,type,
    sK62: ( sK0 > $o ) > sK0 ).

thf(func_def_76,type,
    sK63: sK0 ).

thf(func_def_77,type,
    sK64: sK0 ).

thf(func_def_78,type,
    sK65: ( sK0 > $o ) > sK0 ).

thf(func_def_79,type,
    sK66: ( sK0 > $o ) > sK0 ).

thf(func_def_80,type,
    sK67: ( sK0 > $o ) > sK0 ).

thf(func_def_81,type,
    sK68: ( sK0 > $o ) > sK0 ).

thf(func_def_82,type,
    sK69: ( sK0 > $o ) > sK0 ).

thf(func_def_83,type,
    sK70: ( sK0 > $o ) > sK0 ).

thf(func_def_84,type,
    sK71: ( sK0 > $o ) > sK0 ).

thf(func_def_85,type,
    sK72: ( sK0 > $o ) > sK0 ).

thf(func_def_86,type,
    sK73: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(func_def_87,type,
    sK74: sK0 > $o ).

thf(func_def_88,type,
    sK75: ( ( sK0 > $o ) > $o ) > sK0 > $o ).

thf(f1,axiom,
    ! [X0: $tType,X1: X0 > $o,X2: X0] :
      ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
      = ( X1 @ X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/IN_') ).

thf(f3,axiom,
    ! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
      ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
      = ( ! [X3: X0] :
            ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
           => ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/SUBSET_') ).

thf(f4,axiom,
    ! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
      ( ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
        = ( X1 != X2 ) )
      & ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/PSUBSET_') ).

thf(f5,conjecture,
    ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > $o] :
      ( ( ( 'const/sets/SUBSET' @ X0 @ X2 @ X3 )
        & ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 ) )
     => ( 'const/sets/PSUBSET' @ X0 @ X1 @ X3 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/sets/PSUBSET_SUBSET_TRANS_') ).

thf(f6,negated_conjecture,
    ~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > $o] :
        ( ( ( 'const/sets/SUBSET' @ X0 @ X2 @ X3 )
          & ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 ) )
       => ( 'const/sets/PSUBSET' @ X0 @ X1 @ X3 ) ),
    inference(negated_conjecture,[status(cth)],[f5]) ).

thf(f8,plain,
    ! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
      ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
      = ( ! [X3: X0] :
            ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
           => ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ) ),
    inference(rectify,[],[f3]) ).

thf(f9,plain,
    ! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
      ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
      = ( !! @ X0
        @ ^ [Y0: X0] :
            ( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
           => ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) ) ) ),
    inference(fool_elimination,[],[f8]) ).

thf(f10,plain,
    ! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
      ( ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
        = ( X1 != X2 ) )
      & ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 ) ),
    inference(rectify,[],[f4]) ).

thf(f11,plain,
    ! [X0: $tType,X1: X0 > $o,X2: X0 > $o] :
      ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
      = ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        & ( X1 != X2 ) ) ),
    inference(fool_elimination,[],[f10]) ).

thf(f12,plain,
    ~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > $o] :
        ( ( ( 'const/sets/SUBSET' @ X0 @ X2 @ X3 )
          & ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 ) )
       => ( 'const/sets/PSUBSET' @ X0 @ X1 @ X3 ) ),
    inference(rectify,[],[f6]) ).

thf(f13,plain,
    ~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > $o] :
        ( ( ( ( 'const/sets/SUBSET' @ X0 @ X2 @ X3 )
            = $true )
          & ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
            = $true ) )
       => ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X3 )
          = $true ) ),
    inference(fool_elimination,[],[f12]) ).

thf(f14,plain,
    ? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > $o] :
      ( ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X3 )
       != $true )
      & ( ( 'const/sets/SUBSET' @ X0 @ X2 @ X3 )
        = $true )
      & ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
        = $true ) ),
    inference(ennf_transformation,[],[f13]) ).

thf(f15,plain,
    ? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > $o] :
      ( ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X3 )
       != $true )
      & ( ( 'const/sets/SUBSET' @ X0 @ X2 @ X3 )
        = $true )
      & ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
        = $true ) ),
    inference(flattening,[],[f14]) ).

thf(f16,plain,
    ( ( $true
     != ( 'const/sets/PSUBSET' @ sK0 @ sK1 @ sK3 ) )
    & ( $true
      = ( 'const/sets/SUBSET' @ sK0 @ sK2 @ sK3 ) )
    & ( $true
      = ( 'const/sets/PSUBSET' @ sK0 @ sK1 @ sK2 ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f15]) ).

thf(f17,plain,
    ! [X0: $tType,X2: X0,X1: X0 > $o] :
      ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
      = ( X1 @ X2 ) ),
    inference(cnf_transformation,[],[f1]) ).

thf(f19,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
      = ( !! @ X0
        @ ^ [Y0: X0] :
            ( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
           => ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) ) ) ),
    inference(cnf_transformation,[],[f9]) ).

thf(f20,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
      = ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        & ( X1 != X2 ) ) ),
    inference(cnf_transformation,[],[f11]) ).

thf(f21,plain,
    ( $true
    = ( 'const/sets/PSUBSET' @ sK0 @ sK1 @ sK2 ) ),
    inference(cnf_transformation,[],[f16]) ).

thf(f22,plain,
    ( $true
    = ( 'const/sets/SUBSET' @ sK0 @ sK2 @ sK3 ) ),
    inference(cnf_transformation,[],[f16]) ).

thf(f23,plain,
    ( $true
   != ( 'const/sets/PSUBSET' @ sK0 @ sK1 @ sK3 ) ),
    inference(cnf_transformation,[],[f16]) ).

thf(f26,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
        = $true )
      | ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
          & ( X1 != X2 ) )
        = $false ) ),
    inference(iff_proxy_clausification,[],[f20]) ).

thf(f27,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
        = $false )
      | ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
          & ( X1 != X2 ) )
        = $true ) ),
    inference(iff_proxy_clausification,[],[f20]) ).

thf(f28,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
        = $false )
      | ( ( X1 != X2 )
        = $true ) ),
    inference(and_proxy_clausification,[],[f27]) ).

thf(f29,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
        = $false )
      | ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        = $true ) ),
    inference(and_proxy_clausification,[],[f27]) ).

thf(f30,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
        = $false )
      | ( ( X1 = X2 )
        = $false ) ),
    inference(not_proxy_clausification,[],[f28]) ).

thf(f31,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
        = $false )
      | ( X1 != X2 ) ),
    inference(equality_proxy_clausification,[],[f30]) ).

thf(f32,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
        = $true )
      | ( ( X1 != X2 )
        = $false )
      | ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        = $false ) ),
    inference(and_proxy_clausification,[],[f26]) ).

thf(f33,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
        = $true )
      | ( ( X1 = X2 )
        = $true )
      | ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        = $false ) ),
    inference(not_proxy_clausification,[],[f32]) ).

thf(f34,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/PSUBSET' @ X0 @ X1 @ X2 )
        = $true )
      | ( X1 = X2 )
      | ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        = $false ) ),
    inference(equality_proxy_clausification,[],[f33]) ).

thf(f35,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        = $true )
      | ( ( !! @ X0
          @ ^ [Y0: X0] :
              ( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
             => ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) ) )
        = $false ) ),
    inference(iff_proxy_clausification,[],[f19]) ).

thf(f36,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        = $false )
      | ( ( !! @ X0
          @ ^ [Y0: X0] :
              ( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
             => ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) ) )
        = $true ) ),
    inference(iff_proxy_clausification,[],[f19]) ).

thf(f37,plain,
    ! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
      ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        = $false )
      | ( $true
        = ( ^ [Y0: X0] :
              ( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
             => ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) )
          @ X3 ) ) ),
    inference(pi_proxy_clausification,[],[f36]) ).

thf(f38,plain,
    ! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
      ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        = $false )
      | ( $true
        = ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
         => ( 'const/sets/IN' @ X0 @ X3 @ X2 ) ) ) ),
    inference(beta-eta_normalization,[],[f37]) ).

thf(f39,plain,
    ! [X0: $tType,X2: X0 > $o,X3: X0,X1: X0 > $o] :
      ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        = $false )
      | ( ( 'const/sets/IN' @ X0 @ X3 @ X1 )
        = $false )
      | ( ( 'const/sets/IN' @ X0 @ X3 @ X2 )
        = $true ) ),
    inference(imp_proxy_clausification,[],[f38]) ).

thf(f40,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        = $true )
      | ( $false
        = ( ^ [Y0: X0] :
              ( ( 'const/sets/IN' @ X0 @ Y0 @ X1 )
             => ( 'const/sets/IN' @ X0 @ Y0 @ X2 ) )
          @ ( sK4 @ X0 @ X1 @ X2 ) ) ) ),
    inference(sigma_proxy_clausification,[],[f35]) ).

thf(f41,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        = $true )
      | ( $false
        = ( ( 'const/sets/IN' @ X0 @ ( sK4 @ X0 @ X1 @ X2 ) @ X1 )
         => ( 'const/sets/IN' @ X0 @ ( sK4 @ X0 @ X1 @ X2 ) @ X2 ) ) ) ),
    inference(beta-eta_normalization,[],[f40]) ).

thf(f42,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        = $true )
      | ( $false
        = ( 'const/sets/IN' @ X0 @ ( sK4 @ X0 @ X1 @ X2 ) @ X2 ) ) ),
    inference(imp_proxy_clausification,[],[f41]) ).

thf(f43,plain,
    ! [X0: $tType,X2: X0 > $o,X1: X0 > $o] :
      ( ( ( 'const/sets/SUBSET' @ X0 @ X1 @ X2 )
        = $true )
      | ( $true
        = ( 'const/sets/IN' @ X0 @ ( sK4 @ X0 @ X1 @ X2 ) @ X1 ) ) ),
    inference(imp_proxy_clausification,[],[f41]) ).

thf(f58,plain,
    ! [X0: $tType,X2: X0,X1: X0 > $o] :
      ( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
        = $true )
      | ( ( X1 @ X2 )
        = $false ) ),
    inference(iff_proxy_clausification,[],[f17]) ).

thf(f59,plain,
    ! [X0: $tType,X2: X0,X1: X0 > $o] :
      ( ( ( 'const/sets/IN' @ X0 @ X2 @ X1 )
        = $false )
      | ( ( X1 @ X2 )
        = $true ) ),
    inference(iff_proxy_clausification,[],[f17]) ).

thf(f98,plain,
    ( ( $true = $false )
    | ( sK1 != sK2 ) ),
    inference(constrained_superposition,[],[f21,f31]) ).

thf(f100,plain,
    sK1 != sK2,
    inference(trivial_inequality_removal,[],[f98]) ).

thf(f103,plain,
    ( ( sK1 @ sK6 )
   != ( sK2 @ sK6 ) ),
    inference(negative_extensionality,[],[f100]) ).

thf(f104,plain,
    ( ( $true
      = ( sK1 @ sK6 ) )
    | ( $true
      = ( sK2 @ sK6 ) ) ),
    inference(xor_proxy_clausification,[],[f103]) ).

thf(f105,plain,
    ( ( $false
      = ( sK1 @ sK6 ) )
    | ( $false
      = ( sK2 @ sK6 ) ) ),
    inference(xor_proxy_clausification,[],[f103]) ).

thf(f107,definition,
    ( spl7_1
  <=> ( $true
      = ( sK2 @ sK6 ) ) ),
    introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).

thf(f109,plain,
    ( ( $true
      = ( sK2 @ sK6 ) )
    | ~ spl7_1 ),
    inference(avatar_component_clause,[],[f107]) ).

thf(f111,definition,
    ( spl7_2
  <=> ( $true
      = ( sK1 @ sK6 ) ) ),
    introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).

thf(f112,plain,
    ( ( $true
     != ( sK1 @ sK6 ) )
    | spl7_2 ),
    inference(avatar_component_clause,[],[f111]) ).

thf(f113,plain,
    ( ( $true
      = ( sK1 @ sK6 ) )
    | ~ spl7_2 ),
    inference(avatar_component_clause,[],[f111]) ).

thf(f114,plain,
    ( spl7_1
    | spl7_2 ),
    inference(avatar_split_clause,[],[f104,f111,f107]) ).

thf(f115,plain,
    ( ( $true = $false )
    | ( $false
      = ( sK2 @ sK6 ) )
    | ~ spl7_2 ),
    inference(forward_demodulation,[],[f105,f113]) ).

thf(f116,plain,
    ( ( $false
      = ( sK2 @ sK6 ) )
    | ~ spl7_2 ),
    inference(trivial_inequality_removal,[],[f115]) ).

thf(f121,plain,
    ( ( $true = $false )
    | ( $true
      = ( 'const/sets/SUBSET' @ sK0 @ sK1 @ sK2 ) ) ),
    inference(constrained_superposition,[],[f21,f29]) ).

thf(f123,plain,
    ( $true
    = ( 'const/sets/SUBSET' @ sK0 @ sK1 @ sK2 ) ),
    inference(trivial_inequality_removal,[],[f121]) ).

thf(f1386,plain,
    ( ( $true != $true )
    | ( sK1 = sK3 )
    | ( $false
      = ( 'const/sets/SUBSET' @ sK0 @ sK1 @ sK3 ) ) ),
    inference(constrained_superposition,[],[f23,f34]) ).

thf(f1404,plain,
    ( ( sK1 = sK3 )
    | ( $false
      = ( 'const/sets/SUBSET' @ sK0 @ sK1 @ sK3 ) ) ),
    inference(trivial_inequality_removal,[],[f1386]) ).

thf(f1419,definition,
    ( spl7_7
  <=> ( $false
      = ( 'const/sets/SUBSET' @ sK0 @ sK1 @ sK3 ) ) ),
    introduced(definition,[new_symbols(definition,[spl7_7])],[avatar_definition]) ).

thf(f1421,plain,
    ( ( $false
      = ( 'const/sets/SUBSET' @ sK0 @ sK1 @ sK3 ) )
    | ~ spl7_7 ),
    inference(avatar_component_clause,[],[f1419]) ).

thf(f1423,definition,
    ( spl7_8
  <=> ( sK1 = sK3 ) ),
    introduced(definition,[new_symbols(definition,[spl7_8])],[avatar_definition]) ).

thf(f1425,plain,
    ( ( sK1 = sK3 )
    | ~ spl7_8 ),
    inference(avatar_component_clause,[],[f1423]) ).

thf(f1426,plain,
    ( spl7_7
    | spl7_8 ),
    inference(avatar_split_clause,[],[f1404,f1423,f1419]) ).

thf(f6743,plain,
    ! [X0: sK0] :
      ( ( $true = $false )
      | ( $false
        = ( 'const/sets/IN' @ sK0 @ X0 @ sK1 ) )
      | ( $true
        = ( 'const/sets/IN' @ sK0 @ X0 @ sK2 ) ) ),
    inference(constrained_superposition,[],[f123,f39]) ).

thf(f6767,plain,
    ! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
      ( ( $true = $false )
      | ( $false
        = ( X2 @ X1 ) )
      | ( ( 'const/sets/SUBSET' @ X0 @ X2 @ X3 )
        = $false )
      | ( $true
        = ( 'const/sets/IN' @ X0 @ X1 @ X3 ) ) ),
    inference(constrained_superposition,[],[f58,f39]) ).

thf(f6866,plain,
    ! [X0: $tType,X2: X0 > $o,X3: X0 > $o,X1: X0] :
      ( ( $false
        = ( X2 @ X1 ) )
      | ( ( 'const/sets/SUBSET' @ X0 @ X2 @ X3 )
        = $false )
      | ( $true
        = ( 'const/sets/IN' @ X0 @ X1 @ X3 ) ) ),
    inference(trivial_inequality_removal,[],[f6767]) ).

thf(f6890,plain,
    ! [X0: sK0] :
      ( ( $true
        = ( 'const/sets/IN' @ sK0 @ X0 @ sK2 ) )
      | ( $false
        = ( 'const/sets/IN' @ sK0 @ X0 @ sK1 ) ) ),
    inference(trivial_inequality_removal,[],[f6743]) ).

thf(f7268,plain,
    ! [X0: sK0] :
      ( ( $true = $false )
      | ( $true
        = ( sK2 @ X0 ) )
      | ( $false
        = ( 'const/sets/IN' @ sK0 @ X0 @ sK1 ) ) ),
    inference(constrained_superposition,[],[f59,f6890]) ).

thf(f7316,plain,
    ! [X0: sK0] :
      ( ( $true
        = ( sK2 @ X0 ) )
      | ( $false
        = ( 'const/sets/IN' @ sK0 @ X0 @ sK1 ) ) ),
    inference(trivial_inequality_removal,[],[f7268]) ).

thf(f7384,plain,
    ! [X0: sK0] :
      ( ( $true = $false )
      | ( $false
        = ( sK1 @ X0 ) )
      | ( $true
        = ( sK2 @ X0 ) ) ),
    inference(constrained_superposition,[],[f58,f7316]) ).

thf(f7448,plain,
    ! [X0: sK0] :
      ( ( $true
        = ( sK2 @ X0 ) )
      | ( $false
        = ( sK1 @ X0 ) ) ),
    inference(trivial_inequality_removal,[],[f7384]) ).

thf(f7531,plain,
    ( ( $true = $false )
    | ( $false
      = ( sK1 @ sK6 ) )
    | ~ spl7_2 ),
    inference(constrained_superposition,[],[f116,f7448]) ).

thf(f7532,plain,
    ( ( $false
      = ( sK1 @ sK6 ) )
    | ~ spl7_2 ),
    inference(trivial_inequality_removal,[],[f7531]) ).

thf(f7569,plain,
    ( ( $true = $false )
    | ~ spl7_2 ),
    inference(constrained_superposition,[],[f7532,f113]) ).

thf(f7632,plain,
    ( $false
    | ~ spl7_2 ),
    inference(trivial_inequality_removal,[],[f7569]) ).

thf(f7633,plain,
    ~ spl7_2,
    inference(avatar_contradiction_clause,[],[f7632]) ).

thf(f7732,plain,
    ( ( $false
      = ( 'const/sets/IN' @ sK0 @ sK6 @ sK1 ) )
    | spl7_2 ),
    inference(unit_resulting_resolution,[],[f59,f112]) ).

thf(f7837,plain,
    ( ! [X0: sK0 > $o] :
        ( ( $true = $false )
        | ( $false
          = ( 'const/sets/SUBSET' @ sK0 @ X0 @ sK1 ) )
        | ( $false
          = ( 'const/sets/IN' @ sK0 @ sK6 @ X0 ) ) )
    | spl7_2 ),
    inference(constrained_superposition,[],[f39,f7732]) ).

thf(f7883,plain,
    ( ! [X0: sK0 > $o] :
        ( ( $false
          = ( 'const/sets/SUBSET' @ sK0 @ X0 @ sK1 ) )
        | ( $false
          = ( 'const/sets/IN' @ sK0 @ sK6 @ X0 ) ) )
    | spl7_2 ),
    inference(trivial_inequality_removal,[],[f7837]) ).

thf(f8214,plain,
    ( ! [X0: sK0 > $o] :
        ( ( $true = $false )
        | ( $false
          = ( X0 @ sK6 ) )
        | ( $false
          = ( 'const/sets/SUBSET' @ sK0 @ X0 @ sK1 ) ) )
    | spl7_2 ),
    inference(constrained_superposition,[],[f58,f7883]) ).

thf(f8256,plain,
    ( ! [X0: sK0 > $o] :
        ( ( $false
          = ( X0 @ sK6 ) )
        | ( $false
          = ( 'const/sets/SUBSET' @ sK0 @ X0 @ sK1 ) ) )
    | spl7_2 ),
    inference(trivial_inequality_removal,[],[f8214]) ).

thf(f8388,plain,
    ( ( $true = $false )
    | ( $false
      = ( 'const/sets/SUBSET' @ sK0
        @ ^ [Y0: sK0] :
            ( sK2
            @ ( ^ [Y1: sK0] : Y1
              @ Y0 ) )
        @ sK1 ) )
    | ~ spl7_1
    | spl7_2 ),
    inference(constrained_superposition,[],[f109,f8256]) ).

thf(f8449,plain,
    ( ( $false
      = ( 'const/sets/SUBSET' @ sK0
        @ ^ [Y0: sK0] :
            ( sK2
            @ ( ^ [Y1: sK0] : Y1
              @ Y0 ) )
        @ sK1 ) )
    | ~ spl7_1
    | spl7_2 ),
    inference(trivial_inequality_removal,[],[f8388]) ).

thf(f8450,plain,
    ( ( $false
      = ( 'const/sets/SUBSET' @ sK0 @ sK2 @ sK1 ) )
    | ~ spl7_1
    | spl7_2 ),
    inference(beta-eta_normalization,[],[f8449]) ).

thf(f23288,plain,
    ! [X0: sK0] :
      ( ( $true = $false )
      | ( $false
        = ( sK2 @ X0 ) )
      | ( $true
        = ( 'const/sets/IN' @ sK0 @ X0 @ sK3 ) ) ),
    inference(constrained_superposition,[],[f22,f6866]) ).

thf(f23459,plain,
    ! [X0: sK0] :
      ( ( $true
        = ( 'const/sets/IN' @ sK0 @ X0 @ sK3 ) )
      | ( $false
        = ( sK2 @ X0 ) ) ),
    inference(trivial_inequality_removal,[],[f23288]) ).

thf(f59669,plain,
    ! [X0: sK0 > $o] :
      ( ( $true = $false )
      | ( $false
        = ( sK2 @ ( sK4 @ sK0 @ X0 @ sK3 ) ) )
      | ( $true
        = ( 'const/sets/SUBSET' @ sK0 @ X0 @ sK3 ) ) ),
    inference(constrained_superposition,[],[f23459,f42]) ).

thf(f59852,plain,
    ! [X0: sK0 > $o] :
      ( ( $false
        = ( sK2 @ ( sK4 @ sK0 @ X0 @ sK3 ) ) )
      | ( $true
        = ( 'const/sets/SUBSET' @ sK0 @ X0 @ sK3 ) ) ),
    inference(trivial_inequality_removal,[],[f59669]) ).

thf(f77168,plain,
    ! [X0: sK0 > $o] :
      ( ( $true = $false )
      | ( $true
        = ( sK2 @ ( sK4 @ sK0 @ sK1 @ X0 ) ) )
      | ( $true
        = ( 'const/sets/SUBSET' @ sK0 @ sK1 @ X0 ) ) ),
    inference(constrained_superposition,[],[f7316,f43]) ).

thf(f77344,plain,
    ! [X0: sK0 > $o] :
      ( ( $true
        = ( sK2 @ ( sK4 @ sK0 @ sK1 @ X0 ) ) )
      | ( $true
        = ( 'const/sets/SUBSET' @ sK0 @ sK1 @ X0 ) ) ),
    inference(trivial_inequality_removal,[],[f77168]) ).

thf(f93730,plain,
    ( ( $true = $false )
    | ( $true
      = ( 'const/sets/SUBSET' @ sK0 @ sK1 @ sK3 ) )
    | ( $true
      = ( 'const/sets/SUBSET' @ sK0 @ sK1 @ sK3 ) ) ),
    inference(constrained_superposition,[],[f77344,f59852]) ).

thf(f93960,plain,
    ( ( $true = $false )
    | ( $true
      = ( 'const/sets/SUBSET' @ sK0 @ sK1 @ sK3 ) ) ),
    inference(duplicate_literal_removal,[],[f93730]) ).

thf(f93961,plain,
    ( $true
    = ( 'const/sets/SUBSET' @ sK0 @ sK1 @ sK3 ) ),
    inference(trivial_inequality_removal,[],[f93960]) ).

thf(f94008,plain,
    ( ( $true = $false )
    | ~ spl7_7 ),
    inference(forward_demodulation,[],[f93961,f1421]) ).

thf(f94009,plain,
    ( $false
    | ~ spl7_7 ),
    inference(trivial_inequality_removal,[],[f94008]) ).

thf(f94010,plain,
    ~ spl7_7,
    inference(avatar_contradiction_clause,[],[f94009]) ).

thf(f94026,plain,
    ( ( $true
      = ( 'const/sets/SUBSET' @ sK0 @ sK2 @ sK1 ) )
    | ~ spl7_8 ),
    inference(constrained_superposition,[],[f22,f1425]) ).

thf(f94105,plain,
    ( ( $true = $false )
    | ~ spl7_1
    | spl7_2
    | ~ spl7_8 ),
    inference(forward_demodulation,[],[f94026,f8450]) ).

thf(f94106,plain,
    ( $false
    | ~ spl7_1
    | spl7_2
    | ~ spl7_8 ),
    inference(trivial_inequality_removal,[],[f94105]) ).

thf(f94107,plain,
    ( ~ spl7_1
    | spl7_2
    | ~ spl7_8 ),
    inference(avatar_contradiction_clause,[],[f94106]) ).

cnf(s1,plain,
    ( spl7_1
    | spl7_2 ),
    inference(sat_conversion,[],[f114]) ).

cnf(s6,plain,
    ( spl7_7
    | spl7_8 ),
    inference(sat_conversion,[],[f1426]) ).

cnf(s14,plain,
    ~ spl7_2,
    inference(sat_conversion,[],[f7633]) ).

cnf(s39,plain,
    ~ spl7_7,
    inference(sat_conversion,[],[f94010]) ).

cnf(s41,plain,
    ( ~ spl7_1
    | spl7_2
    | ~ spl7_8 ),
    inference(sat_conversion,[],[f94107]) ).

cnf(s47,plain,
    spl7_8,
    inference(rat,[],[s6,s39]) ).

cnf(s49,plain,
    ~ spl7_1,
    inference(rat,[],[s41,s14,s47]) ).

cnf(s52,plain,
    $false,
    inference(rat,[],[s1,s14,s49]) ).

thf(f94124,plain,
    $false,
    inference(avatar_sat_refutation,[],[s52]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV449^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17  % Computer : n014.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % OS       : Linux 6.8.0-71-generic
% 0.08/0.17  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Tue Sep 29 15:48:14 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20  Running first-order model finding
% 0.08/0.20  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.00/0.95  % (2837368)Will run a generic schedule for satisfiability detection.
% 4.00/0.95  % (2837374)% WARNING: option uhcvi not known.
% 4.00/0.95  % (2837373)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=587332989_2999 on theBenchmark for (2999ds/0Mi)
% 4.00/0.95  % (2837374)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2124789600:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.00/0.95  % (2837375)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1692587587:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.00/0.95  % (2837377)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4173054306:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.00/0.95  % (2837376)dis+10_1_sil=32000:sp=arity:random_seed=2712648010:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.00/0.95  % (2837378)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1376252344:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.00/0.95  % (2837374)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 4.00/0.95  % (2837377)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 4.00/0.95  % Exception at run slice level
% 4.00/0.95  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.00/0.95  % (2837374)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 4.00/0.95  % (2837379)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2337834503:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.00/0.95  % (2837386)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=187479205:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.00/0.95  % Exception at run slice level
% 4.00/0.95  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.00/0.95  % (2837389)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3662905040:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 4.00/0.95  % (2837376)Instruction limit reached! 
% 4.00/0.95  % (2837376)------------------------------
% 4.00/0.95  % (2837376)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.00/0.95  % (2837376)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.00/0.95  % (2837376)CaDiCaL version: 2.1.3
% 4.00/0.95  % (2837376)Termination reason: Instruction limit
% 4.00/0.95  % (2837376)Termination phase: Saturation
% 4.00/0.95  % (2837376)Time elapsed: 0.056 s
% 4.00/0.95  % (2837376)Peak memory usage: 12 MB
% 4.00/0.95  % (2837376)Instructions burned: 104 (million)
% 4.00/0.95  % (2837389)Instruction limit reached! 
% 4.00/0.95  % (2837389)------------------------------
% 4.00/0.95  % (2837389)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.00/0.95  % (2837389)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.00/0.95  % (2837389)CaDiCaL version: 2.1.3
% 4.00/0.95  % (2837389)Termination reason: Instruction limit
% 4.00/0.95  % (2837389)Termination phase: Saturation
% 4.00/0.95  % (2837389)Time elapsed: 0.036 s
% 4.00/0.95  % (2837389)Peak memory usage: 12 MB
% 4.00/0.95  % (2837389)Instructions burned: 132 (million)
% 4.00/0.95  % (2837377)Instruction limit reached! 
% 4.00/0.95  % (2837377)------------------------------
% 4.00/0.95  % (2837377)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.00/0.95  % (2837377)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.00/0.95  % (2837377)CaDiCaL version: 2.1.3
% 4.00/0.95  % (2837377)Termination reason: Instruction limit
% 4.00/0.95  % (2837377)Termination phase: Saturation
% 4.00/0.95  % (2837377)Time elapsed: 0.063 s
% 4.00/0.95  % (2837377)Peak memory usage: 12 MB
% 4.00/0.95  % (2837377)Instructions burned: 118 (million)
% 4.00/0.95  % (2837378)Instruction limit reached! 
% 4.00/0.95  % (2837378)------------------------------
% 4.00/0.95  % (2837378)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.00/0.95  % (2837378)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.00/0.95  % (2837378)CaDiCaL version: 2.1.3
% 4.00/0.95  % (2837378)Termination reason: Instruction limit
% 4.00/0.95  % (2837378)Termination phase: Saturation
% 4.00/0.95  % (2837378)Time elapsed: 0.069 s
% 4.00/0.95  % (2837378)Peak memory usage: 12 MB
% 4.00/0.95  % (2837378)Instructions burned: 131 (million)
% 4.00/0.95  % (2837392)ott-21_1_sil=16000:fs=off:random_seed=3751256661:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 16.78/2.62  % (2837391)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=3368478757:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 16.78/2.62  % (2837391)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 16.78/2.62  % (2837391)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 16.78/2.62  % (2837393)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2581765556:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 16.78/2.62  % (2837394)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3161584443:fmbsr=1.3:i=865:ins=25_2999 on theBenchmark for (2999ds/865Mi)
% 16.78/2.62  % Exception at run slice level
% 16.78/2.62  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 16.78/2.62  % (2837379)Instruction limit reached! 
% 16.78/2.62  % (2837379)------------------------------
% 16.78/2.62  % (2837379)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.78/2.62  % (2837379)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.78/2.62  % (2837379)CaDiCaL version: 2.1.3
% 16.78/2.62  % (2837379)Termination reason: Instruction limit
% 16.78/2.62  % (2837379)Termination phase: Saturation
% 16.78/2.62  % (2837379)Time elapsed: 0.084 s
% 16.78/2.62  % (2837379)Peak memory usage: 12 MB
% 16.78/2.62  % (2837379)Instructions burned: 159 (million)
% 16.78/2.62  % (2837400)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1730310190:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 16.78/2.62  % (2837399)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=982604732:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 16.78/2.62  % Exception at run slice level
% 16.78/2.62  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 16.78/2.62  % (2837392)Instruction limit reached! 
% 16.78/2.62  % (2837392)------------------------------
% 16.78/2.62  % (2837392)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.78/2.62  % (2837392)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.78/2.62  % (2837392)CaDiCaL version: 2.1.3
% 16.78/2.62  % (2837392)Termination reason: Instruction limit
% 16.78/2.62  % (2837392)Termination phase: Saturation
% 16.78/2.62  % (2837392)Time elapsed: 0.045 s
% 16.78/2.62  % (2837392)Peak memory usage: 12 MB
% 16.78/2.62  % (2837392)Instructions burned: 181 (million)
% 16.78/2.62  % (2837404)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1895865402:i=879:kws=inv_precedence:fsr=off_2998 on theBenchmark for (2998ds/879Mi)
% 16.78/2.62  % (2837404)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 16.78/2.62  % (2837403)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=1943472230:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2998 on theBenchmark for (2998ds/692Mi)
% 16.78/2.62  % (2837403)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 16.78/2.62  % (2837393)Instruction limit reached! 
% 16.78/2.62  % (2837393)------------------------------
% 16.78/2.62  % (2837393)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.78/2.62  % (2837393)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 16.78/2.62  % (2837393)CaDiCaL version: 2.1.3
% 16.78/2.62  % (2837393)Termination reason: Instruction limit
% 16.78/2.62  % (2837393)Termination phase: Saturation
% 16.78/2.62  % (2837393)Time elapsed: 0.259 s
% 16.78/2.62  % (2837393)Peak memory usage: 13 MB
% 16.78/2.62  % (2837393)Instructions burned: 478 (million)
% 16.78/2.62  % (2837407)fmb+10_1_sil=64000:random_seed=2833779231:i=22061:nm=2:gsp=on_2996 on theBenchmark for (2996ds/22061Mi)
% 16.78/2.62  % (2837407)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 16.78/2.62  % Exception at run slice level
% 16.78/2.62  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 16.78/2.62  % (2837404)Instruction limit reached! 
% 16.78/2.62  % (2837404)------------------------------
% 16.78/2.62  % (2837404)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 16.78/2.62  % (2837404)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.34/5.25  % (2837404)CaDiCaL version: 2.1.3
% 35.34/5.25  % (2837404)Termination reason: Instruction limit
% 35.34/5.25  % (2837404)Termination phase: Saturation
% 35.34/5.25  % (2837404)Time elapsed: 0.241 s
% 35.34/5.25  % (2837404)Peak memory usage: 15 MB
% 35.34/5.25  % (2837404)Instructions burned: 880 (million)
% 35.34/5.25  % (2837410)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1849564636:fmbsr=1.7:i=920_2996 on theBenchmark for (2996ds/920Mi)
% 35.34/5.25  % Exception at run slice level
% 35.34/5.25  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 35.34/5.25  % (2837409)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=781228485:i=9515:nm=5_2996 on theBenchmark for (2996ds/9515Mi)
% 35.34/5.25  % Exception at run slice level
% 35.34/5.25  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 35.34/5.25  % (2837412)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3054235923:i=5131_2995 on theBenchmark for (2995ds/5131Mi)
% 35.34/5.25  % (2837412)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 35.34/5.26  % (2837414)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2113820231:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 35.34/5.26  % (2837414)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 35.34/5.26  % (2837414)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 35.34/5.26  % (2837391)Instruction limit reached! 
% 35.34/5.26  % (2837391)------------------------------
% 35.34/5.26  % (2837391)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.34/5.26  % (2837391)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.34/5.26  % (2837391)CaDiCaL version: 2.1.3
% 35.34/5.26  % (2837391)Termination reason: Instruction limit
% 35.34/5.26  % (2837391)Termination phase: Saturation
% 35.34/5.26  % (2837391)Time elapsed: 0.351 s
% 35.34/5.26  % (2837391)Peak memory usage: 14 MB
% 35.34/5.26  % (2837391)Instructions burned: 684 (million)
% 35.34/5.26  % (2837417)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1083140707:i=6324_2995 on theBenchmark for (2995ds/6324Mi)
% 35.34/5.26  % Exception at run slice level
% 35.34/5.26  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 35.34/5.26  % (2837419)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=3565352709:fmbsr=2.30978:i=2174_2995 on theBenchmark for (2995ds/2174Mi)
% 35.34/5.26  % Exception at run slice level
% 35.34/5.26  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 35.34/5.26  % (2837403)Instruction limit reached! 
% 35.34/5.26  % (2837403)------------------------------
% 35.34/5.26  % (2837403)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.34/5.26  % (2837403)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.34/5.26  % (2837403)CaDiCaL version: 2.1.3
% 35.34/5.26  % (2837403)Termination reason: Instruction limit
% 35.34/5.26  % (2837403)Termination phase: Saturation
% 35.34/5.26  % (2837403)Time elapsed: 0.354 s
% 35.34/5.26  % (2837403)Peak memory usage: 15 MB
% 35.34/5.26  % (2837403)Instructions burned: 692 (million)
% 35.34/5.26  % (2837421)ott-2_1_sil=16000:newcnf=on:random_seed=2726866325:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2995 on theBenchmark for (2995ds/869Mi)
% 35.34/5.26  % (2837421)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 35.34/5.26  % (2837422)ott+10_1_sil=32000:tgt=ground:random_seed=1938093320:i=5114:av=off_2994 on theBenchmark for (2994ds/5114Mi)
% 35.34/5.26  % (2837399)Instruction limit reached! 
% 35.34/5.26  % (2837399)------------------------------
% 35.34/5.26  % (2837399)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 35.34/5.26  % (2837399)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 35.34/5.26  % (2837399)CaDiCaL version: 2.1.3
% 35.34/5.26  % (2837399)Termination reason: Instruction limit
% 35.34/5.26  % (2837399)Termination phase: Saturation
% 35.34/5.26  % (2837399)Time elapsed: 0.582 s
% 35.34/5.26  % (2837399)Peak memory usage: 15 MB
% 35.34/5.26  % (2837399)Instructions burned: 1181 (million)
% 35.34/5.26  % (2837425)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=3140599477:i=54282_2992 on theBenchmark for (2992ds/54282Mi)
% 35.34/5.26  % Exception at run slice level
% 56.64/8.22  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 56.64/8.22  % (2837427)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=617445726:i=3512:aac=none_2992 on theBenchmark for (2992ds/3512Mi)
% 56.64/8.22  % (2837427)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 56.64/8.22  % (2837421)Instruction limit reached! 
% 56.64/8.22  % (2837421)------------------------------
% 56.64/8.22  % (2837421)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 56.64/8.22  % (2837421)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 56.64/8.22  % (2837421)CaDiCaL version: 2.1.3
% 56.64/8.22  % (2837421)Termination reason: Instruction limit
% 56.64/8.22  % (2837421)Termination phase: Saturation
% 56.64/8.22  % (2837421)Time elapsed: 0.405 s
% 56.64/8.22  % (2837421)Peak memory usage: 14 MB
% 56.64/8.22  % (2837421)Instructions burned: 871 (million)
% 56.64/8.22  % (2837429)dis+21_1_sil=32000:sas=cadical:random_seed=2194233524:i=3773:amm=off_2990 on theBenchmark for (2990ds/3773Mi)
% 56.64/8.22  % (2837414)Instruction limit reached! 
% 56.64/8.22  % (2837414)------------------------------
% 56.64/8.22  % (2837414)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 56.64/8.22  % (2837414)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 56.64/8.22  % (2837414)CaDiCaL version: 2.1.3
% 56.64/8.22  % (2837414)Termination reason: Instruction limit
% 56.64/8.22  % (2837414)Termination phase: Saturation
% 56.64/8.22  % (2837414)Time elapsed: 0.754 s
% 56.64/8.22  % (2837414)Peak memory usage: 18 MB
% 56.64/8.22  % (2837414)Instructions burned: 1474 (million)
% 56.64/8.22  % (2837431)ott+11_1_sil=16000:gs=on:random_seed=4106994200:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2988 on theBenchmark for (2988ds/2251Mi)
% 56.64/8.22  % (2837431)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 56.64/8.22  % (2837412)Instruction limit reached! 
% 56.64/8.22  % (2837412)------------------------------
% 56.64/8.22  % (2837412)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 56.64/8.22  % (2837412)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 56.64/8.22  % (2837412)CaDiCaL version: 2.1.3
% 56.64/8.22  % (2837412)Termination reason: Instruction limit
% 56.64/8.22  % (2837412)Termination phase: Saturation
% 56.64/8.22  % (2837412)Time elapsed: 1.232 s
% 56.64/8.22  % (2837412)Peak memory usage: 22 MB
% 56.64/8.22  % (2837412)Instructions burned: 5131 (million)
% 56.64/8.22  % (2837433)fmb+10_1_fmbas=predicate:sil=64000:tgt=ground:fmbss=7:random_seed=2822520335:fmbsr=1.6:i=67534_2983 on theBenchmark for (2983ds/67534Mi)
% 56.64/8.22  % Exception at run slice level
% 56.64/8.22  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 56.64/8.22  % (2837435)ott-22_32_sil=16000:tgt=full:fdtod=off:sp=weighted_frequency:rnwc=on:alpa=false:random_seed=421186287:avsq=on:i=4591:add=off:avsqr=1,16:kws=inv_arity:nm=10:ins=9:fdi=4_2983 on theBenchmark for (2983ds/4591Mi)
% 56.64/8.22  % (2837431)Instruction limit reached! 
% 56.64/8.22  % (2837431)------------------------------
% 56.64/8.22  % (2837431)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 56.64/8.22  % (2837431)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 56.64/8.22  % (2837431)CaDiCaL version: 2.1.3
% 56.64/8.22  % (2837431)Termination reason: Instruction limit
% 56.64/8.22  % (2837431)Termination phase: Saturation
% 56.64/8.22  % (2837431)Time elapsed: 1.008 s
% 56.64/8.22  % (2837431)Peak memory usage: 15 MB
% 56.64/8.22  % (2837431)Instructions burned: 2253 (million)
% 56.64/8.22  % (2837437)dis+10_64_to=lpo:sil=32000:spb=intro:urr=on:sac=on:random_seed=2474650727:i=29340_2977 on theBenchmark for (2977ds/29340Mi)
% 56.64/8.22  % (2837427)Instruction limit reached! 
% 56.64/8.22  % (2837427)------------------------------
% 56.64/8.22  % (2837427)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 56.64/8.22  % (2837427)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 56.64/8.22  % (2837427)CaDiCaL version: 2.1.3
% 56.64/8.22  % (2837427)Termination reason: Instruction limit
% 56.64/8.22  % (2837427)Termination phase: Saturation
% 56.64/8.22  % (2837427)Time elapsed: 1.628 s
% 56.64/8.22  % (2837427)Peak memory usage: 20 MB
% 56.64/8.22  % (2837427)Instructions burned: 3515 (million)
% 56.64/8.22  % (2837439)dis-10_1_sil=64000:sas=cadical:cn=on:random_seed=983723232:i=5211_2976 on theBenchmark for (2976ds/5211Mi)
% 56.64/8.22  % (2837429)Instruction limit reached! 
% 56.64/8.22  % (2837429)------------------------------
% 56.64/8.22  % (2837429)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 56.64/8.22  % (2837429)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 56.64/8.22  % (2837429)CaDiCaL version: 2.1.3
% 56.64/8.22  % (2837429)Termination reason: Instruction limit
% 56.64/8.22  % (2837429)Termination phase: Saturation
% 56.64/8.22  % (2837429)Time elapsed: 1.746 s
% 56.64/8.22  % (2837429)Peak memory usage: 19 MB
% 56.64/8.22  % (2837429)Instructions burned: 3775 (million)
% 56.64/8.22  % (2837441)fmb+10_1_sil=32000:sas=cadical:bce=on:fmbss=17:random_seed=1777450454:i=5497:nm=2_2973 on theBenchmark for (2973ds/5497Mi)
% 56.64/8.22  % Exception at run slice level
% 56.64/8.22  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 56.64/8.22  % (2837443)fmb+10_1_fmbas=predicate:sil=64000:tgt=full:sas=cadical:fmbss=15:random_seed=2527035122:fmbsr=2:i=46332_2972 on theBenchmark for (2972ds/46332Mi)
% 56.64/8.22  % Exception at run slice level
% 56.64/8.22  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 56.64/8.22  % (2837445)fmb+10_1_sil=128000:tgt=full:sas=cadical:fmbss=12:random_seed=1426942880:i=14071_2972 on theBenchmark for (2972ds/14071Mi)
% 56.64/8.22  % Exception at run slice level
% 56.64/8.22  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 56.64/8.22  % (2837447)dis+10_161_sil=128000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2000040811:i=22565:add=on:rawr=on_2972 on theBenchmark for (2972ds/22565Mi)
% 56.64/8.22  % (2837435)Instruction limit reached! 
% 56.64/8.22  % (2837435)------------------------------
% 56.64/8.22  % (2837435)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 56.64/8.22  % (2837435)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 56.64/8.22  % (2837435)CaDiCaL version: 2.1.3
% 56.64/8.22  % (2837435)Termination reason: Instruction limit
% 56.64/8.22  % (2837435)Termination phase: Saturation
% 56.64/8.22  % (2837435)Time elapsed: 1.259 s
% 56.64/8.22  % (2837435)Peak memory usage: 34 MB
% 56.64/8.22  % (2837435)Instructions burned: 4594 (million)
% 56.64/8.22  % (2837449)ott+4_1_sil=16000:sp=arity:gs=on:random_seed=4086551903:i=8173:av=off_2970 on theBenchmark for (2970ds/8173Mi)
% 56.64/8.22  % (2837422)Instruction limit reached! 
% 56.64/8.22  % (2837422)------------------------------
% 56.64/8.22  % (2837422)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 56.64/8.22  % (2837422)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 56.64/8.22  % (2837422)CaDiCaL version: 2.1.3
% 56.64/8.22  % (2837422)Termination reason: Instruction limit
% 56.64/8.22  % (2837422)Termination phase: Saturation
% 56.64/8.22  % (2837422)Time elapsed: 2.418 s
% 56.64/8.22  % (2837422)Peak memory usage: 25 MB
% 56.64/8.22  % (2837422)Instructions burned: 5114 (million)
% 56.64/8.22  % (2837451)dis+10_16:1_sil=16000:random_seed=1203549227:i=9155:fsr=off_2970 on theBenchmark for (2970ds/9155Mi)
% 56.64/8.22  % (2837439)Instruction limit reached! 
% 56.64/8.22  % (2837439)------------------------------
% 56.64/8.22  % (2837439)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 56.64/8.22  % (2837439)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 56.64/8.22  % (2837439)CaDiCaL version: 2.1.3
% 56.64/8.22  % (2837439)Termination reason: Instruction limit
% 56.64/8.22  % (2837439)Termination phase: Saturation
% 56.64/8.22  % (2837439)Time elapsed: 2.503 s
% 56.64/8.22  % (2837439)Peak memory usage: 27 MB
% 56.64/8.22  % (2837439)Instructions burned: 5212 (million)
% 56.64/8.22  % (2837453)ott-3_8_sil=64000:random_seed=3417950787:i=20139:bs=on_2950 on theBenchmark for (2950ds/20139Mi)
% 56.64/8.22  % (2837449)Instruction limit reached! 
% 56.64/8.22  % (2837449)------------------------------
% 56.64/8.22  % (2837449)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 56.64/8.22  % (2837449)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 56.64/8.22  % (2837449)CaDiCaL version: 2.1.3
% 56.64/8.22  % (2837449)Termination reason: Instruction limit
% 56.64/8.22  % (2837449)Termination phase: Saturation
% 56.64/8.22  % (2837449)Time elapsed: 2.085 s
% 56.64/8.22  % (2837449)Peak memory usage: 32 MB
% 56.64/8.22  % (2837449)Instructions burned: 8176 (million)
% 56.64/8.22  % (2837455)fmb+10_1_sil=64000:tgt=ground:sas=cadical:bce=on:fmbss=9:random_seed=2838405795:fmbsr=2:i=32576_2949 on theBenchmark for (2949ds/32576Mi)
% 56.64/8.22  % Exception at run slice level
% 56.64/8.22  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 56.64/8.22  % (2837457)ott+10_8:1_sil=16000:sp=arity:gs=on:random_seed=4148528281:i=11404_2949 on theBenchmark for (2949ds/11404Mi)
% 56.64/8.22  % (2837451)Instruction limit reached! 
% 56.64/8.22  % (2837451)------------------------------
% 56.64/8.22  % (2837451)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 56.64/8.22  % (2837451)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 56.64/8.22  % (2837451)CaDiCaL version: 2.1.3
% 56.64/8.22  % (2837451)Termination reason: Instruction limit
% 56.64/8.22  % (2837451)Termination phase: Saturation
% 56.64/8.22  % (2837451)Time elapsed: 4.177 s
% 56.64/8.22  % (2837451)Peak memory usage: 25 MB
% 56.64/8.22  % (2837451)Instructions burned: 9157 (million)
% 56.64/8.22  % (2837461)ott-11_1_sil=16000:alpa=false:sac=on:random_seed=2645238320:i=14134_2928 on theBenchmark for (2928ds/14134Mi)
% 56.64/8.22  % (2837461)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 56.64/8.22  % (2837457)Instruction limit reached! 
% 56.64/8.22  % (2837457)------------------------------
% 56.64/8.22  % (2837457)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 56.64/8.22  % (2837457)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 56.64/8.22  % (2837457)CaDiCaL version: 2.1.3
% 56.64/8.22  % (2837457)Termination reason: Instruction limit
% 56.64/8.22  % (2837457)Termination phase: Saturation
% 56.64/8.22  % (2837457)Time elapsed: 2.885 s
% 56.64/8.22  % (2837457)Peak memory usage: 34 MB
% 56.64/8.22  % (2837457)Instructions burned: 11408 (million)
% 56.64/8.22  % (2837463)dis+33_16_sil=32000:sac=on:random_seed=3324955142:i=15851:nm=0_2920 on theBenchmark for (2920ds/15851Mi)
% 56.64/8.22  % (2837437) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2837368-2837437"...
% 56.64/8.22  % (2837437)...printing done.
% 56.64/8.22  % (2837437)Refutation found. Thanks to Tanya!
% 56.64/8.22  % SZS status Theorem for theBenchmark
% 56.64/8.22  % SZS output start Proof for theBenchmark
% See solution above
% 56.64/8.22  % (2837437)------------------------------
% 56.64/8.22  % (2837437)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 56.64/8.22  % (2837437)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 56.64/8.22  % (2837437)CaDiCaL version: 2.1.3
% 56.64/8.22  % (2837437)Termination reason: Refutation
% 56.64/8.22  % (2837437)Time elapsed: 5.756 s
% 56.64/8.22  % (2837437)Peak memory usage: 43 MB
% 56.64/8.22  % (2837437)Instructions burned: 12968 (million)
% 56.64/8.22  % (2837368)Success in time 8.009 s
% 56.64/8.22  % Vampire exiting
%------------------------------------------------------------------------------