0.03/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.12/0.34	% Computer : n003.cluster.edu
0.12/0.34	% Model    : x86_64 x86_64
0.12/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory   : 8042.1875MB
0.12/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit : 960
0.12/0.34	% WCLimit  : 120
0.12/0.34	% DateTime : Tue Aug  9 03:00:51 EDT 2022
0.12/0.34	% CPUTime  : 
0.67/0.94	============================== Prover9 ===============================
0.67/0.94	Prover9 (32) version 2009-11A, November 2009.
0.67/0.94	Process 9761 was started by sandbox on n003.cluster.edu,
0.67/0.94	Tue Aug  9 03:00:51 2022
0.67/0.94	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_9525_n003.cluster.edu".
0.67/0.94	============================== end of head ===========================
0.67/0.94	
0.67/0.94	============================== INPUT =================================
0.67/0.94	
0.67/0.94	% Reading from file /tmp/Prover9_9525_n003.cluster.edu
0.67/0.94	
0.67/0.94	set(prolog_style_variables).
0.67/0.94	set(auto2).
0.67/0.94	    % set(auto2) -> set(auto).
0.67/0.94	    % set(auto) -> set(auto_inference).
0.67/0.94	    % set(auto) -> set(auto_setup).
0.67/0.94	    % set(auto_setup) -> set(predicate_elim).
0.67/0.94	    % set(auto_setup) -> assign(eq_defs, unfold).
0.67/0.94	    % set(auto) -> set(auto_limits).
0.67/0.94	    % set(auto_limits) -> assign(max_weight, "100.000").
0.67/0.94	    % set(auto_limits) -> assign(sos_limit, 20000).
0.67/0.94	    % set(auto) -> set(auto_denials).
0.67/0.94	    % set(auto) -> set(auto_process).
0.67/0.94	    % set(auto2) -> assign(new_constants, 1).
0.67/0.94	    % set(auto2) -> assign(fold_denial_max, 3).
0.67/0.94	    % set(auto2) -> assign(max_weight, "200.000").
0.67/0.94	    % set(auto2) -> assign(max_hours, 1).
0.67/0.94	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.67/0.94	    % set(auto2) -> assign(max_seconds, 0).
0.67/0.94	    % set(auto2) -> assign(max_minutes, 5).
0.67/0.94	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.67/0.94	    % set(auto2) -> set(sort_initial_sos).
0.67/0.94	    % set(auto2) -> assign(sos_limit, -1).
0.67/0.94	    % set(auto2) -> assign(lrs_ticks, 3000).
0.67/0.94	    % set(auto2) -> assign(max_megs, 400).
0.67/0.94	    % set(auto2) -> assign(stats, some).
0.67/0.94	    % set(auto2) -> clear(echo_input).
0.67/0.94	    % set(auto2) -> set(quiet).
0.67/0.94	    % set(auto2) -> clear(print_initial_clauses).
0.67/0.94	    % set(auto2) -> clear(print_given).
0.67/0.94	assign(lrs_ticks,-1).
0.67/0.94	assign(sos_limit,10000).
0.67/0.94	assign(order,kbo).
0.67/0.94	set(lex_order_vars).
0.67/0.94	clear(print_given).
0.67/0.94	
0.67/0.94	% formulas(sos).  % not echoed (25 formulas)
0.67/0.94	
0.67/0.94	============================== end of input ==========================
0.67/0.94	
0.67/0.94	% From the command line: assign(max_seconds, 960).
0.67/0.94	
0.67/0.94	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.67/0.94	
0.67/0.94	% Formulas that are not ordinary clauses:
0.67/0.94	1 (all U all V V = enc(i(U),enc(U,V))) # label(enc_dec_cancel) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	2 (all U all V all W (p(U) & p(W) & p(V) -> p(enc(enc(i(tc),U),V)))) # label(data_encrypt) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	3 (all U all V all W (p(V) & p(W) & p(U) -> p(enc(enc(i(tmk),V),enc(i(tc),U))))) # label(encrypt_a_stored_comms_key) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	4 (all U i(i(U)) = U) # label(double_inverse_cancel) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	5 (all U (p(U) -> p(i(U)))) # label(keys_are_symmetric) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	6 (all U all V all W (p(W) & p(V) & p(U) -> p(enc(wk,enc(i(tmk),U))))) # label(receive_working_key_from_switch) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	7 (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.67/0.94	8 (all U all V V = enc(U,enc(i(U),V))) # label(dec_enc_cancel) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	9 (all U all V all W (p(W) & p(V) & p(U) -> 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.67/0.94	10 (all U all V all W (p(W) & p(V) & p(U) -> p(enc(tmk,enc(i(enc(i(zcmk),V)),U))))) # label(key_translate_from_ZCMK_to_TMK) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	11 (all U all V all W (p(V) & p(W) & p(U) -> p(enc(tc,U)))) # label(encrypt_clear_key_as_Tcomms_key) # label(axiom) # label(non_clause).  [assumption].
0.67/0.94	12 (all U all V all W (p(U) & p(W) & p(V) -> 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.67/0.94	13 (all U all V all W (p(V) & p(W) & p(U) -> 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.88/1.17	14 (all U all V all W (p(U) & p(V) & p(W) -> 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].
0.88/1.17	15 (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.88/1.17	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].
0.88/1.17	
0.88/1.17	============================== end of process non-clausal formulas ===
0.88/1.17	
0.88/1.17	============================== PROCESS INITIAL CLAUSES ===============
0.88/1.17	
0.88/1.17	============================== PREDICATE ELIMINATION =================
0.88/1.17	
0.88/1.17	============================== end predicate elimination =============
0.88/1.17	
0.88/1.17	Auto_denials:
0.88/1.17	  % copying label co1 to answer in negative clause
0.88/1.17	
0.88/1.17	Term ordering decisions:
0.88/1.17	
0.88/1.17	% Assigning unary symbol i kb_weight 0 and highest precedence (16).
0.88/1.17	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.
0.88/1.17	
0.88/1.17	============================== end of process initial clauses ========
0.88/1.17	
0.88/1.17	============================== CLAUSES FOR SEARCH ====================
0.88/1.17	
0.88/1.17	============================== end of clauses for search =============
0.88/1.17	
0.88/1.17	============================== SEARCH ================================
0.88/1.17	
0.88/1.17	% Starting search at 0.02 seconds.
0.88/1.17	
0.88/1.17	============================== PROOF =================================
0.88/1.17	% SZS status Theorem
0.88/1.17	% SZS output start Refutation
0.88/1.17	
0.88/1.17	% Proof 1 at 0.23 (+ 0.01) seconds: co1.
0.88/1.17	% Length of proof is 13.
0.88/1.17	% Level of proof is 4.
0.88/1.17	% Maximum clause weight is 16.000.
0.88/1.17	% Given clauses 29.
0.88/1.17	
0.88/1.17	1 (all U all V V = enc(i(U),enc(U,V))) # label(enc_dec_cancel) # label(axiom) # label(non_clause).  [assumption].
0.88/1.17	3 (all U all V all W (p(V) & p(W) & p(U) -> p(enc(enc(i(tmk),V),enc(i(tc),U))))) # label(encrypt_a_stored_comms_key) # label(axiom) # label(non_clause).  [assumption].
0.88/1.17	11 (all U all V all W (p(V) & p(W) & p(U) -> p(enc(tc,U)))) # label(encrypt_clear_key_as_Tcomms_key) # label(axiom) # label(non_clause).  [assumption].
0.88/1.17	18 p(a) # label(intruder_knows_8) # label(axiom).  [assumption].
0.88/1.17	23 p(enc(tmk,pp)) # label(intruder_knows_1) # label(axiom).  [assumption].
0.88/1.17	24 p(enc(wk,w)) # label(intruder_knows_2) # label(axiom).  [assumption].
0.88/1.17	26 enc(i(A),enc(A,B)) = B # label(enc_dec_cancel) # label(axiom).  [clausify(1)].
0.88/1.17	28 -p(enc(pp,a)) # label(co1) # label(negated_conjecture) # answer(co1).  [assumption].
0.88/1.17	30 -p(A) | -p(B) | -p(C) | p(enc(tc,C)) # label(encrypt_clear_key_as_Tcomms_key) # label(axiom).  [clausify(11)].
0.88/1.17	35 -p(A) | -p(B) | -p(C) | p(enc(enc(i(tmk),A),enc(i(tc),C))) # label(encrypt_a_stored_comms_key) # label(axiom).  [clausify(3)].
0.88/1.17	54 p(enc(tc,a)).  [hyper(30,a,24,a,b,24,a,c,18,a)].
0.88/1.17	3498 p(enc(pp,a)).  [hyper(35,a,23,a,b,54,a,c,54,a),rewrite([26(6),26(7)])].
0.88/1.17	3499 $F # answer(co1).  [resolve(3498,a,28,a)].
0.88/1.17	
0.88/1.17	% SZS output end Refutation
0.88/1.17	============================== end of proof ==========================
0.88/1.17	
0.88/1.17	============================== STATISTICS ============================
0.88/1.17	
0.88/1.17	Given=29. Generated=14941. Kept=3482. proofs=1.
0.88/1.17	Usable=29. Sos=2723. Demods=3. Limbo=729, Disabled=25. Hints=0.
0.88/1.17	Megabytes=2.71.
0.88/1.17	User_CPU=0.23, System_CPU=0.01, Wall_clock=0.
0.88/1.17	
0.88/1.17	============================== end of statistics =====================
0.88/1.17	
0.88/1.17	============================== end of search =========================
0.88/1.17	
0.88/1.17	THEOREM PROVED
0.88/1.17	% SZS status Theorem
0.88/1.17	
0.88/1.17	Exiting with 1 proof.
0.88/1.17	
0.88/1.17	Process 9761 exit (max_proofs) Tue Aug  9 03:00:51 2022
0.88/1.17	Prover9 interrupted
0.88/1.18	EOF