↑ 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  : LCL840_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 : n026.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:49 PM UTC 2026

% Result   : Theorem 0.96s 0.58s
% Output   : Refutation 0.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   40 (   2 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   40 (  22   ~;  15   |;   0   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :   62 (  62 usr;  25 con; 0-5 aty)
%            Number of variables   :   34 (  34   !;   0   ?;  34   :)

% 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,
    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,
    map: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).

tff(func_def_15,type,
    suc: nat > nat ).

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

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

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

tff(func_def_19,type,
    fFalse: bool ).

tff(func_def_20,type,
    fTrue: bool ).

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

tff(func_def_22,type,
    t2: type ).

tff(func_def_23,type,
    t: type ).

tff(func_def_24,type,
    t_a: type ).

tff(func_def_25,type,
    t1: type ).

tff(func_def_26,type,
    ua1: type ).

tff(func_def_27,type,
    a: dB ).

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

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

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

tff(func_def_31,type,
    i: nat ).

tff(func_def_32,type,
    ia: nat ).

tff(func_def_33,type,
    r: dB ).

tff(func_def_34,type,
    t3: dB ).

tff(func_def_35,type,
    u: dB ).

tff(func_def_36,type,
    ua: dB ).

tff(func_def_37,type,
    sK1: type ).

tff(func_def_38,type,
    sK2: type ).

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

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

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

tff(func_def_42,type,
    sK6: ( dB * dB ) > dB ).

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

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

tff(func_def_45,type,
    sK9: ( dB * dB * dB ) > dB ).

tff(func_def_46,type,
    sK10: ( dB * dB * dB ) > dB ).

tff(func_def_47,type,
    sK11: ( dB * dB * dB ) > dB ).

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

tff(func_def_49,type,
    sK13: nat > nat ).

tff(func_def_50,type,
    sK14: nat > nat ).

tff(func_def_51,type,
    sK15: fun(nat,bool) > nat ).

tff(func_def_52,type,
    sK16: fun(nat,bool) > nat ).

tff(func_def_53,type,
    sK17: dB > dB ).

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

tff(func_def_55,type,
    sK19: dB > list(dB) ).

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

tff(func_def_57,type,
    sK21: dB > nat ).

tff(func_def_58,type,
    sK22: dB > dB ).

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

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

tff(pred_def_2,type,
    beta: ( dB * dB ) > $o ).

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

tff(pred_def_4,type,
    typing: ( fun(nat,type) * dB * type ) > $o ).

tff(pred_def_5,type,
    typings: ( fun(nat,type) * list(dB) * list(type) ) > $o ).

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

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

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

tff(f4,axiom,
    typing(e,u,t1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_uT) ).

tff(f6,axiom,
    typing(shift(type,e,i,t1),a,t2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_5__096e_060i_058T_062_A_092_060turnstile_062_Aa_A_058_AT_H_H_096) ).

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

tff(f103,axiom,
    ! [X0: $tType,X1: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_COMBC_1_1_U) ).

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

tff(f110,negated_conjecture,
    ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i))),
    inference(negated_conjecture,[status(cth)],[f109]) ).

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

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

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

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

tff(f214,plain,
    typing(e,u,t1),
    inference(cnf_transformation,[],[f4]) ).

tff(f216,plain,
    typing(shift(type,e,i,t1),a,t2),
    inference(cnf_transformation,[],[f6]) ).

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

tff(f351,plain,
    ! [X1: $tType,X0: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
    inference(cnf_transformation,[],[f103]) ).

tff(f357,plain,
    ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i))),
    inference(cnf_transformation,[],[f113]) ).

tff(f427,plain,
    ! [X2: nat,X3: fun(nat,type),X0: dB,X1: type] :
      ( pp(aa(dB,bool,it,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,a),X2),X0)))
      | ~ typing(X3,X0,t1)
      | ~ pp(aa(dB,bool,it,X0))
      | ~ typing(shift(type,X3,X2,t1),a,X1) ),
    inference(forward_demodulation,[],[f223,f351]) ).

tff(f618,plain,
    ~ pp(aa(dB,bool,it,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,a),i),u))),
    inference(superposition,[],[f357,f351]) ).

tff(f1065,plain,
    ! [X0: fun(nat,type),X1: type] :
      ( ~ typing(shift(type,X0,i,t1),a,X1)
      | ~ pp(aa(dB,bool,it,u))
      | ~ typing(X0,u,t1) ),
    inference(resolution,[],[f427,f618]) ).

tff(f1070,plain,
    ( ~ pp(aa(dB,bool,it,u))
    | ~ typing(e,u,t1) ),
    inference(resolution,[],[f1065,f216]) ).

tff(f1073,plain,
    ~ typing(e,u,t1),
    inference(resolution,[],[f1070,f213]) ).

tff(f1077,plain,
    $false,
    inference(resolution,[],[f1073,f214]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL840_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.12/0.37  % Computer : n026.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 27 17:02:41 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
% 0.96/0.58  % (3065061)Will run a generic schedule for satisfiability detection.
% 0.96/0.58  % (3065070)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3198734744:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.96/0.58  % (3065067)% WARNING: option uhcvi not known.
% 0.96/0.58  % (3065066)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=796114125_2999 on theBenchmark for (2999ds/0Mi)
% 0.96/0.58  % (3065067)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=624716451:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.96/0.58  % (3065068)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=271290981:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.96/0.58  % (3065069)dis+10_1_sil=32000:sp=arity:random_seed=203062822:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.96/0.58  % (3065071)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3478742921:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.96/0.58  % (3065072)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1971733788:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.96/0.58  % Exception at run slice level
% 0.96/0.58  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.96/0.58  % (3065080)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1831157908:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.96/0.58  % Exception at run slice level
% 0.96/0.58  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.96/0.58  % (3065070)Instruction limit reached! 
% 0.96/0.58  % (3065070)------------------------------
% 0.96/0.58  % (3065070)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.58  % (3065070)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.58  % (3065070)CaDiCaL version: 2.1.3
% 0.96/0.58  % (3065070)Termination reason: Instruction limit
% 0.96/0.58  % (3065070)Termination phase: Saturation
% 0.96/0.58  % (3065070)Time elapsed: 0.038 s
% 0.96/0.58  % (3065070)Peak memory usage: 13 MB
% 0.96/0.58  % (3065070)Instructions burned: 116 (million)
% 0.96/0.58  % (3065082)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2066573714:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.96/0.58  % (3065083)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=2185337272:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.96/0.58  % (3065069)Instruction limit reached! 
% 0.96/0.58  % (3065069)------------------------------
% 0.96/0.58  % (3065069)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.58  % (3065069)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.58  % (3065069)CaDiCaL version: 2.1.3
% 0.96/0.58  % (3065069)Termination reason: Instruction limit
% 0.96/0.58  % (3065069)Termination phase: Saturation
% 0.96/0.58  % (3065069)Time elapsed: 0.066 s
% 0.96/0.58  % (3065069)Peak memory usage: 12 MB
% 0.96/0.58  % (3065069)Instructions burned: 104 (million)
% 0.96/0.58  % (3065071)Instruction limit reached! 
% 0.96/0.58  % (3065071)------------------------------
% 0.96/0.58  % (3065071)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.58  % (3065071)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.58  % (3065071)CaDiCaL version: 2.1.3
% 0.96/0.58  % (3065071)Termination reason: Instruction limit
% 0.96/0.58  % (3065071)Termination phase: Saturation
% 0.96/0.58  % (3065071)Time elapsed: 0.080 s
% 0.96/0.58  % (3065071)Peak memory usage: 13 MB
% 0.96/0.58  % (3065071)Instructions burned: 131 (million)
% 0.96/0.58  % (3065086)ott-21_1_sil=16000:fs=off:random_seed=1463613793:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.96/0.58  % (3065082)Instruction limit reached! 
% 0.96/0.58  % (3065082)------------------------------
% 0.96/0.58  % (3065082)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.58  % (3065082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.58  % (3065082)CaDiCaL version: 2.1.3
% 0.96/0.58  % (3065082)Termination reason: Instruction limit
% 0.96/0.58  % (3065082)Termination phase: Saturation
% 0.96/0.58  % (3065082)Time elapsed: 0.045 s
% 0.96/0.58  % (3065082)Peak memory usage: 14 MB
% 0.96/0.58  % (3065082)Instructions burned: 132 (million)
% 0.96/0.58  % (3065089)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4268266979:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 0.96/0.58  % Exception at run slice level
% 0.96/0.58  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.96/0.58  % (3065087)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=603897442:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.96/0.58  % (3065072)Instruction limit reached! 
% 0.96/0.58  % (3065072)------------------------------
% 0.96/0.58  % (3065072)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.58  % (3065072)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.58  % (3065072)CaDiCaL version: 2.1.3
% 0.96/0.58  % (3065072)Termination reason: Instruction limit
% 0.96/0.58  % (3065072)Termination phase: Saturation
% 0.96/0.58  % (3065072)Time elapsed: 0.101 s
% 0.96/0.58  % (3065072)Peak memory usage: 14 MB
% 0.96/0.58  % (3065072)Instructions burned: 161 (million)
% 0.96/0.58  % (3065091)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1675909667:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 0.96/0.58  % (3065086) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3065061-3065086"...
% 0.96/0.58  % (3065086)...printing done.
% 0.96/0.58  % (3065086)Refutation found. Thanks to Tanya!
% 0.96/0.58  % SZS status Theorem for theBenchmark
% 0.96/0.58  % SZS output start Proof for theBenchmark
% See solution above
% 0.96/0.58  % (3065086)------------------------------
% 0.96/0.58  % (3065086)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.58  % (3065086)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.58  % (3065086)CaDiCaL version: 2.1.3
% 0.96/0.58  % (3065086)Termination reason: Refutation
% 0.96/0.58  % (3065086)Time elapsed: 0.031 s
% 0.96/0.58  % (3065086)Peak memory usage: 12 MB
% 0.96/0.58  % (3065086)Instructions burned: 54 (million)
% 0.96/0.58  % (3065061)Success in time 0.161 s
% 0.96/0.58  % Vampire exiting
%------------------------------------------------------------------------------