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

% Computer : n019.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 : Tue Sep 29 12:00:38 PM UTC 2026

% Result   : Theorem 0.94s 0.62s
% Output   : Refutation 0.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   18 (  12 unt;   0 typ;   0 def)
%            Number of atoms       :   33 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   33 (  18   ~;  12   |;   0   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-4 aty)
%            Number of functors    :   79 (  79 usr;  26 con; 0-5 aty)
%            Number of variables   :   18 (  18   !;   0   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    bool: $tType ).

tff(type_def_6,type,
    dB: $tType ).

tff(type_def_7,type,
    list: $tType > $tType ).

tff(type_def_8,type,
    nat: $tType ).

tff(type_def_9,type,
    type: $tType ).

tff(type_def_10,type,
    fun: ( $tType * $tType ) > $tType ).

tff(func_def_0,type,
    combb: 
      !>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,X1),fun(fun(X2,X0),fun(X2,X1))) ).

tff(func_def_1,type,
    combc: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).

tff(func_def_2,type,
    combi: 
      !>[X0: $tType] : fun(X0,X0) ).

tff(func_def_3,type,
    combs: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).

tff(func_def_4,type,
    zero_zero: 
      !>[X0: $tType] : X0 ).

tff(func_def_5,type,
    it: fun(dB,bool) ).

tff(func_def_6,type,
    beta: fun(dB,fun(dB,bool)) ).

tff(func_def_7,type,
    abs: dB > dB ).

tff(func_def_8,type,
    app: fun(dB,fun(dB,dB)) ).

tff(func_def_9,type,
    var: nat > dB ).

tff(func_def_10,type,
    dB_size: dB > nat ).

tff(func_def_11,type,
    lift: fun(dB,fun(nat,dB)) ).

tff(func_def_12,type,
    subst: ( dB * dB * nat ) > dB ).

tff(func_def_13,type,
    foldl: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).

tff(func_def_14,type,
    foldr: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).

tff(func_def_15,type,
    cons: 
      !>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).

tff(func_def_16,type,
    list_case: 
      !>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).

tff(func_def_17,type,
    map: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).

tff(func_def_18,type,
    size_size: 
      !>[X0: $tType] : ( X0 > nat ) ).

tff(func_def_19,type,
    shift: 
      !>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).

tff(func_def_20,type,
    fun1: fun(type,fun(type,type)) ).

tff(func_def_21,type,
    type_case: 
      !>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).

tff(func_def_22,type,
    typing: ( fun(nat,type) * dB ) > fun(type,bool) ).

tff(func_def_23,type,
    typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).

tff(func_def_24,type,
    aa: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).

tff(func_def_25,type,
    fFalse: bool ).

tff(func_def_26,type,
    fTrue: bool ).

tff(func_def_27,type,
    fconj: fun(bool,fun(bool,bool)) ).

tff(func_def_28,type,
    t2: type ).

tff(func_def_29,type,
    t1: type ).

tff(func_def_30,type,
    t_a: type ).

tff(func_def_31,type,
    t: type ).

tff(func_def_32,type,
    ts: list(type) ).

tff(func_def_33,type,
    a: dB ).

tff(func_def_34,type,
    as: list(dB) ).

tff(func_def_35,type,
    e: fun(nat,type) ).

tff(func_def_36,type,
    ea: fun(nat,type) ).

tff(func_def_37,type,
    i: nat ).

tff(func_def_38,type,
    ia: nat ).

tff(func_def_39,type,
    n: nat ).

tff(func_def_40,type,
    rs: list(dB) ).

tff(func_def_41,type,
    t3: dB ).

tff(func_def_42,type,
    u: dB ).

tff(func_def_43,type,
    ua: dB ).

tff(func_def_44,type,
    sK2: ( type * dB * fun(nat,type) ) > type ).

tff(func_def_45,type,
    sK3: ( type * dB * fun(nat,type) ) > type ).

tff(func_def_46,type,
    sK4: ( type * dB * dB * fun(nat,type) ) > type ).

tff(func_def_47,type,
    sK5: ( dB * fun(nat,type) ) > type ).

tff(func_def_48,type,
    sK6: ( dB * fun(nat,type) ) > type ).

tff(func_def_49,type,
    sK7: list(type) ).

tff(func_def_50,type,
    sK8: type ).

tff(func_def_51,type,
    sK9: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).

tff(func_def_52,type,
    sK10: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).

tff(func_def_53,type,
    sK11: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).

tff(func_def_54,type,
    sK12: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).

tff(func_def_55,type,
    sK13: dB > dB ).

tff(func_def_56,type,
    sK14: dB > dB ).

tff(func_def_57,type,
    sK15: dB > list(dB) ).

tff(func_def_58,type,
    sK16: dB > list(dB) ).

tff(func_def_59,type,
    sK17: dB > nat ).

tff(func_def_60,type,
    sK18: dB > dB ).

tff(func_def_61,type,
    sK19: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).

tff(func_def_62,type,
    sK20: ( dB * dB ) > dB ).

tff(func_def_63,type,
    sK21: ( dB * dB * dB ) > dB ).

tff(func_def_64,type,
    sK22: ( dB * dB * dB ) > dB ).

tff(func_def_65,type,
    sK23: ( dB * dB * dB ) > dB ).

tff(func_def_66,type,
    sK24: ( dB * list(dB) * dB ) > dB ).

tff(func_def_67,type,
    sK25: ( dB * list(dB) * dB ) > dB ).

tff(func_def_68,type,
    sK26: ( dB * list(dB) * dB ) > list(dB) ).

tff(func_def_69,type,
    sK27: ( dB * list(dB) * dB ) > list(dB) ).

tff(func_def_70,type,
    sK28: ( dB * list(dB) * dB ) > dB ).

tff(func_def_71,type,
    sK29: ( dB * list(dB) * nat ) > list(dB) ).

tff(func_def_72,type,
    sK30: 
      !>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).

tff(func_def_73,type,
    sK31: 
      !>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > X0 ) ).

tff(func_def_74,type,
    sK32: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).

tff(func_def_75,type,
    sK33: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).

tff(func_def_76,type,
    sK34: 
      !>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).

tff(pred_def_1,type,
    zero: 
      !>[X0: $tType] : $o ).

tff(pred_def_2,type,
    step1: 
      !>[X0: $tType] : ( ( fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > $o ) ).

tff(pred_def_3,type,
    listsp: 
      !>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).

tff(pred_def_4,type,
    pp: bool > $o ).

tff(pred_def_5,type,
    sP0: dB > $o ).

tff(pred_def_6,type,
    sP1: ( dB * list(dB) * dB ) > $o ).

tff(f3,axiom,
    pp(aa(dB,bool,it,u)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_uIT) ).

tff(f4,axiom,
    pp(aa(type,bool,typing(e,u),t)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_uT) ).

tff(f5,axiom,
    ! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
      ( pp(aa(type,bool,typing(shift(type,X0,X3,t),a),X1))
     => ( pp(aa(dB,bool,it,X2))
       => ( pp(aa(type,bool,typing(X0,X2),t))
         => pp(aa(dB,bool,it,subst(a,X2,X3))) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4__096ALL_Ae_AT_H_Au_Ai_O_Ae_060i_058T_062_A_092_060turnstile_062_Aa_A_058_AT_H_A_N_N_062_AIT_Au_A_N_N_062_Ae_A_092_060turnstile_062_Au_A_058_AT_A_N_N_062_AIT_A_Ia_091u_Pi_093_J_096) ).

tff(f7,axiom,
    pp(aa(type,bool,typing(shift(type,e,i,t),a),t2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_6_argT) ).

tff(f112,conjecture,
    pp(aa(dB,bool,it,subst(a,u,i))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f113,negated_conjecture,
    ~ pp(aa(dB,bool,it,subst(a,u,i))),
    inference(negated_conjecture,[status(cth)],[f112]) ).

tff(f116,plain,
    ~ pp(aa(dB,bool,it,subst(a,u,i))),
    inference(flattening,[],[f113]) ).

tff(f117,plain,
    ! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
      ( pp(aa(dB,bool,it,subst(a,X2,X3)))
      | ~ pp(aa(type,bool,typing(X0,X2),t))
      | ~ pp(aa(dB,bool,it,X2))
      | ~ pp(aa(type,bool,typing(shift(type,X0,X3,t),a),X1)) ),
    inference(ennf_transformation,[],[f5]) ).

tff(f118,plain,
    ! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
      ( pp(aa(dB,bool,it,subst(a,X2,X3)))
      | ~ pp(aa(type,bool,typing(X0,X2),t))
      | ~ pp(aa(dB,bool,it,X2))
      | ~ pp(aa(type,bool,typing(shift(type,X0,X3,t),a),X1)) ),
    inference(flattening,[],[f117]) ).

tff(f228,plain,
    pp(aa(dB,bool,it,u)),
    inference(cnf_transformation,[],[f3]) ).

tff(f229,plain,
    pp(aa(type,bool,typing(e,u),t)),
    inference(cnf_transformation,[],[f4]) ).

tff(f230,plain,
    ! [X2: dB,X3: nat,X0: fun(nat,type),X1: type] :
      ( pp(aa(dB,bool,it,subst(a,X2,X3)))
      | ~ pp(aa(type,bool,typing(X0,X2),t))
      | ~ pp(aa(dB,bool,it,X2))
      | ~ pp(aa(type,bool,typing(shift(type,X0,X3,t),a),X1)) ),
    inference(cnf_transformation,[],[f118]) ).

tff(f232,plain,
    pp(aa(type,bool,typing(shift(type,e,i,t),a),t2)),
    inference(cnf_transformation,[],[f7]) ).

tff(f395,plain,
    ~ pp(aa(dB,bool,it,subst(a,u,i))),
    inference(cnf_transformation,[],[f116]) ).

tff(f3093,plain,
    ! [X0: fun(nat,type),X1: type] :
      ( ~ pp(aa(type,bool,typing(shift(type,X0,i,t),a),X1))
      | ~ pp(aa(dB,bool,it,u))
      | ~ pp(aa(type,bool,typing(X0,u),t)) ),
    inference(resolution,[],[f230,f395]) ).

tff(f3120,plain,
    ( ~ pp(aa(type,bool,typing(e,u),t))
    | ~ pp(aa(dB,bool,it,u)) ),
    inference(resolution,[],[f3093,f232]) ).

tff(f3157,plain,
    ~ pp(aa(dB,bool,it,u)),
    inference(resolution,[],[f3120,f229]) ).

tff(f3199,plain,
    $false,
    inference(resolution,[],[f3157,f228]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL798_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n019.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 16:52:34 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.42  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
% 0.94/0.62  % (3260220)Will run a generic schedule for satisfiability detection.
% 0.94/0.62  % (3260229)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3051853967:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.94/0.62  % (3260226)% WARNING: option uhcvi not known.
% 0.94/0.62  % (3260226)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2548501748:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.94/0.62  % (3260225)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1873973664_2999 on theBenchmark for (2999ds/0Mi)
% 0.94/0.62  % (3260227)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4154494252:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.94/0.62  % (3260228)dis+10_1_sil=32000:sp=arity:random_seed=1046153461:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.94/0.62  % (3260230)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=181056912:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.94/0.62  % (3260231)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4131218925:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.94/0.62  % Exception at run slice level
% 0.94/0.62  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.94/0.62  % (3260229)Instruction limit reached! 
% 0.94/0.62  % (3260229)------------------------------
% 0.94/0.62  % (3260229)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.94/0.62  % (3260229)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.94/0.62  % (3260229)CaDiCaL version: 2.1.3
% 0.94/0.62  % (3260229)Termination reason: Instruction limit
% 0.94/0.62  % (3260229)Termination phase: Saturation
% 0.94/0.62  % (3260229)Time elapsed: 0.032 s
% 0.94/0.62  % (3260229)Peak memory usage: 12 MB
% 0.94/0.62  % (3260229)Instructions burned: 121 (million)
% 0.94/0.62  % (3260239)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2839178208:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.94/0.62  % Exception at run slice level
% 0.94/0.62  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.94/0.62  % (3260240)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=427961686:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.94/0.62  % (3260242)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=1453389304:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.94/0.62  % (3260228)Instruction limit reached! 
% 0.94/0.62  % (3260228)------------------------------
% 0.94/0.62  % (3260228)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.94/0.62  % (3260228)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.94/0.62  % (3260228)CaDiCaL version: 2.1.3
% 0.94/0.62  % (3260228)Termination reason: Instruction limit
% 0.94/0.62  % (3260228)Termination phase: Saturation
% 0.94/0.62  % (3260228)Time elapsed: 0.059 s
% 0.94/0.62  % (3260228)Peak memory usage: 12 MB
% 0.94/0.62  % (3260228)Instructions burned: 103 (million)
% 0.94/0.62  % (3260230)Instruction limit reached! 
% 0.94/0.62  % (3260230)------------------------------
% 0.94/0.62  % (3260230)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.94/0.62  % (3260230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.94/0.62  % (3260230)CaDiCaL version: 2.1.3
% 0.94/0.62  % (3260230)Termination reason: Instruction limit
% 0.94/0.62  % (3260230)Termination phase: Saturation
% 0.94/0.62  % (3260230)Time elapsed: 0.075 s
% 0.94/0.62  % (3260230)Peak memory usage: 13 MB
% 0.94/0.62  % (3260230)Instructions burned: 131 (million)
% 0.94/0.62  % (3260240)Instruction limit reached! 
% 0.94/0.62  % (3260240)------------------------------
% 0.94/0.62  % (3260240)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.94/0.62  % (3260240)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.94/0.62  % (3260240)CaDiCaL version: 2.1.3
% 0.94/0.62  % (3260240)Termination reason: Instruction limit
% 0.94/0.62  % (3260240)Termination phase: Saturation
% 0.94/0.62  % (3260240)Time elapsed: 0.042 s
% 0.94/0.62  % (3260240)Peak memory usage: 12 MB
% 0.94/0.62  % (3260240)Instructions burned: 135 (million)
% 0.94/0.62  % (3260245)ott-21_1_sil=16000:fs=off:random_seed=1172867135:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.94/0.62  % (3260231)Instruction limit reached! 
% 0.94/0.62  % (3260231)------------------------------
% 0.94/0.62  % (3260231)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.94/0.62  % (3260231)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.94/0.62  % (3260231)CaDiCaL version: 2.1.3
% 0.94/0.62  % (3260231)Termination reason: Instruction limit
% 0.94/0.62  % (3260231)Termination phase: Saturation
% 0.94/0.62  % (3260231)Time elapsed: 0.087 s
% 0.94/0.62  % (3260231)Peak memory usage: 13 MB
% 0.94/0.62  % (3260231)Instructions burned: 160 (million)
% 0.94/0.62  % (3260248)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3356887054:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 0.94/0.62  % Exception at run slice level
% 0.94/0.62  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.94/0.62  % (3260246)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3848980163:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.94/0.62  % (3260251)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1954545102:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 0.94/0.62  % Exception at run slice level
% 0.94/0.62  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.94/0.62  % (3260249)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3047969735:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 0.94/0.62  % (3260254)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=1896193441: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)
% 0.94/0.62  % (3260245) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3260220-3260245"...
% 0.94/0.62  % (3260245)...printing done.
% 0.94/0.62  % (3260245)Refutation found. Thanks to Tanya!
% 0.94/0.62  % SZS status Theorem for theBenchmark
% 0.94/0.62  % SZS output start Proof for theBenchmark
% See solution above
% 0.94/0.62  % (3260245)------------------------------
% 0.94/0.62  % (3260245)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.94/0.62  % (3260245)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.94/0.62  % (3260245)CaDiCaL version: 2.1.3
% 0.94/0.62  % (3260245)Termination reason: Refutation
% 0.94/0.62  % (3260245)Time elapsed: 0.072 s
% 0.94/0.62  % (3260245)Peak memory usage: 12 MB
% 0.94/0.62  % (3260245)Instructions burned: 133 (million)
% 0.94/0.62  % (3260220)Success in time 0.191 s
% 0.94/0.62  % Vampire exiting
%------------------------------------------------------------------------------