0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.13	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n011.cluster.edu
0.13/0.34	% Model      : x86_64 x86_64
0.13/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory     : 8042.1875MB
0.13/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1200
0.13/0.34	% DateTime   : Tue Jul 13 12:47:55 EDT 2021
0.13/0.34	% CPUTime    : 
0.73/1.03	============================== Prover9 ===============================
0.73/1.03	Prover9 (32) version 2009-11A, November 2009.
0.73/1.03	Process 15844 was started by sandbox on n011.cluster.edu,
0.73/1.03	Tue Jul 13 12:47:55 2021
0.73/1.03	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1200 -f /tmp/Prover9_15660_n011.cluster.edu".
0.73/1.03	============================== end of head ===========================
0.73/1.03	
0.73/1.03	============================== INPUT =================================
0.73/1.03	
0.73/1.03	% Reading from file /tmp/Prover9_15660_n011.cluster.edu
0.73/1.03	
0.73/1.03	set(prolog_style_variables).
0.73/1.03	set(auto2).
0.73/1.03	    % set(auto2) -> set(auto).
0.73/1.03	    % set(auto) -> set(auto_inference).
0.73/1.03	    % set(auto) -> set(auto_setup).
0.73/1.03	    % set(auto_setup) -> set(predicate_elim).
0.73/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.73/1.03	    % set(auto) -> set(auto_limits).
0.73/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.73/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.73/1.03	    % set(auto) -> set(auto_denials).
0.73/1.03	    % set(auto) -> set(auto_process).
0.73/1.03	    % set(auto2) -> assign(new_constants, 1).
0.73/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.73/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.73/1.03	    % set(auto2) -> assign(max_hours, 1).
0.73/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.73/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.73/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.73/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.73/1.03	    % set(auto2) -> set(sort_initial_sos).
0.73/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.73/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.73/1.03	    % set(auto2) -> assign(max_megs, 400).
0.73/1.03	    % set(auto2) -> assign(stats, some).
0.73/1.03	    % set(auto2) -> clear(echo_input).
0.73/1.03	    % set(auto2) -> set(quiet).
0.73/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.73/1.03	    % set(auto2) -> clear(print_given).
0.73/1.03	assign(lrs_ticks,-1).
0.73/1.03	assign(sos_limit,10000).
0.73/1.03	assign(order,kbo).
0.73/1.03	set(lex_order_vars).
0.73/1.03	clear(print_given).
0.73/1.03	
0.73/1.03	% formulas(sos).  % not echoed (29 formulas)
0.73/1.03	
0.73/1.03	============================== end of input ==========================
0.73/1.03	
0.73/1.03	% From the command line: assign(max_seconds, 1200).
0.73/1.03	
0.73/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.73/1.03	
0.73/1.03	% Formulas that are not ordinary clauses:
0.73/1.03	1 (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.73/1.03	2 (all U all V all W (intruder_message(triple(U,V,W)) -> intruder_message(U) & intruder_message(W) & intruder_message(V))) # label(intruder_decomposes_triples) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	3 (all U all V all W all X (intruder_message(quadruple(U,V,W,X)) -> intruder_message(U) & intruder_message(V) & intruder_message(X) & intruder_message(W))) # label(intruder_decomposes_quadruples) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	4 (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.73/1.03	5 (all U all V all W (intruder_message(U) & party_of_protocol(W) & intruder_holds(key(V,W)) -> intruder_message(encrypt(U,V)))) # label(intruder_key_encrypts) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	6 (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.73/1.03	7 (all U all V all W all X (intruder_message(V) & intruder_message(W) & intruder_message(X) & intruder_message(U) -> intruder_message(quadruple(U,V,W,X)))) # label(intruder_composes_quadruples) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	8 (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.73/1.03	9 (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.73/1.03	10 (all V all X all Y (message(sent(X,b,pair(encrypt(triple(X,V,generate_expiration_time(Y)),bt),encrypt(generate_b_nonce(Y),V)))) & b_stored(pair(X,Y)) -> b_holds(key(V,X)))) # label(b_accepts_secure_session_key) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	11 (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.73/1.03	12 (all U all V (intruder_message(pair(U,V)) -> intruder_message(U) & intruder_message(V))) # label(intruder_decomposes_pairs) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	13 (all U all V all W all X all Y all Z all X1 (t_holds(key(X1,W)) & a_nonce(X) & t_holds(key(Z,U)) & message(sent(U,t,triple(U,V,encrypt(triple(W,X,Y),Z)))) -> 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.73/1.03	14 (all U all V all W (intruder_holds(key(V,W)) & party_of_protocol(W) & intruder_message(encrypt(U,V)) -> intruder_message(V))) # label(intruder_interception) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	15 (all U all V all W all X all Y all Z (message(sent(t,a,triple(encrypt(quadruple(Y,Z,W,V),at),X,U))) & a_stored(pair(Y,Z)) -> a_holds(key(W,Y)) & message(sent(a,Y,pair(X,encrypt(U,W)))))) # label(a_forwards_secure) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	16 (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.73/1.03	17 (all U -a_nonce(generate_key(U))) # label(generated_keys_are_not_nonces) # label(axiom) # label(non_clause).  [assumption].
0.73/1.03	18 -(exists U (intruder_holds(key(U,b)) & b_holds(key(U,a)))) # label(co1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.73/1.03	
0.73/1.03	============================== end of process non-clausal formulas ===
0.73/1.03	
0.73/1.03	============================== PROCESS INITIAL CLAUSES ===============
0.73/1.03	
0.73/1.03	============================== PREDICATE ELIMINATION =================
0.73/1.03	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(4)].
0.73/1.03	20 fresh_to_b(an_a_nonce) # label(nonce_a_is_fresh_to_b) # label(axiom).  [assumption].
0.73/1.03	Derived: -message(sent(A,b,pair(A,an_a_nonce))) | b_stored(pair(A,an_a_nonce)).  [resolve(19,a,20,a)].
0.73/1.03	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(4)].
0.73/1.03	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.73/1.03	22 -a_nonce(generate_key(A)) # label(generated_keys_are_not_nonces) # label(axiom).  [clausify(17)].
0.73/1.03	23 a_nonce(an_a_nonce) # label(an_a_nonce_is_a_nonce) # label(axiom).  [assumption].
0.73/1.03	24 a_nonce(generate_b_nonce(A)) # label(generated_times_and_nonces_are_nonces) # label(axiom).  [clausify(8)].
0.73/1.03	25 a_nonce(generate_expiration_time(A)) # label(generated_times_and_nonces_are_nonces) # label(axiom).  [clausify(8)].
0.73/1.03	26 -t_holds(key(A,B)) | -a_nonce(C) | -t_holds(key(D,E)) | -message(sent(E,t,triple(E,F,encrypt(triple(B,C,V6),D)))) | message(sent(t,B,triple(encrypt(quadruple(E,C,generate_key(C),V6),A),encrypt(triple(B,generate_key(C),V6),D),F))) # label(server_t_generates_key) # label(axiom).  [clausify(13)].
0.73/1.03	Derived: -t_holds(key(A,B)) | -t_holds(key(C,D)) | -message(sent(D,t,triple(D,E,encrypt(triple(B,an_a_nonce,F),C)))) | message(sent(t,B,triple(encrypt(quadruple(D,an_a_nonce,generate_key(an_a_nonce),F),A),encrypt(triple(B,generate_key(an_a_nonce),F),C),E))).  [resolve(26,b,23,a)].
0.73/1.03	Derived: -t_holds(key(A,B)) | -t_holds(key(C,D)) | -message(sent(D,t,triple(D,E,encrypt(triple(B,generate_b_nonce(F),V6),C)))) | message(sent(t,B,triple(encrypt(quadruple(D,generate_b_nonce(F),generate_key(generate_b_nonce(F)),V6),A),encrypt(triple(B,generate_keyAlarm clock 
119.85/120.13	Prover9 interrupted
119.85/120.13	EOF