↑ 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  : SWV811_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 : n013.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:26:28 PM UTC 2026

% Result   : Theorem 0.09s 0.25s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   16 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   22 (   6 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   15 (   9   ~;   4   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of types       :    6 (   5 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :   41 (  41 usr;  10 con; 0-5 aty)
%            Number of variables   :   17 (  17   !;   0   ?;  17   :)

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

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

tff(type_def_7,type,
    list: $tType > $tType ).

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

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

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

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

tff(func_def_0,type,
    combb: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).

tff(func_def_1,type,
    combc: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).

tff(func_def_2,type,
    bad: fun(agent,bool) ).

tff(func_def_3,type,
    gets: ( agent * msg ) > event ).

tff(func_def_4,type,
    notes: ( agent * msg ) > event ).

tff(func_def_5,type,
    says: ( agent * agent * msg ) > event ).

tff(func_def_6,type,
    initState: agent > fun(msg,bool) ).

tff(func_def_7,type,
    knows: ( agent * list(event) ) > fun(msg,bool) ).

tff(func_def_8,type,
    nil: 
      !>[X0: $tType] : list(X0) ).

tff(func_def_9,type,
    list_case: 
      !>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).

tff(func_def_10,type,
    rev: 
      !>[X0: $tType] : ( list(X0) > list(X0) ) ).

tff(func_def_11,type,
    set: 
      !>[X0: $tType] : ( list(X0) > fun(X0,bool) ) ).

tff(func_def_12,type,
    takeWhile: 
      !>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > list(X0) ) ).

tff(func_def_13,type,
    spy: agent ).

tff(func_def_14,type,
    analz: fun(msg,bool) > fun(msg,bool) ).

tff(func_def_15,type,
    crypt: ( nat * msg ) > msg ).

tff(func_def_16,type,
    key: nat > msg ).

tff(func_def_17,type,
    mPair: ( msg * msg ) > msg ).

tff(func_def_18,type,
    nonce: nat > msg ).

tff(func_def_19,type,
    parts: fun(msg,bool) > fun(msg,bool) ).

tff(func_def_20,type,
    nS_Sha254967238shared: fun(list(event),bool) ).

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

tff(func_def_22,type,
    fFalse: bool ).

tff(func_def_23,type,
    fNot: fun(bool,bool) ).

tff(func_def_24,type,
    fTrue: bool ).

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

tff(func_def_26,type,
    a: agent ).

tff(func_def_27,type,
    b: agent ).

tff(func_def_28,type,
    k: nat ).

tff(func_def_29,type,
    nb: nat ).

tff(func_def_30,type,
    sK0: 
      !>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).

tff(func_def_31,type,
    sK1: 
      !>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) * list(X0) ) > X0 ) ).

tff(func_def_32,type,
    sK2: fun(msg,bool) > msg ).

tff(func_def_33,type,
    sK3: fun(msg,bool) > nat ).

tff(func_def_34,type,
    sK4: fun(msg,bool) > msg ).

tff(func_def_35,type,
    sK5: fun(msg,bool) > msg ).

tff(func_def_36,type,
    sK6: ( list(event) * agent * msg ) > agent ).

tff(func_def_37,type,
    sK7: ( list(event) * msg ) > agent ).

tff(func_def_38,type,
    sK8: ( list(event) * msg ) > agent ).

tff(pred_def_1,type,
    nS_Sha512322870Issues: ( agent * agent * msg * list(event) ) > $o ).

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

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

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

tff(f6,axiom,
    ! [X0: $tType,X1: fun(X0,bool)] : ( takeWhile(X0,X1,nil(X0)) = nil(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_5_takeWhile_Osimps_I1_J) ).

tff(f8,axiom,
    ! [X0: $tType] : ( rev(X0,nil(X0)) = nil(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_7_rev_Osimps_I1_J) ).

tff(f60,axiom,
    ! [X0: agent] : ( knows(X0,nil(event)) = initState(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_59_knows__Nil) ).

tff(f90,axiom,
    ! [X0: agent,X1: msg,X2: nat] : ~ member(msg,crypt(X2,X1),parts(initState(X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_89_Crypt__notin__initState) ).

tff(f111,conjecture,
    ( member(msg,key(k),analz(knows(spy,nil(event))))
    | ~ member(event,says(a,b,crypt(k,mPair(nonce(nb),nonce(nb)))),set(event,nil(event)))
    | ~ member(msg,crypt(k,mPair(nonce(nb),nonce(nb))),parts(knows(spy,takeWhile(event,combb(bool,bool,event,fNot,combc(event,event,bool,fequal(event),says(a,b,crypt(k,mPair(nonce(nb),nonce(nb)))))),rev(event,nil(event)))))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_2) ).

tff(f112,negated_conjecture,
    ~ ( member(msg,key(k),analz(knows(spy,nil(event))))
      | ~ member(event,says(a,b,crypt(k,mPair(nonce(nb),nonce(nb)))),set(event,nil(event)))
      | ~ member(msg,crypt(k,mPair(nonce(nb),nonce(nb))),parts(knows(spy,takeWhile(event,combb(bool,bool,event,fNot,combc(event,event,bool,fequal(event),says(a,b,crypt(k,mPair(nonce(nb),nonce(nb)))))),rev(event,nil(event)))))) ),
    inference(negated_conjecture,[status(cth)],[f111]) ).

tff(f172,plain,
    ( ~ member(msg,key(k),analz(knows(spy,nil(event))))
    & member(event,says(a,b,crypt(k,mPair(nonce(nb),nonce(nb)))),set(event,nil(event)))
    & member(msg,crypt(k,mPair(nonce(nb),nonce(nb))),parts(knows(spy,takeWhile(event,combb(bool,bool,event,fNot,combc(event,event,bool,fequal(event),says(a,b,crypt(k,mPair(nonce(nb),nonce(nb)))))),rev(event,nil(event)))))) ),
    inference(ennf_transformation,[],[f112]) ).

tff(f213,plain,
    ! [X0: $tType,X1: fun(X0,bool)] : ( nil(X0) = takeWhile(X0,X1,nil(X0)) ),
    inference(cnf_transformation,[],[f6]) ).

tff(f217,plain,
    ! [X0: $tType] : ( nil(X0) = rev(X0,nil(X0)) ),
    inference(cnf_transformation,[],[f8]) ).

tff(f291,plain,
    ! [X0: agent] : ( knows(X0,nil(event)) = initState(X0) ),
    inference(cnf_transformation,[],[f60]) ).

tff(f328,plain,
    ! [X2: nat,X0: agent,X1: msg] : ~ member(msg,crypt(X2,X1),parts(initState(X0))),
    inference(cnf_transformation,[],[f90]) ).

tff(f352,plain,
    member(msg,crypt(k,mPair(nonce(nb),nonce(nb))),parts(knows(spy,takeWhile(event,combb(bool,bool,event,fNot,combc(event,event,bool,fequal(event),says(a,b,crypt(k,mPair(nonce(nb),nonce(nb)))))),rev(event,nil(event)))))),
    inference(cnf_transformation,[],[f172]) ).

tff(f359,plain,
    ! [X2: nat,X0: agent,X1: msg] : ~ member(msg,crypt(X2,X1),parts(knows(X0,nil(event)))),
    inference(definition_unfolding,[],[f328,f291]) ).

tff(f360,plain,
    member(msg,crypt(k,mPair(nonce(nb),nonce(nb))),parts(knows(spy,takeWhile(event,combb(bool,bool,event,fNot,combc(event,event,bool,fequal(event),says(a,b,crypt(k,mPair(nonce(nb),nonce(nb)))))),nil(event))))),
    inference(superposition,[],[f352,f217]) ).

tff(f361,plain,
    member(msg,crypt(k,mPair(nonce(nb),nonce(nb))),parts(knows(spy,nil(event)))),
    inference(forward_demodulation,[],[f360,f213]) ).

tff(f362,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f361,f359]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV811_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.17  % Computer : n013.cluster.edu
% 0.09/0.17  % Model    : x86_64 x86_64
% 0.09/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17  % Memory   : 8046.5625MB
% 0.09/0.17  % OS       : Linux 6.8.0-71-generic
% 0.09/0.17  % CPULimit : 300
% 0.09/0.17  % WCLimit  : 300
% 0.09/0.17  % DateTime : Mon Sep 28 12:36:06 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20  Running first-order model finding
% 0.09/0.20  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.09/0.25  % (1146298)Will run a generic schedule for satisfiability detection.
% 0.09/0.25  % (1146306)dis+10_1_sil=32000:sp=arity:random_seed=1906280572:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.25  % (1146303)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=917648555_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.25  % (1146307)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1861595461:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.25  % (1146308)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2957805058:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.25  % (1146305)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1965193957:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.25  % (1146309)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3067651384:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.25  % (1146304)% WARNING: option uhcvi not known.
% 0.09/0.25  % (1146304)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1194062262:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.25  % Exception at run slice level
% 0.09/0.25  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.09/0.25  % (1146308) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1146298-1146308"...
% 0.09/0.25  % (1146306) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1146298-1146306"...
% 0.09/0.25  % (1146307) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1146298-1146307"...
% 0.09/0.25  % (1146304) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1146298-1146304"...
% 0.09/0.25  % (1146308)...printing done.
% 0.09/0.25  % (1146309) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1146298-1146309"...
% 0.09/0.25  % (1146306)...printing done.
% 0.09/0.25  % (1146304)...printing done.
% 0.09/0.25  % (1146307)...printing done.
% 0.09/0.25  % (1146308)Refutation found. Thanks to Tanya!
% 0.09/0.25  % SZS status Theorem for theBenchmark
% 0.09/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25  % (1146308)------------------------------
% 0.09/0.25  % (1146308)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25  % (1146308)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25  % (1146308)CaDiCaL version: 2.1.3
% 0.09/0.25  % (1146308)Termination reason: Refutation
% 0.09/0.25  % (1146308)Time elapsed: 0.007 s
% 0.09/0.25  % (1146308)Peak memory usage: 11 MB
% 0.09/0.25  % (1146308)Instructions burned: 10 (million)
% 0.09/0.25  % (1146298)Success in time 0.048 s
% 0.09/0.25  % Vampire exiting
%------------------------------------------------------------------------------