TSTP Solution File: SWW525_5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWW525_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 : 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 : Wed May  1 04:19:47 EDT 2024

% Result   : ContradictoryAxioms 0.62s 0.79s
% Output   : Refutation 0.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   39
% Syntax   : Number of formulae    :   53 (   8 unt;  33 typ;   0 def)
%            Number of atoms       :   38 (  19 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   37 (  19   ~;   6   |;   4   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    8 (   7 usr)
%            Number of type conns  :   55 (  18   >;  37   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   2 prp; 0-4 aty)
%            Number of functors    :   22 (  22 usr;   8 con; 0-10 aty)
%            Number of variables   :   29 (  19   !;   6   ?;  29   :)
%                                         (   4  !>;   0  ?*;   0  @-;   0  @+)

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

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

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

tff(type_def_8,type,
    state: $tType ).

tff(type_def_9,type,
    vname: $tType ).

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

tff(type_def_11,type,
    nat: $tType ).

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

tff(func_def_0,type,
    ass: ( vname * fun(state,nat) ) > com ).

tff(func_def_1,type,
    call: ( vname * pname * fun(state,nat) ) > com ).

tff(func_def_2,type,
    cond: ( fun(state,bool) * com * com ) > com ).

tff(func_def_3,type,
    local: ( loc * fun(state,nat) * com ) > com ).

tff(func_def_4,type,
    skip: com ).

tff(func_def_5,type,
    semi: ( com * com ) > com ).

tff(func_def_6,type,
    while: ( fun(state,bool) * com ) > com ).

tff(func_def_7,type,
    com_case: 
      !>[X0: $tType] : ( ( X0 * fun(vname,fun(fun(state,nat),X0)) * fun(loc,fun(fun(state,nat),fun(com,X0))) * fun(com,fun(com,X0)) * fun(fun(state,bool),fun(com,fun(com,X0))) * fun(fun(state,bool),fun(com,X0)) * fun(pname,X0) * fun(vname,fun(pname,fun(fun(state,nat),X0))) * com ) > X0 ) ).

tff(func_def_8,type,
    com_rec: 
      !>[X0: $tType] : ( ( X0 * fun(vname,fun(fun(state,nat),X0)) * fun(loc,fun(fun(state,nat),fun(com,fun(X0,X0)))) * fun(com,fun(com,fun(X0,fun(X0,X0)))) * fun(fun(state,bool),fun(com,fun(com,fun(X0,fun(X0,X0))))) * fun(fun(state,bool),fun(com,fun(X0,X0))) * fun(pname,X0) * fun(vname,fun(pname,fun(fun(state,nat),X0))) * com ) > X0 ) ).

tff(func_def_9,type,
    update: ( state * vname * nat ) > state ).

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

tff(func_def_11,type,
    fFalse: bool ).

tff(func_def_12,type,
    fTrue: bool ).

tff(func_def_13,type,
    z: state ).

tff(func_def_14,type,
    c: com ).

tff(func_def_15,type,
    s: state ).

tff(func_def_16,type,
    sK0: state > state ).

tff(func_def_17,type,
    sK1: state > state ).

tff(func_def_18,type,
    sK2: state ).

tff(func_def_19,type,
    sK3: state ).

tff(func_def_20,type,
    sK4: ( state * state * com * com ) > state ).

tff(pred_def_1,type,
    wt: com > $o ).

tff(pred_def_3,type,
    evalc: ( com * state * state ) > $o ).

tff(pred_def_4,type,
    evaln: ( com * state * nat * state ) > $o ).

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

tff(f161,plain,
    $false,
    inference(unit_resulting_resolution,[],[f149,f138,f136]) ).

tff(f136,plain,
    ! [X0: state] :
      ( ( s = X0 )
      | evalc(c,z,sK0(X0)) ),
    inference(cnf_transformation,[],[f126]) ).

tff(f126,plain,
    ! [X0: state] :
      ( ( s = X0 )
      | ( ( sK0(X0) != X0 )
        & evalc(c,z,sK0(X0)) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f116,f125]) ).

tff(f125,plain,
    ! [X0: state] :
      ( ? [X1: state] :
          ( ( X0 != X1 )
          & evalc(c,z,X1) )
     => ( ( sK0(X0) != X0 )
        & evalc(c,z,sK0(X0)) ) ),
    introduced(choice_axiom,[]) ).

tff(f116,plain,
    ! [X0: state] :
      ( ( s = X0 )
      | ? [X1: state] :
          ( ( X0 != X1 )
          & evalc(c,z,X1) ) ),
    inference(ennf_transformation,[],[f106]) ).

tff(f106,plain,
    ! [X0: state] :
      ( ! [X1: state] :
          ( evalc(c,z,X1)
         => ( X0 = X1 ) )
     => ( s = X0 ) ),
    inference(rectify,[],[f102]) ).

tff(f102,axiom,
    ! [X58: state] :
      ( ! [X27: state] :
          ( evalc(c,z,X27)
         => ( X27 = X58 ) )
     => ( s = X58 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.5vbbH6Bx4q/Vampire---4.8_13558',conj_1) ).

tff(f138,plain,
    ! [X0: state] : ~ evalc(c,z,X0),
    inference(cnf_transformation,[],[f117]) ).

tff(f117,plain,
    ! [X0: state] : ~ evalc(c,z,X0),
    inference(ennf_transformation,[],[f107]) ).

tff(f107,plain,
    ~ ? [X0: state] : evalc(c,z,X0),
    inference(rectify,[],[f103]) ).

tff(f103,axiom,
    ~ ? [X59: state] : evalc(c,z,X59),
    file('/export/starexec/sandbox2/tmp/tmp.5vbbH6Bx4q/Vampire---4.8_13558',conj_2) ).

tff(f149,plain,
    ! [X0: state] : ( sK1(X0) != X0 ),
    inference(subsumption_resolution,[],[f140,f135]) ).

tff(f135,plain,
    hoare_531836380gleton,
    inference(cnf_transformation,[],[f101]) ).

tff(f101,axiom,
    hoare_531836380gleton,
    file('/export/starexec/sandbox2/tmp/tmp.5vbbH6Bx4q/Vampire---4.8_13558',conj_0) ).

tff(f140,plain,
    ! [X0: state] :
      ( ( sK1(X0) != X0 )
      | ~ hoare_531836380gleton ),
    inference(cnf_transformation,[],[f128]) ).

tff(f128,plain,
    ( ! [X0: state] : ( sK1(X0) != X0 )
    | ~ hoare_531836380gleton ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f118,f127]) ).

tff(f127,plain,
    ! [X0: state] :
      ( ? [X1: state] : ( X0 != X1 )
     => ( sK1(X0) != X0 ) ),
    introduced(choice_axiom,[]) ).

tff(f118,plain,
    ( ! [X0: state] :
      ? [X1: state] : ( X0 != X1 )
    | ~ hoare_531836380gleton ),
    inference(ennf_transformation,[],[f109]) ).

tff(f109,plain,
    ( hoare_531836380gleton
   => ! [X0: state] :
        ~ ! [X1: state] : ( X0 = X1 ) ),
    inference(rectify,[],[f2]) ).

tff(f2,axiom,
    ( hoare_531836380gleton
   => ! [X5: state] :
        ~ ! [X6: state] : ( X5 = X6 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.5vbbH6Bx4q/Vampire---4.8_13558',fact_1_single__stateE) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SWW525_5 : TPTP v8.1.2. Released v6.0.0.
% 0.10/0.11  % 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.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   : Tue Apr 30 18:06:03 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.11/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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.5vbbH6Bx4q/Vampire---4.8_13558
% 0.62/0.79  % (13674)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.62/0.79  % (13671)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.62/0.79  % (13673)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.62/0.79  % (13675)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.62/0.79  % (13676)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.62/0.79  % (13672)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.62/0.79  % (13678)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.62/0.79  % (13677)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.62/0.79  % (13677)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.62/0.79  % (13678)Refutation not found, incomplete strategy% (13678)------------------------------
% 0.62/0.79  % (13678)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.79  % (13678)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.79  
% 0.62/0.79  % (13674)First to succeed.
% 0.62/0.79  % (13678)Memory used [KB]: 1093
% 0.62/0.79  % (13678)Time elapsed: 0.003 s
% 0.62/0.79  % (13678)Instructions burned: 3 (million)
% 0.62/0.79  % (13678)------------------------------
% 0.62/0.79  % (13678)------------------------------
% 0.62/0.79  % (13671)Also succeeded, but the first one will report.
% 0.62/0.79  % (13677)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.62/0.79  % (13674)Refutation found. Thanks to Tanya!
% 0.62/0.79  % SZS status ContradictoryAxioms for Vampire---4
% 0.62/0.79  % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.79  % (13674)------------------------------
% 0.62/0.79  % (13674)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.79  % (13674)Termination reason: Refutation
% 0.62/0.79  
% 0.62/0.79  % (13674)Memory used [KB]: 1077
% 0.62/0.79  % (13674)Time elapsed: 0.004 s
% 0.62/0.79  % (13674)Instructions burned: 4 (million)
% 0.62/0.79  % (13674)------------------------------
% 0.62/0.79  % (13674)------------------------------
% 0.62/0.79  % (13666)Success in time 0.47 s
% 0.62/0.79  % Vampire---4.8 exiting
%------------------------------------------------------------------------------