↑ Up

Vampire-SAT---5.0.1.CAX-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SWW525_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 01:40:23 PM UTC 2026

% Result   : ContradictoryAxioms 0.20s 0.28s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   27 (  13 unt;   0 typ;   2 def)
%            Number of atoms       :   43 (  13 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   32 (  16   ~;   9   |;   1   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    8 (   7 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   7 usr;   4 prp; 0-4 aty)
%            Number of functors    :   24 (  24 usr;   8 con; 0-10 aty)
%            Number of variables   :   13 (   0 sgn   7   !;   6   ?;  13   :)

% 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 ).

tff(func_def_17,type,
    sK1: state ).

tff(func_def_18,type,
    sK2: state > state ).

tff(func_def_19,type,
    sK3: ( state * state * com * com ) > state ).

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

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

tff(func_def_22,type,
    sK6: 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(f1,axiom,
    ( hoare_531836380gleton
  <=> ? [X3: state,X4: state] : ( X3 != X4 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_state__not__singleton__def) ).

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

tff(f102,axiom,
    ! [X0: state] :
      ( ! [X1: state] :
          ( evalc(c,z,X1)
         => ( X0 = X1 ) )
     => ( X0 = s ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).

tff(f103,axiom,
    ~ ? [X0: state] : evalc(c,z,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_2) ).

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

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

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

tff(f154,plain,
    ( ( sK0 != sK1 )
    | ~ hoare_531836380gleton ),
    inference(cnf_transformation,[],[f106]) ).

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

tff(f282,plain,
    ! [X0: state] :
      ( evalc(c,z,sK6(X0))
      | ( s = X0 ) ),
    inference(cnf_transformation,[],[f151]) ).

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

tff(f301,plain,
    ( ( sK0 != sK1 )
    | hoare_531836380gleton ),
    inference(consistent_polarity_flipping,[],[f154]) ).

tff(f304,plain,
    ~ hoare_531836380gleton,
    inference(consistent_polarity_flipping,[],[f281]) ).

tff(f309,definition,
    ( spl7_2
  <=> hoare_531836380gleton ),
    introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).

tff(f318,definition,
    ( spl7_4
  <=> ( sK0 = sK1 ) ),
    introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).

tff(f320,plain,
    ( ( sK0 != sK1 )
    | spl7_4 ),
    inference(avatar_component_clause,[],[f318]) ).

tff(f321,plain,
    ( spl7_2
    | ~ spl7_4 ),
    inference(avatar_split_clause,[],[f301,f318,f309]) ).

tff(f322,plain,
    ~ spl7_2,
    inference(avatar_split_clause,[],[f304,f309]) ).

tff(f332,plain,
    ! [X0: state] : ( s = X0 ),
    inference(forward_subsumption_resolution,[],[f282,f284]) ).

tff(f335,plain,
    ( ( s != sK0 )
    | spl7_4 ),
    inference(superposition,[],[f320,f332]) ).

tff(f340,plain,
    ( $false
    | spl7_4 ),
    inference(forward_subsumption_resolution,[],[f335,f332]) ).

tff(f341,plain,
    spl7_4,
    inference(avatar_contradiction_clause,[],[f340]) ).

cnf(s3,plain,
    ( spl7_2
    | ~ spl7_4 ),
    inference(sat_conversion,[],[f321]) ).

cnf(s4,plain,
    ~ spl7_2,
    inference(sat_conversion,[],[f322]) ).

cnf(s7,plain,
    spl7_4,
    inference(sat_conversion,[],[f341]) ).

cnf(s9,plain,
    $false,
    inference(rat,[],[s3,s7,s4]) ).

tff(f343,plain,
    $false,
    inference(avatar_sat_refutation,[],[s9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW525_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n016.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 14:22:19 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/0.22  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.28  % (3649996)Will run a generic schedule for satisfiability detection.
% 0.20/0.28  % (3650001)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3561729072_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28  % Exception at run slice level
% 0.20/0.28  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28  % (3650002)% WARNING: option uhcvi not known.
% 0.20/0.28  % (3650002)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3948960940:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28  % (3650003)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3388943976:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28  % (3650004)dis+10_1_sil=32000:sp=arity:random_seed=1922078547:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28  % (3650005)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1037843200:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28  % (3650006)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3970187107:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.28  % (3650007)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3479461806:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.28  % (3650009)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3902780333:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.28  % (3650002) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3649996-3650002"...
% 0.20/0.28  % (3650004) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3649996-3650004"...
% 0.20/0.28  % (3650006) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3649996-3650006"...
% 0.20/0.28  % (3650005) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3649996-3650005"...
% 0.20/0.28  % Exception at run slice level
% 0.20/0.28  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28  % (3650003) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3649996-3650003"...
% 0.20/0.28  % (3650002)...printing done.
% 0.20/0.28  % (3650004)...printing done.
% 0.20/0.28  % (3650006)...printing done.
% 0.20/0.28  % (3650007) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3649996-3650007"...
% 0.20/0.28  % (3650005)...printing done.
% 0.20/0.28  % (3650002)Refutation found. Thanks to Tanya!
% 0.20/0.28  % SZS status ContradictoryAxioms for theBenchmark
% 0.20/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28  % (3650002)------------------------------
% 0.20/0.28  % (3650002)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28  % (3650002)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28  % (3650002)CaDiCaL version: 2.1.3
% 0.20/0.28  % (3650002)Termination reason: Refutation
% 0.20/0.28  % (3650002)Time elapsed: 0.005 s
% 0.20/0.28  % (3650002)Peak memory usage: 12 MB
% 0.20/0.28  % (3650002)Instructions burned: 7 (million)
% 0.20/0.28  % (3649996)Success in time 0.046 s
% 0.20/0.28  % Vampire exiting
%------------------------------------------------------------------------------