↑ 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  : LCL808_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:41 PM UTC 2026

% Result   : Theorem 1.69s 0.82s
% Output   : Refutation 1.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   19 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   34 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   35 (  20   ~;  12   |;   0   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   78 (  78 usr;  33 con; 0-6 aty)
%            Number of variables   :   22 (  21   !;   1   ?;  22   :)

% 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(fun(X0,fun(X1,X2)),fun(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(fun(X0,fun(X1,X2)),fun(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,
    abs: dB > dB ).

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

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

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

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

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

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

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

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

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

tff(func_def_16,type,
    listset: 
      !>[X0: $tType] : ( list(fun(X0,bool)) > fun(list(X0),bool) ) ).

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

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

tff(func_def_19,type,
    collect: 
      !>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).

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

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

tff(func_def_22,type,
    typing: fun(fun(nat,type),fun(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,
    fAll: 
      !>[X0: $tType] : fun(fun(X0,bool),bool) ).

tff(func_def_26,type,
    fEx: 
      !>[X0: $tType] : fun(fun(X0,bool),bool) ).

tff(func_def_27,type,
    fFalse: bool ).

tff(func_def_28,type,
    fTrue: bool ).

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

tff(func_def_30,type,
    fequal: 
      !>[X0: $tType] : fun(X0,fun(X0,bool)) ).

tff(func_def_31,type,
    fimplies: fun(bool,fun(bool,bool)) ).

tff(func_def_32,type,
    member: 
      !>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).

tff(func_def_33,type,
    t2: type ).

tff(func_def_34,type,
    t1: type ).

tff(func_def_35,type,
    t_a: type ).

tff(func_def_36,type,
    t: type ).

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

tff(func_def_38,type,
    ua1: type ).

tff(func_def_39,type,
    a: dB ).

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

tff(func_def_41,type,
    b: dB ).

tff(func_def_42,type,
    bs: list(dB) ).

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

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

tff(func_def_45,type,
    i: nat ).

tff(func_def_46,type,
    ia: nat ).

tff(func_def_47,type,
    n: nat ).

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

tff(func_def_49,type,
    t3: dB ).

tff(func_def_50,type,
    u: dB ).

tff(func_def_51,type,
    ua: dB ).

tff(func_def_52,type,
    sK0: type ).

tff(func_def_53,type,
    sK1: type ).

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

tff(func_def_55,type,
    sK3: type ).

tff(func_def_56,type,
    sK4: list(type) ).

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

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

tff(func_def_59,type,
    sK7: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).

tff(func_def_60,type,
    sK8: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).

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

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

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

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

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

tff(func_def_66,type,
    sK14: ( type * dB * fun(nat,type) ) > type ).

tff(func_def_67,type,
    sK15: ( type * dB * fun(nat,type) ) > type ).

tff(func_def_68,type,
    sK16: ( dB * fun(nat,type) ) > type ).

tff(func_def_69,type,
    sK17: ( dB * fun(nat,type) ) > type ).

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

tff(func_def_71,type,
    sK19: dB > dB ).

tff(func_def_72,type,
    sK20: dB > list(dB) ).

tff(func_def_73,type,
    sK21: dB > dB ).

tff(func_def_74,type,
    sK22: dB > list(dB) ).

tff(func_def_75,type,
    sK23: dB > nat ).

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

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

tff(pred_def_3,type,
    pp: bool > $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,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,e),u),t)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_uT) ).

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

tff(f9,axiom,
    ~ ! [X0: type] : ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t)),b),X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_8__096_B_Bthesis_O_A_I_B_BU_O_Ae_060i_058T_062_A_092_060turnstile_062_Ab_A_058_AU_A_061_061_062_Athesis_J_A_061_061_062_Athesis_096) ).

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

tff(f120,negated_conjecture,
    ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),u),i))),
    inference(negated_conjecture,[status(cth)],[f119]) ).

tff(f122,plain,
    ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),u),i))),
    inference(flattening,[],[f120]) ).

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

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

tff(f127,plain,
    ? [X0: type] : pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t)),b),X0)),
    inference(ennf_transformation,[],[f9]) ).

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

tff(f172,plain,
    pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,e),u),t)),
    inference(cnf_transformation,[],[f4]) ).

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

tff(f178,plain,
    pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t)),b),sK1)),
    inference(cnf_transformation,[],[f127]) ).

tff(f332,plain,
    ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),u),i))),
    inference(cnf_transformation,[],[f122]) ).

tff(f2389,plain,
    ! [X0: fun(nat,type),X1: type] :
      ( ~ pp(aa(dB,bool,it,u))
      | ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),u),t))
      | ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),X0),i),t)),b),X1)) ),
    inference(resolution,[],[f174,f332]) ).

tff(f2406,plain,
    ! [X0: fun(nat,type),X1: type] :
      ( ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),X0),i),t)),b),X1))
      | ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),u),t)) ),
    inference(forward_subsumption_resolution,[],[f2389,f171]) ).

tff(f2567,plain,
    ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,e),u),t)),
    inference(resolution,[],[f2406,f178]) ).

tff(f2586,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f2567,f172]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL808_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n019.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 16:54:03 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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
% 1.69/0.82  % (3261503)Will run a generic schedule for satisfiability detection.
% 1.69/0.82  % (3261508)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2697111663_2999 on theBenchmark for (2999ds/0Mi)
% 1.69/0.82  % (3261509)% WARNING: option uhcvi not known.
% 1.69/0.82  % Exception at run slice level
% 1.69/0.82  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.69/0.82  % (3261510)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1814408364:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.69/0.82  % (3261511)dis+10_1_sil=32000:sp=arity:random_seed=1815898209:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.69/0.82  % (3261512)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4105271247:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.69/0.82  % (3261513)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=423252335:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.69/0.82  % (3261514)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2595415418:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.69/0.82  % (3261509)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3655831588:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.69/0.82  % (3261516)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3321467091:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.69/0.82  % Exception at run slice level
% 1.69/0.82  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.69/0.82  % (3261524)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2924066150:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.69/0.82  % (3261511)Instruction limit reached! 
% 1.69/0.82  % (3261511)------------------------------
% 1.69/0.82  % (3261511)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.82  % (3261511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.82  % (3261511)CaDiCaL version: 2.1.3
% 1.69/0.82  % (3261511)Termination reason: Instruction limit
% 1.69/0.82  % (3261511)Termination phase: Saturation
% 1.69/0.82  % (3261511)Time elapsed: 0.059 s
% 1.69/0.82  % (3261511)Peak memory usage: 12 MB
% 1.69/0.82  % (3261511)Instructions burned: 105 (million)
% 1.69/0.82  % (3261512)Instruction limit reached! 
% 1.69/0.82  % (3261512)------------------------------
% 1.69/0.82  % (3261512)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.82  % (3261512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.82  % (3261512)CaDiCaL version: 2.1.3
% 1.69/0.82  % (3261512)Termination reason: Instruction limit
% 1.69/0.82  % (3261512)Termination phase: Saturation
% 1.69/0.82  % (3261512)Time elapsed: 0.059 s
% 1.69/0.82  % (3261512)Peak memory usage: 12 MB
% 1.69/0.82  % (3261512)Instructions burned: 121 (million)
% 1.69/0.82  % (3261524)Instruction limit reached! 
% 1.69/0.82  % (3261524)------------------------------
% 1.69/0.82  % (3261524)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.82  % (3261524)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.82  % (3261524)CaDiCaL version: 2.1.3
% 1.69/0.82  % (3261524)Termination reason: Instruction limit
% 1.69/0.82  % (3261524)Termination phase: Saturation
% 1.69/0.82  % (3261524)Time elapsed: 0.037 s
% 1.69/0.82  % (3261524)Peak memory usage: 13 MB
% 1.69/0.82  % (3261524)Instructions burned: 133 (million)
% 1.69/0.82  % (3261513)Instruction limit reached! 
% 1.69/0.82  % (3261513)------------------------------
% 1.69/0.82  % (3261513)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.82  % (3261513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.82  % (3261513)CaDiCaL version: 2.1.3
% 1.69/0.82  % (3261513)Termination reason: Instruction limit
% 1.69/0.82  % (3261513)Termination phase: Saturation
% 1.69/0.82  % (3261513)Time elapsed: 0.068 s
% 1.69/0.82  % (3261513)Peak memory usage: 12 MB
% 1.69/0.82  % (3261513)Instructions burned: 131 (million)
% 1.69/0.82  % (3261528)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3624163697:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.69/0.82  % (3261526)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=2521547019:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.69/0.82  % (3261527)ott-21_1_sil=16000:fs=off:random_seed=2340584804:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.69/0.82  % (3261529)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3182352998:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 1.69/0.82  % (3261514)Instruction limit reached! 
% 1.69/0.82  % (3261514)------------------------------
% 1.69/0.82  % (3261514)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.82  % (3261514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.82  % (3261514)CaDiCaL version: 2.1.3
% 1.69/0.82  % (3261514)Termination reason: Instruction limit
% 1.69/0.82  % (3261514)Termination phase: Saturation
% 1.69/0.82  % (3261514)Time elapsed: 0.088 s
% 1.69/0.82  % (3261514)Peak memory usage: 13 MB
% 1.69/0.82  % (3261514)Instructions burned: 159 (million)
% 1.69/0.82  % Exception at run slice level
% 1.69/0.82  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.69/0.82  % (3261534)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1747365345:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 1.69/0.82  % (3261535)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=4147815727:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 1.69/0.82  % Exception at run slice level
% 1.69/0.82  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.69/0.82  % (3261538)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=4023843228: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)
% 1.69/0.82  % (3261527)Instruction limit reached! 
% 1.69/0.82  % (3261527)------------------------------
% 1.69/0.82  % (3261527)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.82  % (3261527)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.82  % (3261527)CaDiCaL version: 2.1.3
% 1.69/0.82  % (3261527)Termination reason: Instruction limit
% 1.69/0.82  % (3261527)Termination phase: Saturation
% 1.69/0.82  % (3261527)Time elapsed: 0.101 s
% 1.69/0.82  % (3261527)Peak memory usage: 12 MB
% 1.69/0.82  % (3261527)Instructions burned: 181 (million)
% 1.69/0.82  % (3261540)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1897845084:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 1.69/0.82  % (3261528)Instruction limit reached! 
% 1.69/0.82  % (3261528)------------------------------
% 1.69/0.82  % (3261528)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.82  % (3261528)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.82  % (3261528)CaDiCaL version: 2.1.3
% 1.69/0.82  % (3261528)Termination reason: Instruction limit
% 1.69/0.82  % (3261528)Termination phase: Saturation
% 1.69/0.82  % (3261528)Time elapsed: 0.131 s
% 1.69/0.82  % (3261528)Peak memory usage: 13 MB
% 1.69/0.82  % (3261528)Instructions burned: 479 (million)
% 1.69/0.82  % (3261542)fmb+10_1_sil=64000:random_seed=444262278:i=22061:nm=2:gsp=on_2997 on theBenchmark for (2997ds/22061Mi)
% 1.69/0.82  % (3261542)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 1.69/0.82  % Exception at run slice level
% 1.69/0.82  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.69/0.82  % (3261544)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3268194822:i=9515:nm=5_2997 on theBenchmark for (2997ds/9515Mi)
% 1.69/0.82  % Exception at run slice level
% 1.69/0.82  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.69/0.82  % (3261546)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1386199335:fmbsr=1.7:i=920_2997 on theBenchmark for (2997ds/920Mi)
% 1.69/0.82  % Exception at run slice level
% 1.69/0.82  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.69/0.82  % (3261548)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=4094731421:i=5131_2997 on theBenchmark for (2997ds/5131Mi)
% 1.69/0.82  % (3261548) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3261503-3261548"...
% 1.69/0.82  % (3261548)...printing done.
% 1.69/0.82  % (3261548)Refutation found. Thanks to Tanya!
% 1.69/0.82  % SZS status Theorem for theBenchmark
% 1.69/0.82  % SZS output start Proof for theBenchmark
% See solution above
% 1.69/0.82  % (3261548)------------------------------
% 1.69/0.82  % (3261548)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.82  % (3261548)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.82  % (3261548)CaDiCaL version: 2.1.3
% 1.69/0.82  % (3261548)Termination reason: Refutation
% 1.69/0.82  % (3261548)Time elapsed: 0.080 s
% 1.69/0.82  % (3261548)Peak memory usage: 14 MB
% 1.69/0.82  % (3261548)Instructions burned: 272 (million)
% 1.69/0.82  % (3261503)Success in time 0.393 s
% 1.69/0.82  % Vampire exiting
%------------------------------------------------------------------------------