↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SWW522_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 : n005.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   : Theorem 0.08s 0.26s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   13 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   24 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  11   ~;   6   |;   4   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    9 (   8 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  10 usr;   1 prp; 0-4 aty)
%            Number of functors    :   46 (  46 usr;   8 con; 0-10 aty)
%            Number of variables   :   18 (  15   !;   3   ?;  18   :)

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

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

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

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

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

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

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

tff(type_def_12,type,
    hoare_28830079triple: $tType > $tType ).

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

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

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

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

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

tff(func_def_3,type,
    skip: com ).

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

tff(func_def_5,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_6,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_7,type,
    com_size: com > nat ).

tff(func_def_8,type,
    plus_plus: 
      !>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).

tff(func_def_9,type,
    zero_zero: 
      !>[X0: $tType] : X0 ).

tff(func_def_10,type,
    hoare_1841697145triple: 
      !>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * com * fun(X0,fun(state,bool)) ) > hoare_28830079triple(X0) ) ).

tff(func_def_11,type,
    hoare_376461865e_case: 
      !>[X0: $tType,X1: $tType] : ( ( fun(fun(X0,fun(state,bool)),fun(com,fun(fun(X0,fun(state,bool)),X1))) * hoare_28830079triple(X0) ) > X1 ) ).

tff(func_def_12,type,
    hoare_678420151le_rec: 
      !>[X0: $tType,X1: $tType] : ( ( fun(fun(X0,fun(state,bool)),fun(com,fun(fun(X0,fun(state,bool)),X1))) * hoare_28830079triple(X0) ) > X1 ) ).

tff(func_def_13,type,
    hoare_47506394e_size: 
      !>[X0: $tType] : ( ( fun(X0,nat) * hoare_28830079triple(X0) ) > nat ) ).

tff(func_def_14,type,
    suc: nat > nat ).

tff(func_def_15,type,
    nat_case: 
      !>[X0: $tType] : ( ( X0 * fun(nat,X0) * nat ) > X0 ) ).

tff(func_def_16,type,
    nat_rec: 
      !>[X0: $tType] : ( ( X0 * fun(nat,fun(X0,X0)) * nat ) > X0 ) ).

tff(func_def_17,type,
    semiri532925092at_aux: 
      !>[X0: $tType] : ( ( fun(X0,X0) * nat * X0 ) > X0 ) ).

tff(func_def_18,type,
    size_size: 
      !>[X0: $tType] : ( X0 > nat ) ).

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

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

tff(func_def_21,type,
    fFalse: bool ).

tff(func_def_22,type,
    fTrue: bool ).

tff(func_def_23,type,
    ga: fun(hoare_28830079triple(a),bool) ).

tff(func_def_24,type,
    n: nat ).

tff(func_def_25,type,
    sK0: 
      !>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * com * fun(X0,fun(state,bool)) * nat ) > X0 ) ).

tff(func_def_26,type,
    sK1: 
      !>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * com * fun(X0,fun(state,bool)) * nat ) > state ) ).

tff(func_def_27,type,
    sK2: 
      !>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * com * fun(X0,fun(state,bool)) * nat ) > state ) ).

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

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

tff(func_def_30,type,
    sK5: 
      !>[X0: $tType] : ( hoare_28830079triple(X0) > fun(X0,fun(state,bool)) ) ).

tff(func_def_31,type,
    sK6: 
      !>[X0: $tType] : ( hoare_28830079triple(X0) > com ) ).

tff(func_def_32,type,
    sK7: 
      !>[X0: $tType] : ( hoare_28830079triple(X0) > fun(X0,fun(state,bool)) ) ).

tff(func_def_33,type,
    sK8: 
      !>[X0: $tType] : ( ( nat * fun(hoare_28830079triple(X0),bool) ) > hoare_28830079triple(X0) ) ).

tff(func_def_34,type,
    sK9: 
      !>[X0: $tType] : ( ( fun(nat,fun(X0,X0)) * X0 * fun(nat,X0) ) > nat ) ).

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

tff(func_def_36,type,
    sK11: 
      !>[X0: $tType] : ( ( fun(nat,fun(X0,X0)) * X0 * fun(nat,X0) ) > nat ) ).

tff(func_def_37,type,
    sK12: nat > nat ).

tff(func_def_38,type,
    sK13: fun(nat,bool) > nat ).

tff(func_def_39,type,
    sK14: nat > nat ).

tff(func_def_40,type,
    sK15: fun(nat,bool) > nat ).

tff(func_def_41,type,
    sK16: a ).

tff(func_def_42,type,
    sK17: state ).

tff(func_def_43,type,
    sK18: state ).

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

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

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

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

tff(pred_def_5,type,
    hoare_592965047valids: 
      !>[X0: $tType] : ( ( fun(hoare_28830079triple(X0),bool) * fun(hoare_28830079triple(X0),bool) ) > $o ) ).

tff(pred_def_6,type,
    hoare_1633586161_valid: 
      !>[X0: $tType] : ( ( nat * hoare_28830079triple(X0) ) > $o ) ).

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

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

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

tff(pred_def_10,type,
    p: ( a * state ) > $o ).

tff(f2,axiom,
    ! [X0: state,X1: nat,X2: state] :
      ( evaln(skip,X2,X1,X0)
     => ( X0 = X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_evaln__elim__cases_I1_J) ).

tff(f102,conjecture,
    ! [X0: a,X1: state] :
      ( ~ p(X0,X1)
      | ! [X2: state] :
          ( ~ evaln(skip,X1,n,X2)
          | p(X0,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).

tff(f103,negated_conjecture,
    ~ ! [X0: a,X1: state] :
        ( ~ p(X0,X1)
        | ! [X2: state] :
            ( ~ evaln(skip,X1,n,X2)
            | p(X0,X2) ) ),
    inference(negated_conjecture,[status(cth)],[f102]) ).

tff(f106,plain,
    ! [X0: state,X1: nat,X2: state] :
      ( ( X0 = X2 )
      | ~ evaln(skip,X2,X1,X0) ),
    inference(ennf_transformation,[],[f2]) ).

tff(f148,plain,
    ? [X0: a,X1: state] :
      ( p(X0,X1)
      & ? [X2: state] :
          ( evaln(skip,X1,n,X2)
          & ~ p(X0,X2) ) ),
    inference(ennf_transformation,[],[f103]) ).

tff(f180,plain,
    ( p(sK16,sK17)
    & evaln(skip,sK17,n,sK18)
    & ~ p(sK16,sK18) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK16,sK17,sK18]),skolemize(X0,sK16),skolemize(X1,sK17),skolemize(X2,sK18)],[f148]) ).

tff(f182,plain,
    ! [X2: state,X0: state,X1: nat] :
      ( ~ evaln(skip,X2,X1,X0)
      | ( X0 = X2 ) ),
    inference(cnf_transformation,[],[f106]) ).

tff(f313,plain,
    ~ p(sK16,sK18),
    inference(cnf_transformation,[],[f180]) ).

tff(f314,plain,
    evaln(skip,sK17,n,sK18),
    inference(cnf_transformation,[],[f180]) ).

tff(f315,plain,
    p(sK16,sK17),
    inference(cnf_transformation,[],[f180]) ).

tff(f363,plain,
    sK17 = sK18,
    inference(resolution,[],[f182,f314]) ).

tff(f370,plain,
    ~ p(sK16,sK17),
    inference(superposition,[],[f313,f363]) ).

tff(f371,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f370,f315]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWW522_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.08/0.18  % Computer : n005.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 14:17:16 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21  Running first-order model finding
% 0.08/0.21  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.08/0.26  % (808299)Will run a generic schedule for satisfiability detection.
% 0.08/0.26  % (808306)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=527140498:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.26  % (808305)% WARNING: option uhcvi not known.
% 0.08/0.26  % (808306) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-808299-808306"...
% 0.08/0.26  % (808306)...printing done.
% 0.08/0.26  % (808306)Refutation found. Thanks to Tanya!
% 0.08/0.26  % SZS status Theorem for theBenchmark
% 0.08/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26  % (808306)------------------------------
% 0.08/0.26  % (808306)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26  % (808306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26  % (808306)CaDiCaL version: 2.1.3
% 0.08/0.26  % (808306)Termination reason: Refutation
% 0.08/0.26  % (808306)Time elapsed: 0.004 s
% 0.08/0.26  % (808306)Peak memory usage: 12 MB
% 0.08/0.26  % (808306)Instructions burned: 11 (million)
% 0.08/0.26  % (808299)Success in time 0.033 s
% 0.08/0.26  % Vampire exiting
%------------------------------------------------------------------------------