TSTP Solution File: SWW494_5 by Vampire---4.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.9
% Problem  : SWW494_5 : TPTP v8.2.0. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire %s %d THM

% 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 : Mon Jun 24 18:33:16 EDT 2024

% Result   : Theorem 0.23s 0.44s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   26 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   37 (   3 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   24 (  13   ~;   6   |;   0   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   22 (  20 usr;   4 prp; 0-6 aty)
%            Number of functors    :   32 (  32 usr;  12 con; 0-4 aty)
%            Number of variables   :   16 (  13   !;   3   ?;  16   :)

% 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,
    isUb: 
      !>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) ) > fun(X0,bool) ) ).

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

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

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

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

tff(func_def_6,type,
    fFalse: bool ).

tff(func_def_7,type,
    fTrue: bool ).

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

tff(func_def_9,type,
    y: real ).

tff(func_def_10,type,
    x: real ).

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

tff(func_def_12,type,
    sK1: fun(real,bool) > real ).

tff(func_def_13,type,
    sK2: fun(real,bool) > real ).

tff(func_def_14,type,
    sK3: real ).

tff(func_def_15,type,
    sK4: real ).

tff(func_def_16,type,
    sK5: real ).

tff(func_def_17,type,
    sK6: real ).

tff(func_def_18,type,
    sK7: real ).

tff(func_def_19,type,
    sK8: real ).

tff(func_def_20,type,
    sK9: real ).

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

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

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

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

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

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

tff(func_def_27,type,
    sK16: 
      !>[X0: $tType] : X0 ).

tff(func_def_28,type,
    sK17: fun(real,bool) > real ).

tff(func_def_29,type,
    sK18: ( fun(real,bool) * real ) > real ).

tff(func_def_30,type,
    sK19: ( fun(real,bool) * real ) > real ).

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,
    dense_linorder: 
      !>[X0: $tType] : $o ).

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

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

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

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

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

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

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

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

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

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

tff(f319,plain,
    $false,
    inference(avatar_sat_refutation,[],[f304,f305,f318]) ).

tff(f318,plain,
    ~ spl20_1,
    inference(avatar_contradiction_clause,[],[f315]) ).

tff(f315,plain,
    ( $false
    | ~ spl20_1 ),
    inference(resolution,[],[f310,f307]) ).

tff(f307,plain,
    ( ! [X0: real] : ~ isLub(real,top_top(fun(real,bool)),p,X0)
    | ~ spl20_1 ),
    inference(backward_demodulation,[],[f299,f244]) ).

tff(f244,plain,
    ! [X0: $tType,X1: fun(X0,bool)] : ( collect(X0,X1) = X1 ),
    inference(cnf_transformation,[],[f128]) ).

tff(f128,plain,
    ! [X0: $tType,X1: fun(X0,bool)] : ( collect(X0,X1) = X1 ),
    inference(rectify,[],[f78]) ).

tff(f78,axiom,
    ! [X0: $tType,X14: fun(X0,bool)] : ( collect(X0,X14) = X14 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

tff(f299,plain,
    ( ! [X0: real] : ~ isLub(real,top_top(fun(real,bool)),collect(real,p),X0)
    | ~ spl20_1 ),
    inference(avatar_component_clause,[],[f298]) ).

tff(f298,plain,
    ( spl20_1
  <=> ! [X0: real] : ~ isLub(real,top_top(fun(real,bool)),collect(real,p),X0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl20_1])]) ).

tff(f310,plain,
    isLub(real,top_top(fun(real,bool)),p,sK5),
    inference(superposition,[],[f260,f244]) ).

tff(f260,plain,
    isLub(real,top_top(fun(real,bool)),collect(real,p),sK5),
    inference(cnf_transformation,[],[f214]) ).

tff(f214,plain,
    isLub(real,top_top(fun(real,bool)),collect(real,p),sK5),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f142,f213]) ).

tff(f213,plain,
    ( ? [X0: real] : isLub(real,top_top(fun(real,bool)),collect(real,p),X0)
   => isLub(real,top_top(fun(real,bool)),collect(real,p),sK5) ),
    introduced(choice_axiom,[]) ).

tff(f142,plain,
    ? [X0: real] : isLub(real,top_top(fun(real,bool)),collect(real,p),X0),
    inference(rectify,[],[f3]) ).

tff(f3,axiom,
    ? [X2: real] : isLub(real,top_top(fun(real,bool)),collect(real,p),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

tff(f305,plain,
    ~ spl20_2,
    inference(avatar_split_clause,[],[f240,f301]) ).

tff(f301,plain,
    ( spl20_2
  <=> thesis ),
    introduced(avatar_definition,[new_symbols(naming,[spl20_2])]) ).

tff(f240,plain,
    ~ thesis,
    inference(cnf_transformation,[],[f124]) ).

tff(f124,plain,
    ~ thesis,
    inference(flattening,[],[f123]) ).

tff(f123,negated_conjecture,
    ~ thesis,
    inference(negated_conjecture,[],[f122]) ).

tff(f122,conjecture,
    thesis,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

tff(f304,plain,
    ( spl20_1
    | spl20_2 ),
    inference(avatar_split_clause,[],[f241,f301,f298]) ).

tff(f241,plain,
    ! [X0: real] :
      ( thesis
      | ~ isLub(real,top_top(fun(real,bool)),collect(real,p),X0) ),
    inference(cnf_transformation,[],[f161]) ).

tff(f161,plain,
    ! [X0: real] :
      ( thesis
      | ~ isLub(real,top_top(fun(real,bool)),collect(real,p),X0) ),
    inference(ennf_transformation,[],[f125]) ).

tff(f125,plain,
    ! [X0: real] :
      ( isLub(real,top_top(fun(real,bool)),collect(real,p),X0)
     => thesis ),
    inference(rectify,[],[f121]) ).

tff(f121,axiom,
    ! [X35: real] :
      ( isLub(real,top_top(fun(real,bool)),collect(real,p),X35)
     => thesis ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : SWW494_5 : TPTP v8.2.0. Released v6.0.0.
% 0.08/0.13  % Command    : run_vampire %s %d THM
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Wed Jun 19 04:46:09 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.13/0.36  This is a TF1_THM_EQU_NAR problem
% 0.13/0.37  Running first-order theorem proving
% 0.13/0.37  Running /export/starexec/sandbox/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/0.44  % (13400)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44  % (13406)dis+1010_1:1_sil=2000:nwc=3.0:s2a=on:i=132:ins=5:fsr=off:ss=axioms:sd=2:fd=off_0 on theBenchmark for (2999ds/132Mi)
% 0.23/0.44  % (13400)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44  % (13402)dis+11_1:1_nwc=5.0:s2a=on:i=66616:s2at=3.0:sil=128000:bd=off_0 on theBenchmark for (2999ds/66616Mi)
% 0.23/0.44  % (13400)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44  % (13401)lrs+1011_1:12_anc=none:drc=off:sil=64000:sims=off:sp=unary_first:spb=goal_then_units:lsd=20:rnwc=on:nwc=2.0:i=53554:add=off:awrs=converge:bd=off:uhcvi=on:tgt=ground:afp=300:afq=1.63_0 on theBenchmark for (2999ds/53554Mi)
% 0.23/0.44  % (13400)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44  % (13405)dis+1011_3:1_sil=256000:tgt=ground:sac=on:i=109:sd=1:ss=included_0 on theBenchmark for (2999ds/109Mi)
% 0.23/0.44  % (13400)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44  % (13407)dis+1010_159245:1048576_to=lpo:sil=2000:etr=on:sp=unary_frequency:spb=goal:rnwc=on:nwc=10.9066:st=2:i=124:sd=1:nm=3:av=off:ss=axioms:rawr=on:drc=encompass:foolp=on:sgt=5:cond=fast:er=filter:erape=on:erml=2:s2a=on_0 on theBenchmark for (2999ds/124Mi)
% 0.23/0.44  % (13400)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44  % (13404)lrs+10_1:3_drc=off:sil=256000:sp=unary_first:lwlo=on:i=216875:kws=precedence:ins=3:rawr=on:nwc=10.0_0 on theBenchmark for (2999ds/216875Mi)
% 0.23/0.44  % (13406)First to succeed.
% 0.23/0.44  % (13406)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-13400"
% 0.23/0.44  % (13407)Also succeeded, but the first one will report.
% 0.23/0.44  % (13400)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.44  % (13406)Refutation found. Thanks to Tanya!
% 0.23/0.44  % SZS status Theorem for theBenchmark
% 0.23/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.44  % (13406)------------------------------
% 0.23/0.44  % (13406)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.23/0.44  % (13406)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.23/0.44  % (13406)Termination reason: Refutation
% 0.23/0.44  
% 0.23/0.44  % (13406)Memory used [KB]: 1268
% 0.23/0.44  % (13406)Time elapsed: 0.006 s
% 0.23/0.44  % (13406)Instructions burned: 7 (million)
% 0.23/0.44  % (13406)------------------------------
% 0.23/0.44  % (13406)------------------------------
% 0.23/0.44  % (13400)Success in time 0.059 s
%------------------------------------------------------------------------------