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

% Computer : n001.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:49:38 AM UTC 2026

% Result   : Theorem 0.39s 0.29s
% Output   : Refutation 0.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   44 (  25 unt;   0 typ;   6 def)
%            Number of atoms       :  157 ( 103 equ;   0 cnn)
%            Maximal formula atoms :    4 (   3 avg)
%            Number of connectives :  256 (  47   ~;  16   |;   6   &; 175   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :   31 (  31   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   19 (  16 usr;   6 con; 0-4 aty)
%            Number of variables   :   78 (  28   ^;  42   !;   8   ?;  78   :)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    b: $tType ).

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

thf(type_def_7,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    cJ: ( b > $o ) > b ).

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

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

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

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

thf(func_def_8,type,
    sK0: b > a ).

thf(func_def_9,type,
    sK1: b > a ).

thf(func_def_10,type,
    sF2: b ).

thf(func_def_11,type,
    sF3: a ).

thf(func_def_12,type,
    sF4: a ).

thf(func_def_13,type,
    sF5: ( b > $o ) > b ).

thf(func_def_14,type,
    sF6: ( b > $o ) > $o ).

thf(func_def_15,type,
    sF7: b > ( b > $o ) > $o ).

thf(func_def_16,type,
    sK8: b ).

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

thf(f1,conjecture,
    ( ! [X0: b > $o] :
        ( ? [X1: b] : ( X0 @ X1 )
       => ( X0 @ ( cJ @ X0 ) ) )
   => ! [X2: b > a,X3: b > a] :
        ( ( ( X2
            @ ( cJ
              @ ^ [X1: b] :
                  ( ( X2 @ X1 )
                 != ( X3 @ X1 ) ) ) )
          = ( X3
            @ ( cJ
              @ ^ [X1: b] :
                  ( ( X2 @ X1 )
                 != ( X3 @ X1 ) ) ) ) )
       => ( X2 = X3 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5500) ).

thf(f2,negated_conjecture,
    ~ ( ! [X0: b > $o] :
          ( ? [X1: b] : ( X0 @ X1 )
         => ( X0 @ ( cJ @ X0 ) ) )
     => ! [X2: b > a,X3: b > a] :
          ( ( ( X2
              @ ( cJ
                @ ^ [X1: b] :
                    ( ( X2 @ X1 )
                   != ( X3 @ X1 ) ) ) )
            = ( X3
              @ ( cJ
                @ ^ [X1: b] :
                    ( ( X2 @ X1 )
                   != ( X3 @ X1 ) ) ) ) )
         => ( X2 = X3 ) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

thf(f3,plain,
    ~ ( ! [X0: b > $o] :
          ( ? [X1: b] : ( X0 @ X1 )
         => ( X0 @ ( cJ @ X0 ) ) )
     => ! [X2: b > a,X3: b > a] :
          ( ( ( X2
              @ ( cJ
                @ ^ [X4: b] :
                    ( ( X2 @ X4 )
                   != ( X3 @ X4 ) ) ) )
            = ( X3
              @ ( cJ
                @ ^ [X5: b] :
                    ( ( X2 @ X5 )
                   != ( X3 @ X5 ) ) ) ) )
         => ( X2 = X3 ) ) ),
    inference(rectify,[],[f2]) ).

thf(f4,plain,
    ~ ( ! [X0: b > $o] :
          ( ? [X1: b] :
              ( ( X0 @ X1 )
              = $true )
         => ( ( X0 @ ( cJ @ X0 ) )
            = $true ) )
     => ! [X2: b > a,X3: b > a] :
          ( ( ( X2
              @ ( cJ
                @ ^ [Y0: b] :
                    ( ( X2 @ Y0 )
                   != ( X3 @ Y0 ) ) ) )
            = ( X3
              @ ( cJ
                @ ^ [Y0: b] :
                    ( ( X2 @ Y0 )
                   != ( X3 @ Y0 ) ) ) ) )
         => ( X2 = X3 ) ) ),
    inference(fool_elimination,[],[f3]) ).

thf(f5,plain,
    ( ? [X2: b > a,X3: b > a] :
        ( ( X2 != X3 )
        & ( ( X2
            @ ( cJ
              @ ^ [Y0: b] :
                  ( ( X2 @ Y0 )
                 != ( X3 @ Y0 ) ) ) )
          = ( X3
            @ ( cJ
              @ ^ [Y0: b] :
                  ( ( X2 @ Y0 )
                 != ( X3 @ Y0 ) ) ) ) ) )
    & ! [X0: b > $o] :
        ( ( ( X0 @ ( cJ @ X0 ) )
          = $true )
        | ! [X1: b] :
            ( ( X0 @ X1 )
           != $true ) ) ),
    inference(ennf_transformation,[],[f4]) ).

thf(f6,plain,
    ( ? [X0: b > a,X1: b > a] :
        ( ( X0 != X1 )
        & ( ( X0
            @ ( cJ
              @ ^ [Y0: b] :
                  ( ( X0 @ Y0 )
                 != ( X1 @ Y0 ) ) ) )
          = ( X1
            @ ( cJ
              @ ^ [Y0: b] :
                  ( ( X0 @ Y0 )
                 != ( X1 @ Y0 ) ) ) ) ) )
    & ! [X2: b > $o] :
        ( ( $true
          = ( X2 @ ( cJ @ X2 ) ) )
        | ! [X3: b] :
            ( $true
           != ( X2 @ X3 ) ) ) ),
    inference(rectify,[],[f5]) ).

thf(f7,plain,
    ( ( sK0 != sK1 )
    & ( ( sK0
        @ ( cJ
          @ ^ [Y0: b] :
              ( ( sK0 @ Y0 )
             != ( sK1 @ Y0 ) ) ) )
      = ( sK1
        @ ( cJ
          @ ^ [Y0: b] :
              ( ( sK0 @ Y0 )
             != ( sK1 @ Y0 ) ) ) ) )
    & ! [X2: b > $o] :
        ( ( $true
          = ( X2 @ ( cJ @ X2 ) ) )
        | ! [X3: b] :
            ( $true
           != ( X2 @ X3 ) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f6]) ).

thf(f8,plain,
    ! [X2: b > $o,X3: b] :
      ( ( $true
        = ( X2 @ ( cJ @ X2 ) ) )
      | ( $true
       != ( X2 @ X3 ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f9,plain,
    ( ( sK0
      @ ( cJ
        @ ^ [Y0: b] :
            ( ( sK0 @ Y0 )
           != ( sK1 @ Y0 ) ) ) )
    = ( sK1
      @ ( cJ
        @ ^ [Y0: b] :
            ( ( sK0 @ Y0 )
           != ( sK1 @ Y0 ) ) ) ) ),
    inference(cnf_transformation,[],[f7]) ).

thf(f10,plain,
    sK0 != sK1,
    inference(cnf_transformation,[],[f7]) ).

thf(f13,definition,
    ( sF2
    = ( cJ
      @ ^ [Y0: b] :
          ( ( sK0 @ Y0 )
         != ( sK1 @ Y0 ) ) ) ),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

thf(f14,plain,
    ( ( cJ
      @ ^ [Y0: b] :
          ( ( sK0 @ Y0 )
         != ( sK1 @ Y0 ) ) )
    = sF2 ),
    inference(reorient_equations,[],[f13]) ).

thf(f15,definition,
    ( sF3
    = ( sK0 @ sF2 ) ),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

thf(f16,plain,
    ( ( sK0 @ sF2 )
    = sF3 ),
    inference(reorient_equations,[],[f15]) ).

thf(f17,definition,
    ( sF4
    = ( sK1 @ sF2 ) ),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

thf(f18,plain,
    ( ( sK1 @ sF2 )
    = sF4 ),
    inference(reorient_equations,[],[f17]) ).

thf(f19,plain,
    sF3 = sF4,
    inference(definition_folding,[],[f9,f18,f14,f16,f14]) ).

thf(f20,definition,
    ! [X2: b > $o] :
      ( ( sF5 @ X2 )
      = ( cJ @ X2 ) ),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

thf(f21,plain,
    ! [X2: b > $o] :
      ( ( cJ @ X2 )
      = ( sF5 @ X2 ) ),
    inference(reorient_equations,[],[f20]) ).

thf(f22,definition,
    ! [X2: b > $o] :
      ( ( sF6 @ X2 )
      = ( X2 @ ( sF5 @ X2 ) ) ),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

thf(f23,plain,
    ! [X2: b > $o] :
      ( ( X2 @ ( sF5 @ X2 ) )
      = ( sF6 @ X2 ) ),
    inference(reorient_equations,[],[f22]) ).

thf(f24,definition,
    ! [X2: b > $o,X3: b] :
      ( ( sF7 @ X3 @ X2 )
      = ( X2 @ X3 ) ),
    introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).

thf(f25,plain,
    ! [X2: b > $o,X3: b] :
      ( ( X2 @ X3 )
      = ( sF7 @ X3 @ X2 ) ),
    inference(reorient_equations,[],[f24]) ).

thf(f26,plain,
    ! [X2: b > $o,X3: b] :
      ( ( $true
       != ( sF7 @ X3 @ X2 ) )
      | ( $true
        = ( sF6 @ X2 ) ) ),
    inference(definition_folding,[],[f8,f25,f23,f21]) ).

thf(f27,plain,
    ! [X2: b > $o] :
      ( ( $true
        = ( X2 @ ( sF5 @ X2 ) ) )
      | ( $false
        = ( sF6 @ X2 ) ) ),
    inference(iff_proxy_clausification,[],[f23]) ).

thf(f30,plain,
    ! [X2: b > $o,X3: b] :
      ( ( $true
        = ( sF7 @ X3 @ X2 ) )
      | ( ( X2 @ X3 )
        = $false ) ),
    inference(iff_proxy_clausification,[],[f25]) ).

thf(f31,plain,
    ( sF3
    = ( sK1 @ sF2 ) ),
    inference(forward_demodulation,[],[f18,f19]) ).

thf(f32,plain,
    ( ( sK0 @ sK8 )
   != ( sK1 @ sK8 ) ),
    inference(negative_extensionality,[],[f10]) ).

thf(f68,plain,
    ( sF2
    = ( sF5
      @ ^ [Y0: b] :
          ( ( sK0 @ Y0 )
         != ( sK1 @ Y0 ) ) ) ),
    inference(constrained_superposition,[],[f21,f14]) ).

thf(f150,plain,
    ! [X0: b,X1: b > $o] :
      ( ( $true != $true )
      | ( $true
        = ( sF6 @ X1 ) )
      | ( $false
        = ( X1 @ X0 ) ) ),
    inference(constrained_superposition,[],[f26,f30]) ).

thf(f157,plain,
    ! [X0: b,X1: b > $o] :
      ( ( $true
        = ( sF6 @ X1 ) )
      | ( $false
        = ( X1 @ X0 ) ) ),
    inference(trivial_inequality_removal,[],[f150]) ).

thf(f236,plain,
    ( ( $true
      = ( ^ [Y0: b] :
            ( ( sK0 @ Y0 )
           != ( sK1 @ Y0 ) )
        @ sF2 ) )
    | ( $false
      = ( sF6
        @ ^ [Y0: b] :
            ( ( sK0 @ Y0 )
           != ( sK1 @ Y0 ) ) ) ) ),
    inference(constrained_superposition,[],[f27,f68]) ).

thf(f237,plain,
    ( ( $true
      = ( ( sK0 @ sF2 )
       != ( sK1 @ sF2 ) ) )
    | ( $false
      = ( sF6
        @ ^ [Y0: b] :
            ( ( sK0 @ Y0 )
           != ( sK1 @ Y0 ) ) ) ) ),
    inference(beta-eta_normalization,[],[f236]) ).

thf(f238,plain,
    ( ( $false
      = ( ( sK0 @ sF2 )
        = ( sK1 @ sF2 ) ) )
    | ( $false
      = ( sF6
        @ ^ [Y0: b] :
            ( ( sK0 @ Y0 )
           != ( sK1 @ Y0 ) ) ) ) ),
    inference(not_proxy_clausification,[],[f237]) ).

thf(f239,plain,
    ( ( ( sK0 @ sF2 )
     != ( sK1 @ sF2 ) )
    | ( $false
      = ( sF6
        @ ^ [Y0: b] :
            ( ( sK0 @ Y0 )
           != ( sK1 @ Y0 ) ) ) ) ),
    inference(equality_proxy_clausification,[],[f238]) ).

thf(f243,plain,
    ( ( ( sK0 @ sF2 )
     != sF3 )
    | ( $false
      = ( sF6
        @ ^ [Y0: b] :
            ( ( sK0 @ Y0 )
           != ( sK1 @ Y0 ) ) ) ) ),
    inference(forward_demodulation,[],[f239,f31]) ).

thf(f245,plain,
    ( $false
    = ( sF6
      @ ^ [Y0: b] :
          ( ( sK0 @ Y0 )
         != ( sK1 @ Y0 ) ) ) ),
    inference(forward_subsumption_resolution,[],[f243,f16]) ).

thf(f288,plain,
    ! [X0: b] :
      ( ( $true = $false )
      | ( $false
        = ( ^ [Y0: b] :
              ( ( sK0 @ Y0 )
             != ( sK1 @ Y0 ) )
          @ X0 ) ) ),
    inference(constrained_superposition,[],[f157,f245]) ).

thf(f294,plain,
    ! [X0: b] :
      ( $false
      = ( ^ [Y0: b] :
            ( ( sK0 @ Y0 )
           != ( sK1 @ Y0 ) )
        @ X0 ) ),
    inference(trivial_inequality_removal,[],[f288]) ).

thf(f295,plain,
    ! [X0: b] :
      ( $false
      = ( ( sK0 @ X0 )
       != ( sK1 @ X0 ) ) ),
    inference(beta-eta_normalization,[],[f294]) ).

thf(f296,plain,
    ! [X0: b] :
      ( $true
      = ( ( sK0 @ X0 )
        = ( sK1 @ X0 ) ) ),
    inference(not_proxy_clausification,[],[f295]) ).

thf(f297,plain,
    ! [X0: b] :
      ( ( sK0 @ X0 )
      = ( sK1 @ X0 ) ),
    inference(equality_proxy_clausification,[],[f296]) ).

thf(f307,plain,
    ( ( sK0 @ sK8 )
   != ( sK0 @ sK8 ) ),
    inference(constrained_superposition,[],[f32,f297]) ).

thf(f308,plain,
    $false,
    inference(trivial_inequality_removal,[],[f307]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO271^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.16  % Computer : n001.cluster.edu
% 0.09/0.16  % Model    : x86_64 x86_64
% 0.09/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16  % Memory   : 8046.5625MB
% 0.09/0.16  % OS       : Linux 6.8.0-71-generic
% 0.09/0.17  % CPULimit : 300
% 0.09/0.17  % WCLimit  : 300
% 0.09/0.17  % DateTime : Tue Sep 29 16:48:06 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20  Running first-order model finding
% 0.09/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
% 0.39/0.29  % (1487688)Will run a generic schedule for satisfiability detection.
% 0.39/0.29  % (1487718)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=726036786:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.39/0.29  % (1487718)Refutation not found, incomplete strategy
% 0.39/0.29  % (1487718)------------------------------
% 0.39/0.29  % (1487718)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29  % (1487718)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29  % (1487718)CaDiCaL version: 2.1.3
% 0.39/0.29  % (1487718)Termination reason: Refutation not found, incomplete strategy
% 0.39/0.29  % (1487718)Time elapsed: 0.004 s
% 0.39/0.29  % (1487718)Peak memory usage: 12 MB
% 0.39/0.29  % (1487718)Instructions burned: 12 (million)
% 0.39/0.29  % (1487713)% WARNING: option uhcvi not known.
% 0.39/0.29  % (1487718)------------------------------
% 0.39/0.29  % (1487718)------------------------------
% 0.39/0.29  % (1487712)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3850064891_2999 on theBenchmark for (2999ds/0Mi)
% 0.39/0.29  % (1487716)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3955089185:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.39/0.29  % (1487717)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2074460816:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.39/0.29  % (1487715)dis+10_1_sil=32000:sp=arity:random_seed=1670193514:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.39/0.29  % (1487714)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1131331196:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.39/0.29  % (1487716)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.39/0.29  % Exception at run slice level
% 0.39/0.29  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.39/0.29  % (1487713)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=657497010:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.39/0.29  % (1487713)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.39/0.29  % (1487713)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.39/0.29  % (1487717)Refutation not found, incomplete strategy
% 0.39/0.29  % (1487717)------------------------------
% 0.39/0.29  % (1487717)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29  % (1487717)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29  % (1487717)CaDiCaL version: 2.1.3
% 0.39/0.29  % (1487717)Termination reason: Refutation not found, incomplete strategy
% 0.39/0.29  % (1487717)Time elapsed: 0.008 s
% 0.39/0.29  % (1487717)Peak memory usage: 12 MB
% 0.39/0.29  % (1487717)Instructions burned: 12 (million)
% 0.39/0.29  % (1487721)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1721011845:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.39/0.29  % (1487715)Refutation not found, incomplete strategy
% 0.39/0.29  % (1487715)------------------------------
% 0.39/0.29  % (1487715)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29  % (1487715)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29  % (1487715)CaDiCaL version: 2.1.3
% 0.39/0.29  % (1487715)Termination reason: Refutation not found, incomplete strategy
% 0.39/0.29  % (1487715)Time elapsed: 0.008 s
% 0.39/0.29  % Exception at run slice level% (1487715)Peak memory usage: 12 MB
% 0.39/0.29  
% 0.39/0.29  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.39/0.29  % (1487715)Instructions burned: 13 (million)
% 0.39/0.29  % (1487717)------------------------------
% 0.39/0.29  % (1487717)------------------------------
% 0.39/0.29  % (1487713)Refutation not found, incomplete strategy
% 0.39/0.29  % (1487713)------------------------------
% 0.39/0.29  % (1487713)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29  % (1487713)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29  % (1487713)CaDiCaL version: 2.1.3
% 0.39/0.29  % (1487713)Termination reason: Refutation not found, incomplete strategy
% 0.39/0.29  % (1487713)Time elapsed: 0.007 s
% 0.39/0.29  % (1487713)Peak memory usage: 12 MB
% 0.39/0.29  % (1487713)Instructions burned: 12 (million)
% 0.39/0.29  % (1487715)------------------------------
% 0.39/0.29  % (1487715)------------------------------
% 0.39/0.29  % (1487713)------------------------------
% 0.39/0.29  % (1487713)------------------------------
% 0.39/0.29  % (1487716)Refutation not found, incomplete strategy
% 0.39/0.29  % (1487716)------------------------------
% 0.39/0.29  % (1487716)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29  % (1487716)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29  % (1487716)CaDiCaL version: 2.1.3
% 0.39/0.29  % (1487716)Termination reason: Refutation not found, incomplete strategy
% 0.39/0.29  % (1487716)Time elapsed: 0.013 s
% 0.39/0.29  % (1487716)Peak memory usage: 12 MB
% 0.39/0.29  % (1487716)Instructions burned: 24 (million)
% 0.39/0.29  % (1487716)------------------------------
% 0.39/0.29  % (1487716)------------------------------
% 0.39/0.29  % (1487730)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=3820054023:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.39/0.29  % (1487714)Refutation not found, incomplete strategy
% 0.39/0.29  % (1487714)------------------------------
% 0.39/0.29  % (1487714)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29  % (1487714)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29  % (1487714)CaDiCaL version: 2.1.3
% 0.39/0.29  % (1487714)Termination reason: Refutation not found, incomplete strategy
% 0.39/0.29  % (1487714)Time elapsed: 0.018 s
% 0.39/0.29  % (1487714)Peak memory usage: 12 MB
% 0.39/0.29  % (1487714)Instructions burned: 31 (million)
% 0.39/0.29  % (1487730)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.39/0.29  % (1487730)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.39/0.29  % (1487714)------------------------------
% 0.39/0.29  % (1487714)------------------------------
% 0.39/0.29  % (1487728)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2846899578:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.39/0.29  % (1487730)Refutation not found, incomplete strategy
% 0.39/0.29  % (1487730)------------------------------
% 0.39/0.29  % (1487730)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29  % (1487730)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29  % (1487730)CaDiCaL version: 2.1.3
% 0.39/0.29  % (1487730)Termination reason: Refutation not found, incomplete strategy
% 0.39/0.29  % (1487730)Time elapsed: 0.004 s
% 0.39/0.29  % (1487730)Peak memory usage: 13 MB
% 0.39/0.29  % (1487730)Instructions burned: 12 (million)
% 0.39/0.29  % (1487730)------------------------------
% 0.39/0.29  % (1487730)------------------------------
% 0.39/0.29  % (1487731)ott-21_1_sil=16000:fs=off:random_seed=2199420624:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.39/0.29  % (1487728)Refutation not found, incomplete strategy
% 0.39/0.29  % (1487728)------------------------------
% 0.39/0.29  % (1487728)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29  % (1487728)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29  % (1487728)CaDiCaL version: 2.1.3
% 0.39/0.29  % (1487728)Termination reason: Refutation not found, incomplete strategy
% 0.39/0.29  % (1487728)Time elapsed: 0.007 s
% 0.39/0.29  % (1487728)Peak memory usage: 12 MB
% 0.39/0.29  % (1487728)Instructions burned: 11 (million)
% 0.39/0.29  % (1487728)------------------------------
% 0.39/0.29  % (1487728)------------------------------
% 0.39/0.29  % (1487732)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=4187216375:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 0.39/0.29  % (1487733)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3716720699:fmbsr=1.3:i=865:ins=25_2999 on theBenchmark for (2999ds/865Mi)
% 0.39/0.29  % Exception at run slice level
% 0.39/0.29  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.39/0.29  % (1487738)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=1175655018:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2999 on theBenchmark for (2999ds/692Mi)
% 0.39/0.29  % (1487734)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1499085300:i=1179_2999 on theBenchmark for (2999ds/1179Mi)
% 0.39/0.29  % (1487738)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.39/0.29  % (1487738)Refutation not found, incomplete strategy
% 0.39/0.29  % (1487738)------------------------------
% 0.39/0.29  % (1487738)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29  % (1487738)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29  % (1487738)CaDiCaL version: 2.1.3
% 0.39/0.29  % (1487738)Termination reason: Refutation not found, incomplete strategy
% 0.39/0.29  % (1487738)Time elapsed: 0.004 s
% 0.39/0.29  % (1487738)Peak memory usage: 12 MB
% 0.39/0.29  % (1487738)Instructions burned: 13 (million)
% 0.39/0.29  % (1487736)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2493841488:i=889:ins=1_2999 on theBenchmark for (2999ds/889Mi)
% 0.39/0.29  % (1487738)------------------------------
% 0.39/0.29  % (1487738)------------------------------
% 0.39/0.29  % Exception at run slice level
% 0.39/0.29  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.39/0.29  % (1487734) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1487688-1487734"...
% 0.39/0.29  % (1487740)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1217618477:i=879:kws=inv_precedence:fsr=off_2999 on theBenchmark for (2999ds/879Mi)
% 0.39/0.29  % (1487740)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.39/0.29  % (1487747)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2299143563:i=9515:nm=5_2999 on theBenchmark for (2999ds/9515Mi)
% 0.39/0.29  % Exception at run slice level
% 0.39/0.29  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.39/0.29  % (1487743)fmb+10_1_sil=64000:random_seed=1573107227:i=22061:nm=2:gsp=on_2999 on theBenchmark for (2999ds/22061Mi)
% 0.39/0.29  % (1487734)...printing done.
% 0.39/0.29  % (1487743)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.39/0.29  % Exception at run slice level
% 0.39/0.29  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.39/0.29  % (1487734)Refutation found. Thanks to Tanya!
% 0.39/0.29  % SZS status Theorem for theBenchmark
% 0.39/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.39/0.29  % (1487734)------------------------------
% 0.39/0.29  % (1487734)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.39/0.29  % (1487734)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.39/0.29  % (1487734)CaDiCaL version: 2.1.3
% 0.39/0.29  % (1487734)Termination reason: Refutation
% 0.39/0.29  % (1487734)Time elapsed: 0.015 s
% 0.39/0.29  % (1487734)Peak memory usage: 12 MB
% 0.39/0.29  % (1487734)Instructions burned: 26 (million)
% 0.39/0.29  % (1487688)Success in time 0.086 s
% 0.39/0.29  % Vampire exiting
%------------------------------------------------------------------------------