%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV014-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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:19:58 PM UTC 2026
% Result : Unsatisfiable 0.08s 0.16s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 20
% Syntax : Number of formulae : 63 ( 19 unt; 4 def)
% Number of atoms : 141 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 161 ( 83 ~; 74 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 12 ( 11 usr; 5 prp; 0-1 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 52 ( 0 sgn 52 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
party_of_protocol(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_party_of_protocol_2) ).
fof(f2,axiom,
message(sent(a,b,pair(a,an_a_nonce))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_sent_message_i_to_b_3) ).
fof(f5,axiom,
party_of_protocol(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_party_of_protocol_8) ).
fof(f6,axiom,
fresh_to_b(an_a_nonce),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonce_a_is_fresh_to_b_9) ).
fof(f7,axiom,
! [X0,X1] :
( ~ message(sent(X1,b,pair(X1,X0)))
| ~ fresh_to_b(X0)
| message(sent(b,t,triple(b,generate_b_nonce(X0),encrypt(triple(X1,X0,generate_expiration_time(X0)),bt)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_creates_freash_nonces_in_time_10) ).
fof(f8,axiom,
! [X0,X1] :
( ~ message(sent(X0,b,pair(X0,X1)))
| ~ fresh_to_b(X1)
| b_stored(pair(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_creates_freash_nonces_in_time_11) ).
fof(f9,axiom,
! [X2,X0,X1] :
( ~ message(sent(X1,b,pair(encrypt(triple(X1,X0,generate_expiration_time(X2)),bt),encrypt(generate_b_nonce(X2),X0))))
| ~ b_stored(pair(X1,X2))
| b_holds(key(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_accepts_secure_session_key_12) ).
fof(f14,axiom,
! [X2,X0,X1] :
( ~ message(sent(X1,X2,X0))
| intruder_message(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_can_record_17) ).
fof(f16,axiom,
! [X0,X1] :
( ~ intruder_message(pair(X1,X0))
| intruder_message(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_decomposes_pairs_19) ).
fof(f18,axiom,
! [X2,X0,X1] :
( ~ intruder_message(triple(X1,X0,X2))
| intruder_message(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_decomposes_triples_21) ).
fof(f19,axiom,
! [X2,X0,X1] :
( ~ intruder_message(triple(X1,X2,X0))
| intruder_message(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_decomposes_triples_22) ).
fof(f24,axiom,
! [X0,X1] :
( intruder_message(pair(X0,X1))
| ~ intruder_message(X1)
| ~ intruder_message(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_composes_pairs_27) ).
fof(f28,axiom,
! [X2,X0,X1] :
( message(sent(X0,X1,X2))
| ~ intruder_message(X2)
| ~ party_of_protocol(X1)
| ~ party_of_protocol(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_message_sent_31) ).
fof(f29,axiom,
! [X0,X1] :
( intruder_holds(key(X0,X1))
| ~ intruder_message(X0)
| ~ party_of_protocol(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_holds_key_32) ).
fof(f30,axiom,
! [X2,X0,X1] :
( ~ intruder_holds(key(X1,X2))
| intruder_message(encrypt(X0,X1))
| ~ intruder_message(X0)
| ~ party_of_protocol(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_key_encrypts_33) ).
fof(f34,negated_conjecture,
! [X0] :
( ~ intruder_holds(key(X0,b))
| ~ b_holds(key(X0,a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_38) ).
fof(f35,plain,
intruder_message(pair(a,an_a_nonce)),
inference(resolution,[],[f14,f2]) ).
fof(f36,plain,
intruder_message(an_a_nonce),
inference(resolution,[],[f35,f16]) ).
fof(f40,plain,
! [X0] :
( ~ intruder_message(X0)
| ~ party_of_protocol(b)
| ~ b_holds(key(X0,a)) ),
inference(resolution,[],[f29,f34]) ).
fof(f41,plain,
! [X0] :
( ~ b_holds(key(X0,a))
| ~ intruder_message(X0) ),
inference(forward_subsumption_resolution,[],[f40,f5]) ).
fof(f48,plain,
! [X2,X0,X1] :
( intruder_message(encrypt(X0,X1))
| ~ intruder_message(X0)
| ~ party_of_protocol(X2)
| ~ intruder_message(X1)
| ~ party_of_protocol(X2) ),
inference(resolution,[],[f30,f29]) ).
fof(f49,plain,
! [X2,X0,X1] :
( intruder_message(encrypt(X0,X1))
| ~ intruder_message(X0)
| ~ party_of_protocol(X2)
| ~ intruder_message(X1) ),
inference(duplicate_literal_removal,[],[f48]) ).
fof(f51,definition,
( spl0_1
<=> ! [X2] : ~ party_of_protocol(X2) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f52,plain,
( ! [X2] : ~ party_of_protocol(X2)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f51]) ).
fof(f54,definition,
( spl0_2
<=> ! [X0,X1] :
( intruder_message(encrypt(X0,X1))
| ~ intruder_message(X1)
| ~ intruder_message(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f55,plain,
( ! [X0,X1] :
( intruder_message(encrypt(X0,X1))
| ~ intruder_message(X1)
| ~ intruder_message(X0) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f54]) ).
fof(f56,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f49,f54,f51]) ).
fof(f57,plain,
( ~ fresh_to_b(an_a_nonce)
| b_stored(pair(a,an_a_nonce)) ),
inference(resolution,[],[f8,f2]) ).
fof(f60,plain,
b_stored(pair(a,an_a_nonce)),
inference(forward_subsumption_resolution,[],[f57,f6]) ).
fof(f67,plain,
( ~ fresh_to_b(an_a_nonce)
| message(sent(b,t,triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt)))) ),
inference(resolution,[],[f7,f2]) ).
fof(f70,plain,
message(sent(b,t,triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt)))),
inference(forward_subsumption_resolution,[],[f67,f6]) ).
fof(f71,plain,
! [X2,X0,X1] :
( ~ b_stored(pair(X0,X1))
| b_holds(key(X2,X0))
| ~ intruder_message(pair(encrypt(triple(X0,X2,generate_expiration_time(X1)),bt),encrypt(generate_b_nonce(X1),X2)))
| ~ party_of_protocol(b)
| ~ party_of_protocol(X0) ),
inference(resolution,[],[f9,f28]) ).
fof(f72,plain,
! [X2,X0,X1] :
( ~ intruder_message(pair(encrypt(triple(X0,X2,generate_expiration_time(X1)),bt),encrypt(generate_b_nonce(X1),X2)))
| b_holds(key(X2,X0))
| ~ b_stored(pair(X0,X1))
| ~ party_of_protocol(X0) ),
inference(forward_subsumption_resolution,[],[f71,f5]) ).
fof(f73,plain,
intruder_message(triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt))),
inference(resolution,[],[f70,f14]) ).
fof(f77,plain,
intruder_message(encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt)),
inference(resolution,[],[f73,f19]) ).
fof(f78,plain,
intruder_message(generate_b_nonce(an_a_nonce)),
inference(resolution,[],[f73,f18]) ).
fof(f88,plain,
! [X2,X0,X1] :
( ~ intruder_message(encrypt(triple(X1,X0,generate_expiration_time(X2)),bt))
| ~ b_stored(pair(X1,X2))
| ~ party_of_protocol(X1)
| ~ intruder_message(encrypt(generate_b_nonce(X2),X0))
| b_holds(key(X0,X1)) ),
inference(resolution,[],[f72,f24]) ).
fof(f105,plain,
( ~ b_stored(pair(a,an_a_nonce))
| ~ party_of_protocol(a)
| ~ intruder_message(encrypt(generate_b_nonce(an_a_nonce),an_a_nonce))
| b_holds(key(an_a_nonce,a)) ),
inference(resolution,[],[f88,f77]) ).
fof(f115,plain,
( ~ party_of_protocol(a)
| ~ intruder_message(encrypt(generate_b_nonce(an_a_nonce),an_a_nonce))
| b_holds(key(an_a_nonce,a)) ),
inference(forward_subsumption_resolution,[],[f105,f60]) ).
fof(f116,plain,
( ~ intruder_message(encrypt(generate_b_nonce(an_a_nonce),an_a_nonce))
| b_holds(key(an_a_nonce,a)) ),
inference(forward_subsumption_resolution,[],[f115,f1]) ).
fof(f118,definition,
( spl0_7
<=> b_holds(key(an_a_nonce,a)) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f120,plain,
( b_holds(key(an_a_nonce,a))
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f118]) ).
fof(f122,definition,
( spl0_8
<=> intruder_message(encrypt(generate_b_nonce(an_a_nonce),an_a_nonce)) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f124,plain,
( ~ intruder_message(encrypt(generate_b_nonce(an_a_nonce),an_a_nonce))
| spl0_8 ),
inference(avatar_component_clause,[],[f122]) ).
fof(f125,plain,
( spl0_7
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f116,f122,f118]) ).
fof(f139,plain,
( ~ intruder_message(an_a_nonce)
| ~ intruder_message(generate_b_nonce(an_a_nonce))
| ~ spl0_2
| spl0_8 ),
inference(resolution,[],[f124,f55]) ).
fof(f140,plain,
( ~ intruder_message(generate_b_nonce(an_a_nonce))
| ~ spl0_2
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f139,f36]) ).
fof(f141,plain,
( $false
| ~ spl0_2
| spl0_8 ),
inference(forward_subsumption_resolution,[],[f140,f78]) ).
fof(f142,plain,
( ~ spl0_2
| spl0_8 ),
inference(avatar_contradiction_clause,[],[f141]) ).
fof(f147,plain,
( ~ intruder_message(an_a_nonce)
| ~ spl0_7 ),
inference(resolution,[],[f120,f41]) ).
fof(f148,plain,
( $false
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f147,f36]) ).
fof(f149,plain,
~ spl0_7,
inference(avatar_contradiction_clause,[],[f148]) ).
fof(f150,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f52,f1]) ).
fof(f155,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f150]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f56]) ).
cnf(s4,plain,
( spl0_7
| ~ spl0_8 ),
inference(sat_conversion,[],[f125]) ).
cnf(s6,plain,
( ~ spl0_2
| spl0_8 ),
inference(sat_conversion,[],[f142]) ).
cnf(s7,plain,
~ spl0_7,
inference(sat_conversion,[],[f149]) ).
cnf(s10,plain,
~ spl0_1,
inference(sat_conversion,[],[f155]) ).
cnf(s11,plain,
~ spl0_8,
inference(rat,[],[s4,s7]) ).
cnf(s12,plain,
~ spl0_2,
inference(rat,[],[s6,s11]) ).
cnf(s13,plain,
$false,
inference(rat,[],[s1,s12,s10]) ).
fof(f156,plain,
$false,
inference(avatar_sat_refutation,[],[s13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV014-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Mon Sep 28 09:42:19 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.12 Running first-order model finding
% 0.08/0.13 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.16 % (3268984)Will run a generic schedule for satisfiability detection.
% 0.08/0.16 % (3268996)% WARNING: option uhcvi not known.
% 0.08/0.16 % (3268995)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2188112720_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.16 % (3268997)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4037357585:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.16 % (3268998)dis+10_1_sil=32000:sp=arity:random_seed=2466006489:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.16 % (3268999)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3539901142:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.16 % (3269001)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1580960569:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.16 % (3268996)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3022755976:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.16 % (3268998) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3268984-3268998"...
% 0.08/0.16 % TRYING [1]
% 0.08/0.16 % (3268998)...printing done.
% 0.08/0.16 % (3268999) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3268984-3268999"...
% 0.08/0.16 % TRYING [2]
% 0.08/0.16 % (3268998)Refutation found. Thanks to Tanya!
% 0.08/0.16 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.16 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.16 % (3268998)------------------------------
% 0.08/0.16 % (3268998)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.16 % (3268998)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.16 % (3268998)CaDiCaL version: 2.1.3
% 0.08/0.16 % (3268998)Termination reason: Refutation
% 0.08/0.16 % (3268998)Time elapsed: 0.002 s
% 0.08/0.16 % (3268998)Peak memory usage: 12 MB
% 0.08/0.16 % (3268998)Instructions burned: 5 (million)
% 0.08/0.16 % (3268984)Success in time 0.028 s
% 0.08/0.16 % Vampire exiting
%------------------------------------------------------------------------------