%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV235+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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.19s 0.30s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 18
% Syntax : Number of formulae : 80 ( 31 unt; 4 def)
% Number of atoms : 168 ( 7 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 167 ( 79 ~; 72 |; 7 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 69 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : xor(X0,X1) = xor(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_commutative) ).
fof(f4,axiom,
! [X0] : xor(X0,id) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_rules_1) ).
fof(f5,axiom,
! [X0] : xor(X0,X0) = id,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_rules_2) ).
fof(f7,axiom,
! [X0,X1,X2] :
( ( p(crypt(xor(km,X0),X1))
& p(X0)
& p(crypt(xor(km,exp),X2)) )
=> p(crypt(xor(X2,X0),X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',key_export) ).
fof(f8,axiom,
! [X0,X1] :
( ( p(X0)
& p(X1) )
=> p(crypt(xor(km,xor(kp,X1)),X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',key_part_import___part_1) ).
fof(f10,axiom,
! [X0,X1,X2] :
( ( p(X0)
& p(crypt(xor(km,xor(X1,kp)),X2))
& p(X1) )
=> p(crypt(xor(km,X1),xor(X2,X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',key_part_import___part_3) ).
fof(f15,axiom,
! [X0,X1] :
( ( p(crypt(X0,X1))
& p(X0) )
=> p(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',decrypt_knowledge) ).
fof(f16,axiom,
! [X0,X1] :
( ( p(X1)
& p(X0) )
=> p(crypt(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',encrypt_knowledge) ).
fof(f21,axiom,
p(pin),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_5) ).
fof(f22,axiom,
p(crypt(xor(km,pin),pp)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_6) ).
fof(f25,axiom,
p(crypt(xor(km,xor(imp,kp)),kek)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_9) ).
fof(f27,axiom,
p(exp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_11) ).
fof(f28,axiom,
p(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_account_number) ).
fof(f29,conjecture,
p(crypt(pp,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',find_pin) ).
fof(f30,negated_conjecture,
~ p(crypt(pp,a)),
inference(negated_conjecture,[status(cth)],[f29]) ).
fof(f31,plain,
~ p(crypt(pp,a)),
inference(flattening,[],[f30]) ).
fof(f34,plain,
! [X0,X1,X2] :
( p(crypt(xor(X2,X0),X1))
| ~ p(crypt(xor(km,X0),X1))
| ~ p(X0)
| ~ p(crypt(xor(km,exp),X2)) ),
inference(ennf_transformation,[],[f7]) ).
fof(f35,plain,
! [X0,X1,X2] :
( p(crypt(xor(X2,X0),X1))
| ~ p(crypt(xor(km,X0),X1))
| ~ p(X0)
| ~ p(crypt(xor(km,exp),X2)) ),
inference(flattening,[],[f34]) ).
fof(f36,plain,
! [X0,X1] :
( p(crypt(xor(km,xor(kp,X1)),X0))
| ~ p(X0)
| ~ p(X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f37,plain,
! [X0,X1] :
( p(crypt(xor(km,xor(kp,X1)),X0))
| ~ p(X0)
| ~ p(X1) ),
inference(flattening,[],[f36]) ).
fof(f40,plain,
! [X0,X1,X2] :
( p(crypt(xor(km,X1),xor(X2,X0)))
| ~ p(X0)
| ~ p(crypt(xor(km,xor(X1,kp)),X2))
| ~ p(X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f41,plain,
! [X0,X1,X2] :
( p(crypt(xor(km,X1),xor(X2,X0)))
| ~ p(X0)
| ~ p(crypt(xor(km,xor(X1,kp)),X2))
| ~ p(X1) ),
inference(flattening,[],[f40]) ).
fof(f50,plain,
! [X0,X1] :
( p(X1)
| ~ p(crypt(X0,X1))
| ~ p(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f51,plain,
! [X0,X1] :
( p(X1)
| ~ p(crypt(X0,X1))
| ~ p(X0) ),
inference(flattening,[],[f50]) ).
fof(f52,plain,
! [X0,X1] :
( p(crypt(X0,X1))
| ~ p(X1)
| ~ p(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f53,plain,
! [X0,X1] :
( p(crypt(X0,X1))
| ~ p(X1)
| ~ p(X0) ),
inference(flattening,[],[f52]) ).
fof(f54,plain,
! [X0,X1] : xor(X0,X1) = xor(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f57,plain,
! [X0] : xor(X0,id) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f58,plain,
! [X0] : id = xor(X0,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f60,plain,
! [X2,X0,X1] :
( ~ p(crypt(xor(km,exp),X2))
| ~ p(crypt(xor(km,X0),X1))
| p(crypt(xor(X2,X0),X1))
| ~ p(X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f61,plain,
! [X0,X1] :
( p(crypt(xor(km,xor(kp,X1)),X0))
| ~ p(X0)
| ~ p(X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f63,plain,
! [X2,X0,X1] :
( ~ p(crypt(xor(km,xor(X1,kp)),X2))
| p(crypt(xor(km,X1),xor(X2,X0)))
| ~ p(X0)
| ~ p(X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f68,plain,
! [X0,X1] :
( ~ p(crypt(X0,X1))
| ~ p(X0)
| p(X1) ),
inference(cnf_transformation,[],[f51]) ).
fof(f69,plain,
! [X0,X1] :
( p(crypt(X0,X1))
| ~ p(X1)
| ~ p(X0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f74,plain,
p(pin),
inference(cnf_transformation,[],[f21]) ).
fof(f75,plain,
p(crypt(xor(km,pin),pp)),
inference(cnf_transformation,[],[f22]) ).
fof(f78,plain,
p(crypt(xor(km,xor(imp,kp)),kek)),
inference(cnf_transformation,[],[f25]) ).
fof(f80,plain,
p(exp),
inference(cnf_transformation,[],[f27]) ).
fof(f81,plain,
p(a),
inference(cnf_transformation,[],[f28]) ).
fof(f82,plain,
~ p(crypt(pp,a)),
inference(cnf_transformation,[],[f31]) ).
fof(f87,plain,
! [X0] : xor(id,X0) = X0,
inference(superposition,[],[f57,f54]) ).
fof(f123,definition,
( spl0_5
<=> p(pp) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f124,plain,
( ~ p(pp)
| spl0_5 ),
inference(avatar_component_clause,[],[f123]) ).
fof(f132,plain,
( ~ p(a)
| ~ p(pp) ),
inference(resolution,[],[f69,f82]) ).
fof(f135,plain,
~ p(pp),
inference(forward_subsumption_resolution,[],[f132,f81]) ).
fof(f136,plain,
~ spl0_5,
inference(avatar_split_clause,[],[f135,f123]) ).
fof(f169,plain,
! [X0,X1] :
( p(crypt(xor(km,xor(X0,kp)),X1))
| ~ p(X1)
| ~ p(X0) ),
inference(superposition,[],[f61,f54]) ).
fof(f200,plain,
! [X0] :
( ~ p(crypt(xor(km,exp),X0))
| p(crypt(xor(X0,pin),pp))
| ~ p(pin) ),
inference(resolution,[],[f60,f75]) ).
fof(f225,definition,
( spl0_11
<=> p(crypt(xor(km,exp),id)) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f226,plain,
( p(crypt(xor(km,exp),id))
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f225]) ).
fof(f227,plain,
( ~ p(crypt(xor(km,exp),id))
| spl0_11 ),
inference(avatar_component_clause,[],[f225]) ).
fof(f243,plain,
! [X0] :
( ~ p(crypt(xor(km,exp),X0))
| p(crypt(xor(X0,pin),pp)) ),
inference(forward_subsumption_resolution,[],[f200,f74]) ).
fof(f285,plain,
! [X0,X1] :
( p(crypt(xor(km,X0),id))
| ~ p(crypt(xor(km,xor(X0,kp)),X1))
| ~ p(X1)
| ~ p(X0) ),
inference(superposition,[],[f63,f58]) ).
fof(f292,plain,
! [X0,X1] :
( p(crypt(xor(km,X0),id))
| ~ p(X1)
| ~ p(X0) ),
inference(forward_subsumption_resolution,[],[f285,f169]) ).
fof(f303,definition,
( spl0_18
<=> ! [X1] : ~ p(X1) ),
introduced(definition,[new_symbols(definition,[spl0_18])],[avatar_definition]) ).
fof(f304,plain,
( ! [X1] : ~ p(X1)
| ~ spl0_18 ),
inference(avatar_component_clause,[],[f303]) ).
fof(f306,definition,
( spl0_19
<=> ! [X0] :
( p(crypt(xor(km,X0),id))
| ~ p(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_19])],[avatar_definition]) ).
fof(f307,plain,
( ! [X0] :
( p(crypt(xor(km,X0),id))
| ~ p(X0) )
| ~ spl0_19 ),
inference(avatar_component_clause,[],[f306]) ).
fof(f308,plain,
( spl0_18
| spl0_19 ),
inference(avatar_split_clause,[],[f292,f306,f303]) ).
fof(f320,plain,
( $false
| ~ spl0_18 ),
inference(resolution,[],[f304,f78]) ).
fof(f349,plain,
~ spl0_18,
inference(avatar_contradiction_clause,[],[f320]) ).
fof(f609,plain,
( ~ p(exp)
| spl0_11
| ~ spl0_19 ),
inference(resolution,[],[f307,f227]) ).
fof(f627,plain,
( $false
| spl0_11
| ~ spl0_19 ),
inference(forward_subsumption_resolution,[],[f609,f80]) ).
fof(f628,plain,
( spl0_11
| ~ spl0_19 ),
inference(avatar_contradiction_clause,[],[f627]) ).
fof(f1212,plain,
( p(crypt(pin,pp))
| ~ p(crypt(xor(km,exp),id)) ),
inference(superposition,[],[f243,f87]) ).
fof(f1215,plain,
( p(crypt(pin,pp))
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f1212,f226]) ).
fof(f1226,plain,
( ~ p(pin)
| p(pp)
| ~ spl0_11 ),
inference(resolution,[],[f1215,f68]) ).
fof(f1227,plain,
( p(pp)
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f1226,f74]) ).
fof(f1228,plain,
( $false
| spl0_5
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f1227,f124]) ).
fof(f1229,plain,
( spl0_5
| ~ spl0_11 ),
inference(avatar_contradiction_clause,[],[f1228]) ).
cnf(s5,plain,
~ spl0_5,
inference(sat_conversion,[],[f136]) ).
cnf(s15,plain,
( spl0_18
| spl0_19 ),
inference(sat_conversion,[],[f308]) ).
cnf(s28,plain,
~ spl0_18,
inference(sat_conversion,[],[f349]) ).
cnf(s55,plain,
( spl0_11
| ~ spl0_19 ),
inference(sat_conversion,[],[f628]) ).
cnf(s71,plain,
( spl0_5
| ~ spl0_11 ),
inference(sat_conversion,[],[f1229]) ).
cnf(s79,plain,
spl0_19,
inference(rat,[],[s15,s28]) ).
cnf(s81,plain,
spl0_11,
inference(rat,[],[s55,s79]) ).
cnf(s84,plain,
spl0_5,
inference(rat,[],[s71,s81]) ).
cnf(s88,plain,
$false,
inference(rat,[],[s5,s84]) ).
fof(f1230,plain,
$false,
inference(avatar_sat_refutation,[],[s88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV235+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19 % Computer : n006.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 10:14:40 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.30 % (3864444)Will run a generic schedule for satisfiability detection.
% 0.19/0.30 % (3864449)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3744411702_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.30 % TRYING [1]
% 0.19/0.30 % TRYING [2]
% 0.19/0.30 % TRYING [3]
% 0.19/0.30 % (3864450)% WARNING: option uhcvi not known.
% 0.19/0.30 % TRYING [4]
% 0.19/0.30 % (3864450)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2662111351:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.30 % (3864451)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3658798894:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.30 % (3864452)dis+10_1_sil=32000:sp=arity:random_seed=3373744992:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.30 % (3864455)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2468224163:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.30 % (3864453)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3484818226:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.30 % (3864454)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2179408411:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.30 % TRYING [5]
% 0.19/0.30 % TRYING [6]
% 0.19/0.30 % (3864453) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3864444-3864453"...
% 0.19/0.30 % (3864452) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3864444-3864452"...
% 0.19/0.30 % (3864453)...printing done.
% 0.19/0.30 % (3864452)...printing done.
% 0.19/0.30 % (3864453)Refutation found. Thanks to Tanya!
% 0.19/0.30 % SZS status Theorem for theBenchmark
% 0.19/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.30 % (3864453)------------------------------
% 0.19/0.30 % (3864453)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.30 % (3864453)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.30 % (3864453)CaDiCaL version: 2.1.3
% 0.19/0.30 % (3864453)Termination reason: Refutation
% 0.19/0.30 % (3864453)Time elapsed: 0.033 s
% 0.19/0.30 % (3864453)Peak memory usage: 13 MB
% 0.19/0.30 % (3864453)Instructions burned: 47 (million)
% 0.19/0.30 % (3864444)Success in time 0.07 s
% 0.19/0.30 % Vampire exiting
%------------------------------------------------------------------------------