TSTP Solution File: SWV016-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV016-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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 : 600s
% DateTime : Wed Jul 20 21:10:14 EDT 2022
% Result : Timeout 300.04s 300.32s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV016-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 15 04:35:14 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.76/1.01 ============================== Prover9 ===============================
% 0.76/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.01 Process 16659 was started by sandbox on n018.cluster.edu,
% 0.76/1.01 Wed Jun 15 04:35:15 2022
% 0.76/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_16506_n018.cluster.edu".
% 0.76/1.01 ============================== end of head ===========================
% 0.76/1.01
% 0.76/1.01 ============================== INPUT =================================
% 0.76/1.01
% 0.76/1.01 % Reading from file /tmp/Prover9_16506_n018.cluster.edu
% 0.76/1.01
% 0.76/1.01 set(prolog_style_variables).
% 0.76/1.01 set(auto2).
% 0.76/1.01 % set(auto2) -> set(auto).
% 0.76/1.01 % set(auto) -> set(auto_inference).
% 0.76/1.01 % set(auto) -> set(auto_setup).
% 0.76/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.01 % set(auto) -> set(auto_limits).
% 0.76/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.01 % set(auto) -> set(auto_denials).
% 0.76/1.01 % set(auto) -> set(auto_process).
% 0.76/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.01 % set(auto2) -> assign(stats, some).
% 0.76/1.01 % set(auto2) -> clear(echo_input).
% 0.76/1.01 % set(auto2) -> set(quiet).
% 0.76/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.01 % set(auto2) -> clear(print_given).
% 0.76/1.01 assign(lrs_ticks,-1).
% 0.76/1.01 assign(sos_limit,10000).
% 0.76/1.01 assign(order,kbo).
% 0.76/1.01 set(lex_order_vars).
% 0.76/1.01 clear(print_given).
% 0.76/1.01
% 0.76/1.01 % formulas(sos). % not echoed (37 formulas)
% 0.76/1.01
% 0.76/1.01 ============================== end of input ==========================
% 0.76/1.01
% 0.76/1.01 % From the command line: assign(max_seconds, 300).
% 0.76/1.01
% 0.76/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.01
% 0.76/1.01 % Formulas that are not ordinary clauses:
% 0.76/1.01
% 0.76/1.01 ============================== end of process non-clausal formulas ===
% 0.76/1.01
% 0.76/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.01
% 0.76/1.01 ============================== PREDICATE ELIMINATION =================
% 0.76/1.01 1 b_stored(pair(A,B)) | -fresh_to_b(B) | -message(sent(A,b,pair(A,B))) # label(b_creates_freash_nonces_in_time_11) # label(axiom). [assumption].
% 0.76/1.01 2 fresh_to_b(an_a_nonce) # label(nonce_a_is_fresh_to_b_9) # label(axiom). [assumption].
% 0.76/1.01 Derived: b_stored(pair(A,an_a_nonce)) | -message(sent(A,b,pair(A,an_a_nonce))). [resolve(1,b,2,a)].
% 0.76/1.01 3 message(sent(b,t,triple(b,generate_b_nonce(A),encrypt(triple(B,A,generate_expiration_time(A)),bt)))) | -fresh_to_b(A) | -message(sent(B,b,pair(B,A))) # label(b_creates_freash_nonces_in_time_10) # label(axiom). [assumption].
% 0.76/1.01 Derived: 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)))) | -message(sent(A,b,pair(A,an_a_nonce))). [resolve(3,b,2,a)].
% 0.76/1.01 4 -a_key(A) | -a_nonce(A) # label(nothing_is_a_nonce_and_a_key_38) # label(axiom). [assumption].
% 0.76/1.01 5 a_nonce(an_a_nonce) # label(an_a_nonce_is_a_nonce_34) # label(axiom). [assumption].
% 0.76/1.01 6 a_nonce(generate_expiration_time(A)) # label(generated_times_and_nonces_are_nonces_36) # label(axiom). [assumption].
% 0.76/1.01 7 a_nonce(generate_b_nonce(A)) # label(generated_times_and_nonces_are_nonces_37) # label(axiom). [assumption].
% 0.76/1.01 Derived: -a_key(an_a_nonce). [resolve(4,b,5,a)].
% 0.76/1.01 Derived: -a_key(generate_expiration_time(A)). [resolve(4,b,6,a)].
% 0.76/1.01 Derived: -a_key(generate_b_nonce(A)). [resolve(4,b,7,a)].
% 0.76/1.01 8 message(sent(t,A,triple(encrypt(quadruple(B,C,generate_key(C),D),E),encrypt(triple(A,generate_key(C),D),F),V6))) | -a_nonce(C) | -message(sent(B,t,triple(B,V6,encrypt(triple(A,C,D),F)))) | -t_holds(key(E,A)) | -t_holds(key(F,B)) # label(server_t_generates_key_16) # label(axiom). [assumption].
% 0.76/1.01 Derived: message(sent(t,A,triple(encrypt(quadruple(B,an_a_nonce,generate_key(an_a_nonce),C),D),encrypt(triple(A,generate_key(an_a_nonce),C),E),F))) | -message(sent(B,t,triple(B,F,encrypt(triple(A,an_a_nonce,C),E)))) | -t_holds(key(D,A)) | -t_holds(key(E,B)). [resolve(8,b,5,a)].
% 0.76/1.01 Derived: message(sent(t,A,triple(encrypt(quadruple(B,generate_expiration_time(C),generate_key(generate_expiration_time(C)),D),E),encrypt(triple(A,generate_key(generate_expiration_time(C)),D),F),V6))) | -message(sent(B,t,triple(B,V6,encrypt(triple(A,generate_expiration_time(C),D),F)))) | -t_holds(key(E,A)) | -t_holds(key(F,B)). [resolve(8,b,6,a)].
% 0.76/1.01 Derived: message(sent(t,A,triple(encrypt(quadruple(B,generate_b_nonce(C),generate_key(generate_b_nonce(C)),D),E),encrypt(triple(A,generate_key(generate_b_nonce(C)),D),F),V6))) | -message(sent(B,t,triple(B,V6,encrypt(triple(A,generate_b_nonce(C),D),F)))) | -t_holds(key(E,A)) | -t_holds(key(F,B)). [resolve(8,b,7,a)].
% 0.76/1.01 9 b_holds(key(A,B)) | -a_key(A) | -b_stored(pair(B,C)) | -message(sent(B,b,pair(encrypt(triple(B,A,generate_expiration_time(C)),bt),encrypt(generate_b_nonce(C),A)))) # label(b_accepts_secure_session_key_12) # label(axiom). [assumption].
% 0.76/1.01 10 a_key(generate_key(A)) # label(generated_keys_are_keys_39) # label(axiom). [assumption].
% 0.76/1.01 Derived: b_holds(key(generate_key(A),B)) | -b_stored(pair(B,C)) | -message(sent(B,b,pair(encrypt(triple(B,generate_key(A),generate_expiration_time(C)),bt),encrypt(generate_b_nonce(C),generate_key(A))))). [resolve(9,b,10,a)].
% 0.76/1.01 11 -a_key(an_a_nonce). [resolve(4,b,5,a)].
% 0.76/1.01 12 -a_key(generate_expiration_time(A)). [resolve(4,b,6,a)].
% 0.76/1.01 13 -a_key(generate_b_nonce(A)). [resolve(4,b,7,a)].
% 0.76/1.01 14 message(sent(a,A,pair(B,encrypt(C,D)))) | -a_stored(pair(A,E)) | -message(sent(t,a,triple(encrypt(quadruple(A,E,D,F),at),B,C))) # label(a_forwards_secure_5) # label(axiom). [assumption].
% 0.76/1.01 15 a_stored(pair(b,an_a_nonce)) # label(a_stored_message_i_4) # label(axiom). [assumption].
% 0.76/1.01 Derived: message(sent(a,b,pair(A,encrypt(B,C)))) | -message(sent(t,a,triple(encrypt(quadruple(b,an_a_nonce,C,D),at),A,B))). [resolve(14,b,15,a)].
% 0.76/1.01 16 -b_holds(key(A,B)) | -intruder_holds(key(A,C)) # label(co1_40) # label(negated_conjecture). [assumption].
% 0.76/1.01 17 b_holds(key(bt,t)) # label(b_hold_key_bt_for_t_7) # label(axiom). [assumption].
% 0.76/1.01 Derived: -intruder_holds(key(bt,A)). [resolve(16,a,17,a)].
% 0.76/1.01 18 b_holds(key(generate_key(A),B)) | -b_stored(pair(B,C)) | -message(sent(B,b,pair(encrypt(triple(B,generate_key(A),generate_expiration_time(C)),bt),encrypt(generate_b_nonce(C),generate_key(A))))). [resolve(9,b,10,a)].
% 0.76/1.01 Derived: -b_stored(pair(A,B)) | -message(sent(A,b,pair(encrypt(triple(A,generate_key(C),generate_expiration_time(B)),bt),encrypt(generate_b_nonce(B),generate_key(C))))) | -intruder_holds(key(generate_key(C),D)). [resolve(18,a,16,a)].
% 0.76/1.01 19 intruder_message(A) | -intruder_holds(key(A,B)) | -intruder_message(encrypt(C,A)) | -party_of_protocol(B) # label(intruder_interception_30) # label(axiom). [assumption].
% 0.76/1.01 20 intruder_holds(key(A,B)) | -intruder_message(A) | -party_of_protocol(B) # label(intruder_holds_key_32) # label(axiom). [assumption].
% 0.76/1.01 21 intruder_message(encrypt(A,B)) | -intruder_holds(key(B,C)) | -intruder_message(A) | -party_of_protocol(C) # label(intruder_key_encrypts_33) # label(axiom). [assumption].
% 0.76/1.01 Derived: intruder_message(encrypt(A,B)) | -intruder_message(A) | -party_of_protocol(C) | -intruder_message(B) | -party_of_protocol(C). [resolve(21,b,20,a)].
% 0.76/1.01 22 -intruder_holds(key(bt,A)). [resolve(16,a,17,a)].
% 0.76/1.01 Derived: -intruder_message(bt) | -party_of_protocol(A). [resolve(22,a,20,a)].
% 0.76/1.01 23 -b_stored(pair(A,B)) | -message(sent(A,b,pair(encrypt(triple(A,generate_key(C),generate_expiration_time(B)),bt),encrypt(generate_b_nonce(B),generate_key(C))))) | -intruder_holds(key(generate_key(C),D)). [resolve(18,a,16,a)].
% 0.76/1.01 Derived: -b_stored(pair(A,B)) | -message(sent(A,b,pair(encrypt(triple(A,generate_key(C),generate_expiration_time(B)),bt),encrypt(generate_b_nonce(B),generate_key(C))))) | -intruder_message(generate_key(C)) | -party_of_protocol(D). [resolve(23,c,20,a)].
% 0.76/1.01 24 -b_stored(pair(A,B)) | -message(sent(A,b,pair(encrypt(triple(A,generate_key(C),generate_expiration_time(B)),bt),encrypt(gene
% 0.76/1.01 WARNING: denials share constants (see output).
% 0.76/1.01
% 300.04/300.32 Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------