TSTP Solution File: SWV811_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV811_5 : TPTP v8.2.0. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 06:06:18 EDT 2024
% Result : Theorem 0.50s 0.68s
% Output : Refutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 56
% Syntax : Number of formulae : 73 ( 11 unt; 51 typ; 0 def)
% Number of atoms : 36 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 15 ~; 8 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of types : 6 ( 5 usr)
% Number of type conns : 61 ( 34 >; 27 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 41 ( 41 usr; 10 con; 0-5 aty)
% Number of variables : 62 ( 42 !; 0 ?; 62 :)
% ( 20 !>; 0 ?*; 0 @-; 0 @+)
% 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: ( list(event) * msg ) > agent ).
tff(func_def_31,type,
sK1: ( list(event) * msg ) > agent ).
tff(func_def_32,type,
sK2: ( list(event) * agent * msg ) > agent ).
tff(func_def_33,type,
sK3:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) * list(X0) ) > X0 ) ).
tff(func_def_34,type,
sK4:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_35,type,
sK5: fun(msg,bool) > msg ).
tff(func_def_36,type,
sK6: fun(msg,bool) > nat ).
tff(func_def_37,type,
sK7: fun(msg,bool) > msg ).
tff(func_def_38,type,
sK8: fun(msg,bool) > msg ).
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(pred_def_5,type,
sQ9_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f623,plain,
$false,
inference(subsumption_resolution,[],[f622,f550]) ).
tff(f550,plain,
! [X2: agent,X0: nat,X1: msg] : ~ member(msg,crypt(X0,X1),knows(X2,nil(event))),
inference(resolution,[],[f436,f331]) ).
tff(f331,plain,
! [X0: fun(msg,bool),X1: msg] :
( member(msg,X1,parts(X0))
| ~ member(msg,X1,X0) ),
inference(cnf_transformation,[],[f233]) ).
tff(f233,plain,
! [X0: fun(msg,bool),X1: msg] :
( member(msg,X1,parts(X0))
| ~ member(msg,X1,X0) ),
inference(ennf_transformation,[],[f131]) ).
tff(f131,plain,
! [X0: fun(msg,bool),X1: msg] :
( member(msg,X1,X0)
=> member(msg,X1,parts(X0)) ),
inference(rectify,[],[f19]) ).
tff(f19,axiom,
! [X15: fun(msg,bool),X5: msg] :
( member(msg,X5,X15)
=> member(msg,X5,parts(X15)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_18_parts_OInj) ).
tff(f436,plain,
! [X2: nat,X0: agent,X1: msg] : ~ member(msg,crypt(X2,X1),parts(knows(X0,nil(event)))),
inference(definition_unfolding,[],[f403,f357]) ).
tff(f357,plain,
! [X0: agent] : ( knows(X0,nil(event)) = initState(X0) ),
inference(cnf_transformation,[],[f153]) ).
tff(f153,plain,
! [X0: agent] : ( knows(X0,nil(event)) = initState(X0) ),
inference(rectify,[],[f60]) ).
tff(f60,axiom,
! [X10: agent] : ( knows(X10,nil(event)) = initState(X10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_59_knows__Nil) ).
tff(f403,plain,
! [X2: nat,X0: agent,X1: msg] : ~ member(msg,crypt(X2,X1),parts(initState(X0))),
inference(cnf_transformation,[],[f184]) ).
tff(f184,plain,
! [X0: agent,X1: msg,X2: nat] : ~ member(msg,crypt(X2,X1),parts(initState(X0))),
inference(rectify,[],[f90]) ).
tff(f90,axiom,
! [X7: agent,X5: msg,X6: nat] : ~ member(msg,crypt(X6,X5),parts(initState(X7))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_89_Crypt__notin__initState) ).
tff(f622,plain,
member(msg,crypt(k,mPair(nonce(nb),nonce(nb))),knows(spy,nil(event))),
inference(resolution,[],[f343,f305]) ).
tff(f305,plain,
member(event,says(a,b,crypt(k,mPair(nonce(nb),nonce(nb)))),set(event,nil(event))),
inference(cnf_transformation,[],[f209]) ).
tff(f209,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))))))
& member(event,says(a,b,crypt(k,mPair(nonce(nb),nonce(nb)))),set(event,nil(event)))
& ~ member(msg,key(k),analz(knows(spy,nil(event)))) ),
inference(ennf_transformation,[],[f112]) ).
tff(f112,negated_conjecture,
~ ( ~ 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))))))
| ~ member(event,says(a,b,crypt(k,mPair(nonce(nb),nonce(nb)))),set(event,nil(event)))
| member(msg,key(k),analz(knows(spy,nil(event)))) ),
inference(negated_conjecture,[],[f111]) ).
tff(f111,conjecture,
( ~ 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))))))
| ~ member(event,says(a,b,crypt(k,mPair(nonce(nb),nonce(nb)))),set(event,nil(event)))
| member(msg,key(k),analz(knows(spy,nil(event)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_2) ).
tff(f343,plain,
! [X2: agent,X3: agent,X0: list(event),X1: msg] :
( ~ member(event,says(X3,X2,X1),set(event,X0))
| member(msg,X1,knows(spy,X0)) ),
inference(cnf_transformation,[],[f239]) ).
tff(f239,plain,
! [X0: list(event),X1: msg,X2: agent,X3: agent] :
( member(msg,X1,knows(spy,X0))
| ~ member(event,says(X3,X2,X1),set(event,X0)) ),
inference(ennf_transformation,[],[f142]) ).
tff(f142,plain,
! [X0: list(event),X1: msg,X2: agent,X3: agent] :
( member(event,says(X3,X2,X1),set(event,X0))
=> member(msg,X1,knows(spy,X0)) ),
inference(rectify,[],[f55]) ).
tff(f55,axiom,
! [X4: list(event),X5: msg,X7: agent,X10: agent] :
( member(event,says(X10,X7,X5),set(event,X4))
=> member(msg,X5,knows(spy,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_54_Says__imp__spies) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWV811_5 : TPTP v8.2.0. Released v6.0.0.
% 0.02/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.31 % Computer : n027.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sun May 19 08:08:07 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.11/0.31 This is a TF1_THM_EQU_NAR problem
% 0.11/0.32 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.50/0.68 % (12454)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.50/0.68 % (12461)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.50/0.68 % (12458)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.50/0.68 % (12459)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.50/0.68 % (12457)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.50/0.68 % (12456)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.50/0.68 % (12460)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.50/0.68 % (12455)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.50/0.68 % (12460)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.50/0.68 % (12461)Refutation not found, incomplete strategy% (12461)------------------------------
% 0.50/0.68 % (12461)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.68 % (12461)Termination reason: Refutation not found, incomplete strategy
% 0.50/0.68
% 0.50/0.68 % (12461)Memory used [KB]: 1184
% 0.50/0.68 % (12461)Time elapsed: 0.004 s
% 0.50/0.68 % (12461)Instructions burned: 10 (million)
% 0.50/0.68 % (12461)------------------------------
% 0.50/0.68 % (12461)------------------------------
% 0.50/0.68 % (12458)Refutation not found, incomplete strategy% (12458)------------------------------
% 0.50/0.68 % (12458)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.68 % (12458)Termination reason: Refutation not found, incomplete strategy
% 0.50/0.68
% 0.50/0.68 % (12458)Memory used [KB]: 1277
% 0.50/0.68 % (12458)Time elapsed: 0.005 s
% 0.50/0.68 % (12458)Instructions burned: 14 (million)
% 0.50/0.68 % (12458)------------------------------
% 0.50/0.68 % (12458)------------------------------
% 0.50/0.68 % (12454)First to succeed.
% 0.50/0.68 % (12460)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.50/0.68 % (12454)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-12452"
% 0.50/0.68 % (12459)Refutation not found, incomplete strategy% (12459)------------------------------
% 0.50/0.68 % (12459)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.68 % (12459)Termination reason: Refutation not found, incomplete strategy
% 0.50/0.68
% 0.50/0.68 % (12459)Memory used [KB]: 1190
% 0.50/0.68 % (12459)Time elapsed: 0.006 s
% 0.50/0.68 % (12459)Instructions burned: 11 (million)
% 0.50/0.68 % (12456)Also succeeded, but the first one will report.
% 0.50/0.68 % (12454)Refutation found. Thanks to Tanya!
% 0.50/0.68 % SZS status Theorem for theBenchmark
% 0.50/0.68 % SZS output start Proof for theBenchmark
% See solution above
% 0.50/0.68 % (12454)------------------------------
% 0.50/0.68 % (12454)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.68 % (12454)Termination reason: Refutation
% 0.50/0.68
% 0.50/0.68 % (12454)Memory used [KB]: 1298
% 0.50/0.68 % (12454)Time elapsed: 0.006 s
% 0.50/0.68 % (12454)Instructions burned: 18 (million)
% 0.50/0.68 % (12452)Success in time 0.362 s
% 0.50/0.68 % Vampire---4.8 exiting
%------------------------------------------------------------------------------