TSTP Solution File: LCL798_5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : LCL798_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 : n009.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:34 EDT 2024

% Result   : Theorem 0.60s 0.79s
% Output   : Refutation 0.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   72
% Syntax   : Number of formulae    :   89 (  11 unt;  66 typ;   0 def)
%            Number of atoms       :   48 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   47 (  22   ~;  12   |;   4   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :   72 (  32   >;  40   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :   57 (  57 usr;  26 con; 0-5 aty)
%            Number of variables   :   60 (  27   !;   2   ?;  60   :)
%                                         (  31  !>;   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,
    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,
    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: fun(dB,fun(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,
    map: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).

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,
    type_case: 
      !>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).

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

tff(func_def_26,type,
    fTrue: bool ).

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

tff(func_def_28,type,
    t2: type ).

tff(func_def_29,type,
    t1: type ).

tff(func_def_30,type,
    t_a: type ).

tff(func_def_31,type,
    t: type ).

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

tff(func_def_33,type,
    a: dB ).

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

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

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

tff(func_def_37,type,
    i: nat ).

tff(func_def_38,type,
    ia: nat ).

tff(func_def_39,type,
    n: nat ).

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

tff(func_def_41,type,
    t3: dB ).

tff(func_def_42,type,
    u: dB ).

tff(func_def_43,type,
    ua: dB ).

tff(func_def_44,type,
    sK0: ( dB * list(dB) * dB ) > dB ).

tff(func_def_45,type,
    sK1: ( dB * list(dB) * dB ) > dB ).

tff(func_def_46,type,
    sK2: ( dB * list(dB) * dB ) > list(dB) ).

tff(func_def_47,type,
    sK3: ( dB * dB ) > list(dB) ).

tff(func_def_48,type,
    sK4: ( dB * list(dB) * dB ) > dB ).

tff(func_def_49,type,
    sK5: ( dB * dB * dB ) > dB ).

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

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

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

tff(func_def_53,type,
    sK9: type ).

tff(func_def_54,type,
    sK10: list(type) ).

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(pred_def_5,type,
    sQ11_eqProxy: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(f345,plain,
    $false,
    inference(resolution,[],[f342,f240]) ).

tff(f240,plain,
    pp(aa(type,bool,typing(shift(type,e,i,t),a),sK9)),
    inference(cnf_transformation,[],[f189]) ).

tff(f189,plain,
    ( pp(aa(type,bool,typing(shift(type,e,i,t),a),sK9))
    & pp(aa(type,bool,typing(shift(type,e,i,t),var(n)),aa(type,type,aa(type,fun(type,type),fun1,sK9),foldr(type,type,fun1,ts,t1)))) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f168,f188]) ).

tff(f188,plain,
    ( ? [X0: type] :
        ( pp(aa(type,bool,typing(shift(type,e,i,t),a),X0))
        & pp(aa(type,bool,typing(shift(type,e,i,t),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1)))) )
   => ( pp(aa(type,bool,typing(shift(type,e,i,t),a),sK9))
      & pp(aa(type,bool,typing(shift(type,e,i,t),var(n)),aa(type,type,aa(type,fun(type,type),fun1,sK9),foldr(type,type,fun1,ts,t1)))) ) ),
    introduced(choice_axiom,[]) ).

tff(f168,plain,
    ? [X0: type] :
      ( pp(aa(type,bool,typing(shift(type,e,i,t),a),X0))
      & pp(aa(type,bool,typing(shift(type,e,i,t),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1)))) ),
    inference(ennf_transformation,[],[f141]) ).

tff(f141,plain,
    ~ ! [X0: type] :
        ( pp(aa(type,bool,typing(shift(type,e,i,t),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1))))
       => ~ pp(aa(type,bool,typing(shift(type,e,i,t),a),X0)) ),
    inference(rectify,[],[f52]) ).

tff(f52,axiom,
    ~ ! [X53: type] :
        ( pp(aa(type,bool,typing(shift(type,e,i,t),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X53),foldr(type,type,fun1,ts,t1))))
       => ~ pp(aa(type,bool,typing(shift(type,e,i,t),a),X53)) ),
    file('/export/starexec/sandbox/tmp/tmp.5HzvxCsCkc/Vampire---4.8_18696',fact_51__096_B_Bthesis_O_A_I_B_BT_H_H_O_A_091_124_Ae_060i_058T_062_A_092_060turnstile_062_AVar_An_A_058_AT_H_H_A_092_060Rightarrow_062_ATs_A_061_062_062_AT_H_059_Ae_060i_058T_062_A_092_060turnstile_062_Aa_A_058_AT_H_H_A_124_093_A_061_061_062_Athesis_J_A_061_061_062_Athesis_096) ).

tff(f342,plain,
    ! [X0: type] : ~ pp(aa(type,bool,typing(shift(type,e,i,t),a),X0)),
    inference(resolution,[],[f341,f252]) ).

tff(f252,plain,
    pp(aa(type,bool,typing(e,u),t)),
    inference(cnf_transformation,[],[f4]) ).

tff(f4,axiom,
    pp(aa(type,bool,typing(e,u),t)),
    file('/export/starexec/sandbox/tmp/tmp.5HzvxCsCkc/Vampire---4.8_18696',fact_3_uT) ).

tff(f341,plain,
    ! [X0: fun(nat,type),X1: type] :
      ( ~ pp(aa(type,bool,typing(X0,u),t))
      | ~ pp(aa(type,bool,typing(shift(type,X0,i,t),a),X1)) ),
    inference(subsumption_resolution,[],[f340,f207]) ).

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

tff(f3,axiom,
    pp(aa(dB,bool,it,u)),
    file('/export/starexec/sandbox/tmp/tmp.5HzvxCsCkc/Vampire---4.8_18696',fact_2_uIT) ).

tff(f340,plain,
    ! [X0: fun(nat,type),X1: type] :
      ( ~ pp(aa(type,bool,typing(X0,u),t))
      | ~ pp(aa(dB,bool,it,u))
      | ~ pp(aa(type,bool,typing(shift(type,X0,i,t),a),X1)) ),
    inference(resolution,[],[f206,f192]) ).

tff(f192,plain,
    ~ pp(aa(dB,bool,it,subst(a,u,i))),
    inference(cnf_transformation,[],[f114]) ).

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

tff(f113,negated_conjecture,
    ~ pp(aa(dB,bool,it,subst(a,u,i))),
    inference(negated_conjecture,[],[f112]) ).

tff(f112,conjecture,
    pp(aa(dB,bool,it,subst(a,u,i))),
    file('/export/starexec/sandbox/tmp/tmp.5HzvxCsCkc/Vampire---4.8_18696',conj_0) ).

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

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

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

tff(f126,plain,
    ! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
      ( pp(aa(type,bool,typing(shift(type,X0,X3,t),a),X1))
     => ( pp(aa(dB,bool,it,X2))
       => ( pp(aa(type,bool,typing(X0,X2),t))
         => pp(aa(dB,bool,it,subst(a,X2,X3))) ) ) ),
    inference(rectify,[],[f5]) ).

tff(f5,axiom,
    ! [X4: fun(nat,type),X5: type,X6: dB,X7: nat] :
      ( pp(aa(type,bool,typing(shift(type,X4,X7,t),a),X5))
     => ( pp(aa(dB,bool,it,X6))
       => ( pp(aa(type,bool,typing(X4,X6),t))
         => pp(aa(dB,bool,it,subst(a,X6,X7))) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.5HzvxCsCkc/Vampire---4.8_18696',fact_4__096ALL_Ae_AT_H_Au_Ai_O_Ae_060i_058T_062_A_092_060turnstile_062_Aa_A_058_AT_H_A_N_N_062_AIT_Au_A_N_N_062_Ae_A_092_060turnstile_062_Au_A_058_AT_A_N_N_062_AIT_A_Ia_091u_Pi_093_J_096) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : LCL798_5 : TPTP v8.1.2. Released v6.0.0.
% 0.07/0.15  % 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.15/0.37  % Computer : n009.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 300
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Fri May  3 13:36:55 EDT 2024
% 0.15/0.37  % CPUTime    : 
% 0.15/0.37  This is a TF1_THM_EQU_NAR problem
% 0.15/0.37  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.5HzvxCsCkc/Vampire---4.8_18696
% 0.60/0.78  % (18806)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 (2996ds/34Mi)
% 0.60/0.78  % (18809)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.60/0.78  % (18811)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.60/0.78  % (18808)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.60/0.78  % (18807)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 (2996ds/51Mi)
% 0.60/0.78  % (18810)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 (2996ds/34Mi)
% 0.60/0.78  % (18813)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 (2996ds/56Mi)
% 0.60/0.78  % (18812)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 (2996ds/83Mi)
% 0.60/0.78  % (18812)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.79  % (18806)First to succeed.
% 0.60/0.79  % (18806)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-18805"
% 0.60/0.79  % (18812)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.79  % (18811)Refutation not found, incomplete strategy% (18811)------------------------------
% 0.60/0.79  % (18811)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79  % (18811)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.79  
% 0.60/0.79  % (18811)Memory used [KB]: 1208
% 0.60/0.79  % (18811)Time elapsed: 0.007 s
% 0.60/0.79  % (18811)Instructions burned: 13 (million)
% 0.60/0.79  % (18811)------------------------------
% 0.60/0.79  % (18811)------------------------------
% 0.60/0.79  % (18806)Refutation found. Thanks to Tanya!
% 0.60/0.79  % SZS status Theorem for Vampire---4
% 0.60/0.79  % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.79  % (18806)------------------------------
% 0.60/0.79  % (18806)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79  % (18806)Termination reason: Refutation
% 0.60/0.79  
% 0.60/0.79  % (18806)Memory used [KB]: 1231
% 0.60/0.79  % (18806)Time elapsed: 0.007 s
% 0.60/0.79  % (18806)Instructions burned: 17 (million)
% 0.60/0.79  % (18805)Success in time 0.409 s
% 0.60/0.79  % Vampire---4.8 exiting
%------------------------------------------------------------------------------