0.03/0.07 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.07 % Command : tptp2X_and_run_prover9 %d %s 0.07/0.26 % Computer : n032.cluster.edu 0.07/0.26 % Model : x86_64 x86_64 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.07/0.26 % Memory : 8042.1875MB 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64 0.07/0.26 % CPULimit : 960 0.07/0.26 % DateTime : Thu Jul 2 09:37:06 EDT 2020 0.07/0.26 % CPUTime : 0.57/0.90 ============================== Prover9 =============================== 0.57/0.90 Prover9 (32) version 2009-11A, November 2009. 0.57/0.90 Process 9400 was started by sandbox2 on n032.cluster.edu, 0.57/0.90 Thu Jul 2 09:37:06 2020 0.57/0.90 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_9227_n032.cluster.edu". 0.57/0.90 ============================== end of head =========================== 0.57/0.90 0.57/0.90 ============================== INPUT ================================= 0.57/0.90 0.57/0.90 % Reading from file /tmp/Prover9_9227_n032.cluster.edu 0.57/0.90 0.57/0.90 set(prolog_style_variables). 0.57/0.90 set(auto2). 0.57/0.90 % set(auto2) -> set(auto). 0.57/0.90 % set(auto) -> set(auto_inference). 0.57/0.90 % set(auto) -> set(auto_setup). 0.57/0.90 % set(auto_setup) -> set(predicate_elim). 0.57/0.90 % set(auto_setup) -> assign(eq_defs, unfold). 0.57/0.90 % set(auto) -> set(auto_limits). 0.57/0.90 % set(auto_limits) -> assign(max_weight, "100.000"). 0.57/0.90 % set(auto_limits) -> assign(sos_limit, 20000). 0.57/0.90 % set(auto) -> set(auto_denials). 0.57/0.90 % set(auto) -> set(auto_process). 0.57/0.90 % set(auto2) -> assign(new_constants, 1). 0.57/0.90 % set(auto2) -> assign(fold_denial_max, 3). 0.57/0.90 % set(auto2) -> assign(max_weight, "200.000"). 0.57/0.90 % set(auto2) -> assign(max_hours, 1). 0.57/0.90 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.57/0.90 % set(auto2) -> assign(max_seconds, 0). 0.57/0.90 % set(auto2) -> assign(max_minutes, 5). 0.57/0.90 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.57/0.90 % set(auto2) -> set(sort_initial_sos). 0.57/0.90 % set(auto2) -> assign(sos_limit, -1). 0.57/0.90 % set(auto2) -> assign(lrs_ticks, 3000). 0.57/0.90 % set(auto2) -> assign(max_megs, 400). 0.57/0.90 % set(auto2) -> assign(stats, some). 0.57/0.90 % set(auto2) -> clear(echo_input). 0.57/0.90 % set(auto2) -> set(quiet). 0.57/0.90 % set(auto2) -> clear(print_initial_clauses). 0.57/0.90 % set(auto2) -> clear(print_given). 0.57/0.90 assign(lrs_ticks,-1). 0.57/0.90 assign(sos_limit,10000). 0.57/0.90 assign(order,kbo). 0.57/0.90 set(lex_order_vars). 0.57/0.90 clear(print_given). 0.57/0.90 0.57/0.90 % formulas(sos). % not echoed (29 formulas) 0.57/0.90 0.57/0.90 ============================== end of input ========================== 0.57/0.90 0.57/0.90 % From the command line: assign(max_seconds, 960). 0.57/0.90 0.57/0.90 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.57/0.90 0.57/0.90 % Formulas that are not ordinary clauses: 0.57/0.90 1 (all V all W (party_of_protocol(W) & intruder_message(V) -> intruder_holds(key(V,W)))) # label(intruder_holds_key) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 2 (all U all V all W (intruder_message(U) & intruder_holds(key(V,W)) & party_of_protocol(W) -> intruder_message(encrypt(U,V)))) # label(intruder_key_encrypts) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 3 (all U all V all W all X (intruder_message(X) & intruder_message(W) & intruder_message(V) & intruder_message(U) -> intruder_message(quadruple(U,V,W,X)))) # label(intruder_composes_quadruples) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 4 (all U all V all W all X all Y all Z all X1 (message(sent(U,t,triple(U,V,encrypt(triple(W,X,Y),Z)))) & t_holds(key(Z,U)) & t_holds(key(X1,W)) & a_nonce(X) -> message(sent(t,W,triple(encrypt(quadruple(U,X,generate_key(X),Y),X1),encrypt(triple(W,generate_key(X),Y),Z),V))))) # label(server_t_generates_key) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 5 (all U all V all W (intruder_message(triple(U,V,W)) -> intruder_message(U) & intruder_message(V) & intruder_message(W))) # label(intruder_decomposes_triples) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 6 (all U all V (fresh_to_b(V) & message(sent(U,b,pair(U,V))) -> b_stored(pair(U,V)) & message(sent(b,t,triple(b,generate_b_nonce(V),encrypt(triple(U,V,generate_expiration_time(V)),bt)))))) # label(b_creates_freash_nonces_in_time) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 7 (all U all V all W (party_of_protocol(W) & intruder_holds(key(V,W)) & intruder_message(encrypt(U,V)) -> intruder_message(V))) # label(intruder_interception) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 8 (all U all V all W all X (intruder_message(quadruple(U,V,W,X)) -> intruder_message(U) & intruder_message(V) & intruder_message(W) & intruder_message(X))) # label(intruder_decomposes_quadruples) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 9 (all U all V all W (message(sent(U,V,W)) -> intruder_message(W))) # label(intruder_can_record) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 10 (all U all V (intruder_message(V) & intruder_message(U) -> intruder_message(pair(U,V)))) # label(intruder_composes_pairs) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 11 (all V all X all Y (b_stored(pair(X,Y)) & message(sent(X,b,pair(encrypt(triple(X,V,generate_expiration_time(Y)),bt),encrypt(generate_b_nonce(Y),V)))) -> b_holds(key(V,X)))) # label(b_accepts_secure_session_key) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 12 (all U -a_nonce(generate_key(U))) # label(generated_keys_are_not_nonces) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 13 (all U all V (intruder_message(pair(U,V)) -> intruder_message(V) & intruder_message(U))) # label(intruder_decomposes_pairs) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 14 (all U all V all W (intruder_message(U) & party_of_protocol(W) & party_of_protocol(V) -> message(sent(V,W,U)))) # label(intruder_message_sent) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 15 (all U all V all W (intruder_message(V) & intruder_message(W) & intruder_message(U) -> intruder_message(triple(U,V,W)))) # label(intruder_composes_triples) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 16 (all U (a_nonce(generate_b_nonce(U)) & a_nonce(generate_expiration_time(U)))) # label(generated_times_and_nonces_are_nonces) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 17 (all U all V all W all X all Y all Z (a_stored(pair(Y,Z)) & message(sent(t,a,triple(encrypt(quadruple(Y,Z,W,V),at),X,U))) -> message(sent(a,Y,pair(X,encrypt(U,W)))) & a_holds(key(W,Y)))) # label(a_forwards_secure) # label(axiom) # label(non_clause). [assumption]. 0.57/0.90 18 -(exists U (intruder_holds(key(U,b)) & b_holds(key(U,a)))) # label(co1) # label(negated_conjecture) # label(non_clause). [assumption]. 0.57/0.90 0.57/0.90 ============================== end of process non-clausal formulas === 0.57/0.90 0.57/0.90 ============================== PROCESS INITIAL CLAUSES =============== 0.57/0.90 0.57/0.90 ============================== PREDICATE ELIMINATION ================= 0.57/0.90 19 -fresh_to_b(A) | -message(sent(B,b,pair(B,A))) | b_stored(pair(B,A)) # label(b_creates_freash_nonces_in_time) # label(axiom). [clausify(6)]. 0.57/0.90 20 fresh_to_b(an_a_nonce) # label(nonce_a_is_fresh_to_b) # label(axiom). [assumption]. 0.57/0.90 Derived: -message(sent(A,b,pair(A,an_a_nonce))) | b_stored(pair(A,an_a_nonce)). [resolve(19,a,20,a)]. 0.57/0.90 21 -fresh_to_b(A) | -message(sent(B,b,pair(B,A))) | message(sent(b,t,triple(b,generate_b_nonce(A),encrypt(triple(B,A,generate_expiration_time(A)),bt)))) # label(b_creates_freash_nonces_in_time) # label(axiom). [clausify(6)]. 0.57/0.90 Derived: -message(sent(A,b,pair(A,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)))). [resolve(21,a,20,a)]. 0.57/0.90 22 -a_nonce(generate_key(A)) # label(generated_keys_are_not_nonces) # label(axiom). [clausify(12)]. 0.57/0.90 23 a_nonce(an_a_nonce) # label(an_a_nonce_is_a_nonce) # label(axiom). [assumption]. 0.57/0.90 24 a_nonce(generate_b_nonce(A)) # label(generated_times_and_nonces_are_nonces) # label(axiom). [clausify(16)]. 0.57/0.90 25 a_nonce(generate_expiration_time(A)) # label(generated_times_and_nonces_are_nonces) # label(axiom). [clausify(16)]. 0.57/0.90 26 -message(sent(A,t,triple(A,B,encrypt(triple(C,D,E),F)))) | -t_holds(key(F,A)) | -t_holds(key(V6,C)) | -a_nonce(D) | message(sent(t,C,triple(encrypt(quadruple(A,D,generate_key(D),E),V6),encrypt(triple(C,generate_key(D),E),F),B))) # label(server_t_generates_key) # label(axiom). [clausify(4)]. 0.57/0.90 Derived: -message(sent(A,t,triple(A,B,encrypt(triple(C,an_a_nonce,D),E)))) | -t_holds(key(E,A)) | -t_holds(key(F,C)) | message(sent(t,C,triple(encrypt(quadruple(A,an_a_nonce,generate_key(an_a_nonce),D),F),encrypt(triple(C,generate_key(an_a_nonce),D),E),B))). [resolve(26,d,23,a)]. 0.57/0.90 Derived: -message(sent(A,t,triple(A,B,encrypt(triple(C,generate_b_nonce(D),E),F)))) | -t_holds(key(F,A)) | -t_holds(key(V6,C)) | message(sent(t,C,triple(encrypt(quadruple(A,generate_b_nonce(D),generate_key(generate_b_nonce(D)),E),V6),encrypt(triple(C,generate_key(generate_b_nonce(D)),E),F),B))). [resolve(26,d,24,a)]. 10.17/10.49 Derived: -message(sent(A,t,triple(A,B,encrypt(triple(C,generate_expiration_time(D),E),F)))) | -t_holds(key(F,A)) | -t_holds(key(V6,C)) | message(sent(t,C,triple(encrypt(quadruple(A,generate_expiration_time(D),generate_key(generate_expiration_time(D)),E),V6),encrypt(triple(C,generate_key(generate_expiration_time(D)),E),F),B))). [resolve(26,d,25,a)]. 10.17/10.49 27 -intruder_holds(key(A,b)) | -b_holds(key(A,a)) # label(co1) # label(negated_conjecture). [clausify(18)]. 10.17/10.49 28 b_holds(key(bt,t)) # label(b_hold_key_bt_for_t) # label(axiom). [assumption]. 10.17/10.49 29 -b_stored(pair(A,B)) | -message(sent(A,b,pair(encrypt(triple(A,C,generate_expiration_time(B)),bt),encrypt(generate_b_nonce(B),C)))) | b_holds(key(C,A)) # label(b_accepts_secure_session_key) # label(axiom). [clausify(11)]. 10.17/10.49 Derived: -b_stored(pair(a,A)) | -message(sent(a,b,pair(encrypt(triple(a,B,generate_expiration_time(A)),bt),encrypt(generate_b_nonce(A),B)))) | -intruder_holds(key(B,b)). [resolve(29,c,27,b)]. 10.17/10.49 30 -a_stored(pair(A,B)) | -message(sent(t,a,triple(encrypt(quadruple(A,B,C,D),at),E,F))) | a_holds(key(C,A)) # label(a_forwards_secure) # label(axiom). [clausify(17)]. 10.17/10.49 31 a_stored(pair(b,an_a_nonce)) # label(a_stored_message_i) # label(axiom). [assumption]. 10.17/10.49 Derived: -message(sent(t,a,triple(encrypt(quadruple(b,an_a_nonce,A,B),at),C,D))) | a_holds(key(A,b)). [resolve(30,a,31,a)]. 10.17/10.49 32 -a_stored(pair(A,B)) | -message(sent(t,a,triple(encrypt(quadruple(A,B,C,D),at),E,F))) | message(sent(a,A,pair(E,encrypt(F,C)))) # label(a_forwards_secure) # label(axiom). [clausify(17)]. 10.17/10.49 Derived: -message(sent(t,a,triple(encrypt(quadruple(b,an_a_nonce,A,B),at),C,D))) | message(sent(a,b,pair(C,encrypt(D,A)))). [resolve(32,a,31,a)]. 10.17/10.49 33 -intruder_message(A) | -intruder_holds(key(B,C)) | -party_of_protocol(C) | intruder_message(encrypt(A,B)) # label(intruder_key_encrypts) # label(axiom). [clausify(2)]. 10.17/10.49 34 -party_of_protocol(A) | -intruder_message(B) | intruder_holds(key(B,A)) # label(intruder_holds_key) # label(axiom). [clausify(1)]. 10.17/10.49 Derived: -intruder_message(A) | -party_of_protocol(B) | intruder_message(encrypt(A,C)) | -party_of_protocol(B) | -intruder_message(C). [resolve(33,b,34,c)]. 10.17/10.49 35 -party_of_protocol(A) | -intruder_holds(key(B,A)) | -intruder_message(encrypt(C,B)) | intruder_message(B) # label(intruder_interception) # label(axiom). [clausify(7)]. 10.17/10.49 36 -b_stored(pair(a,A)) | -message(sent(a,b,pair(encrypt(triple(a,B,generate_expiration_time(A)),bt),encrypt(generate_b_nonce(A),B)))) | -intruder_holds(key(B,b)). [resolve(29,c,27,b)]. 10.17/10.49 Derived: -b_stored(pair(a,A)) | -message(sent(a,b,pair(encrypt(triple(a,B,generate_expiration_time(A)),bt),encrypt(generate_b_nonce(A),B)))) | -party_of_protocol(b) | -intruder_message(B). [resolve(36,c,34,c)]. 10.17/10.49 37 -b_stored(pair(a,A)) | -message(sent(a,b,pair(encrypt(triple(a,B,generate_expiration_time(A)),bt),encrypt(generate_b_nonce(A),B)))) | -party_of_protocol(b) | -intruder_message(B). [resolve(36,c,34,c)]. 10.17/10.49 38 -message(sent(A,b,pair(A,an_a_nonce))) | b_stored(pair(A,an_a_nonce)). [resolve(19,a,20,a)]. 10.17/10.49 Derived: -message(sent(a,b,pair(encrypt(triple(a,A,generate_expiration_time(an_a_nonce)),bt),encrypt(generate_b_nonce(an_a_nonce),A)))) | -party_of_protocol(b) | -intruder_message(A) | -message(sent(a,b,pair(a,an_a_nonce))). [resolve(37,a,38,b)]. 10.17/10.49 10.17/10.49 ============================== end predicate elimination ============= 10.17/10.49 10.17/10.49 Auto_denials: (no changes). 10.17/10.49 10.17/10.49 Term ordering decisions: 10.17/10.49 Function symbol KB weights: an_a_nonce=1. t=1. b=1. a=1. at=1. bt=1. encrypt=1. key=1. pair=1. generate_key=1. generate_b_nonce=1. generate_expiration_time=1. triple=1. sent=1. quadruple=1. 10.17/10.49 10.17/10.49 ============================== end of process initial clauses ======== 10.17/10.49 10.17/10.49 ============================== CLAUSES FOR SEARCH ==================== 10.17/10.49 10.17/10.49 ============================== end of clauses for search ============= 10.17/10.49 10.17/10.49 ============================== SEARCH ================================ 10.17/10.49 10.17/10.49 % Starting search at 0.01 seconds. 10.17/10.49 10.17/10.49 Low Water (keep): wt=14.000, iters=5402 10.17/10.49 10.17/10.49 Low Water (keep): wt=12.000, iters=3944 10.17/10.49 10.17/10.49 Low Water (keep): wt=11.000, iters=3475 10.17/10.49 10.17/10.49 LowAlarm clock 119.74/120.04 Prover9 interrupted 119.74/120.04 EOF