TSTP Solution File: SWW525_5 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SWW525_5 : TPTP v8.1.2. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n031.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 : Tue Apr 30 17:35:28 EDT 2024

% Result   : ContradictoryAxioms 0.13s 0.37s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   45
% Syntax   : Number of formulae    :   62 (  10 unt;  39 typ;   0 def)
%            Number of atoms       :   48 (  25 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   47 (  22   ~;  10   |;   7   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    8 (   7 usr)
%            Number of type conns  :   78 (  24   >;  54   *;   0   +;   0  <<)
%            Number of predicates  :   11 (   9 usr;   2 prp; 0-5 aty)
%            Number of functors    :   24 (  24 usr;   8 con; 0-10 aty)
%            Number of variables   :   35 (  17   !;  14   ?;  35   :)
%                                         (   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,
    sK4: state > state ).

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

tff(func_def_18,type,
    sK6: state ).

tff(func_def_19,type,
    sK7: state ).

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

tff(func_def_21,type,
    sK9: ( state * state * com * com ) > state ).

tff(func_def_22,type,
    sK10: ( state * com * fun(state,bool) * state ) > 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(pred_def_6,type,
    sP0: ( state * com * fun(state,bool) * state ) > $o ).

tff(pred_def_7,type,
    sP1: ( state * fun(state,bool) * state ) > $o ).

tff(pred_def_8,type,
    sP2: ( state * state * com * fun(state,bool) ) > $o ).

tff(pred_def_9,type,
    sP3: ( state * nat * state * com * fun(state,bool) ) > $o ).

tff(f449,plain,
    $false,
    inference(subsumption_resolution,[],[f448,f445]) ).

tff(f445,plain,
    ! [X0: state] : ( s = X0 ),
    inference(subsumption_resolution,[],[f297,f296]) ).

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

tff(f206,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/benchmark/theBenchmark.p',conj_2) ).

tff(f297,plain,
    ! [X0: state] :
      ( ( s = X0 )
      | evalc(c,z,sK4(X0)) ),
    inference(cnf_transformation,[],[f259]) ).

tff(f259,plain,
    ! [X0: state] :
      ( ( s = X0 )
      | ( ( sK4(X0) != X0 )
        & evalc(c,z,sK4(X0)) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f207,f258]) ).

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

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

tff(f108,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/benchmark/theBenchmark.p',conj_1) ).

tff(f448,plain,
    s != sK6,
    inference(forward_demodulation,[],[f447,f445]) ).

tff(f447,plain,
    sK6 != sK7,
    inference(subsumption_resolution,[],[f303,f295]) ).

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

tff(f101,axiom,
    hoare_531836380gleton,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f303,plain,
    ( ( sK6 != sK7 )
    | ~ hoare_531836380gleton ),
    inference(cnf_transformation,[],[f265]) ).

tff(f265,plain,
    ( ( hoare_531836380gleton
      | ! [X0: state,X1: state] : ( X0 = X1 ) )
    & ( ( sK6 != sK7 )
      | ~ hoare_531836380gleton ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f263,f264]) ).

tff(f264,plain,
    ( ? [X2: state,X3: state] : ( X2 != X3 )
   => ( sK6 != sK7 ) ),
    introduced(choice_axiom,[]) ).

tff(f263,plain,
    ( ( hoare_531836380gleton
      | ! [X0: state,X1: state] : ( X0 = X1 ) )
    & ( ? [X2: state,X3: state] : ( X2 != X3 )
      | ~ hoare_531836380gleton ) ),
    inference(rectify,[],[f262]) ).

tff(f262,plain,
    ( ( hoare_531836380gleton
      | ! [X0: state,X1: state] : ( X0 = X1 ) )
    & ( ? [X0: state,X1: state] : ( X0 != X1 )
      | ~ hoare_531836380gleton ) ),
    inference(nnf_transformation,[],[f110]) ).

tff(f110,plain,
    ( hoare_531836380gleton
  <=> ? [X0: state,X1: state] : ( X0 != X1 ) ),
    inference(rectify,[],[f1]) ).

tff(f1,axiom,
    ( hoare_531836380gleton
  <=> ? [X3: state,X4: state] : ( X3 != X4 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_state__not__singleton__def) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SWW525_5 : TPTP v8.1.2. Released v6.0.0.
% 0.10/0.13  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34  % Computer : n031.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   : Tue Apr 30 03:49:58 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.35  % (12530)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37  % (12533)WARNING: value z3 for option sas not known
% 0.13/0.37  % (12532)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.37  % (12531)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.37  % (12534)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.37  % (12533)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.37  % (12535)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.13/0.37  % (12536)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.13/0.37  % (12537)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.13/0.37  % (12537)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.13/0.37  % Exception at run slice level
% 0.13/0.37  User error: % Exception at run slice levelFinite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.13/0.37  
% 0.13/0.37  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.13/0.37  % Exception at run slice level
% 0.13/0.37  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.13/0.37  % (12537)First to succeed.
% 0.13/0.37  % (12537)Refutation found. Thanks to Tanya!
% 0.13/0.37  % SZS status ContradictoryAxioms for theBenchmark
% 0.13/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37  % (12537)------------------------------
% 0.13/0.37  % (12537)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.13/0.37  % (12537)Termination reason: Refutation
% 0.13/0.37  
% 0.13/0.37  % (12537)Memory used [KB]: 975
% 0.13/0.37  % (12537)Time elapsed: 0.006 s
% 0.13/0.37  % (12537)Instructions burned: 9 (million)
% 0.13/0.37  % (12537)------------------------------
% 0.13/0.37  % (12537)------------------------------
% 0.13/0.37  % (12530)Success in time 0.026 s
%------------------------------------------------------------------------------