TSTP Solution File: SWW959+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWW959+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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 : Thu Jul 21 01:17:59 EDT 2022
% Result : Theorem 182.21s 182.47s
% Output : Refutation 182.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWW959+1 : TPTP v8.1.0. Released v7.4.0.
% 0.13/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n021.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 : Sun Jun 5 15:28:49 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.48/1.06 ============================== Prover9 ===============================
% 0.48/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.06 Process 10671 was started by sandbox on n021.cluster.edu,
% 0.48/1.06 Sun Jun 5 15:28:50 2022
% 0.48/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10518_n021.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_10518_n021.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 (169 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, 300).
% 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 VAR_K_18 all VAR_M_17 constr_adec(constr_aenc(VAR_M_17,constr_pkey(VAR_K_18)),VAR_K_18) = VAR_M_17) # label(ax78) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 2 (all VAR_K_16 all VAR_M_15 constr_dec(constr_enc(VAR_M_15,VAR_K_16),VAR_K_16) = VAR_M_15) # label(ax79) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 3 (all VAR_K_14 all VAR_M_13 constr_getmess(constr_sign(VAR_M_13,VAR_K_14)) = VAR_M_13) # label(ax80) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 4 (all VAR_K_0X30 all VAR_M_0X30 constr_checksign(constr_sign(VAR_M_0X30,VAR_K_0X30),constr_pkey(VAR_K_0X30)) = VAR_M_0X30) # label(ax81) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 5 (all VAR_X0X30_11 all VAR_X1_12 constr_tuple_2_get_1_bitstring(tuple_2(VAR_X0X30_11,VAR_X1_12)) = VAR_X1_12) # label(ax82) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 6 (all VAR_X0X30_9 all VAR_X1_10X30 constr_tuple_2_get_0x30_bitstring(tuple_2(VAR_X0X30_9,VAR_X1_10X30)) = VAR_X0X30_9) # label(ax83) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 7 (all VAR_X0X30_7 all VAR_X1_8 constr_tuple_2_get_1(tuple_2(VAR_X0X30_7,VAR_X1_8)) = VAR_X1_8) # label(ax84) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 8 (all VAR_X0X30_0X30 all VAR_X1_0X30 constr_tuple_2_get_0x30(tuple_2(VAR_X0X30_0X30,VAR_X1_0X30)) = VAR_X0X30_0X30) # label(ax85) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 9 (all VAR_X_35 all VAR_Y_36 pred_eq_bitstring_bitstring(VAR_X_35,VAR_Y_36)) # label(ax86) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 10 (all VAR_V_42 (pred_attacker(VAR_V_42) -> pred_attacker(constr_tuple_2_get_1_bitstring(VAR_V_42)))) # label(ax87) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 11 (all VAR_V_44 (pred_attacker(VAR_V_44) -> pred_attacker(constr_tuple_2_get_1(VAR_V_44)))) # label(ax88) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 12 (all VAR_V_46 (pred_attacker(VAR_V_46) -> pred_attacker(constr_tuple_2_get_0x30_bitstring(VAR_V_46)))) # label(ax89) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 13 (all VAR_V_48 (pred_attacker(VAR_V_48) -> pred_attacker(constr_tuple_2_get_0x30(VAR_V_48)))) # label(ax90) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 14 (all VAR_V_51 all VAR_V_52 (pred_attacker(VAR_V_51) & pred_attacker(VAR_V_52) -> pred_attacker(constr_sign(VAR_V_51,VAR_V_52)))) # label(ax92) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 15 (all VAR_V_54 (pred_attacker(VAR_V_54) -> pred_attacker(constr_pkey(VAR_V_54)))) # label(ax93) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 16 (all VAR_V_56 (pred_attacker(VAR_V_56) -> pred_attacker(tuple_out_3(VAR_V_56)))) # label(ax94) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 17 (all VAR_V_59 (pred_attacker(tuple_out_3(VAR_V_59)) -> pred_attacker(VAR_V_59))) # label(ax95) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 18 (all VAR_V_62 (pred_attacker(VAR_V_62) -> pred_attacker(tuple_out_2(VAR_V_62)))) # label(ax96) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 19 (all VAR_V_65 (pred_attacker(tuple_out_2(VAR_V_65)) -> pred_attacker(VAR_V_65))) # label(ax97) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 20 (all VAR_V_68 (pred_attacker(VAR_V_68) -> pred_attacker(tuple_out_1(VAR_V_68)))) # label(ax98) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 21 (all VAR_V_71 (pred_attacker(tuple_out_1(VAR_V_71)) -> pred_attacker(VAR_V_71))) # label(ax99) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 22 (all VAR_V_75 (pred_attacker(VAR_V_75) -> pred_attacker(tuple_key_retrieval_server_out_2(VAR_V_75)))) # label(ax100) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 23 (all VAR_V_78 (pred_attacker(tuple_key_retrieval_server_out_2(VAR_V_78)) -> pred_attacker(VAR_V_78))) # label(ax101) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 24 (all VAR_V_82 all VAR_V_83 (pred_attacker(VAR_V_82) & pred_attacker(VAR_V_83) -> pred_attacker(tuple_key_retrieval_server_in_1(VAR_V_82,VAR_V_83)))) # label(ax102) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 25 (all VAR_V_90X30 all VAR_V_91 (pred_attacker(tuple_key_retrieval_server_in_1(VAR_V_90X30,VAR_V_91)) -> pred_attacker(VAR_V_90X30))) # label(ax103) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 26 (all VAR_V_93 all VAR_V_94 (pred_attacker(tuple_key_retrieval_server_in_1(VAR_V_93,VAR_V_94)) -> pred_attacker(VAR_V_94))) # label(ax104) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 27 (all VAR_V_98 all VAR_V_99 (pred_attacker(VAR_V_98) & pred_attacker(VAR_V_99) -> pred_attacker(tuple_key_register_server_in_1(VAR_V_98,VAR_V_99)))) # label(ax105) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 28 (all VAR_V_10X306 all VAR_V_10X307 (pred_attacker(tuple_key_register_server_in_1(VAR_V_10X306,VAR_V_10X307)) -> pred_attacker(VAR_V_10X306))) # label(ax106) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 29 (all VAR_V_10X309 all VAR_V_110X30 (pred_attacker(tuple_key_register_server_in_1(VAR_V_10X309,VAR_V_110X30)) -> pred_attacker(VAR_V_110X30))) # label(ax107) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 30 (all VAR_V_113 (pred_attacker(VAR_V_113) -> pred_attacker(constr_getmess(VAR_V_113)))) # label(ax108) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 31 (all VAR_V_116 all VAR_V_117 (pred_attacker(VAR_V_116) & pred_attacker(VAR_V_117) -> pred_attacker(constr_enc(VAR_V_116,VAR_V_117)))) # label(ax110) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 32 (all VAR_V_120X30 all VAR_V_121 (pred_attacker(VAR_V_120X30) & pred_attacker(VAR_V_121) -> pred_attacker(constr_dec(VAR_V_120X30,VAR_V_121)))) # label(ax111) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 33 (all VAR_V_123 (pred_attacker(VAR_V_123) -> pred_attacker(tuple_client_B_out_6(VAR_V_123)))) # label(ax112) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 34 (all VAR_V_126 (pred_attacker(tuple_client_B_out_6(VAR_V_126)) -> pred_attacker(VAR_V_126))) # label(ax113) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.06 35 (all VAR_V_129 (pred_attacker(VAR_V_129) -> pred_attacker(tuple_client_B_out_4(VAR_V_129)))) # label(ax114) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 36 (all VAR_V_132 (pred_attacker(tuple_client_B_out_4(VAR_V_132)) -> pred_attacker(VAR_V_132))) # label(ax115) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 37 (all VAR_V_136 all VAR_V_137 (pred_attacker(VAR_V_136) & pred_attacker(VAR_V_137) -> pred_attacker(tuple_client_B_out_1(VAR_V_136,VAR_V_137)))) # label(ax116) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 38 (all VAR_V_144 all VAR_V_145 (pred_attacker(tuple_client_B_out_1(VAR_V_144,VAR_V_145)) -> pred_attacker(VAR_V_144))) # label(ax117) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 39 (all VAR_V_147 all VAR_V_148 (pred_attacker(tuple_client_B_out_1(VAR_V_147,VAR_V_148)) -> pred_attacker(VAR_V_148))) # label(ax118) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 40 (all VAR_V_151 (pred_attacker(VAR_V_151) -> pred_attacker(tuple_client_B_in_5(VAR_V_151)))) # label(ax119) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 41 (all VAR_V_154 (pred_attacker(tuple_client_B_in_5(VAR_V_154)) -> pred_attacker(VAR_V_154))) # label(ax120) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 42 (all VAR_V_157 (pred_attacker(VAR_V_157) -> pred_attacker(tuple_client_B_in_3(VAR_V_157)))) # label(ax121) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 43 (all VAR_V_160X30 (pred_attacker(tuple_client_B_in_3(VAR_V_160X30)) -> pred_attacker(VAR_V_160X30))) # label(ax122) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 44 (all VAR_V_163 (pred_attacker(VAR_V_163) -> pred_attacker(tuple_client_B_in_2(VAR_V_163)))) # label(ax123) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 45 (all VAR_V_166 (pred_attacker(tuple_client_B_in_2(VAR_V_166)) -> pred_attacker(VAR_V_166))) # label(ax124) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 46 (all VAR_V_169 (pred_attacker(VAR_V_169) -> pred_attacker(tuple_client_A_out_5(VAR_V_169)))) # label(ax125) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 47 (all VAR_V_172 (pred_attacker(tuple_client_A_out_5(VAR_V_172)) -> pred_attacker(VAR_V_172))) # label(ax126) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 48 (all VAR_V_175 (pred_attacker(VAR_V_175) -> pred_attacker(tuple_client_A_out_3(VAR_V_175)))) # label(ax127) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 49 (all VAR_V_178 (pred_attacker(tuple_client_A_out_3(VAR_V_178)) -> pred_attacker(VAR_V_178))) # label(ax128) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 50 (all VAR_V_182 all VAR_V_183 (pred_attacker(VAR_V_182) & pred_attacker(VAR_V_183) -> pred_attacker(tuple_client_A_out_1(VAR_V_182,VAR_V_183)))) # label(ax129) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 51 (all VAR_V_190X30 all VAR_V_191 (pred_attacker(tuple_client_A_out_1(VAR_V_190X30,VAR_V_191)) -> pred_attacker(VAR_V_190X30))) # label(ax130) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 52 (all VAR_V_193 all VAR_V_194 (pred_attacker(tuple_client_A_out_1(VAR_V_193,VAR_V_194)) -> pred_attacker(VAR_V_194))) # label(ax131) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 53 (all VAR_V_197 (pred_attacker(VAR_V_197) -> pred_attacker(tuple_client_A_in_4(VAR_V_197)))) # label(ax132) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 54 (all VAR_V_20X300X30 (pred_attacker(tuple_client_A_in_4(VAR_V_20X300X30)) -> pred_attacker(VAR_V_20X300X30))) # label(ax133) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 55 (all VAR_V_20X303 (pred_attacker(VAR_V_20X303) -> pred_attacker(tuple_client_A_in_2(VAR_V_20X303)))) # label(ax134) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 56 (all VAR_V_20X306 (pred_attacker(tuple_client_A_in_2(VAR_V_20X306)) -> pred_attacker(VAR_V_20X306))) # label(ax135) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 57 (all VAR_V_210X30 all VAR_V_211 (pred_attacker(VAR_V_210X30) & pred_attacker(VAR_V_211) -> pred_attacker(constr_checksign(VAR_V_210X30,VAR_V_211)))) # label(ax136) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 58 (all VAR_V_214 all VAR_V_215 (pred_attacker(VAR_V_214) & pred_attacker(VAR_V_215) -> pred_attacker(constr_aenc(VAR_V_214,VAR_V_215)))) # label(ax137) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 59 (all VAR_V_218 all VAR_V_219 (pred_attacker(VAR_V_218) & pred_attacker(VAR_V_219) -> pred_attacker(constr_adec(VAR_V_218,VAR_V_219)))) # label(ax138) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 60 (all VAR_V_226 all VAR_V_227 (pred_attacker(VAR_V_226) & pred_attacker(VAR_V_227) -> pred_attacker(tuple_2(VAR_V_226,VAR_V_227)))) # label(ax144) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 61 (all VAR_V_234 all VAR_V_235 (pred_attacker(tuple_2(VAR_V_234,VAR_V_235)) -> pred_attacker(VAR_V_234))) # label(ax145) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 62 (all VAR_V_237 all VAR_V_238 (pred_attacker(tuple_2(VAR_V_237,VAR_V_238)) -> pred_attacker(VAR_V_238))) # label(ax146) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 63 (all VAR_V_240X30 all VAR_V_241 (pred_mess(VAR_V_241,VAR_V_240X30) & pred_attacker(VAR_V_241) -> pred_attacker(VAR_V_240X30))) # label(ax147) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 64 (all VAR_V_242 all VAR_V_243 (pred_attacker(VAR_V_243) & pred_attacker(VAR_V_242) -> pred_mess(VAR_V_243,VAR_V_242))) # label(ax148) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 65 (all VAR_V_245 pred_equal(VAR_V_245,VAR_V_245)) # label(ax153) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 66 (all VAR_V_246 pred_attacker(name_new0x2Dname(VAR_V_246))) # label(ax154) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 67 (all VAR_0X40SID_366 all VAR_SIGN_I_PKI_365 (pred_eq_bitstring_bitstring(name_I,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_I_PKI_365,constr_pkey(name_skS)))) & pred_attacker(tuple_client_A_in_2(VAR_SIGN_I_PKI_365)) -> pred_attacker(tuple_client_A_out_3(constr_aenc(tuple_2(name_Na(VAR_0X40SID_366),name_A),constr_tuple_2_get_1_bitstring(constr_checksign(VAR_SIGN_I_PKI_365,constr_pkey(name_skS)))))))) # label(ax161) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 68 (all VAR_0X40SID_414 all VAR_AENC_NA_NI_415 all VAR_SIGN_I_PKI_416 (pred_eq_bitstring_bitstring(name_Na(VAR_0X40SID_414),constr_tuple_2_get_0x30(constr_adec(VAR_AENC_NA_NI_415,name_skA))) & pred_attacker(tuple_client_A_in_4(VAR_AENC_NA_NI_415)) & pred_eq_bitstring_bitstring(name_I,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_I_PKI_416,constr_pkey(name_skS)))) & pred_attacker(tuple_client_A_in_2(VAR_SIGN_I_PKI_416)) -> pred_attacker(tuple_client_A_out_5(constr_aenc(constr_tuple_2_get_1_bitstring(constr_adec(VAR_AENC_NA_NI_415,name_skA)),constr_tuple_2_get_1_bitstring(constr_checksign(VAR_SIGN_I_PKI_416,constr_pkey(name_skS)))))))) # label(ax162) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 69 (all VAR_0X40SID_523 all VAR_AENC_NA_A_521 all VAR_SIGN_A_PKA_522 (pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(VAR_AENC_NA_A_521,name_skB))) & pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_521)) & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_A_PKA_522,constr_pkey(name_skS)))) & pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_522)) -> pred_attacker(tuple_client_B_out_4(constr_aenc(tuple_2(constr_tuple_2_get_0x30_bitstring(constr_adec(VAR_AENC_NA_A_521,name_skB)),name_Nb(VAR_0X40SID_523)),constr_tuple_2_get_1_bitstring(constr_checksign(VAR_SIGN_A_PKA_522,constr_pkey(name_skS)))))))) # label(ax164) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 70 (all VAR_0X40SID_545 all VAR_AENC_NA_A_547 all VAR_AENC_NB_546 all VAR_SIGN_A_PKA_548 (pred_eq_bitstring_bitstring(name_Nb(VAR_0X40SID_545),constr_adec(VAR_AENC_NB_546,name_skB)) & pred_attacker(tuple_client_B_in_5(VAR_AENC_NB_546)) & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(VAR_AENC_NA_A_547,name_skB))) & pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_547)) & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_A_PKA_548,constr_pkey(name_skS)))) & pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_548)) -> pred_attacker(tuple_client_B_out_6(name_objective)))) # label(ax165) # label(axiom) # label(non_clause). [assumption].
% 0.48/1.07 71 (all VAR_DST_587 all VAR_PKDST_588 all VAR_SRC_589 (pred_table(tuple_keys(VAR_DST_587,VAR_PKDST_588)) & pred_attacker(tuple_key_retrieval_server_in_1(VAR_SRC_589,VAR_DST_587)) -> pred_attacker(tuple_key_retrieval_server_out_2(constr_sign(tuple_2(VAR_DST_587,VAR_PKDST_588),name_skS))))) # label(ax166) # label(axiom) # label(non_clause). [assumption].
% 182.21/182.47 72 (all VAR_HOST_641 all VAR_PK_642 (VAR_HOST_641 != name_B & VAR_HOST_641 != name_A & pred_attacker(tuple_key_register_server_in_1(VAR_HOST_641,VAR_PK_642)) -> pred_table(tuple_keys(VAR_HOST_641,VAR_PK_642)))) # label(ax167) # label(axiom) # label(non_clause). [assumption].
% 182.21/182.47
% 182.21/182.47 ============================== end of process non-clausal formulas ===
% 182.21/182.47
% 182.21/182.47 ============================== PROCESS INITIAL CLAUSES ===============
% 182.21/182.47
% 182.21/182.47 ============================== PREDICATE ELIMINATION =================
% 182.21/182.47 73 -pred_attacker(A) | -pred_attacker(B) | pred_mess(A,B) # label(ax148) # label(axiom). [clausify(64)].
% 182.21/182.47 74 -pred_mess(A,B) | -pred_attacker(A) | pred_attacker(B) # label(ax147) # label(axiom). [clausify(63)].
% 182.21/182.47
% 182.21/182.47 ============================== end predicate elimination =============
% 182.21/182.47
% 182.21/182.47 Auto_denials: (non-Horn, no changes).
% 182.21/182.47
% 182.21/182.47 Term ordering decisions:
% 182.21/182.47 Function symbol KB weights: name_A=1. name_skS=1. name_skB=1. name_B=1. name_I=1. name_skA=1. constr_CONST_0x30=1. constr_CONST_1=1. constr_CONST_2=1. constr_CONST_3=1. constr_CONST_4=1. name_c=1. name_objective=1. tuple_false=1. tuple_true=1. tuple_2=1. constr_checksign=1. constr_adec=1. constr_aenc=1. constr_sign=1. tuple_client_A_out_1=1. tuple_client_B_out_1=1. tuple_key_register_server_in_1=1. tuple_key_retrieval_server_in_1=1. tuple_keys=1. constr_dec=1. constr_enc=1. constr_pkey=1. constr_tuple_2_get_0x30=1. constr_tuple_2_get_1_bitstring=1. constr_tuple_2_get_1=1. tuple_client_A_in_2=1. tuple_client_B_in_2=1. tuple_client_B_in_3=1. constr_tuple_2_get_0x30_bitstring=1. tuple_client_A_in_4=1. tuple_client_A_out_3=1. tuple_client_A_out_5=1. tuple_client_B_in_5=1. tuple_client_B_out_4=1. tuple_client_B_out_6=1. tuple_key_retrieval_server_out_2=1. tuple_out_1=1. tuple_out_2=1. tuple_out_3=1. constr_getmess=1. name_Na=1. name_Nb=1. name_new0x2Dname=1.
% 182.21/182.47
% 182.21/182.47 ============================== end of process initial clauses ========
% 182.21/182.47
% 182.21/182.47 ============================== CLAUSES FOR SEARCH ====================
% 182.21/182.47
% 182.21/182.47 ============================== end of clauses for search =============
% 182.21/182.47
% 182.21/182.47 ============================== SEARCH ================================
% 182.21/182.47
% 182.21/182.47 % Starting search at 0.03 seconds.
% 182.21/182.47
% 182.21/182.47 Low Water (keep): wt=7.000, iters=3360
% 182.21/182.47
% 182.21/182.47 Low Water (keep): wt=6.000, iters=3346
% 182.21/182.47
% 182.21/182.47 Low Water (keep): wt=5.000, iters=3338
% 182.21/182.47
% 182.21/182.47 Low Water (displace): id=5614, wt=18.000
% 182.21/182.47
% 182.21/182.47 Low Water (displace): id=5270, wt=15.000
% 182.21/182.47
% 182.21/182.47 Low Water (displace): id=5203, wt=12.000
% 182.21/182.47
% 182.21/182.47 Low Water (displace): id=10550, wt=4.000
% 182.21/182.47
% 182.21/182.47 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 10953 (0.00 of 0.60 sec).
% 182.21/182.47
% 182.21/182.47 ============================== PROOF =================================
% 182.21/182.47 % SZS status Theorem
% 182.21/182.47 % SZS output start Refutation
% 182.21/182.47
% 182.21/182.47 % Proof 1 at 157.53 (+ 23.88) seconds.
% 182.21/182.47 % Length of proof is 37.
% 182.21/182.47 % Level of proof is 8.
% 182.21/182.47 % Maximum clause weight is 12.000.
% 182.21/182.47 % Given clauses 26840.
% 182.21/182.47
% 182.21/182.47 9 (all VAR_X_35 all VAR_Y_36 pred_eq_bitstring_bitstring(VAR_X_35,VAR_Y_36)) # label(ax86) # label(axiom) # label(non_clause). [assumption].
% 182.21/182.47 24 (all VAR_V_82 all VAR_V_83 (pred_attacker(VAR_V_82) & pred_attacker(VAR_V_83) -> pred_attacker(tuple_key_retrieval_server_in_1(VAR_V_82,VAR_V_83)))) # label(ax102) # label(axiom) # label(non_clause). [assumption].
% 182.21/182.47 32 (all VAR_V_120X30 all VAR_V_121 (pred_attacker(VAR_V_120X30) & pred_attacker(VAR_V_121) -> pred_attacker(constr_dec(VAR_V_120X30,VAR_V_121)))) # label(ax111) # label(axiom) # label(non_clause). [assumption].
% 182.21/182.47 33 (all VAR_V_123 (pred_attacker(VAR_V_123) -> pred_attacker(tuple_client_B_out_6(VAR_V_123)))) # label(ax112) # label(axiom) # label(non_clause). [assumption].
% 182.21/182.47 34 (all VAR_V_126 (pred_attacker(tuple_client_B_out_6(VAR_V_126)) -> pred_attacker(VAR_V_126))) # label(ax113) # label(axiom) # label(non_clause). [assumption].
% 182.21/182.47 40 (all VAR_V_151 (pred_attacker(VAR_V_151) -> pred_attacker(tuple_client_B_in_5(VAR_V_151)))) # label(ax119) # label(axiom) # label(non_clause). [assumption].
% 182.21/182.47 42 (all VAR_V_157 (pred_attacker(VAR_V_157) -> pred_attacker(tuple_client_B_in_3(VAR_V_157)))) # label(ax121) # label(axiom) # label(non_clause). [assumption].
% 182.21/182.47 44 (all VAR_V_163 (pred_attacker(VAR_V_163) -> pred_attacker(tuple_client_B_in_2(VAR_V_163)))) # label(ax123) # label(axiom) # label(non_clause). [assumption].
% 182.21/182.47 70 (all VAR_0X40SID_545 all VAR_AENC_NA_A_547 all VAR_AENC_NB_546 all VAR_SIGN_A_PKA_548 (pred_eq_bitstring_bitstring(name_Nb(VAR_0X40SID_545),constr_adec(VAR_AENC_NB_546,name_skB)) & pred_attacker(tuple_client_B_in_5(VAR_AENC_NB_546)) & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(VAR_AENC_NA_A_547,name_skB))) & pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_547)) & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_A_PKA_548,constr_pkey(name_skS)))) & pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_548)) -> pred_attacker(tuple_client_B_out_6(name_objective)))) # label(ax165) # label(axiom) # label(non_clause). [assumption].
% 182.21/182.47 196 pred_eq_bitstring_bitstring(A,B) # label(ax86) # label(axiom). [clausify(9)].
% 182.21/182.47 212 -pred_attacker(A) | -pred_attacker(B) | pred_attacker(tuple_key_retrieval_server_in_1(A,B)) # label(ax102) # label(axiom). [clausify(24)].
% 182.21/182.47 219 pred_attacker(tuple_false) # label(ax109) # label(axiom). [assumption].
% 182.21/182.47 221 -pred_attacker(A) | -pred_attacker(B) | pred_attacker(constr_dec(A,B)) # label(ax111) # label(axiom). [clausify(32)].
% 182.21/182.47 222 -pred_attacker(A) | pred_attacker(tuple_client_B_out_6(A)) # label(ax112) # label(axiom). [clausify(33)].
% 182.21/182.47 223 -pred_attacker(tuple_client_B_out_6(A)) | pred_attacker(A) # label(ax113) # label(axiom). [clausify(34)].
% 182.21/182.47 229 -pred_attacker(A) | pred_attacker(tuple_client_B_in_5(A)) # label(ax119) # label(axiom). [clausify(40)].
% 182.21/182.47 231 -pred_attacker(A) | pred_attacker(tuple_client_B_in_3(A)) # label(ax121) # label(axiom). [clausify(42)].
% 182.21/182.47 233 -pred_attacker(A) | pred_attacker(tuple_client_B_in_2(A)) # label(ax123) # label(axiom). [clausify(44)].
% 182.21/182.47 250 pred_attacker(constr_CONST_3) # label(ax140) # label(axiom). [assumption].
% 182.21/182.47 253 pred_attacker(constr_CONST_0x30) # label(ax143) # label(axiom). [assumption].
% 182.21/182.47 258 pred_attacker(name_I) # label(ax150) # label(axiom). [assumption].
% 182.21/182.47 275 -pred_eq_bitstring_bitstring(name_Nb(A),constr_adec(B,name_skB)) | -pred_attacker(tuple_client_B_in_5(B)) | -pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(C,name_skB))) | -pred_attacker(tuple_client_B_in_3(C)) | -pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(D,constr_pkey(name_skS)))) | -pred_attacker(tuple_client_B_in_2(D)) | pred_attacker(tuple_client_B_out_6(name_objective)) # label(ax165) # label(axiom). [clausify(70)].
% 182.21/182.47 276 -pred_attacker(tuple_client_B_in_5(A)) | -pred_attacker(tuple_client_B_in_3(B)) | -pred_attacker(tuple_client_B_in_2(C)) | pred_attacker(tuple_client_B_out_6(name_objective)). [copy(275),unit_del(a,196),unit_del(c,196),unit_del(e,196)].
% 182.21/182.47 280 -pred_attacker(name_objective) # label(co0) # label(negated_conjecture). [assumption].
% 182.21/182.47 340 pred_attacker(tuple_client_B_in_5(tuple_false)). [resolve(229,a,219,a)].
% 182.21/182.47 344 pred_attacker(tuple_client_B_in_2(tuple_false)). [resolve(233,a,219,a)].
% 182.21/182.47 427 pred_attacker(tuple_client_B_out_6(constr_CONST_3)). [resolve(250,a,222,a)].
% 182.21/182.47 2645 -pred_attacker(tuple_client_B_in_3(A)) | -pred_attacker(tuple_client_B_in_2(B)) | pred_attacker(tuple_client_B_out_6(name_objective)). [resolve(340,a,276,a)].
% 182.21/182.47 2943 -pred_attacker(A) | pred_attacker(constr_dec(A,tuple_client_B_in_2(tuple_false))). [resolve(344,a,221,b)].
% 182.21/182.47 5925 -pred_attacker(A) | pred_attacker(tuple_key_retrieval_server_in_1(A,tuple_client_B_out_6(constr_CONST_3))). [resolve(427,a,212,b)].
% 182.21/182.47 15848 pred_attacker(constr_dec(name_I,tuple_client_B_in_2(tuple_false))). [resolve(2943,a,258,a)].
% 182.21/182.47 20956 pred_attacker(tuple_key_retrieval_server_in_1(constr_CONST_0x30,tuple_client_B_out_6(constr_CONST_3))). [resolve(5925,a,253,a)].
% 182.21/182.47 22828 pred_attacker(tuple_client_B_in_2(constr_dec(name_I,tuple_client_B_in_2(tuple_false)))). [resolve(15848,a,233,a)].
% 182.21/182.47 28152 pred_attacker(tuple_client_B_in_3(tuple_key_retrieval_server_in_1(constr_CONST_0x30,tuple_client_B_out_6(constr_CONST_3)))). [resolve(20956,a,231,a)].
% 182.21/182.47 28166 -pred_attacker(tuple_client_B_in_3(A)) | pred_attacker(tuple_client_B_out_6(name_objective)). [resolve(22828,a,2645,b)].
% 182.21/182.47 33260 pred_attacker(tuple_client_B_out_6(name_objective)). [resolve(28166,a,28152,a)].
% 182.21/182.47 34996 $F. [resolve(33260,a,223,a),unit_del(a,280)].
% 182.21/182.47
% 182.21/182.47 % SZS output end Refutation
% 182.21/182.47 ============================== end of proof ==========================
% 182.21/182.47
% 182.21/182.47 ============================== STATISTICS ============================
% 182.21/182.47
% 182.21/182.47 Given=26840. Generated=46309454. Kept=34881. proofs=1.
% 182.21/182.47 Usable=26839. Sos=5619. Demods=8. Limbo=1735, Disabled=857. Hints=0.
% 182.21/182.47 Megabytes=19.38.
% 182.21/182.47 User_CPU=157.53, System_CPU=23.88, Wall_clock=181.
% 182.21/182.47
% 182.21/182.47 ============================== end of statistics =====================
% 182.21/182.47
% 182.21/182.47 ============================== end of search =========================
% 182.21/182.47
% 182.21/182.47 THEOREM PROVED
% 182.21/182.47 % SZS status Theorem
% 182.21/182.47
% 182.21/182.47 Exiting with 1 proof.
% 182.21/182.47
% 182.21/182.47 Process 10671 exit (max_proofs) Sun Jun 5 15:31:51 2022
% 182.21/182.47 Prover9 interrupted
%------------------------------------------------------------------------------