TSTP Solution File: SWW495_5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWW495_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 : n003.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 11:18:41 EDT 2024

% Result   : Theorem 0.63s 0.81s
% Output   : Refutation 0.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   59
% Syntax   : Number of formulae    :   74 (  12 unt;  53 typ;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   34 (  15   ~;  11   |;   0   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :   41 (  25   >;  16   *;   0   +;   0  <<)
%            Number of predicates  :   25 (  24 usr;   1 prp; 0-4 aty)
%            Number of functors    :   27 (  27 usr;  13 con; 0-4 aty)
%            Number of variables   :   71 (  24   !;   0   ?;  71   :)
%                                         (  47  !>;   0  ?*;   0  @-;   0  @+)

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

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

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

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

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

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

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

tff(func_def_4,type,
    fFalse: bool ).

tff(func_def_5,type,
    fTrue: bool ).

tff(func_def_6,type,
    l: real ).

tff(func_def_7,type,
    p: fun(real,bool) ).

tff(func_def_8,type,
    y1: real ).

tff(func_def_9,type,
    x: real ).

tff(func_def_10,type,
    y: real ).

tff(func_def_11,type,
    z: real ).

tff(func_def_12,type,
    sK12: real ).

tff(func_def_13,type,
    sK13: real ).

tff(func_def_14,type,
    sK14: real ).

tff(func_def_15,type,
    sK15: real ).

tff(func_def_16,type,
    sK16: real ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(pred_def_10,type,
    ord_less_eq: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

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

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

tff(pred_def_13,type,
    sP0: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_14,type,
    sP1: 
      !>[X0: $tType] : $o ).

tff(pred_def_15,type,
    sP2: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_16,type,
    sP3: 
      !>[X0: $tType] : $o ).

tff(pred_def_17,type,
    sP4: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_18,type,
    sP5: 
      !>[X0: $tType] : $o ).

tff(pred_def_19,type,
    sP6: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_20,type,
    sP7: 
      !>[X0: $tType] : $o ).

tff(pred_def_21,type,
    sP8: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_22,type,
    sP9: 
      !>[X0: $tType] : $o ).

tff(pred_def_23,type,
    sP10: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(pred_def_24,type,
    sP11: 
      !>[X0: $tType] : $o ).

tff(f573,plain,
    $false,
    inference(unit_resulting_resolution,[],[f488,f521,f365]) ).

tff(f365,plain,
    ! [X0: real] :
      ( ~ pp(aa(real,bool,p,X0))
      | ord_less_eq(real,X0,l) ),
    inference(cnf_transformation,[],[f203]) ).

tff(f203,plain,
    ! [X0: real] :
      ( ord_less_eq(real,X0,l)
      | ~ pp(aa(real,bool,p,X0)) ),
    inference(ennf_transformation,[],[f123]) ).

tff(f123,plain,
    ! [X0: real] :
      ( pp(aa(real,bool,p,X0))
     => ord_less_eq(real,X0,l) ),
    inference(rectify,[],[f3]) ).

tff(f3,axiom,
    ! [X3: real] :
      ( pp(aa(real,bool,p,X3))
     => ord_less_eq(real,X3,l) ),
    file('/export/starexec/sandbox/tmp/tmp.afQWVUFmce/Vampire---4.8_27152',fact_2_L_H) ).

tff(f521,plain,
    ~ ord_less_eq(real,z,l),
    inference(unit_resulting_resolution,[],[f368,f369,f363,f482]) ).

tff(f482,plain,
    ! [X0: $tType,X2: X0,X3: X0,X1: X0] :
      ( ~ ord_less(X0,X3,X2)
      | ~ ord_less_eq(X0,X2,X1)
      | ord_less(X0,X3,X1)
      | ~ preorder(X0) ),
    inference(cnf_transformation,[],[f274]) ).

tff(f274,plain,
    ! [X0: $tType] :
      ( ! [X1: X0,X2: X0,X3: X0] :
          ( ord_less(X0,X3,X1)
          | ~ ord_less_eq(X0,X2,X1)
          | ~ ord_less(X0,X3,X2) )
      | ~ preorder(X0) ),
    inference(flattening,[],[f273]) ).

tff(f273,plain,
    ! [X0: $tType] :
      ( ! [X1: X0,X2: X0,X3: X0] :
          ( ord_less(X0,X3,X1)
          | ~ ord_less_eq(X0,X2,X1)
          | ~ ord_less(X0,X3,X2) )
      | ~ preorder(X0) ),
    inference(ennf_transformation,[],[f188]) ).

tff(f188,plain,
    ! [X0: $tType] :
      ( preorder(X0)
     => ! [X1: X0,X2: X0,X3: X0] :
          ( ord_less(X0,X3,X2)
         => ( ord_less_eq(X0,X2,X1)
           => ord_less(X0,X3,X1) ) ) ),
    inference(rectify,[],[f43]) ).

tff(f43,axiom,
    ! [X0: $tType] :
      ( preorder(X0)
     => ! [X19: X0,X10: X0,X5: X0] :
          ( ord_less(X0,X5,X10)
         => ( ord_less_eq(X0,X10,X19)
           => ord_less(X0,X5,X19) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.afQWVUFmce/Vampire---4.8_27152',fact_42_order__less__le__trans) ).

tff(f363,plain,
    ~ ord_less(real,y,l),
    inference(cnf_transformation,[],[f122]) ).

tff(f122,plain,
    ~ ord_less(real,y,l),
    inference(flattening,[],[f121]) ).

tff(f121,negated_conjecture,
    ~ ord_less(real,y,l),
    inference(negated_conjecture,[],[f120]) ).

tff(f120,conjecture,
    ord_less(real,y,l),
    file('/export/starexec/sandbox/tmp/tmp.afQWVUFmce/Vampire---4.8_27152',conj_0) ).

tff(f369,plain,
    ord_less(real,y,z),
    inference(cnf_transformation,[],[f4]) ).

tff(f4,axiom,
    ord_less(real,y,z),
    file('/export/starexec/sandbox/tmp/tmp.afQWVUFmce/Vampire---4.8_27152',fact_3_z_I2_J) ).

tff(f368,plain,
    preorder(real),
    inference(cnf_transformation,[],[f111]) ).

tff(f111,axiom,
    preorder(real),
    file('/export/starexec/sandbox/tmp/tmp.afQWVUFmce/Vampire---4.8_27152',arity_RealDef_Oreal___Orderings_Opreorder) ).

tff(f488,plain,
    pp(aa(real,bool,p,z)),
    inference(cnf_transformation,[],[f19]) ).

tff(f19,axiom,
    pp(aa(real,bool,p,z)),
    file('/export/starexec/sandbox/tmp/tmp.afQWVUFmce/Vampire---4.8_27152',fact_18_z_I1_J) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem    : SWW495_5 : TPTP v8.1.2. Released v6.0.0.
% 0.09/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 : n003.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 19:42:52 EDT 2024
% 0.16/0.32  % CPUTime    : 
% 0.16/0.32  This is a TF1_THM_EQU_NAR problem
% 0.16/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.afQWVUFmce/Vampire---4.8_27152
% 0.63/0.80  % (27266)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.80  % (27263)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.80  % (27265)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.80  % (27264)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.80  % (27267)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.80  % (27268)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.80  % (27269)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.80  % (27270)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.80  % (27266)Refutation not found, incomplete strategy% (27266)------------------------------
% 0.63/0.80  % (27266)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.80  % (27266)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.80  
% 0.63/0.80  % (27266)Memory used [KB]: 1054
% 0.63/0.80  % (27266)Time elapsed: 0.003 s
% 0.63/0.80  % (27266)Instructions burned: 2 (million)
% 0.63/0.80  % (27266)------------------------------
% 0.63/0.80  % (27266)------------------------------
% 0.63/0.80  % (27269)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.63/0.80  % (27270)Refutation not found, incomplete strategy% (27270)------------------------------
% 0.63/0.80  % (27270)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.80  % (27270)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.80  
% 0.63/0.80  % (27270)Memory used [KB]: 1074
% 0.63/0.80  % (27270)Time elapsed: 0.003 s
% 0.63/0.80  % (27270)Instructions burned: 4 (million)
% 0.63/0.80  % (27270)------------------------------
% 0.63/0.80  % (27270)------------------------------
% 0.63/0.80  % (27269)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.63/0.80  % (27267)Refutation not found, incomplete strategy% (27267)------------------------------
% 0.63/0.80  % (27267)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.80  % (27267)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.80  
% 0.63/0.80  % (27267)Memory used [KB]: 1299
% 0.63/0.80  % (27267)Time elapsed: 0.006 s
% 0.63/0.80  % (27267)Instructions burned: 10 (million)
% 0.63/0.80  % (27271)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.80  % (27267)------------------------------
% 0.63/0.80  % (27267)------------------------------
% 0.63/0.80  % (27272)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.63/0.80  % (27269)First to succeed.
% 0.63/0.80  % (27269)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-27261"
% 0.63/0.81  % (27269)Refutation found. Thanks to Tanya!
% 0.63/0.81  % SZS status Theorem for Vampire---4
% 0.63/0.81  % SZS output start Proof for Vampire---4
% See solution above
% 0.63/0.81  % (27269)------------------------------
% 0.63/0.81  % (27269)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.81  % (27269)Termination reason: Refutation
% 0.63/0.81  
% 0.63/0.81  % (27269)Memory used [KB]: 1333
% 0.63/0.81  % (27269)Time elapsed: 0.008 s
% 0.63/0.81  % (27269)Instructions burned: 13 (million)
% 0.63/0.81  % (27261)Success in time 0.48 s
% 0.63/0.81  % Vampire---4.8 exiting
%------------------------------------------------------------------------------