0.04/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.14	% Command    : tptp2X_and_run_prover9 %d %s
0.14/0.35	% Computer   : n024.cluster.edu
0.14/0.35	% Model      : x86_64 x86_64
0.14/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory     : 8042.1875MB
0.14/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 180
0.14/0.35	% DateTime   : Thu Aug 29 09:27:20 EDT 2019
0.14/0.35	% CPUTime    : 
0.48/1.06	============================== Prover9 ===============================
0.48/1.06	Prover9 (32) version 2009-11A, November 2009.
0.48/1.06	Process 1489 was started by sandbox2 on n024.cluster.edu,
0.48/1.06	Thu Aug 29 09:27:21 2019
0.48/1.06	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_1334_n024.cluster.edu".
0.48/1.06	============================== end of head ===========================
0.48/1.06	
0.48/1.06	============================== INPUT =================================
0.48/1.06	
0.48/1.06	% Reading from file /tmp/Prover9_1334_n024.cluster.edu
0.48/1.06	
0.48/1.06	set(prolog_style_variables).
0.48/1.06	set(auto2).
0.48/1.06	    % set(auto2) -> set(auto).
0.48/1.06	    % set(auto) -> set(auto_inference).
0.48/1.06	    % set(auto) -> set(auto_setup).
0.48/1.06	    % set(auto_setup) -> set(predicate_elim).
0.48/1.06	    % set(auto_setup) -> assign(eq_defs, unfold).
0.48/1.06	    % set(auto) -> set(auto_limits).
0.48/1.06	    % set(auto_limits) -> assign(max_weight, "100.000").
0.48/1.06	    % set(auto_limits) -> assign(sos_limit, 20000).
0.48/1.06	    % set(auto) -> set(auto_denials).
0.48/1.06	    % set(auto) -> set(auto_process).
0.48/1.06	    % set(auto2) -> assign(new_constants, 1).
0.48/1.06	    % set(auto2) -> assign(fold_denial_max, 3).
0.48/1.06	    % set(auto2) -> assign(max_weight, "200.000").
0.48/1.06	    % set(auto2) -> assign(max_hours, 1).
0.48/1.06	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.48/1.06	    % set(auto2) -> assign(max_seconds, 0).
0.48/1.06	    % set(auto2) -> assign(max_minutes, 5).
0.48/1.06	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.48/1.06	    % set(auto2) -> set(sort_initial_sos).
0.48/1.06	    % set(auto2) -> assign(sos_limit, -1).
0.48/1.06	    % set(auto2) -> assign(lrs_ticks, 3000).
0.48/1.06	    % set(auto2) -> assign(max_megs, 400).
0.48/1.06	    % set(auto2) -> assign(stats, some).
0.48/1.06	    % set(auto2) -> clear(echo_input).
0.48/1.06	    % set(auto2) -> set(quiet).
0.48/1.06	    % set(auto2) -> clear(print_initial_clauses).
0.48/1.06	    % set(auto2) -> clear(print_given).
0.48/1.06	assign(lrs_ticks,-1).
0.48/1.06	assign(sos_limit,10000).
0.48/1.06	assign(order,kbo).
0.48/1.06	set(lex_order_vars).
0.48/1.06	clear(print_given).
0.48/1.06	
0.48/1.06	% formulas(sos).  % not echoed (25 formulas)
0.48/1.06	
0.48/1.06	============================== end of input ==========================
0.48/1.06	
0.48/1.06	% From the command line: assign(max_seconds, 180).
0.48/1.06	
0.48/1.06	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.48/1.06	
0.48/1.06	% Formulas that are not ordinary clauses:
0.48/1.06	1 (all U all V all W (p(U) & p(V) & p(W) -> p(enc(enc(i(tc),U),V)))) # label(data_encrypt) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	2 (all U i(i(U)) = U) # label(double_inverse_cancel) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	3 (all U all V all W (p(U) & p(W) & p(V) -> p(enc(tc,U)))) # label(encrypt_clear_key_as_Tcomms_key) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	4 (all U all V all W (p(U) & p(V) & p(W) -> p(enc(i(enc(i(tc),U)),V)))) # label(data_decrypt) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	5 (all U all V V = enc(i(U),enc(U,V))) # label(enc_dec_cancel) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	6 (all U all V all W (p(U) & p(V) & p(W) -> p(enc(enc(i(tmk),V),enc(i(tmk),U))))) # label(encrypt_a_PIN_derivation_key_under_a_TMK) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	7 (all U all V all W (p(U) & p(V) & p(W) -> p(enc(wk,enc(i(tmk),U))))) # label(receive_working_key_from_switch) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	8 (all U all V all W (p(U) & p(W) & p(V) -> p(enc(enc(i(wk),W),enc(i(enc(i(tmk),V)),U))))) # label(data_translate_PIN_from_local_to_interchange_key) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	9 (all U all V all W (p(W) & p(V) & p(U) -> p(enc(i(enc(i(zcmk),V)),enc(i(tmk),U))))) # label(key_translate_from_TMK_to_ZCMK) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	10 (all U all V all W (p(U) & p(W) & p(V) -> p(enc(tmk,enc(i(enc(i(zcmk),V)),U))))) # label(key_translate_from_ZCMK_to_TMK) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	11 (all U all V V = enc(U,enc(i(U),V))) # label(dec_enc_cancel) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	12 (all U all V all W (p(U) & p(W) & p(V) -> p(enc(enc(i(wk),V),enc(i(lp),U))))) # label(data_translate_PIN_from_local_storage_to_interchange_key) # label(axiom) # label(non_clause).  [assumption].
0.48/1.06	13 (all U all V all W (p(U) & p(W) & p(V) -> p(enc(enc(i(tmk),V),enc(i(tc),U))))) # label(encrypt_a_stored_comms_key) # label(axiom) # label(non_clause).  [assumption].
1.00/1.30	14 (all U all V all W (p(W) & p(V) & p(U) -> p(enc(enc(i(wk),W),enc(i(enc(i(wk),V)),U))))) # label(data_translate_between_interchange_keys) # label(axiom) # label(non_clause).  [assumption].
1.00/1.30	15 (all U (p(U) -> p(i(U)))) # label(keys_are_symmetric) # label(axiom) # label(non_clause).  [assumption].
1.00/1.30	16 (all U all V all W (p(V) & p(W) & p(U) -> p(enc(U,V)))) # label(attacker_can_encrypt) # label(axiom) # label(non_clause).  [assumption].
1.00/1.30	
1.00/1.30	============================== end of process non-clausal formulas ===
1.00/1.30	
1.00/1.30	============================== PROCESS INITIAL CLAUSES ===============
1.00/1.30	
1.00/1.30	============================== PREDICATE ELIMINATION =================
1.00/1.30	
1.00/1.30	============================== end predicate elimination =============
1.00/1.30	
1.00/1.30	Auto_denials:
1.00/1.30	  % copying label co1 to answer in negative clause
1.00/1.30	
1.00/1.30	Term ordering decisions:
1.00/1.30	
1.00/1.30	% Assigning unary symbol i kb_weight 0 and highest precedence (16).
1.00/1.30	Function symbol KB weights:  tmk=1. wk=1. tc=1. kk=1. lp=1. w=1. zcmk=1. a=1. k=1. pp=1. t1=1. t2=1. enc=1. i=0.
1.00/1.30	
1.00/1.30	============================== end of process initial clauses ========
1.00/1.30	
1.00/1.30	============================== CLAUSES FOR SEARCH ====================
1.00/1.30	
1.00/1.30	============================== end of clauses for search =============
1.00/1.30	
1.00/1.30	============================== SEARCH ================================
1.00/1.30	
1.00/1.30	% Starting search at 0.01 seconds.
1.00/1.30	
1.00/1.30	============================== PROOF =================================
1.00/1.30	% SZS status Theorem
1.00/1.30	% SZS output start Refutation
1.00/1.30	
1.00/1.30	% Proof 1 at 0.23 (+ 0.02) seconds: co1.
1.00/1.30	% Length of proof is 13.
1.00/1.30	% Level of proof is 4.
1.00/1.30	% Maximum clause weight is 16.000.
1.00/1.30	% Given clauses 29.
1.00/1.30	
1.00/1.30	3 (all U all V all W (p(U) & p(W) & p(V) -> p(enc(tc,U)))) # label(encrypt_clear_key_as_Tcomms_key) # label(axiom) # label(non_clause).  [assumption].
1.00/1.30	5 (all U all V V = enc(i(U),enc(U,V))) # label(enc_dec_cancel) # label(axiom) # label(non_clause).  [assumption].
1.00/1.30	13 (all U all V all W (p(U) & p(W) & p(V) -> p(enc(enc(i(tmk),V),enc(i(tc),U))))) # label(encrypt_a_stored_comms_key) # label(axiom) # label(non_clause).  [assumption].
1.00/1.30	18 p(a) # label(intruder_knows_8) # label(axiom).  [assumption].
1.00/1.30	21 p(enc(tmk,pp)) # label(intruder_knows_1) # label(axiom).  [assumption].
1.00/1.30	24 p(enc(tc,k)) # label(intruder_knows_5) # label(axiom).  [assumption].
1.00/1.30	26 enc(i(A),enc(A,B)) = B # label(enc_dec_cancel) # label(axiom).  [clausify(5)].
1.00/1.30	28 -p(enc(pp,a)) # label(co1) # label(negated_conjecture) # answer(co1).  [assumption].
1.00/1.30	30 -p(A) | -p(B) | -p(C) | p(enc(tc,A)) # label(encrypt_clear_key_as_Tcomms_key) # label(axiom).  [clausify(3)].
1.00/1.30	38 -p(A) | -p(B) | -p(C) | p(enc(enc(i(tmk),C),enc(i(tc),A))) # label(encrypt_a_stored_comms_key) # label(axiom).  [clausify(13)].
1.00/1.30	54 p(enc(tc,a)).  [hyper(30,a,18,a,b,24,a,c,24,a)].
1.00/1.30	3447 p(enc(pp,a)).  [hyper(38,a,54,a,b,54,a,c,21,a),rewrite([26(6),26(7)])].
1.00/1.30	3448 $F # answer(co1).  [resolve(3447,a,28,a)].
1.00/1.30	
1.00/1.30	% SZS output end Refutation
1.00/1.30	============================== end of proof ==========================
1.00/1.30	
1.00/1.30	============================== STATISTICS ============================
1.00/1.30	
1.00/1.30	Given=29. Generated=13935. Kept=3431. proofs=1.
1.00/1.30	Usable=29. Sos=2723. Demods=3. Limbo=678, Disabled=25. Hints=0.
1.00/1.30	Megabytes=2.68.
1.00/1.30	User_CPU=0.23, System_CPU=0.02, Wall_clock=0.
1.00/1.30	
1.00/1.30	============================== end of statistics =====================
1.00/1.30	
1.00/1.30	============================== end of search =========================
1.00/1.30	
1.00/1.30	THEOREM PROVED
1.00/1.30	% SZS status Theorem
1.00/1.30	
1.00/1.30	Exiting with 1 proof.
1.00/1.30	
1.00/1.30	Process 1489 exit (max_proofs) Thu Aug 29 09:27:21 2019
1.00/1.30	Prover9 interrupted
1.00/1.30	EOF