%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV236+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 : n010.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.34s 0.44s
% Output : Refutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 16 unt; 2 def)
% Number of atoms : 85 ( 4 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 88 ( 44 ~; 35 |; 5 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 38 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : xor(X0,X1) = xor(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_commutative) ).
fof(f5,axiom,
! [X0] : xor(X0,X0) = id,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xor_rules_2) ).
fof(f8,axiom,
! [X0,X1] :
( ( p(X0)
& p(X1) )
=> p(crypt(xor(km,xor(kp,X1)),X0)) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',key_part_import___part_3) ).
fof(f21,axiom,
p(id),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge_of_intruder_4) ).
fof(f24,axiom,
p(crypt(xor(km,exp),eurk)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge_of_intruder_7) ).
fof(f26,axiom,
p(exp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_knowledge_of_intruder_9) ).
fof(f28,conjecture,
? [X0] :
( p(crypt(xor(km,exp),X0))
& p(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',find_known_exporter) ).
fof(f29,negated_conjecture,
~ ? [X0] :
( p(crypt(xor(km,exp),X0))
& p(X0) ),
inference(negated_conjecture,[status(cth)],[f28]) ).
fof(f34,plain,
! [X0,X1] :
( p(crypt(xor(km,xor(kp,X1)),X0))
| ~ p(X0)
| ~ p(X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f35,plain,
! [X0,X1] :
( p(crypt(xor(km,xor(kp,X1)),X0))
| ~ p(X0)
| ~ p(X1) ),
inference(flattening,[],[f34]) ).
fof(f38,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(f39,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,[],[f38]) ).
fof(f53,plain,
! [X0] :
( ~ p(crypt(xor(km,exp),X0))
| ~ p(X0) ),
inference(ennf_transformation,[],[f29]) ).
fof(f54,plain,
! [X0,X1] : xor(X0,X1) = xor(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f58,plain,
! [X0] : id = xor(X0,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f61,plain,
! [X0,X1] :
( p(crypt(xor(km,xor(kp,X1)),X0))
| ~ p(X0)
| ~ p(X1) ),
inference(cnf_transformation,[],[f35]) ).
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,[],[f39]) ).
fof(f74,plain,
p(id),
inference(cnf_transformation,[],[f21]) ).
fof(f77,plain,
p(crypt(xor(km,exp),eurk)),
inference(cnf_transformation,[],[f24]) ).
fof(f79,plain,
p(exp),
inference(cnf_transformation,[],[f26]) ).
fof(f81,plain,
! [X0] :
( ~ p(crypt(xor(km,exp),X0))
| ~ p(X0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f147,plain,
! [X0,X1] :
( p(crypt(xor(km,xor(X0,kp)),X1))
| ~ p(X1)
| ~ p(X0) ),
inference(superposition,[],[f61,f54]) ).
fof(f161,definition,
( spl0_3
<=> ! [X0] : ~ p(X0) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f162,plain,
( ! [X0] : ~ p(X0)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f161]) ).
fof(f250,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(f257,plain,
! [X0,X1] :
( p(crypt(xor(km,X0),id))
| ~ p(X1)
| ~ p(X0) ),
inference(forward_subsumption_resolution,[],[f250,f147]) ).
fof(f269,definition,
( spl0_9
<=> ! [X0] :
( p(crypt(xor(km,X0),id))
| ~ p(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f270,plain,
( ! [X0] :
( p(crypt(xor(km,X0),id))
| ~ p(X0) )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f269]) ).
fof(f271,plain,
( spl0_3
| spl0_9 ),
inference(avatar_split_clause,[],[f257,f269,f161]) ).
fof(f284,plain,
( $false
| ~ spl0_3 ),
inference(resolution,[],[f162,f77]) ).
fof(f310,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f284]) ).
fof(f693,plain,
( ~ p(exp)
| ~ p(id)
| ~ spl0_9 ),
inference(resolution,[],[f270,f81]) ).
fof(f716,plain,
( ~ p(id)
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f693,f79]) ).
fof(f725,plain,
( $false
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f716,f74]) ).
fof(f726,plain,
~ spl0_9,
inference(avatar_contradiction_clause,[],[f725]) ).
cnf(s5,plain,
( spl0_3
| spl0_9 ),
inference(sat_conversion,[],[f271]) ).
cnf(s16,plain,
~ spl0_3,
inference(sat_conversion,[],[f310]) ).
cnf(s50,plain,
~ spl0_9,
inference(sat_conversion,[],[f726]) ).
cnf(s61,plain,
$false,
inference(rat,[],[s5,s50,s16]) ).
fof(f728,plain,
$false,
inference(avatar_sat_refutation,[],[s61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV236+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.29 % Computer : n010.cluster.edu
% 0.12/0.29 % Model : x86_64 x86_64
% 0.12/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.29 % Memory : 8046.5625MB
% 0.12/0.29 % OS : Linux 6.8.0-71-generic
% 0.12/0.29 % CPULimit : 300
% 0.12/0.29 % WCLimit : 300
% 0.12/0.29 % DateTime : Mon Sep 28 10:15:02 UTC 2026
% 0.12/0.30 % CPUTime :
% 0.12/0.30 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.30/0.34 Running first-order model finding
% 0.30/0.34 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.34/0.44 % (1828165)Will run a generic schedule for satisfiability detection.
% 0.34/0.44 % (1828176)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=253706086:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.34/0.44 % (1828171)% WARNING: option uhcvi not known.
% 0.34/0.44 % (1828174)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2165974653:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.34/0.44 % (1828175)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2616360945:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.34/0.44 % (1828172)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4073024403:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.34/0.44 % (1828173)dis+10_1_sil=32000:sp=arity:random_seed=3960854989:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.34/0.44 % (1828170)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2972267985_2999 on theBenchmark for (2999ds/0Mi)
% 0.34/0.44 % (1828171)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2458106888:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.34/0.44 % TRYING [1]
% 0.34/0.44 % TRYING [2]
% 0.34/0.44 % TRYING [3]
% 0.34/0.44 % TRYING [4]
% 0.34/0.44 % (1828174) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1828165-1828174"...
% 0.34/0.44 % (1828174)...printing done.
% 0.34/0.44 % (1828174)Refutation found. Thanks to Tanya!
% 0.34/0.44 % SZS status Theorem for theBenchmark
% 0.34/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.34/0.44 % (1828174)------------------------------
% 0.34/0.44 % (1828174)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.34/0.44 % (1828174)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.34/0.44 % (1828174)CaDiCaL version: 2.1.3
% 0.34/0.44 % (1828174)Termination reason: Refutation
% 0.34/0.44 % (1828174)Time elapsed: 0.031 s
% 0.34/0.44 % (1828174)Peak memory usage: 13 MB
% 0.34/0.44 % (1828174)Instructions burned: 29 (million)
% 0.34/0.44 % (1828165)Success in time 0.081 s
% 0.34/0.44 % Vampire exiting
%------------------------------------------------------------------------------