TSTP Solution File: SCT222_5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SCT222_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 : n024.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 09:00:05 EDT 2024

% Result   : Theorem 0.61s 0.77s
% Output   : Refutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   49
% Syntax   : Number of formulae    :   57 (   9 unt;  46 typ;   0 def)
%            Number of atoms       :   14 (  10 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   12 (   9   ~;   0   |;   2   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :   54 (  28   >;  26   *;   0   +;   0  <<)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-6 aty)
%            Number of functors    :   34 (  34 usr;  11 con; 0-6 aty)
%            Number of variables   :   40 (   3   !;   0   ?;  40   :)
%                                         (  37  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    arrow_411405190le_alt: $tType ).

tff(type_def_6,type,
    arrow_159774573e_indi: $tType ).

tff(type_def_7,type,
    bool: $tType ).

tff(type_def_8,type,
    list: $tType > $tType ).

tff(type_def_9,type,
    fun: ( $tType * $tType ) > $tType ).

tff(type_def_10,type,
    product_prod: ( $tType * $tType ) > $tType ).

tff(func_def_0,type,
    arrow_1985332922le_Lin: fun(fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool),bool) ).

tff(func_def_1,type,
    arrow_610318064e_Prof: fun(fun(arrow_159774573e_indi,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)),bool) ).

tff(func_def_2,type,
    arrow_1158827142_above: ( fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) * arrow_411405190le_alt * arrow_411405190le_alt ) > fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) ).

tff(func_def_3,type,
    arrow_319942042_below: fun(fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool),fun(arrow_411405190le_alt,fun(arrow_411405190le_alt,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)))) ).

tff(func_def_4,type,
    arrow_276188178_mkbot: ( fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) * arrow_411405190le_alt ) > fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) ).

tff(func_def_5,type,
    arrow_424895264_mktop: ( fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) * arrow_411405190le_alt ) > fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool) ).

tff(func_def_6,type,
    combb: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).

tff(func_def_7,type,
    combc: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).

tff(func_def_8,type,
    combi: 
      !>[X0: $tType] : fun(X0,X0) ).

tff(func_def_9,type,
    combk: 
      !>[X0: $tType,X1: $tType] : ( X0 > fun(X1,X0) ) ).

tff(func_def_10,type,
    pi: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,bool) * fun(X0,fun(X1,bool)) ) > fun(fun(X0,X1),bool) ) ).

tff(func_def_11,type,
    insert: 
      !>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).

tff(func_def_12,type,
    cons: 
      !>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).

tff(func_def_13,type,
    nil: 
      !>[X0: $tType] : list(X0) ).

tff(func_def_14,type,
    list_case: 
      !>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).

tff(func_def_15,type,
    splice: 
      !>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).

tff(func_def_16,type,
    top_top: 
      !>[X0: $tType] : X0 ).

tff(func_def_17,type,
    product_Pair: 
      !>[X0: $tType,X1: $tType] : ( ( X0 * X1 ) > product_prod(X0,X1) ) ).

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

tff(func_def_19,type,
    produc1605651328_split: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * product_prod(X0,X1) ) > X2 ) ).

tff(func_def_20,type,
    product_prod_rec: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * product_prod(X0,X1) ) > X2 ) ).

tff(func_def_21,type,
    collect: 
      !>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).

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

tff(func_def_23,type,
    fFalse: bool ).

tff(func_def_24,type,
    fTrue: bool ).

tff(func_def_25,type,
    f: fun(fun(arrow_159774573e_indi,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)),fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)) ).

tff(func_def_26,type,
    p1: fun(arrow_159774573e_indi,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)) ).

tff(func_def_27,type,
    p: fun(arrow_159774573e_indi,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)) ).

tff(func_def_28,type,
    a: arrow_411405190le_alt ).

tff(func_def_29,type,
    b: arrow_411405190le_alt ).

tff(func_def_30,type,
    c: arrow_411405190le_alt ).

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

tff(pred_def_2,type,
    arrow_1958449194le_IIA: fun(fun(arrow_159774573e_indi,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)),fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)) > $o ).

tff(pred_def_3,type,
    arrow_987702531ctator: ( fun(fun(arrow_159774573e_indi,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)),fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)) * arrow_159774573e_indi ) > $o ).

tff(pred_def_4,type,
    arrow_2069624013nimity: fun(fun(arrow_159774573e_indi,fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)),fun(product_prod(arrow_411405190le_alt,arrow_411405190le_alt),bool)) > $o ).

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

tff(pred_def_6,type,
    inv_imagep: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X0,bool)) * fun(X1,X0) * X1 * X1 ) > $o ) ).

tff(pred_def_7,type,
    member: 
      !>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).

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

tff(pred_def_9,type,
    sQ0_eqProxy: ( arrow_411405190le_alt * arrow_411405190le_alt ) > $o ).

tff(f132,plain,
    $false,
    inference(subsumption_resolution,[],[f127,f131]) ).

tff(f131,plain,
    ! [X0: arrow_411405190le_alt] : sQ0_eqProxy(X0,X0),
    inference(equality_proxy_axiom,[],[f126]) ).

tff(f126,plain,
    ! [X0: arrow_411405190le_alt,X1: arrow_411405190le_alt] :
      ( sQ0_eqProxy(X0,X1)
    <=> ( X0 = X1 ) ),
    introduced(equality_proxy_definition,[new_symbols(naming,[sQ0_eqProxy])]) ).

tff(f127,plain,
    ~ sQ0_eqProxy(c,c),
    inference(equality_proxy_replacement,[],[f123,f126]) ).

tff(f123,plain,
    c != c,
    inference(definition_unfolding,[],[f120,f121]) ).

tff(f121,plain,
    b = c,
    inference(cnf_transformation,[],[f117]) ).

tff(f117,plain,
    b = c,
    inference(flattening,[],[f116]) ).

tff(f116,negated_conjecture,
    ( ~ b != c ),
    inference(negated_conjecture,[],[f115]) ).

tff(f115,conjecture,
    b != c,
    file('/export/starexec/sandbox/tmp/tmp.8b2JLDUvYq/Vampire---4.8_32455',conj_4) ).

tff(f120,plain,
    b != c,
    inference(cnf_transformation,[],[f114]) ).

tff(f114,axiom,
    ( ( b != c )
    & ( a != c )
    & ( a != b ) ),
    file('/export/starexec/sandbox/tmp/tmp.8b2JLDUvYq/Vampire---4.8_32455',conj_3) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : SCT222_5 : TPTP v8.1.2. Released v6.0.0.
% 0.11/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.16/0.37  % Computer : n024.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 300
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Fri May  3 13:01:50 EDT 2024
% 0.16/0.37  % CPUTime    : 
% 0.16/0.37  This is a TF1_THM_EQU_NAR problem
% 0.16/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.8b2JLDUvYq/Vampire---4.8_32455
% 0.61/0.76  % (32743)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.61/0.76  % (32742)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.61/0.76  % (32736)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.61/0.76  % (32743)First to succeed.
% 0.61/0.76  % (32738)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.61/0.77  % (32739)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.61/0.77  % (32737)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.61/0.77  % (32740)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.61/0.77  % (32743)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-32726"
% 0.61/0.77  % (32743)Refutation found. Thanks to Tanya!
% 0.61/0.77  % SZS status Theorem for Vampire---4
% 0.61/0.77  % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.77  % (32743)------------------------------
% 0.61/0.77  % (32743)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.77  % (32743)Termination reason: Refutation
% 0.61/0.77  
% 0.61/0.77  % (32743)Memory used [KB]: 1082
% 0.61/0.77  % (32743)Time elapsed: 0.002 s
% 0.61/0.77  % (32743)Instructions burned: 3 (million)
% 0.61/0.77  % (32726)Success in time 0.388 s
% 0.61/0.77  % Vampire---4.8 exiting
%------------------------------------------------------------------------------