TSTP Solution File: LCL760_5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : LCL760_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n018.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:14 EDT 2024

% Result   : Theorem 0.55s 0.75s
% Output   : Refutation 0.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   54
% Syntax   : Number of formulae    :   60 (   8 unt;  52 typ;   0 def)
%            Number of atoms       :    8 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :   11 (   2 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :   39 (  23   >;  16   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-3 aty)
%            Number of functors    :   37 (  37 usr;  12 con; 0-5 aty)
%            Number of variables   :   39 (   6   !;   0   ?;  39   :)
%                                         (  33  !>;   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,
    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,
    one_one: 
      !>[X0: $tType] : X0 ).

tff(func_def_5,type,
    plus_plus: 
      !>[X0: $tType] : fun(X0,fun(X0,X0)) ).

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

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

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

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

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

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

tff(func_def_12,type,
    lift: fun(dB,fun(nat,dB)) ).

tff(func_def_13,type,
    liftn: ( nat * dB * nat ) > dB ).

tff(func_def_14,type,
    subst: fun(dB,fun(dB,fun(nat,dB))) ).

tff(func_def_15,type,
    substn: ( dB * dB * nat ) > dB ).

tff(func_def_16,type,
    foldl: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * 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,
    suc: nat > nat ).

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

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

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

tff(func_def_22,type,
    fFalse: bool ).

tff(func_def_23,type,
    fTrue: bool ).

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

tff(func_def_25,type,
    ia: nat ).

tff(func_def_26,type,
    ja: nat ).

tff(func_def_27,type,
    ra: dB ).

tff(func_def_28,type,
    s: dB ).

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

tff(func_def_30,type,
    sK0: fun(nat,bool) > nat ).

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

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

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

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

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

tff(pred_def_2,type,
    semiring_1: 
      !>[X0: $tType] : $o ).

tff(pred_def_3,type,
    monoid_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_4,type,
    semigroup_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_5,type,
    comm_monoid_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_6,type,
    ab_semigroup_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_7,type,
    cancel_semigroup_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_8,type,
    cancel146912293up_add: 
      !>[X0: $tType] : $o ).

tff(pred_def_9,type,
    linord219039673up_add: 
      !>[X0: $tType] : $o ).

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

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

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

tff(f278,plain,
    $false,
    inference(subsumption_resolution,[],[f201,f198]) ).

tff(f198,plain,
    ! [X0: nat,X1: nat] : pp(aa(dB,bool,it,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,ra),var(suc(X0))),suc(X1))),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,s),var(X0)),X1)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,var(X0)),X1),ss)))),
    inference(cnf_transformation,[],[f122]) ).

tff(f122,plain,
    ! [X0: nat,X1: nat] : pp(aa(dB,bool,it,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,ra),var(suc(X0))),suc(X1))),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,s),var(X0)),X1)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,var(X0)),X1),ss)))),
    inference(rectify,[],[f117]) ).

tff(f117,axiom,
    ! [X73: nat,X74: nat] : pp(aa(dB,bool,it,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,ra),var(suc(X73))),suc(X74))),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,s),var(X73)),X74)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,var(X73)),X74),ss)))),
    file('/export/starexec/sandbox2/tmp/tmp.LzJO8k0TUh/Vampire---4.8_11641',conj_1) ).

tff(f201,plain,
    ~ pp(aa(dB,bool,it,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,ra),var(suc(ia))),suc(ja))),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,s),var(ia)),ja)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,var(ia)),ja),ss)))),
    inference(cnf_transformation,[],[f124]) ).

tff(f124,plain,
    ~ pp(aa(dB,bool,it,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,ra),var(suc(ia))),suc(ja))),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,s),var(ia)),ja)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,var(ia)),ja),ss)))),
    inference(flattening,[],[f121]) ).

tff(f121,negated_conjecture,
    ~ pp(aa(dB,bool,it,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,ra),var(suc(ia))),suc(ja))),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,s),var(ia)),ja)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,var(ia)),ja),ss)))),
    inference(negated_conjecture,[],[f120]) ).

tff(f120,conjecture,
    pp(aa(dB,bool,it,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,ra),var(suc(ia))),suc(ja))),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,s),var(ia)),ja)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,var(ia)),ja),ss)))),
    file('/export/starexec/sandbox2/tmp/tmp.LzJO8k0TUh/Vampire---4.8_11641',conj_4) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : LCL760_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36  % Computer : n018.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit   : 300
% 0.16/0.36  % WCLimit    : 300
% 0.16/0.36  % DateTime   : Fri May  3 13:53:32 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.16/0.36  This is a TF1_THM_EQU_NAR problem
% 0.16/0.36  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.LzJO8k0TUh/Vampire---4.8_11641
% 0.55/0.74  % (11822)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.55/0.74  % (11816)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.55/0.74  % (11818)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.55/0.74  % (11817)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.55/0.74  % (11819)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.55/0.74  % (11820)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.55/0.74  % (11821)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.55/0.74  % (11822)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.55/0.74  % (11822)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.55/0.74  % (11823)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.55/0.74  % (11819)First to succeed.
% 0.55/0.74  % (11822)Also succeeded, but the first one will report.
% 0.55/0.74  % (11819)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11815"
% 0.55/0.75  % (11818)Also succeeded, but the first one will report.
% 0.55/0.75  % (11821)Also succeeded, but the first one will report.
% 0.55/0.75  % (11823)Also succeeded, but the first one will report.
% 0.55/0.75  % (11819)Refutation found. Thanks to Tanya!
% 0.55/0.75  % SZS status Theorem for Vampire---4
% 0.55/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.75  % (11819)------------------------------
% 0.55/0.75  % (11819)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75  % (11819)Termination reason: Refutation
% 0.55/0.75  
% 0.55/0.75  % (11819)Memory used [KB]: 1135
% 0.55/0.75  % (11819)Time elapsed: 0.006 s
% 0.55/0.75  % (11819)Instructions burned: 8 (million)
% 0.55/0.75  % (11815)Success in time 0.37 s
% 0.55/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------