0.03/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.11 % Command : tptp2X_and_run_prover9 %d %s 0.11/0.32 % Computer : n027.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 960 0.11/0.32 % DateTime : Thu Jul 2 07:36:18 EDT 2020 0.11/0.33 % CPUTime : 0.41/0.99 ============================== Prover9 =============================== 0.41/0.99 Prover9 (32) version 2009-11A, November 2009. 0.41/0.99 Process 18481 was started by sandbox2 on n027.cluster.edu, 0.41/0.99 Thu Jul 2 07:36:18 2020 0.41/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_18325_n027.cluster.edu". 0.41/0.99 ============================== end of head =========================== 0.41/0.99 0.41/0.99 ============================== INPUT ================================= 0.41/0.99 0.41/0.99 % Reading from file /tmp/Prover9_18325_n027.cluster.edu 0.41/0.99 0.41/0.99 set(prolog_style_variables). 0.41/0.99 set(auto2). 0.41/0.99 % set(auto2) -> set(auto). 0.41/0.99 % set(auto) -> set(auto_inference). 0.41/0.99 % set(auto) -> set(auto_setup). 0.41/0.99 % set(auto_setup) -> set(predicate_elim). 0.41/0.99 % set(auto_setup) -> assign(eq_defs, unfold). 0.41/0.99 % set(auto) -> set(auto_limits). 0.41/0.99 % set(auto_limits) -> assign(max_weight, "100.000"). 0.41/0.99 % set(auto_limits) -> assign(sos_limit, 20000). 0.41/0.99 % set(auto) -> set(auto_denials). 0.41/0.99 % set(auto) -> set(auto_process). 0.41/0.99 % set(auto2) -> assign(new_constants, 1). 0.41/0.99 % set(auto2) -> assign(fold_denial_max, 3). 0.41/0.99 % set(auto2) -> assign(max_weight, "200.000"). 0.41/0.99 % set(auto2) -> assign(max_hours, 1). 0.41/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.41/0.99 % set(auto2) -> assign(max_seconds, 0). 0.41/0.99 % set(auto2) -> assign(max_minutes, 5). 0.41/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.41/0.99 % set(auto2) -> set(sort_initial_sos). 0.41/0.99 % set(auto2) -> assign(sos_limit, -1). 0.41/0.99 % set(auto2) -> assign(lrs_ticks, 3000). 0.41/0.99 % set(auto2) -> assign(max_megs, 400). 0.41/0.99 % set(auto2) -> assign(stats, some). 0.41/0.99 % set(auto2) -> clear(echo_input). 0.41/0.99 % set(auto2) -> set(quiet). 0.41/0.99 % set(auto2) -> clear(print_initial_clauses). 0.41/0.99 % set(auto2) -> clear(print_given). 0.41/0.99 assign(lrs_ticks,-1). 0.41/0.99 assign(sos_limit,10000). 0.41/0.99 assign(order,kbo). 0.41/0.99 set(lex_order_vars). 0.41/0.99 clear(print_given). 0.41/0.99 0.41/0.99 % formulas(sos). % not echoed (177 formulas) 0.41/0.99 0.41/0.99 ============================== end of input ========================== 0.41/0.99 0.41/0.99 % From the command line: assign(max_seconds, 960). 0.41/0.99 0.41/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.41/0.99 0.41/0.99 % Formulas that are not ordinary clauses: 0.41/0.99 1 (all VAR_V_68 (pred_attacker(tuple_out_2(VAR_V_68)) -> pred_attacker(VAR_V_68))) # label(ax98) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 2 (all VAR_V_129 (pred_attacker(tuple_client_B_out_6(VAR_V_129)) -> pred_attacker(VAR_V_129))) # label(ax114) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 3 (all VAR_V_81 (pred_attacker(tuple_key_retrieval_server_out_2(VAR_V_81)) -> pred_attacker(VAR_V_81))) # label(ax102) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 4 (all VAR_V_20X300X30 (pred_attacker(VAR_V_20X300X30) -> pred_attacker(tuple_client_A_in_4(VAR_V_20X300X30)))) # label(ax133) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 5 (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_10X309))) # label(ax107) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 6 (all VAR_V_132 (pred_attacker(VAR_V_132) -> pred_attacker(tuple_client_B_out_4(VAR_V_132)))) # label(ax115) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 7 (all VAR_V_49 (pred_attacker(VAR_V_49) -> pred_attacker(constr_tuple_2_get_1_bitstring(VAR_V_49)))) # label(ax90) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 8 (all VAR_X0X30_11 all VAR_X1_12 VAR_X1_12 = constr_assoc_pair_2_get_1(tuple_assoc_pair(VAR_X0X30_11,VAR_X1_12))) # label(ax85) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 9 (all VAR_0X40SID_464 all VAR_AENC_NA_NI_I_463 all VAR_SIGN_I_PKI_465 (pred_attacker(tuple_client_A_in_4(VAR_AENC_NA_NI_I_463)) & pred_attacker(tuple_client_A_in_2(VAR_SIGN_I_PKI_465)) & pred_eq_bitstring_bitstring(name_I,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_I_PKI_465,constr_pkey(name_skS)))) & pred_eq_bitstring_bitstring(name_Na(VAR_0X40SID_464),constr_assoc_pair_2_get_0x30(constr_adec(VAR_AENC_NA_NI_I_463,name_skA))) & pred_eq_bitstring_bitstring(name_I,constr_assoc_pair_2_get_1(constr_assoc_pair_2_get_1_bitstring(constr_adec(VAR_AENC_NA_NI_I_463,name_skA)))) -> pred_attacker(tuple_client_A_out_5(constr_aenc(constr_assoc_pair_2_get_0x30_bitstring(constr_assoc_pair_2_get_1_bitstring(constr_adec(VAR_AENC_NA_NI_I_463,name_skA))),constr_tuple_2_get_1_bitstring(constr_checksign(VAR_SIGN_I_PKI_465,constr_pkey(name_skS)))))))) # label(ax170) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 10 (all VAR_V_71 (pred_attacker(VAR_V_71) -> pred_attacker(tuple_out_1(VAR_V_71)))) # label(ax99) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 11 (all VAR_V_65 (pred_attacker(VAR_V_65) -> pred_attacker(tuple_out_2(VAR_V_65)))) # label(ax97) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 12 (all VAR_HOST_70X302 all VAR_PK_70X303 (name_B != VAR_HOST_70X302 & pred_attacker(tuple_key_register_server_in_1(VAR_HOST_70X302,VAR_PK_70X303)) & VAR_HOST_70X302 != name_A -> pred_table(tuple_keys(VAR_HOST_70X302,VAR_PK_70X303)))) # label(ax175) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 13 (all VAR_X_17 all VAR_Y_18 all VAR_Z_0X30 tuple_assoc_pair(tuple_assoc_pair(VAR_X_17,VAR_Y_18),VAR_Z_0X30) = tuple_assoc_pair(VAR_X_17,tuple_assoc_pair(VAR_Y_18,VAR_Z_0X30))) # label(ax82) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 14 (all VAR_V_20X303 (pred_attacker(tuple_client_A_in_4(VAR_V_20X303)) -> pred_attacker(VAR_V_20X303))) # label(ax134) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 15 (all VAR_V_269 all VAR_V_270X30 (pred_attacker(VAR_V_269) & pred_attacker(VAR_V_270X30) -> pred_mess(VAR_V_270X30,VAR_V_269))) # label(ax156) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 16 (all VAR_V_139 all VAR_V_140X30 (pred_attacker(VAR_V_139) & pred_attacker(VAR_V_140X30) -> pred_attacker(tuple_client_B_out_1(VAR_V_139,VAR_V_140X30)))) # label(ax117) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 17 (all VAR_V_59 (pred_attacker(VAR_V_59) -> pred_attacker(tuple_out_3(VAR_V_59)))) # label(ax95) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 18 (all VAR_V_154 (pred_attacker(VAR_V_154) -> pred_attacker(tuple_client_B_in_5(VAR_V_154)))) # label(ax120) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 19 (all VAR_V_267 all VAR_V_268 (pred_attacker(VAR_V_268) & pred_mess(VAR_V_268,VAR_V_267) -> pred_attacker(VAR_V_267))) # label(ax155) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 20 (all VAR_0X40SID_393 all VAR_SIGN_I_PKI_392 (pred_attacker(tuple_client_A_in_2(VAR_SIGN_I_PKI_392)) & pred_eq_bitstring_bitstring(name_I,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_I_PKI_392,constr_pkey(name_skS)))) -> pred_attacker(tuple_client_A_out_3(constr_aenc(tuple_assoc_pair(name_Na(VAR_0X40SID_393),name_A),constr_tuple_2_get_1_bitstring(constr_checksign(VAR_SIGN_I_PKI_392,constr_pkey(name_skS)))))))) # label(ax169) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 21 (all VAR_V_245 all VAR_V_246 (pred_attacker(VAR_V_246) & pred_attacker(VAR_V_245) -> pred_attacker(constr_adec(VAR_V_245,VAR_V_246)))) # label(ax146) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 22 (all VAR_V_261 all VAR_V_262 (pred_attacker(tuple_2(VAR_V_261,VAR_V_262)) -> pred_attacker(VAR_V_261))) # label(ax153) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 23 (all VAR_V_169 (pred_attacker(tuple_client_B_in_2(VAR_V_169)) -> pred_attacker(VAR_V_169))) # label(ax125) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 24 (all VAR_V_175 (pred_attacker(tuple_client_A_out_5(VAR_V_175)) -> pred_attacker(VAR_V_175))) # label(ax127) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 25 (all VAR_V_178 (pred_attacker(VAR_V_178) -> pred_attacker(tuple_client_A_out_3(VAR_V_178)))) # label(ax128) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 26 (all VAR_V_57 (pred_attacker(VAR_V_57) -> pred_attacker(constr_pkey(VAR_V_57)))) # label(ax94) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 27 (all VAR_V_222 (pred_attacker(VAR_V_222) -> pred_attacker(constr_assoc_pair_2_get_0x30(VAR_V_222)))) # label(ax141) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 28 (all VAR_V_172 (pred_attacker(VAR_V_172) -> pred_attacker(tuple_client_A_out_5(VAR_V_172)))) # label(ax126) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 29 (all VAR_V_54 all VAR_V_55 (pred_attacker(VAR_V_55) & pred_attacker(VAR_V_54) -> pred_attacker(constr_sign(VAR_V_54,VAR_V_55)))) # label(ax93) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 30 (all VAR_X0X30_15 all VAR_X1_16 VAR_X1_16 = constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(VAR_X0X30_15,VAR_X1_16))) # label(ax83) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 31 (all VAR_V_78 (pred_attacker(VAR_V_78) -> pred_attacker(tuple_key_retrieval_server_out_2(VAR_V_78)))) # label(ax101) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 32 (all VAR_V_157 (pred_attacker(tuple_client_B_in_5(VAR_V_157)) -> pred_attacker(VAR_V_157))) # label(ax121) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 33 (all VAR_K_20X30 all VAR_M_19 VAR_M_19 = constr_getmess(constr_sign(VAR_M_19,VAR_K_20X30))) # label(ax80) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 34 (all VAR_V_273 pred_attacker(name_new0x2Dname(VAR_V_273))) # label(ax162) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 35 (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_147))) # label(ax118) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 36 (all VAR_K_22 all VAR_M_21 constr_dec(constr_enc(VAR_M_21,VAR_K_22),VAR_K_22) = VAR_M_21) # label(ax79) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 37 (all VAR_V_74 (pred_attacker(tuple_out_1(VAR_V_74)) -> pred_attacker(VAR_V_74))) # label(ax100) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 38 (all VAR_V_264 all VAR_V_265 (pred_attacker(tuple_2(VAR_V_264,VAR_V_265)) -> pred_attacker(VAR_V_265))) # label(ax154) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 39 (all VAR_V_150X30 all VAR_V_151 (pred_attacker(tuple_client_B_out_1(VAR_V_150X30,VAR_V_151)) -> pred_attacker(VAR_V_151))) # label(ax119) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 40 (all VAR_V_116 (pred_attacker(VAR_V_116) -> pred_attacker(constr_getmess(VAR_V_116)))) # label(ax109) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 41 (all VAR_V_216 (pred_attacker(VAR_V_216) -> pred_attacker(constr_assoc_pair_2_get_1_bitstring(VAR_V_216)))) # label(ax138) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 42 (all VAR_X0X30_7 all VAR_X1_8 VAR_X1_8 = constr_tuple_2_get_1_bitstring(tuple_2(VAR_X0X30_7,VAR_X1_8))) # label(ax87) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 43 (all VAR_V_196 all VAR_V_197 (pred_attacker(tuple_client_A_out_1(VAR_V_196,VAR_V_197)) -> pred_attacker(VAR_V_197))) # label(ax132) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 44 (all VAR_K_24 all VAR_M_23 VAR_M_23 = constr_adec(constr_aenc(VAR_M_23,constr_pkey(VAR_K_24)),VAR_K_24)) # label(ax78) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 45 (all VAR_X0X30_13 all VAR_X1_14 VAR_X0X30_13 = constr_assoc_pair_2_get_0x30_bitstring(tuple_assoc_pair(VAR_X0X30_13,VAR_X1_14))) # label(ax84) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 46 (all VAR_V_253 all VAR_V_254 (pred_attacker(VAR_V_254) & pred_attacker(VAR_V_253) -> pred_attacker(tuple_2(VAR_V_253,VAR_V_254)))) # label(ax152) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 47 (all VAR_X0X30_9 all VAR_X1_10X30 constr_assoc_pair_2_get_0x30(tuple_assoc_pair(VAR_X0X30_9,VAR_X1_10X30)) = VAR_X0X30_9) # label(ax86) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 48 (all VAR_V_272 pred_equal(VAR_V_272,VAR_V_272)) # label(ax161) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 49 (all VAR_V_96 all VAR_V_97 (pred_attacker(tuple_key_retrieval_server_in_1(VAR_V_96,VAR_V_97)) -> pred_attacker(VAR_V_97))) # label(ax105) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 50 (all VAR_V_126 (pred_attacker(VAR_V_126) -> pred_attacker(tuple_client_B_out_6(VAR_V_126)))) # label(ax113) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 51 (all VAR_V_123 all VAR_V_124 (pred_attacker(VAR_V_124) & pred_attacker(VAR_V_123) -> pred_attacker(constr_dec(VAR_V_123,VAR_V_124)))) # label(ax112) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 52 (all VAR_V_119 all VAR_V_120X30 (pred_attacker(VAR_V_119) & pred_attacker(VAR_V_120X30) -> pred_attacker(constr_enc(VAR_V_119,VAR_V_120X30)))) # label(ax111) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 53 (all VAR_V_241 all VAR_V_242 (pred_attacker(VAR_V_241) & pred_attacker(VAR_V_242) -> pred_attacker(constr_aenc(VAR_V_241,VAR_V_242)))) # label(ax145) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 54 (all VAR_DST_648 all VAR_PKDST_649 all VAR_SRC_650X30 (pred_table(tuple_keys(VAR_DST_648,VAR_PKDST_649)) & pred_attacker(tuple_key_retrieval_server_in_1(VAR_SRC_650X30,VAR_DST_648)) -> pred_attacker(tuple_key_retrieval_server_out_2(constr_sign(tuple_2(VAR_DST_648,VAR_PKDST_649),name_skS))))) # label(ax174) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 55 (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(ax88) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 56 (all VAR_0X40SID_582 all VAR_AENC_NA_A_580X30 all VAR_SIGN_A_PKA_581 (pred_eq_bitstring_bitstring(name_A,constr_assoc_pair_2_get_1(constr_adec(VAR_AENC_NA_A_580X30,name_skB))) & pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_581)) & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_A_PKA_581,constr_pkey(name_skS)))) & pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_580X30)) -> pred_attacker(tuple_client_B_out_4(constr_aenc(tuple_assoc_pair(constr_assoc_pair_2_get_0x30_bitstring(constr_adec(VAR_AENC_NA_A_580X30,name_skB)),tuple_assoc_pair(name_Nb(VAR_0X40SID_582),name_B)),constr_tuple_2_get_1_bitstring(constr_checksign(VAR_SIGN_A_PKA_581,constr_pkey(name_skS)))))))) # label(ax172) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 57 (all VAR_V_213 all VAR_V_214 (pred_attacker(VAR_V_213) & pred_attacker(VAR_V_214) -> pred_attacker(constr_checksign(VAR_V_213,VAR_V_214)))) # label(ax137) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 58 (all VAR_V_135 (pred_attacker(tuple_client_B_out_4(VAR_V_135)) -> pred_attacker(VAR_V_135))) # label(ax116) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 59 (all VAR_V_62 (pred_attacker(tuple_out_3(VAR_V_62)) -> pred_attacker(VAR_V_62))) # label(ax96) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 60 (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_193))) # label(ax131) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 61 (all VAR_V_160X30 (pred_attacker(VAR_V_160X30) -> pred_attacker(tuple_client_B_in_3(VAR_V_160X30)))) # label(ax122) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 62 (all VAR_V_181 (pred_attacker(tuple_client_A_out_3(VAR_V_181)) -> pred_attacker(VAR_V_181))) # label(ax129) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 63 (all VAR_V_185 all VAR_V_186 (pred_attacker(VAR_V_186) & pred_attacker(VAR_V_185) -> pred_attacker(tuple_client_A_out_1(VAR_V_185,VAR_V_186)))) # label(ax130) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 64 (all VAR_V_236 all VAR_V_237 (pred_attacker(tuple_assoc_pair(VAR_V_236,VAR_V_237)) -> pred_attacker(VAR_V_237))) # label(ax144) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 65 (all VAR_V_20X306 (pred_attacker(VAR_V_20X306) -> pred_attacker(tuple_client_A_in_2(VAR_V_20X306)))) # label(ax135) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 66 (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_93))) # label(ax104) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 67 (all VAR_V_163 (pred_attacker(tuple_client_B_in_3(VAR_V_163)) -> pred_attacker(VAR_V_163))) # label(ax123) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 68 (all VAR_V_51 (pred_attacker(VAR_V_51) -> pred_attacker(constr_tuple_2_get_0x30(VAR_V_51)))) # label(ax91) # label(axiom) # label(non_clause). [assumption]. 0.41/0.99 69 (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.41/0.99 70 (all VAR_V_166 (pred_attacker(VAR_V_166) -> pred_attacker(tuple_client_B_in_2(VAR_V_166)))) # label(ax124) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 71 (all VAR_V_218 (pred_attacker(VAR_V_218) -> pred_attacker(constr_assoc_pair_2_get_1(VAR_V_218)))) # label(ax139) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 72 (all VAR_V_220X30 (pred_attacker(VAR_V_220X30) -> pred_attacker(constr_assoc_pair_2_get_0x30_bitstring(VAR_V_220X30)))) # label(ax140) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 73 (all VAR_V_20X309 (pred_attacker(tuple_client_A_in_2(VAR_V_20X309)) -> pred_attacker(VAR_V_20X309))) # label(ax136) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 74 (all VAR_V_85 all VAR_V_86 (pred_attacker(VAR_V_85) & pred_attacker(VAR_V_86) -> pred_attacker(tuple_key_retrieval_server_in_1(VAR_V_85,VAR_V_86)))) # label(ax103) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 75 (all VAR_X_42 all VAR_Y_43 pred_eq_bitstring_bitstring(VAR_X_42,VAR_Y_43)) # label(ax89) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 76 (all VAR_V_225 all VAR_V_226 (pred_attacker(VAR_V_226) & pred_attacker(VAR_V_225) -> pred_attacker(tuple_assoc_pair(VAR_V_225,VAR_V_226)))) # label(ax142) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 77 (all VAR_V_112 all VAR_V_113 (pred_attacker(tuple_key_register_server_in_1(VAR_V_112,VAR_V_113)) -> pred_attacker(VAR_V_113))) # label(ax108) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 78 (all VAR_0X40SID_60X306 all VAR_AENC_NA_A_60X308 all VAR_AENC_NB_60X307 all VAR_SIGN_A_PKA_60X309 (pred_eq_bitstring_bitstring(name_Nb(VAR_0X40SID_60X306),constr_adec(VAR_AENC_NB_60X307,name_skB)) & pred_attacker(tuple_client_B_in_5(VAR_AENC_NB_60X307)) & pred_eq_bitstring_bitstring(name_A,constr_assoc_pair_2_get_1(constr_adec(VAR_AENC_NA_A_60X308,name_skB))) & pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_60X309)) & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_A_PKA_60X309,constr_pkey(name_skS)))) & pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_60X308)) -> pred_attacker(tuple_client_B_out_6(name_objective)))) # label(ax173) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 79 (all VAR_V_233 all VAR_V_234 (pred_attacker(tuple_assoc_pair(VAR_V_233,VAR_V_234)) -> pred_attacker(VAR_V_233))) # label(ax143) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 80 (all VAR_V_10X301 all VAR_V_10X302 (pred_attacker(VAR_V_10X302) & pred_attacker(VAR_V_10X301) -> pred_attacker(tuple_key_register_server_in_1(VAR_V_10X301,VAR_V_10X302)))) # label(ax106) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 81 -(all VAR_V_711 pred_attacker(tuple_2(name_Nb(VAR_V_711),name_objective))) # label(co0) # label(negated_conjecture) # label(non_clause). [assumption]. 0.41/1.01 0.41/1.01 ============================== end of process non-clausal formulas === 0.41/1.01 0.41/1.01 ============================== PROCESS INITIAL CLAUSES =============== 0.41/1.01 0.41/1.01 ============================== PREDICATE ELIMINATION ================= 0.41/1.01 82 -pred_attacker(A) | -pred_mess(A,B) | pred_attacker(B) # label(ax155) # label(axiom). [clausify(19)]. 0.41/1.01 83 -pred_attacker(A) | -pred_attacker(B) | pred_mess(B,A) # label(ax156) # label(axiom). [clausify(15)]. 0.41/1.01 0.41/1.01 ============================== end predicate elimination ============= 0.41/1.01 0.41/1.01 Auto_denials: (non-Horn, no changes). 0.41/1.01 0.41/1.01 Term ordering decisions: 0.41/1.01 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. c1=1. tuple_assoc_pair=1. constr_adec=1. constr_checksign=1. tuple_2=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_assoc_pair_2_get_1=1. constr_tuple_2_get_1_bitstring=1. constr_assoc_pair_2_get_0x30_bitstring=1. constr_assoc_pair_2_get_1_bitstring=1. tuple_client_A_in_2=1. tuple_client_B_in_2=1. tuple_client_B_in_3=1. constr_assoc_pair_2_get_0x30=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. 0.41/1.01 0.41/1.01 ============================== end of process initial clauses ======== 0.41/1.01 0.41/1.01 ============================== CLAUSES FOR SEARCH ==================== 0.41/1.01 0.41/1.01 ============================== end of clauses for search ============= 0.41/1.01 0.41/1.01 ============================== SEARCH ================================ 0.41/1.01 0.41/1.01 % Starting search at 0.04 seconds. 0.41/1.01 0.41/1.01 ============================== PROOF ================================= 0.41/1.01 % SZS status Theorem 0.41/1.01 % SZS output start Refutation 0.41/1.01 0.41/1.01 % Proof 1 at 0.04 (+ 0.00) seconds. 0.41/1.01 % Length of proof is 16. 0.41/1.01 % Level of proof is 5. 0.41/1.01 % Maximum clause weight is 11.000. 0.41/1.01 % Given clauses 139. 0.41/1.01 0.41/1.01 8 (all VAR_X0X30_11 all VAR_X1_12 VAR_X1_12 = constr_assoc_pair_2_get_1(tuple_assoc_pair(VAR_X0X30_11,VAR_X1_12))) # label(ax85) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 11 (all VAR_V_65 (pred_attacker(VAR_V_65) -> pred_attacker(tuple_out_2(VAR_V_65)))) # label(ax97) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 13 (all VAR_X_17 all VAR_Y_18 all VAR_Z_0X30 tuple_assoc_pair(tuple_assoc_pair(VAR_X_17,VAR_Y_18),VAR_Z_0X30) = tuple_assoc_pair(VAR_X_17,tuple_assoc_pair(VAR_Y_18,VAR_Z_0X30))) # label(ax82) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 79 (all VAR_V_233 all VAR_V_234 (pred_attacker(tuple_assoc_pair(VAR_V_233,VAR_V_234)) -> pred_attacker(VAR_V_233))) # label(ax143) # label(axiom) # label(non_clause). [assumption]. 0.41/1.01 81 -(all VAR_V_711 pred_attacker(tuple_2(name_Nb(VAR_V_711),name_objective))) # label(co0) # label(negated_conjecture) # label(non_clause). [assumption]. 0.41/1.01 98 pred_attacker(constr_CONST_3) # label(ax148) # label(axiom). [assumption]. 0.41/1.01 114 constr_assoc_pair_2_get_1(tuple_assoc_pair(A,B)) = B # label(ax85) # label(axiom). [clausify(8)]. 0.41/1.01 119 -pred_attacker(A) | pred_attacker(tuple_out_2(A)) # label(ax97) # label(axiom). [clausify(11)]. 0.41/1.01 128 tuple_assoc_pair(tuple_assoc_pair(A,B),C) = tuple_assoc_pair(A,tuple_assoc_pair(B,C)) # label(ax82) # label(axiom). [clausify(13)]. 0.41/1.01 289 -pred_attacker(tuple_assoc_pair(A,B)) | pred_attacker(A) # label(ax143) # label(axiom). [clausify(79)]. 0.41/1.01 295 -pred_attacker(tuple_2(name_Nb(c1),name_objective)) # label(co0) # label(negated_conjecture). [clausify(81)]. 0.41/1.01 330 pred_attacker(tuple_out_2(constr_CONST_3)). [resolve(119,a,98,a)]. 0.41/1.01 331 tuple_assoc_pair(A,B) = B. [para(128(a,1),114(a,1,1)),rewrite([114(3)])]. 0.41/1.01 334 -pred_attacker(A) | pred_attacker(B). [back_rewrite(289),rewrite([331(1)])]. 0.41/1.01 339 pred_attacker(A). [resolve(334,a,330,a)]. 0.41/1.01 340 $F. [resolve(339,a,295,a)]. 0.41/1.01 0.41/1.01 % SZS output end Refutation 0.41/1.01 ============================== end of proof ========================== 0.41/1.01 0.41/1.01 ============================== STATISTICS ============================ 0.41/1.01 0.41/1.01 Given=139. Generated=238. Kept=218. proofs=1. 0.41/1.01 Usable=128. Sos=4. Demods=9. Limbo=0, Disabled=262. Hints=0. 0.41/1.01 Megabytes=0.34. 0.41/1.01 User_CPU=0.04, System_CPU=0.00, Wall_clock=0. 0.41/1.01 0.41/1.01 ============================== end of statistics ===================== 0.41/1.01 0.41/1.01 ============================== end of search ========================= 0.41/1.01 0.41/1.01 THEOREM PROVED 0.41/1.01 % SZS status Theorem 0.41/1.01 0.41/1.01 Exiting with 1 proof. 0.41/1.01 0.41/1.01 Process 18481 exit (max_proofs) Thu Jul 2 07:36:18 2020 0.41/1.01 Prover9 interrupted 0.41/1.02 EOF