↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL796_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 : n011.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:38 AM UTC 2026

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

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

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

tff(func_def_4,type,
    bool_size: bool > nat ).

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: ( dB * 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,
    nat_size: nat > nat ).

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,
    typing: ( fun(nat,type) * dB ) > fun(type,bool) ).

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

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

tff(func_def_24,type,
    fFalse: bool ).

tff(func_def_25,type,
    fTrue: bool ).

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

tff(func_def_27,type,
    t: type ).

tff(func_def_28,type,
    t2: type ).

tff(func_def_29,type,
    t_a: type ).

tff(func_def_30,type,
    t1: type ).

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

tff(func_def_32,type,
    a: dB ).

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

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

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

tff(func_def_36,type,
    i: nat ).

tff(func_def_37,type,
    ia: nat ).

tff(func_def_38,type,
    n: nat ).

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

tff(func_def_40,type,
    t3: dB ).

tff(func_def_41,type,
    u: dB ).

tff(func_def_42,type,
    ua: dB ).

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

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

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

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

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

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

tff(func_def_49,type,
    sK6: type ).

tff(func_def_50,type,
    sK7: ( dB * dB * dB ) > dB ).

tff(func_def_51,type,
    sK8: ( dB * dB * dB ) > dB ).

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

tff(func_def_53,type,
    sK10: ( 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,
    pp: bool > $o ).

tff(f2,axiom,
    ! [X0: type,X1: nat,X2: fun(nat,type)] :
      ( ( aa(nat,type,X2,X1) = X0 )
     => pp(aa(type,bool,typing(X2,var(X1)),X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_typing_OVar) ).

tff(f8,axiom,
    ! [X0: $tType,X1: X0,X2: fun(nat,X0),X3: nat,X4: nat] :
      ( ( X4 = X3 )
     => ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_7_shift__eq) ).

tff(f113,conjecture,
    pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t),var(zero_zero(nat))),t)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

tff(f114,negated_conjecture,
    ~ pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t),var(zero_zero(nat))),t)),
    inference(negated_conjecture,[status(cth)],[f113]) ).

tff(f115,plain,
    ~ pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t),var(zero_zero(nat))),t)),
    inference(flattening,[],[f114]) ).

tff(f118,plain,
    ! [X0: type,X1: nat,X2: fun(nat,type)] :
      ( pp(aa(type,bool,typing(X2,var(X1)),X0))
      | ( aa(nat,type,X2,X1) != X0 ) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f122,plain,
    ! [X0: $tType,X1: X0,X2: fun(nat,X0),X3: nat,X4: nat] :
      ( ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 )
      | ( X3 != X4 ) ),
    inference(ennf_transformation,[],[f8]) ).

tff(f173,plain,
    ~ pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t),var(zero_zero(nat))),t)),
    inference(cnf_transformation,[],[f115]) ).

tff(f175,plain,
    ! [X2: fun(nat,type),X0: type,X1: nat] :
      ( pp(aa(type,bool,typing(X2,var(X1)),X0))
      | ( aa(nat,type,X2,X1) != X0 ) ),
    inference(cnf_transformation,[],[f118]) ).

tff(f184,plain,
    ! [X0: $tType,X2: fun(nat,X0),X3: nat,X1: X0,X4: nat] :
      ( ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 )
      | ( X3 != X4 ) ),
    inference(cnf_transformation,[],[f122]) ).

tff(f263,plain,
    ! [X2: fun(nat,type),X1: nat] : pp(aa(type,bool,typing(X2,var(X1)),aa(nat,type,X2,X1))),
    inference(equality_resolution,[],[f175]) ).

tff(f265,plain,
    ! [X0: $tType,X2: fun(nat,X0),X1: X0,X4: nat] : ( aa(nat,X0,shift(X0,X2,X4,X1),X4) = X1 ),
    inference(equality_resolution,[],[f184]) ).

tff(f279,plain,
    ! [X2: nat,X0: type,X1: fun(nat,type)] : pp(aa(type,bool,typing(shift(type,X1,X2,X0),var(X2)),X0)),
    inference(superposition,[],[f263,f265]) ).

tff(f280,plain,
    $false,
    inference(resolution,[],[f279,f173]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL796_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n011.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 16:52:26 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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.46/1.37  % (2617308)Detected formulas, will run a generic FOF schedule.
% 3.46/1.37  % (2617319)dis-21_1_sil=8000:lcm=predicate:random_seed=1734048732: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.46/1.37  % (2617318)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3792670981:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.46/1.37  % (2617313)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=3776779573:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.46/1.37  % (2617316)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=792690520:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.46/1.37  % (2617314)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=1017872521:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.46/1.37  % (2617317)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=502682353:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.46/1.37  % (2617315)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=2223202010:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.46/1.37  % (2617316)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.46/1.37  % (2617316)Refutation not found, incomplete strategy
% 3.46/1.37  % (2617316)------------------------------
% 3.46/1.37  % (2617316)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.46/1.37  % (2617316)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.46/1.37  % (2617316)CaDiCaL version: 2.1.3
% 3.46/1.37  % (2617316)Termination reason: Refutation not found, incomplete strategy
% 3.46/1.37  % (2617316)Time elapsed: 0.003 s
% 3.46/1.37  % (2617316)Peak memory usage: 88 MB
% 3.46/1.37  % (2617316)Instructions burned: 2 (million)
% 3.46/1.37  % (2617319)Instruction limit reached! 
% 3.46/1.37  % (2617319)------------------------------
% 3.46/1.37  % (2617319)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.46/1.37  % (2617319)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.46/1.37  % (2617319)CaDiCaL version: 2.1.3
% 3.46/1.37  % (2617319)Termination reason: Instruction limit
% 3.46/1.37  % (2617319)Termination phase: Saturation
% 3.46/1.37  % (2617319)Time elapsed: 0.040 s
% 3.46/1.37  % (2617319)Peak memory usage: 89 MB
% 3.46/1.37  % (2617319)Instructions burned: 132 (million)
% 3.46/1.37  % (2617317)First to succeed.
% 3.46/1.37  % (2617315)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.46/1.37  % (2617317)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2617308"
% 3.46/1.37  % (2617318)Instruction limit reached! 
% 3.46/1.37  % (2617318)------------------------------
% 3.46/1.37  % (2617318)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.46/1.37  % (2617318)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.46/1.37  % (2617318)CaDiCaL version: 2.1.3
% 3.46/1.37  % (2617318)Termination reason: Instruction limit
% 3.46/1.37  % (2617318)Termination phase: Saturation
% 3.46/1.37  % (2617318)Time elapsed: 0.080 s
% 3.46/1.37  % (2617318)Peak memory usage: 88 MB
% 3.46/1.37  % (2617318)Instructions burned: 140 (million)
% 3.46/1.37  % (2617327)lrs+10_1_sil=8000:sp=occurrence:random_seed=1815473925:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.46/1.37  % (2617327)Also succeeded, but the first one will report.
% 3.46/1.37  % (2617328)lrs+10_1_sil=32000:urr=on:br=off:random_seed=518941930:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.46/1.37  % (2617328)Also succeeded, but the first one will report.
% 3.46/1.37  % (2617316)------------------------------
% 3.46/1.37  % (2617316)------------------------------
% 3.46/1.37  % (2617317)Refutation found. Thanks to Tanya!
% 3.46/1.37  % SZS status Theorem for theBenchmark
% 3.46/1.37  % SZS output start Proof for theBenchmark
% See solution above
% 3.46/1.37  % (2617317)------------------------------
% 3.46/1.37  % (2617317)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.46/1.37  % (2617317)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.46/1.37  % (2617317)CaDiCaL version: 2.1.3
% 3.46/1.37  % (2617317)Termination reason: Refutation
% 3.46/1.37  % (2617317)Time elapsed: 0.006 s
% 3.46/1.37  % (2617317)Peak memory usage: 88 MB
% 3.46/1.37  % (2617317)Instructions burned: 9 (million)
% 3.46/1.37  % (2617317)------------------------------
% 3.46/1.37  % (2617317)------------------------------
% 3.46/1.37  % (2617308)Success in time 0.423 s
% 3.46/1.37  % Vampire exiting
%------------------------------------------------------------------------------