TSTP Solution File: LCL840_5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : LCL840_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 : n002.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:54 EDT 2024

% Result   : Theorem 0.63s 0.84s
% Output   : Refutation 0.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   68
% Syntax   : Number of formulae    :   85 (  15 unt;  62 typ;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   41 (  22   ~;  12   |;   0   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :   56 (  29   >;  27   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :   52 (  52 usr;  25 con; 0-5 aty)
%            Number of variables   :   52 (  26   !;   2   ?;  52   :)
%                                         (  24  !>;   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,
    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,
    map: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).

tff(func_def_15,type,
    suc: nat > nat ).

tff(func_def_16,type,
    shift: 
      !>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).

tff(func_def_17,type,
    fun1: fun(type,fun(type,type)) ).

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

tff(func_def_19,type,
    fFalse: bool ).

tff(func_def_20,type,
    fTrue: bool ).

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

tff(func_def_22,type,
    t2: type ).

tff(func_def_23,type,
    t: type ).

tff(func_def_24,type,
    t_a: type ).

tff(func_def_25,type,
    t1: type ).

tff(func_def_26,type,
    ua1: type ).

tff(func_def_27,type,
    a: dB ).

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

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

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

tff(func_def_31,type,
    i: nat ).

tff(func_def_32,type,
    ia: nat ).

tff(func_def_33,type,
    r: dB ).

tff(func_def_34,type,
    t3: dB ).

tff(func_def_35,type,
    u: dB ).

tff(func_def_36,type,
    ua: dB ).

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

tff(func_def_38,type,
    sK1: fun(nat,bool) > nat ).

tff(func_def_39,type,
    sK2: fun(nat,bool) > nat ).

tff(func_def_40,type,
    sK3: nat > nat ).

tff(func_def_41,type,
    sK4: nat > nat ).

tff(func_def_42,type,
    sK5: type ).

tff(func_def_43,type,
    sK6: type ).

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

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

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

tff(func_def_47,type,
    sK10: ( dB * dB ) > dB ).

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

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

tff(pred_def_1,type,
    zero: 
      !>[X0: $tType] : $o ).

tff(pred_def_2,type,
    beta: ( dB * dB ) > $o ).

tff(pred_def_3,type,
    listsp: 
      !>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).

tff(pred_def_4,type,
    typing: ( fun(nat,type) * dB * type ) > $o ).

tff(pred_def_5,type,
    typings: ( fun(nat,type) * list(dB) * list(type) ) > $o ).

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

tff(f360,plain,
    $false,
    inference(subsumption_resolution,[],[f358,f257]) ).

tff(f257,plain,
    typing(e,u,t1),
    inference(cnf_transformation,[],[f4]) ).

tff(f4,axiom,
    typing(e,u,t1),
    file('/export/starexec/sandbox/tmp/tmp.eYysOxeNJy/Vampire---4.8_6758',fact_3_uT) ).

tff(f358,plain,
    ~ typing(e,u,t1),
    inference(resolution,[],[f357,f303]) ).

tff(f303,plain,
    typing(shift(type,e,i,t1),a,sK6),
    inference(cnf_transformation,[],[f237]) ).

tff(f237,plain,
    typing(shift(type,e,i,t1),a,sK6),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f196,f236]) ).

tff(f236,plain,
    ( ? [X0: type] : typing(shift(type,e,i,t1),a,X0)
   => typing(shift(type,e,i,t1),a,sK6) ),
    introduced(choice_axiom,[]) ).

tff(f196,plain,
    ? [X0: type] : typing(shift(type,e,i,t1),a,X0),
    inference(ennf_transformation,[],[f148]) ).

tff(f148,plain,
    ~ ! [X0: type] : ~ typing(shift(type,e,i,t1),a,X0),
    inference(rectify,[],[f7]) ).

tff(f7,axiom,
    ~ ! [X3: type] : ~ typing(shift(type,e,i,t1),a,X3),
    file('/export/starexec/sandbox/tmp/tmp.eYysOxeNJy/Vampire---4.8_6758',fact_6__096_B_Bthesis_O_A_I_B_BT_H_H_O_Ae_060i_058T_062_A_092_060turnstile_062_Aa_A_058_AT_H_H_A_061_061_062_Athesis_J_A_061_061_062_Athesis_096) ).

tff(f357,plain,
    ! [X0: fun(nat,type),X1: type] :
      ( ~ typing(shift(type,X0,i,t1),a,X1)
      | ~ typing(X0,u,t1) ),
    inference(subsumption_resolution,[],[f356,f258]) ).

tff(f258,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.eYysOxeNJy/Vampire---4.8_6758',fact_2_uIT) ).

tff(f356,plain,
    ! [X0: fun(nat,type),X1: type] :
      ( ~ typing(X0,u,t1)
      | ~ pp(aa(dB,bool,it,u))
      | ~ typing(shift(type,X0,i,t1),a,X1) ),
    inference(resolution,[],[f250,f301]) ).

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

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

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

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

tff(f13,axiom,
    ! [X4: dB,X15: type,X6: nat,X7: fun(nat,type)] :
      ( typing(shift(type,X7,X6,t1),a,X15)
     => ( pp(aa(dB,bool,it,X4))
       => ( typing(X7,X4,t1)
         => pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),X4),X6))) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.eYysOxeNJy/Vampire---4.8_6758',fact_12_SI2) ).

tff(f250,plain,
    ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i))),
    inference(cnf_transformation,[],[f111]) ).

tff(f111,plain,
    ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i))),
    inference(flattening,[],[f110]) ).

tff(f110,negated_conjecture,
    ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i))),
    inference(negated_conjecture,[],[f109]) ).

tff(f109,conjecture,
    pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i))),
    file('/export/starexec/sandbox/tmp/tmp.eYysOxeNJy/Vampire---4.8_6758',conj_0) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : LCL840_5 : TPTP v8.1.2. Released v6.0.0.
% 0.07/0.14  % 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.36  % Computer : n002.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 13:36:42 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  This is a TF1_THM_EQU_NAR problem
% 0.15/0.36  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.eYysOxeNJy/Vampire---4.8_6758
% 0.63/0.83  % (7228)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.63/0.83  % (7221)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.63/0.83  % (7223)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.63/0.83  % (7224)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.63/0.83  % (7222)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.63/0.83  % (7225)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.63/0.83  % (7226)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.63/0.83  % (7227)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.63/0.83  % (7228)Refutation not found, incomplete strategy% (7228)------------------------------
% 0.63/0.83  % (7228)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.83  % (7228)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.83  
% 0.63/0.83  % (7228)Memory used [KB]: 1129
% 0.63/0.83  % (7228)Time elapsed: 0.003 s
% 0.63/0.83  % (7228)Instructions burned: 8 (million)
% 0.63/0.83  % (7228)------------------------------
% 0.63/0.83  % (7228)------------------------------
% 0.63/0.83  % (7227)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.63/0.83  % (7229)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.63/0.84  % (7227)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.63/0.84  % (7226)First to succeed.
% 0.63/0.84  % (7221)Also succeeded, but the first one will report.
% 0.63/0.84  % (7226)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-7036"
% 0.63/0.84  % (7226)Refutation found. Thanks to Tanya!
% 0.63/0.84  % SZS status Theorem for Vampire---4
% 0.63/0.84  % SZS output start Proof for Vampire---4
% See solution above
% 0.63/0.84  % (7226)------------------------------
% 0.63/0.84  % (7226)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.84  % (7226)Termination reason: Refutation
% 0.63/0.84  
% 0.63/0.84  % (7226)Memory used [KB]: 1214
% 0.63/0.84  % (7226)Time elapsed: 0.009 s
% 0.63/0.84  % (7226)Instructions burned: 15 (million)
% 0.63/0.84  % (7036)Success in time 0.464 s
% 0.63/0.84  % Vampire---4.8 exiting
%------------------------------------------------------------------------------