↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n020.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:33 AM UTC 2026

% Result   : Theorem 3.46s 1.50s
% Output   : Refutation 3.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   26 (  20 unt;   0 typ;   0 def)
%            Number of atoms       :   37 (   6 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   25 (  14   ~;   9   |;   0   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :   48 (  48 usr;   9 con; 0-5 aty)
%            Number of variables   :   41 (  41   !;   0   ?;  41   :)

% 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,
    fun: ( $tType * $tType ) > $tType ).

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

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

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

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

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

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

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

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

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

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

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

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

tff(func_def_12,type,
    nil: 
      !>[X0: $tType] : list(X0) ).

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

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

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

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

tff(func_def_17,type,
    sublist: 
      !>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).

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

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

tff(func_def_20,type,
    fFalse: bool ).

tff(func_def_21,type,
    fTrue: bool ).

tff(func_def_22,type,
    i: nat ).

tff(func_def_23,type,
    r: dB ).

tff(func_def_24,type,
    s: dB ).

tff(func_def_25,type,
    ss: list(dB) ).

tff(func_def_26,type,
    sK0: ( dB * dB * dB ) > dB ).

tff(func_def_27,type,
    sK1: ( dB * dB * dB ) > dB ).

tff(func_def_28,type,
    sK2: ( dB * dB * dB ) > dB ).

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

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

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

tff(func_def_32,type,
    sK6: ( list(dB) * dB * dB * dB ) > list(dB) ).

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

tff(func_def_34,type,
    sK8: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

tff(func_def_35,type,
    sK9: 
      !>[X0: $tType] : ( list(X0) > X0 ) ).

tff(func_def_36,type,
    sK10: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

tff(func_def_37,type,
    sK11: 
      !>[X0: $tType] : ( list(X0) > X0 ) ).

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

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

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

tff(func_def_41,type,
    sK15: 
      !>[X0: $tType] : ( list(X0) > X0 ) ).

tff(func_def_42,type,
    sK16: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

tff(func_def_43,type,
    sK17: 
      !>[X0: $tType] : ( list(X0) > X0 ) ).

tff(func_def_44,type,
    sK18: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

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

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,
    member: 
      !>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).

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

tff(f3,axiom,
    ! [X0: list(dB),X1: dB,X2: dB] :
      ( pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0)))
     => ( pp(aa(dB,bool,it,X1))
       => pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0))) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_Beta) ).

tff(f11,axiom,
    ! [X0: dB,X1: list(dB),X2: dB] : ( aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,X2,X1)),X0) = foldl(dB,dB,app,X2,append(dB,X1,cons(dB,X0,nil(dB)))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_10_app__last) ).

tff(f22,axiom,
    ! [X0: $tType,X1: list(X0),X2: list(X0),X3: X0] : ( append(X0,cons(X0,X3,X2),X1) = cons(X0,X3,append(X0,X2,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_21_append__Cons) ).

tff(f40,axiom,
    ! [X0: $tType,X1: $tType,X2: list(X1),X3: X1,X4: X0,X5: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X5,X4,cons(X1,X3,X2)) = foldl(X0,X1,X5,aa(X1,X0,aa(X0,fun(X1,X0),X5,X4),X3),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_39_foldl__Cons) ).

tff(f104,axiom,
    pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),ss)),var(i)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

tff(f105,axiom,
    pp(aa(dB,bool,it,s)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_2) ).

tff(f107,conjecture,
    pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),append(dB,ss,cons(dB,var(i),nil(dB)))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_4) ).

tff(f108,negated_conjecture,
    ~ pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),append(dB,ss,cons(dB,var(i),nil(dB)))))),
    inference(negated_conjecture,[status(cth)],[f107]) ).

tff(f109,plain,
    ~ pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),append(dB,ss,cons(dB,var(i),nil(dB)))))),
    inference(flattening,[],[f108]) ).

tff(f114,plain,
    ! [X0: list(dB),X1: dB,X2: dB] :
      ( pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0)))
      | ~ pp(aa(dB,bool,it,X1))
      | ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0))) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f115,plain,
    ! [X0: list(dB),X1: dB,X2: dB] :
      ( pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0)))
      | ~ pp(aa(dB,bool,it,X1))
      | ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0))) ),
    inference(flattening,[],[f114]) ).

tff(f191,plain,
    pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),ss)),var(i)))),
    inference(cnf_transformation,[],[f104]) ).

tff(f192,plain,
    pp(aa(dB,bool,it,s)),
    inference(cnf_transformation,[],[f105]) ).

tff(f194,plain,
    ~ pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),append(dB,ss,cons(dB,var(i),nil(dB)))))),
    inference(cnf_transformation,[],[f109]) ).

tff(f204,plain,
    ! [X2: dB,X0: list(dB),X1: dB] :
      ( pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0)))
      | ~ pp(aa(dB,bool,it,X1))
      | ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0))) ),
    inference(cnf_transformation,[],[f115]) ).

tff(f216,plain,
    ! [X1: $tType,X0: $tType,X2: list(X1),X3: X1,X4: X0,X5: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X5,X4,cons(X1,X3,X2)) = foldl(X0,X1,X5,aa(X1,X0,aa(X0,fun(X1,X0),X5,X4),X3),X2) ),
    inference(cnf_transformation,[],[f40]) ).

tff(f220,plain,
    ! [X2: dB,X0: dB,X1: list(dB)] : ( aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,X2,X1)),X0) = foldl(dB,dB,app,X2,append(dB,X1,cons(dB,X0,nil(dB)))) ),
    inference(cnf_transformation,[],[f11]) ).

tff(f295,plain,
    ! [X0: $tType,X2: list(X0),X3: X0,X1: list(X0)] : ( append(X0,cons(X0,X3,X2),X1) = cons(X0,X3,append(X0,X2,X1)) ),
    inference(cnf_transformation,[],[f22]) ).

tff(f377,plain,
    ! [X2: dB,X0: list(dB),X1: dB] :
      ( ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0)))
      | ~ pp(aa(dB,bool,it,X1))
      | pp(aa(dB,bool,it,foldl(dB,dB,app,abs(X2),cons(dB,X1,X0)))) ),
    inference(forward_demodulation,[],[f204,f216]) ).

tff(f378,plain,
    ~ pp(aa(dB,bool,it,foldl(dB,dB,app,abs(r),cons(dB,s,append(dB,ss,cons(dB,var(i),nil(dB))))))),
    inference(forward_demodulation,[],[f194,f216]) ).

tff(f379,plain,
    pp(aa(dB,bool,it,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),append(dB,ss,cons(dB,var(i),nil(dB)))))),
    inference(forward_demodulation,[],[f191,f220]) ).

tff(f380,plain,
    ~ pp(aa(dB,bool,it,foldl(dB,dB,app,abs(r),append(dB,cons(dB,s,ss),cons(dB,var(i),nil(dB)))))),
    inference(forward_demodulation,[],[f378,f295]) ).

tff(f1206,plain,
    ( ~ pp(aa(dB,bool,it,s))
    | pp(aa(dB,bool,it,foldl(dB,dB,app,abs(r),cons(dB,s,append(dB,ss,cons(dB,var(i),nil(dB))))))) ),
    inference(resolution,[],[f377,f379]) ).

tff(f1209,plain,
    pp(aa(dB,bool,it,foldl(dB,dB,app,abs(r),cons(dB,s,append(dB,ss,cons(dB,var(i),nil(dB))))))),
    inference(forward_subsumption_resolution,[],[f1206,f192]) ).

tff(f1211,plain,
    pp(aa(dB,bool,it,foldl(dB,dB,app,abs(r),append(dB,cons(dB,s,ss),cons(dB,var(i),nil(dB)))))),
    inference(forward_demodulation,[],[f1209,f295]) ).

tff(f1212,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1211,f380]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL776_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40  % Computer : n020.cluster.edu
% 0.12/0.40  % Model    : x86_64 x86_64
% 0.12/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40  % Memory   : 8046.5625MB
% 0.12/0.40  % OS       : Linux 6.8.0-71-generic
% 0.12/0.40  % CPULimit : 300
% 0.12/0.40  % WCLimit  : 300
% 0.12/0.40  % DateTime : Sun Sep 27 16:48:50 UTC 2026
% 0.12/0.41  % CPUTime  : 
% 0.12/0.41  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.44  Running first-order theorem proving
% 0.12/0.44  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.64/1.30  % (3601352)Detected formulas, will run a generic FOF schedule.
% 1.64/1.30  % (3601360)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1878131214:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.64/1.30  % (3601360)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 1.64/1.30  % (3601360)Instruction limit reached! 
% 1.64/1.30  % (3601360)------------------------------
% 1.64/1.30  % (3601360)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.64/1.30  % (3601360)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.64/1.30  % (3601360)CaDiCaL version: 2.1.3
% 1.64/1.30  % (3601360)Termination reason: Instruction limit
% 1.64/1.30  % (3601360)Termination phase: Saturation
% 1.64/1.30  % (3601360)Time elapsed: 0.034 s
% 1.64/1.30  % (3601360)Peak memory usage: 89 MB
% 1.64/1.30  % (3601360)Instructions burned: 112 (million)
% 1.64/1.30  % (3601358)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=1371546226:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.64/1.30  % (3601357)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=3300249283:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.64/1.30  % (3601363)dis-21_1_sil=8000:lcm=predicate:random_seed=3578296738: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)
% 1.64/1.30  % (3601361)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=504730913:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.64/1.30  % (3601359)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=1896509698:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.64/1.30  % (3601362)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2120475768:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.64/1.30  % (3601359)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 1.64/1.30  % (3601361)Instruction limit reached! 
% 1.64/1.30  % (3601361)------------------------------
% 1.64/1.30  % (3601361)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.64/1.30  % (3601361)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.64/1.30  % (3601361)CaDiCaL version: 2.1.3
% 1.64/1.30  % (3601361)Termination reason: Instruction limit
% 1.64/1.30  % (3601361)Termination phase: Saturation
% 1.64/1.30  % (3601361)Time elapsed: 0.067 s
% 1.64/1.30  % (3601361)Peak memory usage: 88 MB
% 1.64/1.30  % (3601361)Instructions burned: 119 (million)
% 1.64/1.30  % (3601363)Instruction limit reached! 
% 1.64/1.30  % (3601363)------------------------------
% 1.64/1.30  % (3601363)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.64/1.30  % (3601363)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.64/1.30  % (3601363)CaDiCaL version: 2.1.3
% 1.64/1.30  % (3601363)Termination reason: Instruction limit
% 1.64/1.30  % (3601363)Termination phase: Saturation
% 1.64/1.30  % (3601363)Time elapsed: 0.071 s
% 1.64/1.30  % (3601363)Peak memory usage: 89 MB
% 1.64/1.30  % (3601363)Instructions burned: 129 (million)
% 1.64/1.30  % (3601365)lrs+10_1_sil=8000:sp=occurrence:random_seed=2245195648:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 1.64/1.30  % (3601362)Instruction limit reached! 
% 1.64/1.30  % (3601362)------------------------------
% 1.64/1.30  % (3601362)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.64/1.30  % (3601362)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.64/1.30  % (3601362)CaDiCaL version: 2.1.3
% 1.64/1.30  % (3601362)Termination reason: Instruction limit
% 1.64/1.30  % (3601362)Termination phase: Saturation
% 1.64/1.30  % (3601362)Time elapsed: 0.086 s
% 1.64/1.30  % (3601362)Peak memory usage: 89 MB
% 1.64/1.30  % (3601362)Instructions burned: 139 (million)
% 1.64/1.30  % (3601365)First to succeed.
% 1.64/1.30  % (3601365)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3601352"
% 1.64/1.30  % (3601374)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1452647560:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 1.64/1.30  % (3601373)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3097614664:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.46/1.50  % (3601375)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=3363678740:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 3.46/1.50  % (3601365)Refutation found. Thanks to Tanya!
% 3.46/1.50  % SZS status Theorem for theBenchmark
% 3.46/1.50  % SZS output start Proof for theBenchmark
% See solution above
% 3.59/1.50  % (3601365)------------------------------
% 3.59/1.50  % (3601365)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.59/1.50  % (3601365)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.59/1.50  % (3601365)CaDiCaL version: 2.1.3
% 3.59/1.50  % (3601365)Termination reason: Refutation
% 3.59/1.50  % (3601365)Time elapsed: 0.026 s
% 3.59/1.50  % (3601365)Peak memory usage: 89 MB
% 3.59/1.50  % (3601365)Instructions burned: 81 (million)
% 3.59/1.50  % (3601365)------------------------------
% 3.59/1.50  % (3601365)------------------------------
% 3.59/1.50  % (3601352)Success in time 0.419 s
% 3.59/1.50  % Vampire exiting
%------------------------------------------------------------------------------