↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL808_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% 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 : Tue Sep 29 11:56:41 AM UTC 2026

% Result   : Theorem 5.36s 1.75s
% Output   : Refutation 5.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   17 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   29 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   26 (  14   ~;   9   |;   0   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 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    :   56 (  56 usr;  31 con; 0-5 aty)
%            Number of variables   :   18 (  17   !;   1   ?;  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(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(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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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(f121,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(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(f130,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(f131,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,[],[f130]) ).

tff(f132,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),sK0)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f127]) ).

tff(f134,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,[],[f121]) ).

tff(f141,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),sK0)),
    inference(cnf_transformation,[],[f132]) ).

tff(f145,plain,
    ! [X2: dB,X3: nat,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),X3),t)),b),X1))
      | ~ 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(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),X2),X3))) ),
    inference(cnf_transformation,[],[f131]) ).

tff(f149,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(f150,plain,
    pp(aa(dB,bool,it,u)),
    inference(cnf_transformation,[],[f3]) ).

tff(f186,plain,
    $false,
    inference(unit_resulting_resolution,[],[f145,f150,f149,f134,f141]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL808_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38  % Computer : n001.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Sun Sep 27 16:59:46 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.42  Running first-order theorem proving
% 0.13/0.42  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.60/1.57  % (3791684)Detected formulas, will run a generic FOF schedule.
% 3.60/1.57  % (3791695)dis-21_1_sil=8000:lcm=predicate:random_seed=3891200152:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.60/1.57  % (3791692)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=338621280:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.60/1.57  % (3791693)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3248120530:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.60/1.57  % (3791691)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=252778318:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.60/1.57  % (3791690)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2770035500:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.60/1.57  % (3791689)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2046585719:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.60/1.57  % (3791694)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3852208752:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.60/1.57  % (3791695)Instruction limit reached! 
% 3.60/1.57  % (3791695)------------------------------
% 3.60/1.57  % (3791695)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/1.57  % (3791695)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/1.57  % (3791695)CaDiCaL version: 2.1.3
% 3.60/1.57  % (3791695)Termination reason: Instruction limit
% 3.60/1.57  % (3791695)Termination phase: Saturation
% 3.60/1.57  % (3791695)Time elapsed: 0.035 s
% 3.60/1.57  % (3791695)Peak memory usage: 89 MB
% 3.60/1.57  % (3791695)Instructions burned: 131 (million)
% 3.60/1.57  % (3791692)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.60/1.57  % (3791692)Refutation not found, incomplete strategy
% 3.60/1.57  % (3791692)------------------------------
% 3.60/1.57  % (3791692)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/1.57  % (3791692)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/1.57  % (3791692)CaDiCaL version: 2.1.3
% 3.60/1.57  % (3791692)Termination reason: Refutation not found, incomplete strategy
% 3.60/1.57  % (3791692)Time elapsed: 0.004 s
% 3.60/1.57  % (3791692)Peak memory usage: 88 MB
% 3.60/1.57  % (3791692)Instructions burned: 5 (million)
% 3.60/1.57  % (3791691)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.60/1.57  % (3791693)Instruction limit reached! 
% 3.60/1.57  % (3791693)------------------------------
% 3.60/1.57  % (3791693)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/1.57  % (3791693)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/1.57  % (3791693)CaDiCaL version: 2.1.3
% 3.60/1.57  % (3791693)Termination reason: Instruction limit
% 3.60/1.57  % (3791693)Termination phase: Saturation
% 3.60/1.57  % (3791693)Time elapsed: 0.073 s
% 3.60/1.57  % (3791693)Peak memory usage: 88 MB
% 3.60/1.57  % (3791693)Instructions burned: 119 (million)
% 3.60/1.57  % (3791694)Instruction limit reached! 
% 3.60/1.57  % (3791694)------------------------------
% 3.60/1.57  % (3791694)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/1.57  % (3791694)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/1.57  % (3791694)CaDiCaL version: 2.1.3
% 3.60/1.57  % (3791694)Termination reason: Instruction limit
% 3.60/1.57  % (3791694)Termination phase: Saturation
% 3.60/1.57  % (3791694)Time elapsed: 0.081 s
% 3.60/1.57  % (3791694)Peak memory usage: 89 MB
% 3.60/1.57  % (3791694)Instructions burned: 140 (million)
% 3.60/1.57  % (3791703)lrs+10_1_sil=8000:sp=occurrence:random_seed=2308255723:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.60/1.57  % (3791704)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1330947439:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.60/1.57  % (3791704)First to succeed.
% 3.60/1.57  % (3791704)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3791684"
% 3.60/1.57  % (3791703)Instruction limit reached! 
% 5.36/1.75  % (3791703)------------------------------
% 5.36/1.75  % (3791703)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.36/1.75  % (3791703)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.36/1.75  % (3791703)CaDiCaL version: 2.1.3
% 5.36/1.75  % (3791703)Termination reason: Instruction limit
% 5.36/1.75  % (3791703)Termination phase: Saturation
% 5.36/1.75  % (3791703)Time elapsed: 0.100 s
% 5.36/1.75  % (3791703)Peak memory usage: 92 MB
% 5.36/1.75  % (3791703)Instructions burned: 286 (million)
% 5.36/1.75  % (3791692)------------------------------
% 5.36/1.75  % (3791692)------------------------------
% 5.36/1.75  % (3791705)lrs+1011_1_sil=32000:sp=occurrence:random_seed=833766832:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 5.36/1.75  % (3791705)Also succeeded, but the first one will report.
% 5.36/1.75  % (3791708)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=272806741:s2a=on:i=248:s2at=1.23:gtg=position_2995 on theBenchmark for (2995ds/248Mi)
% 5.36/1.75  % (3791708)Also succeeded, but the first one will report.
% 5.36/1.75  % Exception at run slice level% Exception at run slice level
% 5.36/1.75  User error: GNN currently only supports monomorphic FOL.
% 5.36/1.75  
% 5.36/1.75  User error: GNN currently only supports monomorphic FOL.
% 5.36/1.75  % Exception at run slice level
% 5.36/1.75  User error: GNN currently only supports monomorphic FOL.
% 5.36/1.75  % (3791710)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1443097209:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 5.36/1.75  % (3791710)Refutation not found, incomplete strategy
% 5.36/1.75  % (3791710)------------------------------
% 5.36/1.75  % (3791710)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.36/1.75  % (3791710)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.36/1.75  % (3791710)CaDiCaL version: 2.1.3
% 5.36/1.75  % (3791710)Termination reason: Refutation not found, incomplete strategy
% 5.36/1.75  % (3791710)Time elapsed: 0.028 s
% 5.36/1.75  % (3791710)Peak memory usage: 89 MB
% 5.36/1.75  % (3791710)Instructions burned: 54 (million)
% 5.36/1.75  % (3791704)Refutation found. Thanks to Tanya!
% 5.36/1.75  % SZS status Theorem for theBenchmark
% 5.36/1.75  % SZS output start Proof for theBenchmark
% See solution above
% 5.36/1.76  % (3791704)------------------------------
% 5.36/1.76  % (3791704)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.36/1.76  % (3791704)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.36/1.76  % (3791704)CaDiCaL version: 2.1.3
% 5.36/1.76  % (3791704)Termination reason: Refutation
% 5.36/1.76  % (3791704)Time elapsed: 0.011 s
% 5.36/1.76  % (3791704)Peak memory usage: 89 MB
% 5.36/1.76  % (3791704)Instructions burned: 18 (million)
% 5.36/1.76  % (3791704)------------------------------
% 5.36/1.76  % (3791704)------------------------------
% 5.36/1.76  % (3791684)Success in time 0.693 s
% 5.36/1.76  % Vampire exiting
%------------------------------------------------------------------------------