%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV237+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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:20:32 PM UTC 2026
% Result : Theorem 0.13s 0.26s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 18 unt; 3 def)
% Number of atoms : 105 ( 2 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 115 ( 56 ~; 50 |; 4 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : enc(i(X0),enc(X0,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',enc_dec_cancel) ).
fof(f9,axiom,
! [X0,X1,X2] :
( ( p(X0)
& p(X1)
& p(X2) )
=> p(enc(enc(i(tmk),X1),enc(i(tc),X0))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',encrypt_a_stored_comms_key) ).
fof(f10,axiom,
! [X0,X1,X2] :
( ( p(X0)
& p(X1)
& p(X2) )
=> p(enc(tc,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',encrypt_clear_key_as_Tcomms_key) ).
fof(f17,axiom,
p(enc(tmk,pp)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_knows_1) ).
fof(f22,axiom,
p(kk),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_knows_6) ).
fof(f24,axiom,
p(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intruder_knows_8) ).
fof(f25,conjecture,
p(enc(pp,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f26,negated_conjecture,
~ p(enc(pp,a)),
inference(negated_conjecture,[status(cth)],[f25]) ).
fof(f27,plain,
~ p(enc(pp,a)),
inference(flattening,[],[f26]) ).
fof(f37,plain,
! [X0,X1,X2] :
( p(enc(enc(i(tmk),X1),enc(i(tc),X0)))
| ~ p(X0)
| ~ p(X1)
| ~ p(X2) ),
inference(ennf_transformation,[],[f9]) ).
fof(f38,plain,
! [X0,X1,X2] :
( p(enc(enc(i(tmk),X1),enc(i(tc),X0)))
| ~ p(X0)
| ~ p(X1)
| ~ p(X2) ),
inference(flattening,[],[f37]) ).
fof(f39,plain,
! [X0,X1,X2] :
( p(enc(tc,X0))
| ~ p(X0)
| ~ p(X1)
| ~ p(X2) ),
inference(ennf_transformation,[],[f10]) ).
fof(f40,plain,
! [X0,X1,X2] :
( p(enc(tc,X0))
| ~ p(X0)
| ~ p(X1)
| ~ p(X2) ),
inference(flattening,[],[f39]) ).
fof(f53,plain,
! [X0,X1] : enc(i(X0),enc(X0,X1)) = X1,
inference(cnf_transformation,[],[f1]) ).
fof(f61,plain,
! [X2,X0,X1] :
( ~ p(X2)
| ~ p(X1)
| ~ p(X0)
| p(enc(enc(i(tmk),X1),enc(i(tc),X0))) ),
inference(cnf_transformation,[],[f38]) ).
fof(f62,plain,
! [X2,X0,X1] :
( ~ p(X2)
| ~ p(X1)
| ~ p(X0)
| p(enc(tc,X0)) ),
inference(cnf_transformation,[],[f40]) ).
fof(f69,plain,
p(enc(tmk,pp)),
inference(cnf_transformation,[],[f17]) ).
fof(f74,plain,
p(kk),
inference(cnf_transformation,[],[f22]) ).
fof(f76,plain,
p(a),
inference(cnf_transformation,[],[f24]) ).
fof(f77,plain,
~ p(enc(pp,a)),
inference(cnf_transformation,[],[f27]) ).
fof(f82,definition,
( spl0_2
<=> ! [X2] : ~ p(X2) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f83,plain,
( ! [X2] : ~ p(X2)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f82]) ).
fof(f98,definition,
( spl0_6
<=> ! [X0] :
( ~ p(X0)
| p(enc(tc,X0)) ) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f99,plain,
( ! [X0] :
( p(enc(tc,X0))
| ~ p(X0) )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f98]) ).
fof(f100,plain,
( spl0_6
| spl0_2
| spl0_2 ),
inference(avatar_split_clause,[],[f62,f82,f82,f98]) ).
fof(f102,definition,
( spl0_7
<=> ! [X0,X1] :
( ~ p(X1)
| p(enc(enc(i(tmk),X1),enc(i(tc),X0)))
| ~ p(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f103,plain,
( ! [X0,X1] :
( p(enc(enc(i(tmk),X1),enc(i(tc),X0)))
| ~ p(X1)
| ~ p(X0) )
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f102]) ).
fof(f104,plain,
( spl0_7
| spl0_2 ),
inference(avatar_split_clause,[],[f61,f82,f102]) ).
fof(f121,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f83,f74]) ).
fof(f124,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f121]) ).
fof(f231,plain,
( ! [X0,X1] :
( p(enc(X0,enc(i(tc),X1)))
| ~ p(enc(tmk,X0))
| ~ p(X1) )
| ~ spl0_7 ),
inference(superposition,[],[f103,f53]) ).
fof(f414,plain,
( ! [X0,X1] :
( p(enc(X1,X0))
| ~ p(enc(tmk,X1))
| ~ p(enc(tc,X0)) )
| ~ spl0_7 ),
inference(superposition,[],[f231,f53]) ).
fof(f1529,plain,
( ~ p(enc(tmk,pp))
| ~ p(enc(tc,a))
| ~ spl0_7 ),
inference(resolution,[],[f414,f77]) ).
fof(f1552,plain,
( ~ p(enc(tc,a))
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f1529,f69]) ).
fof(f1554,plain,
( ~ p(a)
| ~ spl0_6
| ~ spl0_7 ),
inference(resolution,[],[f1552,f99]) ).
fof(f1558,plain,
( $false
| ~ spl0_6
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f1554,f76]) ).
fof(f1559,plain,
( ~ spl0_6
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f1558]) ).
cnf(s5,plain,
( spl0_2
| spl0_2
| spl0_6 ),
inference(sat_conversion,[],[f100]) ).
cnf(s6,plain,
( spl0_2
| spl0_6 ),
inference(rat,[],[s5]) ).
cnf(s7,plain,
( spl0_2
| spl0_7 ),
inference(sat_conversion,[],[f104]) ).
cnf(s14,plain,
~ spl0_2,
inference(sat_conversion,[],[f124]) ).
cnf(s146,plain,
( ~ spl0_6
| ~ spl0_7 ),
inference(sat_conversion,[],[f1559]) ).
cnf(s153,plain,
spl0_7,
inference(rat,[],[s7,s14]) ).
cnf(s154,plain,
~ spl0_6,
inference(rat,[],[s146,s153]) ).
cnf(s157,plain,
$false,
inference(rat,[],[s6,s154,s14]) ).
fof(f1560,plain,
$false,
inference(avatar_sat_refutation,[],[s157]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV237+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.18 % Computer : n007.cluster.edu
% 0.13/0.18 % Model : x86_64 x86_64
% 0.13/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.18 % Memory : 8046.5625MB
% 0.13/0.18 % OS : Linux 6.8.0-71-generic
% 0.13/0.18 % CPULimit : 300
% 0.13/0.18 % WCLimit : 300
% 0.13/0.18 % DateTime : Mon Sep 28 10:12:40 UTC 2026
% 0.13/0.18 % CPUTime :
% 0.13/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.21 Running first-order model finding
% 0.13/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.13/0.26 % (2301137)Will run a generic schedule for satisfiability detection.
% 0.13/0.26 % (2301146)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3195661495:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.26 % (2301143)% WARNING: option uhcvi not known.
% 0.13/0.26 % (2301142)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3198900103_2999 on theBenchmark for (2999ds/0Mi)
% 0.13/0.26 % (2301143)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3874057218:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.13/0.26 % (2301148)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1887651421:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.13/0.26 % (2301144)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4010106937:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.13/0.26 % (2301145)dis+10_1_sil=32000:sp=arity:random_seed=3593831885:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.13/0.26 % (2301147)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3347816061:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.13/0.26 % TRYING [1]
% 0.13/0.26 % TRYING [2]
% 0.13/0.26 % TRYING [3]
% 0.13/0.26 % (2301146) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2301137-2301146"...
% 0.13/0.26 % TRYING [4]
% 0.13/0.26 % (2301146)...printing done.
% 0.13/0.26 % (2301146)Refutation found. Thanks to Tanya!
% 0.13/0.26 % SZS status Theorem for theBenchmark
% 0.13/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.26 % (2301146)------------------------------
% 0.13/0.26 % (2301146)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.26 % (2301146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.26 % (2301146)CaDiCaL version: 2.1.3
% 0.13/0.26 % (2301146)Termination reason: Refutation
% 0.13/0.26 % (2301146)Time elapsed: 0.017 s
% 0.13/0.26 % (2301146)Peak memory usage: 13 MB
% 0.13/0.26 % (2301146)Instructions burned: 43 (million)
% 0.13/0.26 % (2301137)Success in time 0.043 s
% 0.13/0.26 % Vampire exiting
%------------------------------------------------------------------------------