TSTP Solution File: LCL796_5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : LCL796_5 : TPTP v8.1.2. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n028.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 07:42:33 EDT 2024

% Result   : Theorem 0.60s 0.80s
% Output   : Refutation 0.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   76
% Syntax   : Number of formulae    :   94 (  18 unt;  68 typ;   0 def)
%            Number of atoms       :   34 (  19 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   16 (   8   ~;   4   |;   0   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :   69 (  32   >;  37   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :   60 (  60 usr;  29 con; 0-5 aty)
%            Number of variables   :   64 (  38   !;   0   ?;  64   :)
%                                         (  26  !>;   0  ?*;   0  @-;   0  @+)

% 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 * dB * dB ) > dB ).

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

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

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

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

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

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

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

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

tff(func_def_52,type,
    sK9: type ).

tff(func_def_53,type,
    sF10: nat ).

tff(func_def_54,type,
    sF11: fun(nat,type) ).

tff(func_def_55,type,
    sF12: dB ).

tff(func_def_56,type,
    sF13: fun(type,bool) ).

tff(func_def_57,type,
    sF14: bool ).

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(f274,plain,
    $false,
    inference(subsumption_resolution,[],[f273,f247]) ).

tff(f247,plain,
    ~ pp(sF14),
    inference(definition_folding,[],[f185,f246,f245,f244,f242,f243,f242]) ).

tff(f243,plain,
    shift(type,e,sF10,t) = sF11,
    introduced(function_definition,[new_symbols(definition,[sF11])]) ).

tff(f242,plain,
    zero_zero(nat) = sF10,
    introduced(function_definition,[new_symbols(definition,[sF10])]) ).

tff(f244,plain,
    var(sF10) = sF12,
    introduced(function_definition,[new_symbols(definition,[sF12])]) ).

tff(f245,plain,
    typing(sF11,sF12) = sF13,
    introduced(function_definition,[new_symbols(definition,[sF13])]) ).

tff(f246,plain,
    aa(type,bool,sF13,t) = sF14,
    introduced(function_definition,[new_symbols(definition,[sF14])]) ).

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

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

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

tff(f113,conjecture,
    pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t),var(zero_zero(nat))),t)),
    file('/export/starexec/sandbox/tmp/tmp.urcyCwitlU/Vampire---4.8_24333',conj_0) ).

tff(f273,plain,
    pp(sF14),
    inference(forward_demodulation,[],[f272,f246]) ).

tff(f272,plain,
    pp(aa(type,bool,sF13,t)),
    inference(forward_demodulation,[],[f271,f245]) ).

tff(f271,plain,
    pp(aa(type,bool,typing(sF11,sF12),t)),
    inference(forward_demodulation,[],[f269,f244]) ).

tff(f269,plain,
    pp(aa(type,bool,typing(sF11,var(sF10)),t)),
    inference(superposition,[],[f235,f267]) ).

tff(f267,plain,
    t = aa(nat,type,sF11,sF10),
    inference(superposition,[],[f234,f243]) ).

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

tff(f200,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,[],[f149]) ).

tff(f149,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,[],[f122]) ).

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

tff(f8,axiom,
    ! [X0: $tType,X4: X0,X8: fun(nat,X0),X11: nat,X7: nat] :
      ( ( X7 = X11 )
     => ( aa(nat,X0,shift(X0,X8,X7,X4),X11) = X4 ) ),
    file('/export/starexec/sandbox/tmp/tmp.urcyCwitlU/Vampire---4.8_24333',fact_7_shift__eq) ).

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

tff(f202,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,[],[f151]) ).

tff(f151,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,[],[f124]) ).

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

tff(f2,axiom,
    ! [X4: type,X5: nat,X6: fun(nat,type)] :
      ( ( aa(nat,type,X6,X5) = X4 )
     => pp(aa(type,bool,typing(X6,var(X5)),X4)) ),
    file('/export/starexec/sandbox/tmp/tmp.urcyCwitlU/Vampire---4.8_24333',fact_1_typing_OVar) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10  % Problem    : LCL796_5 : TPTP v8.1.2. Released v6.0.0.
% 0.10/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.32  % Computer : n028.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Fri May  3 13:51:48 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.11/0.32  This is a TF1_THM_EQU_NAR problem
% 0.11/0.32  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.urcyCwitlU/Vampire---4.8_24333
% 0.60/0.78  % (24450)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.78  % (24449)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.60/0.78  % (24447)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.78  % (24446)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.60/0.78  % (24448)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.78  % (24445)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.60/0.78  % (24451)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.60/0.78  % (24452)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.60/0.78  % (24451)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.78  % (24452)Refutation not found, incomplete strategy% (24452)------------------------------
% 0.60/0.78  % (24452)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78  % (24452)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78  
% 0.60/0.78  % (24452)Memory used [KB]: 1174
% 0.60/0.78  % (24452)Time elapsed: 0.005 s
% 0.60/0.78  % (24452)Instructions burned: 8 (million)
% 0.60/0.78  % (24452)------------------------------
% 0.60/0.78  % (24452)------------------------------
% 0.60/0.78  % (24451)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.78  % (24450)Refutation not found, incomplete strategy% (24450)------------------------------
% 0.60/0.78  % (24450)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78  % (24450)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78  
% 0.60/0.78  % (24450)Memory used [KB]: 1202
% 0.60/0.78  % (24450)Time elapsed: 0.007 s
% 0.60/0.78  % (24450)Instructions burned: 13 (million)
% 0.60/0.78  % (24450)------------------------------
% 0.60/0.78  % (24450)------------------------------
% 0.60/0.78  % (24453)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2995ds/55Mi)
% 0.60/0.79  % (24449)Refutation not found, incomplete strategy% (24449)------------------------------
% 0.60/0.79  % (24449)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79  % (24449)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.79  
% 0.60/0.79  % (24449)Memory used [KB]: 1405
% 0.60/0.79  % (24449)Time elapsed: 0.011 s
% 0.60/0.79  % (24449)Instructions burned: 22 (million)
% 0.60/0.79  % (24451)Refutation not found, incomplete strategy% (24451)------------------------------
% 0.60/0.79  % (24451)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79  % (24451)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.79  
% 0.60/0.79  % (24451)Memory used [KB]: 1301
% 0.60/0.79  % (24451)Time elapsed: 0.011 s
% 0.60/0.79  % (24451)Instructions burned: 20 (million)
% 0.60/0.79  % (24449)------------------------------
% 0.60/0.79  % (24449)------------------------------
% 0.60/0.79  % (24454)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2995ds/50Mi)
% 0.60/0.79  % (24451)------------------------------
% 0.60/0.79  % (24451)------------------------------
% 0.60/0.79  % (24455)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/208Mi)
% 0.60/0.79  % (24456)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on Vampire---4 for (2995ds/52Mi)
% 0.60/0.79  % (24448)Instruction limit reached!
% 0.60/0.79  % (24448)------------------------------
% 0.60/0.79  % (24448)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79  % (24448)Termination reason: Unknown
% 0.60/0.79  % (24448)Termination phase: Saturation
% 0.60/0.79  
% 0.60/0.79  % (24448)Memory used [KB]: 1710
% 0.60/0.79  % (24448)Time elapsed: 0.018 s
% 0.60/0.79  % (24448)Instructions burned: 34 (million)
% 0.60/0.79  % (24448)------------------------------
% 0.60/0.79  % (24448)------------------------------
% 0.60/0.79  % (24445)Instruction limit reached!
% 0.60/0.79  % (24445)------------------------------
% 0.60/0.79  % (24445)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79  % (24445)Termination reason: Unknown
% 0.60/0.79  % (24445)Termination phase: Saturation
% 0.60/0.79  
% 0.60/0.79  % (24445)Memory used [KB]: 1345
% 0.60/0.79  % (24445)Time elapsed: 0.019 s
% 0.60/0.79  % (24445)Instructions burned: 34 (million)
% 0.60/0.79  % (24445)------------------------------
% 0.60/0.79  % (24445)------------------------------
% 0.60/0.80  % (24455)First to succeed.
% 0.60/0.80  % (24455)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-24443"
% 0.60/0.80  % (24457)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on Vampire---4 for (2995ds/518Mi)
% 0.60/0.80  % (24455)Refutation found. Thanks to Tanya!
% 0.60/0.80  % SZS status Theorem for Vampire---4
% 0.60/0.80  % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.80  % (24455)------------------------------
% 0.60/0.80  % (24455)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.80  % (24455)Termination reason: Refutation
% 0.60/0.80  
% 0.60/0.80  % (24455)Memory used [KB]: 1210
% 0.60/0.80  % (24455)Time elapsed: 0.008 s
% 0.60/0.80  % (24455)Instructions burned: 13 (million)
% 0.60/0.80  % (24443)Success in time 0.471 s
% 0.60/0.80  % Vampire---4.8 exiting
%------------------------------------------------------------------------------