TSTP Solution File: SWW965+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWW965+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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 179.16s 179.47s
% Output : Refutation 179.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWW965+1 : TPTP v8.1.0. Released v7.4.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 6 08:14:50 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.81/1.06 ============================== Prover9 ===============================
% 0.81/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.81/1.06 Process 6645 was started by sandbox2 on n024.cluster.edu,
% 0.81/1.06 Mon Jun 6 08:14:50 2022
% 0.81/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_6491_n024.cluster.edu".
% 0.81/1.06 ============================== end of head ===========================
% 0.81/1.06
% 0.81/1.06 ============================== INPUT =================================
% 0.81/1.06
% 0.81/1.06 % Reading from file /tmp/Prover9_6491_n024.cluster.edu
% 0.81/1.06
% 0.81/1.06 set(prolog_style_variables).
% 0.81/1.06 set(auto2).
% 0.81/1.06 % set(auto2) -> set(auto).
% 0.81/1.06 % set(auto) -> set(auto_inference).
% 0.81/1.06 % set(auto) -> set(auto_setup).
% 0.81/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.81/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.81/1.06 % set(auto) -> set(auto_limits).
% 0.81/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.81/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.81/1.06 % set(auto) -> set(auto_denials).
% 0.81/1.06 % set(auto) -> set(auto_process).
% 0.81/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.81/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.81/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.81/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.81/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.81/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.81/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.81/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.81/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.81/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.81/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.81/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.81/1.06 % set(auto2) -> assign(stats, some).
% 0.81/1.06 % set(auto2) -> clear(echo_input).
% 0.81/1.06 % set(auto2) -> set(quiet).
% 0.81/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.81/1.06 % set(auto2) -> clear(print_given).
% 0.81/1.06 assign(lrs_ticks,-1).
% 0.81/1.06 assign(sos_limit,10000).
% 0.81/1.06 assign(order,kbo).
% 0.81/1.06 set(lex_order_vars).
% 0.81/1.06 clear(print_given).
% 0.81/1.06
% 0.81/1.06 % formulas(sos). % not echoed (188 formulas)
% 0.81/1.06
% 0.81/1.06 ============================== end of input ==========================
% 0.81/1.06
% 0.81/1.06 % From the command line: assign(max_seconds, 300).
% 0.81/1.06
% 0.81/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.81/1.06
% 0.81/1.06 % Formulas that are not ordinary clauses:
% 0.81/1.06 1 (all VAR_K_24 all VAR_M_23 constr_adec(constr_aenc(VAR_M_23,constr_pkey(VAR_K_24)),VAR_K_24) = VAR_M_23) # label(ax91) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.06 2 (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(ax92) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.06 3 (all VAR_K_20X30 all VAR_M_19 constr_getmess(constr_sign(VAR_M_19,VAR_K_20X30)) = VAR_M_19) # label(ax93) # label(axiom) # label(non_clause). [assumption].
% 0.81/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(ax94) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.06 5 (all VAR_X_18 constr_xor(VAR_X_18,VAR_X_18) = constr_ZERO) # label(ax95) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.06 6 (all VAR_X_17 constr_xor(VAR_X_17,constr_ZERO) = VAR_X_17) # label(ax96) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.06 7 (all VAR_X_15 all VAR_Y_16 constr_xor(VAR_X_15,VAR_Y_16) = constr_xor(VAR_Y_16,VAR_X_15)) # label(ax97) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.06 8 (all VAR_X_13 all VAR_Y_14 all VAR_Z_0X30 constr_xor(VAR_X_13,constr_xor(VAR_Y_14,VAR_Z_0X30)) = constr_xor(constr_xor(VAR_X_13,VAR_Y_14),VAR_Z_0X30)) # label(ax98) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.06 9 (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(ax99) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.06 10 (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(ax100) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.06 11 (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(ax101) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.06 12 (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(ax102) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 13 (all VAR_X_41 all VAR_Y_42 pred_eq_bitstring_bitstring(VAR_X_41,VAR_Y_42)) # label(ax103) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 14 (all VAR_V_49 all VAR_V_50X30 (pred_attacker(VAR_V_49) & pred_attacker(VAR_V_50X30) -> pred_attacker(constr_xor(VAR_V_49,VAR_V_50X30)))) # label(ax104) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 15 (all VAR_V_52 (pred_attacker(VAR_V_52) -> pred_attacker(constr_tuple_2_get_1_bitstring(VAR_V_52)))) # label(ax105) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 16 (all VAR_V_54 (pred_attacker(VAR_V_54) -> pred_attacker(constr_tuple_2_get_1(VAR_V_54)))) # label(ax106) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 17 (all VAR_V_56 (pred_attacker(VAR_V_56) -> pred_attacker(constr_tuple_2_get_0x30_bitstring(VAR_V_56)))) # label(ax107) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 18 (all VAR_V_58 (pred_attacker(VAR_V_58) -> pred_attacker(constr_tuple_2_get_0x30(VAR_V_58)))) # label(ax108) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 19 (all VAR_V_61 all VAR_V_62 (pred_attacker(VAR_V_61) & pred_attacker(VAR_V_62) -> pred_attacker(constr_sign(VAR_V_61,VAR_V_62)))) # label(ax110) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 20 (all VAR_V_64 (pred_attacker(VAR_V_64) -> pred_attacker(constr_pkey(VAR_V_64)))) # label(ax111) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 21 (all VAR_V_66 (pred_attacker(VAR_V_66) -> pred_attacker(tuple_out_3(VAR_V_66)))) # label(ax112) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 22 (all VAR_V_69 (pred_attacker(tuple_out_3(VAR_V_69)) -> pred_attacker(VAR_V_69))) # label(ax113) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 23 (all VAR_V_72 (pred_attacker(VAR_V_72) -> pred_attacker(tuple_out_2(VAR_V_72)))) # label(ax114) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 24 (all VAR_V_75 (pred_attacker(tuple_out_2(VAR_V_75)) -> pred_attacker(VAR_V_75))) # label(ax115) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 25 (all VAR_V_78 (pred_attacker(VAR_V_78) -> pred_attacker(tuple_out_1(VAR_V_78)))) # label(ax116) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 26 (all VAR_V_81 (pred_attacker(tuple_out_1(VAR_V_81)) -> pred_attacker(VAR_V_81))) # label(ax117) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 27 (all VAR_V_85 (pred_attacker(VAR_V_85) -> pred_attacker(tuple_key_retrieval_server_out_2(VAR_V_85)))) # label(ax118) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 28 (all VAR_V_88 (pred_attacker(tuple_key_retrieval_server_out_2(VAR_V_88)) -> pred_attacker(VAR_V_88))) # label(ax119) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 29 (all VAR_V_92 all VAR_V_93 (pred_attacker(VAR_V_92) & pred_attacker(VAR_V_93) -> pred_attacker(tuple_key_retrieval_server_in_1(VAR_V_92,VAR_V_93)))) # label(ax120) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 30 (all VAR_V_10X300X30 all VAR_V_10X301 (pred_attacker(tuple_key_retrieval_server_in_1(VAR_V_10X300X30,VAR_V_10X301)) -> pred_attacker(VAR_V_10X300X30))) # label(ax121) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 31 (all VAR_V_10X303 all VAR_V_10X304 (pred_attacker(tuple_key_retrieval_server_in_1(VAR_V_10X303,VAR_V_10X304)) -> pred_attacker(VAR_V_10X304))) # label(ax122) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 32 (all VAR_V_10X308 all VAR_V_10X309 (pred_attacker(VAR_V_10X308) & pred_attacker(VAR_V_10X309) -> pred_attacker(tuple_key_register_server_in_1(VAR_V_10X308,VAR_V_10X309)))) # label(ax123) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 33 (all VAR_V_116 all VAR_V_117 (pred_attacker(tuple_key_register_server_in_1(VAR_V_116,VAR_V_117)) -> pred_attacker(VAR_V_116))) # label(ax124) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 34 (all VAR_V_119 all VAR_V_120X30 (pred_attacker(tuple_key_register_server_in_1(VAR_V_119,VAR_V_120X30)) -> pred_attacker(VAR_V_120X30))) # label(ax125) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 35 (all VAR_V_123 (pred_attacker(VAR_V_123) -> pred_attacker(constr_getmess(VAR_V_123)))) # label(ax126) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 36 (all VAR_V_126 all VAR_V_127 (pred_attacker(VAR_V_126) & pred_attacker(VAR_V_127) -> pred_attacker(constr_enc(VAR_V_126,VAR_V_127)))) # label(ax128) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 37 (all VAR_V_130X30 all VAR_V_131 (pred_attacker(VAR_V_130X30) & pred_attacker(VAR_V_131) -> pred_attacker(constr_dec(VAR_V_130X30,VAR_V_131)))) # label(ax129) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 38 (all VAR_V_133 (pred_attacker(VAR_V_133) -> pred_attacker(tuple_client_B_out_6(VAR_V_133)))) # label(ax130) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 39 (all VAR_V_136 (pred_attacker(tuple_client_B_out_6(VAR_V_136)) -> pred_attacker(VAR_V_136))) # label(ax131) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 40 (all VAR_V_139 (pred_attacker(VAR_V_139) -> pred_attacker(tuple_client_B_out_4(VAR_V_139)))) # label(ax132) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 41 (all VAR_V_142 (pred_attacker(tuple_client_B_out_4(VAR_V_142)) -> pred_attacker(VAR_V_142))) # label(ax133) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 42 (all VAR_V_146 all VAR_V_147 (pred_attacker(VAR_V_146) & pred_attacker(VAR_V_147) -> pred_attacker(tuple_client_B_out_1(VAR_V_146,VAR_V_147)))) # label(ax134) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 43 (all VAR_V_154 all VAR_V_155 (pred_attacker(tuple_client_B_out_1(VAR_V_154,VAR_V_155)) -> pred_attacker(VAR_V_154))) # label(ax135) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 44 (all VAR_V_157 all VAR_V_158 (pred_attacker(tuple_client_B_out_1(VAR_V_157,VAR_V_158)) -> pred_attacker(VAR_V_158))) # label(ax136) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 45 (all VAR_V_161 (pred_attacker(VAR_V_161) -> pred_attacker(tuple_client_B_in_5(VAR_V_161)))) # label(ax137) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 46 (all VAR_V_164 (pred_attacker(tuple_client_B_in_5(VAR_V_164)) -> pred_attacker(VAR_V_164))) # label(ax138) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 47 (all VAR_V_167 (pred_attacker(VAR_V_167) -> pred_attacker(tuple_client_B_in_3(VAR_V_167)))) # label(ax139) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 48 (all VAR_V_170X30 (pred_attacker(tuple_client_B_in_3(VAR_V_170X30)) -> pred_attacker(VAR_V_170X30))) # label(ax140) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 49 (all VAR_V_173 (pred_attacker(VAR_V_173) -> pred_attacker(tuple_client_B_in_2(VAR_V_173)))) # label(ax141) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 50 (all VAR_V_176 (pred_attacker(tuple_client_B_in_2(VAR_V_176)) -> pred_attacker(VAR_V_176))) # label(ax142) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 51 (all VAR_V_179 (pred_attacker(VAR_V_179) -> pred_attacker(tuple_client_A_out_5(VAR_V_179)))) # label(ax143) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 52 (all VAR_V_182 (pred_attacker(tuple_client_A_out_5(VAR_V_182)) -> pred_attacker(VAR_V_182))) # label(ax144) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 53 (all VAR_V_185 (pred_attacker(VAR_V_185) -> pred_attacker(tuple_client_A_out_3(VAR_V_185)))) # label(ax145) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 54 (all VAR_V_188 (pred_attacker(tuple_client_A_out_3(VAR_V_188)) -> pred_attacker(VAR_V_188))) # label(ax146) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 55 (all VAR_V_192 all VAR_V_193 (pred_attacker(VAR_V_192) & pred_attacker(VAR_V_193) -> pred_attacker(tuple_client_A_out_1(VAR_V_192,VAR_V_193)))) # label(ax147) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 56 (all VAR_V_20X300X30 all VAR_V_20X301 (pred_attacker(tuple_client_A_out_1(VAR_V_20X300X30,VAR_V_20X301)) -> pred_attacker(VAR_V_20X300X30))) # label(ax148) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 57 (all VAR_V_20X303 all VAR_V_20X304 (pred_attacker(tuple_client_A_out_1(VAR_V_20X303,VAR_V_20X304)) -> pred_attacker(VAR_V_20X304))) # label(ax149) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 58 (all VAR_V_20X307 (pred_attacker(VAR_V_20X307) -> pred_attacker(tuple_client_A_in_4(VAR_V_20X307)))) # label(ax150) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 59 (all VAR_V_210X30 (pred_attacker(tuple_client_A_in_4(VAR_V_210X30)) -> pred_attacker(VAR_V_210X30))) # label(ax151) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 60 (all VAR_V_213 (pred_attacker(VAR_V_213) -> pred_attacker(tuple_client_A_in_2(VAR_V_213)))) # label(ax152) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 61 (all VAR_V_216 (pred_attacker(tuple_client_A_in_2(VAR_V_216)) -> pred_attacker(VAR_V_216))) # label(ax153) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 62 (all VAR_V_220X30 all VAR_V_221 (pred_attacker(VAR_V_220X30) & pred_attacker(VAR_V_221) -> pred_attacker(constr_checksign(VAR_V_220X30,VAR_V_221)))) # label(ax154) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 63 (all VAR_V_224 all VAR_V_225 (pred_attacker(VAR_V_224) & pred_attacker(VAR_V_225) -> pred_attacker(constr_aenc(VAR_V_224,VAR_V_225)))) # label(ax155) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 64 (all VAR_V_228 all VAR_V_229 (pred_attacker(VAR_V_228) & pred_attacker(VAR_V_229) -> pred_attacker(constr_adec(VAR_V_228,VAR_V_229)))) # label(ax156) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 65 (all VAR_V_236 all VAR_V_237 (pred_attacker(VAR_V_236) & pred_attacker(VAR_V_237) -> pred_attacker(tuple_2(VAR_V_236,VAR_V_237)))) # label(ax163) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 66 (all VAR_V_244 all VAR_V_245 (pred_attacker(tuple_2(VAR_V_244,VAR_V_245)) -> pred_attacker(VAR_V_244))) # label(ax164) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 67 (all VAR_V_247 all VAR_V_248 (pred_attacker(tuple_2(VAR_V_247,VAR_V_248)) -> pred_attacker(VAR_V_248))) # label(ax165) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 68 (all VAR_V_250X30 all VAR_V_251 (pred_mess(VAR_V_251,VAR_V_250X30) & pred_attacker(VAR_V_251) -> pred_attacker(VAR_V_250X30))) # label(ax166) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 69 (all VAR_V_252 all VAR_V_253 (pred_attacker(VAR_V_253) & pred_attacker(VAR_V_252) -> pred_mess(VAR_V_253,VAR_V_252))) # label(ax167) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 70 (all VAR_V_255 pred_equal(VAR_V_255,VAR_V_255)) # label(ax172) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 71 (all VAR_V_256 pred_attacker(name_new0x2Dname(VAR_V_256))) # label(ax173) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 72 (all VAR_0X40SID_376 all VAR_SIGN_I_PKI_375 (pred_eq_bitstring_bitstring(name_I,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_I_PKI_375,constr_pkey(name_skS)))) & pred_attacker(tuple_client_A_in_2(VAR_SIGN_I_PKI_375)) -> pred_attacker(tuple_client_A_out_3(constr_aenc(tuple_2(name_Na(VAR_0X40SID_376),name_A),constr_tuple_2_get_1_bitstring(constr_checksign(VAR_SIGN_I_PKI_375,constr_pkey(name_skS)))))))) # label(ax180) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 73 (all VAR_0X40SID_435 all VAR_AENC_NA_XOR_I_NI_434 all VAR_SIGN_I_PKI_436 (pred_eq_bitstring_bitstring(name_I,constr_xor(constr_tuple_2_get_0x30_bitstring(constr_adec(VAR_AENC_NA_XOR_I_NI_434,name_skA)),name_Na(VAR_0X40SID_435))) & pred_attacker(tuple_client_A_in_4(VAR_AENC_NA_XOR_I_NI_434)) & pred_eq_bitstring_bitstring(name_I,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_I_PKI_436,constr_pkey(name_skS)))) & pred_attacker(tuple_client_A_in_2(VAR_SIGN_I_PKI_436)) -> pred_attacker(tuple_client_A_out_5(constr_aenc(constr_tuple_2_get_1_bitstring(constr_adec(VAR_AENC_NA_XOR_I_NI_434,name_skA)),constr_tuple_2_get_1_bitstring(constr_checksign(VAR_SIGN_I_PKI_436,constr_pkey(name_skS)))))))) # label(ax181) # label(axiom) # label(non_clause). [assumption].
% 0.81/1.07 74 (all VAR_0X40SID_553 all VAR_AENC_NA_A_551 all VAR_SIGN_A_PKA_552 (pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(VAR_AENC_NA_A_551,name_skB))) & pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_551)) & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_A_PKA_552,constr_pkey(name_skS)))) & pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_552)) -> pred_attacker(tuple_client_B_out_4(constr_aenc(tuple_2(constr_xor(constr_tuple_2_get_0x30_bitstring(constr_adec(VAR_AENC_NA_A_551,name_skB)),name_B),name_Nb(VAR_0X40SID_553)),constr_tuple_2_get_1_bitstring(constr_checksign(VAR_SIGN_A_PKA_552,constr_pkey(name_skS)))))))) # label(ax183) # label(axiom) # label(non_clause). [assumption].
% 179.16/179.47 75 (all VAR_0X40SID_577 all VAR_AENC_NA_A_579 all VAR_AENC_NB_578 all VAR_SIGN_A_PKA_580X30 (pred_eq_bitstring_bitstring(name_Nb(VAR_0X40SID_577),constr_adec(VAR_AENC_NB_578,name_skB)) & pred_attacker(tuple_client_B_in_5(VAR_AENC_NB_578)) & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(VAR_AENC_NA_A_579,name_skB))) & pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_579)) & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_A_PKA_580X30,constr_pkey(name_skS)))) & pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_580X30)) -> pred_attacker(tuple_client_B_out_6(name_objective)))) # label(ax184) # label(axiom) # label(non_clause). [assumption].
% 179.16/179.47 76 (all VAR_DST_619 all VAR_PKDST_620X30 all VAR_SRC_621 (pred_table(tuple_keys(VAR_DST_619,VAR_PKDST_620X30)) & pred_attacker(tuple_key_retrieval_server_in_1(VAR_SRC_621,VAR_DST_619)) -> pred_attacker(tuple_key_retrieval_server_out_2(constr_sign(tuple_2(VAR_DST_619,VAR_PKDST_620X30),name_skS))))) # label(ax185) # label(axiom) # label(non_clause). [assumption].
% 179.16/179.47 77 (all VAR_HOST_673 all VAR_PK_674 (VAR_HOST_673 != name_B & VAR_HOST_673 != name_A & pred_attacker(tuple_key_register_server_in_1(VAR_HOST_673,VAR_PK_674)) -> pred_table(tuple_keys(VAR_HOST_673,VAR_PK_674)))) # label(ax186) # label(axiom) # label(non_clause). [assumption].
% 179.16/179.47
% 179.16/179.47 ============================== end of process non-clausal formulas ===
% 179.16/179.47
% 179.16/179.47 ============================== PROCESS INITIAL CLAUSES ===============
% 179.16/179.47
% 179.16/179.47 ============================== PREDICATE ELIMINATION =================
% 179.16/179.47 78 -pred_attacker(A) | -pred_attacker(B) | pred_mess(A,B) # label(ax167) # label(axiom). [clausify(69)].
% 179.16/179.47 79 -pred_mess(A,B) | -pred_attacker(A) | pred_attacker(B) # label(ax166) # label(axiom). [clausify(68)].
% 179.16/179.47
% 179.16/179.47 ============================== end predicate elimination =============
% 179.16/179.47
% 179.16/179.47 Auto_denials: (non-Horn, no changes).
% 179.16/179.47
% 179.16/179.47 Term ordering decisions:
% 179.16/179.47 Function symbol KB weights: name_A=1. name_skS=1. name_skB=1. name_B=1. name_I=1. name_skA=1. constr_ZERO=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. constr_xor=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_0x30_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. 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.
% 179.16/179.47
% 179.16/179.47 ============================== end of process initial clauses ========
% 179.16/179.47
% 179.16/179.47 ============================== CLAUSES FOR SEARCH ====================
% 179.16/179.47
% 179.16/179.47 ============================== end of clauses for search =============
% 179.16/179.47
% 179.16/179.47 ============================== SEARCH ================================
% 179.16/179.47
% 179.16/179.47 % Starting search at 0.04 seconds.
% 179.16/179.47
% 179.16/179.47 Low Water (keep): wt=20.000, iters=3353
% 179.16/179.47
% 179.16/179.47 Low Water (keep): wt=7.000, iters=3366
% 179.16/179.47
% 179.16/179.47 Low Water (keep): wt=6.000, iters=3336
% 179.16/179.47
% 179.16/179.47 Low Water (keep): wt=5.000, iters=3345
% 179.16/179.47
% 179.16/179.47 Low Water (displace): id=5719, wt=20.000
% 179.16/179.47
% 179.16/179.47 Low Water (displace): id=5438, wt=15.000
% 179.16/179.47
% 179.16/179.47 Low Water (displace): id=5370, wt=12.000
% 179.16/179.47
% 179.16/179.47 Low Water (displace): id=10572, wt=4.000
% 179.16/179.47
% 179.16/179.47 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 11406 (0.00 of 0.64 sec).
% 179.16/179.47
% 179.16/179.47 ============================== PROOF =================================
% 179.16/179.47 % SZS status Theorem
% 179.16/179.47 % SZS output start Refutation
% 179.16/179.47
% 179.16/179.47 % Proof 1 at 153.82 (+ 24.58) seconds.
% 179.16/179.47 % Length of proof is 35.
% 179.16/179.47 % Level of proof is 8.
% 179.16/179.47 % Maximum clause weight is 12.000.
% 179.16/179.47 % Given clauses 27028.
% 179.16/179.47
% 179.16/179.47 13 (all VAR_X_41 all VAR_Y_42 pred_eq_bitstring_bitstring(VAR_X_41,VAR_Y_42)) # label(ax103) # label(axiom) # label(non_clause). [assumption].
% 179.16/179.47 29 (all VAR_V_92 all VAR_V_93 (pred_attacker(VAR_V_92) & pred_attacker(VAR_V_93) -> pred_attacker(tuple_key_retrieval_server_in_1(VAR_V_92,VAR_V_93)))) # label(ax120) # label(axiom) # label(non_clause). [assumption].
% 179.16/179.47 39 (all VAR_V_136 (pred_attacker(tuple_client_B_out_6(VAR_V_136)) -> pred_attacker(VAR_V_136))) # label(ax131) # label(axiom) # label(non_clause). [assumption].
% 179.16/179.47 45 (all VAR_V_161 (pred_attacker(VAR_V_161) -> pred_attacker(tuple_client_B_in_5(VAR_V_161)))) # label(ax137) # label(axiom) # label(non_clause). [assumption].
% 179.16/179.47 47 (all VAR_V_167 (pred_attacker(VAR_V_167) -> pred_attacker(tuple_client_B_in_3(VAR_V_167)))) # label(ax139) # label(axiom) # label(non_clause). [assumption].
% 179.16/179.47 49 (all VAR_V_173 (pred_attacker(VAR_V_173) -> pred_attacker(tuple_client_B_in_2(VAR_V_173)))) # label(ax141) # label(axiom) # label(non_clause). [assumption].
% 179.16/179.47 55 (all VAR_V_192 all VAR_V_193 (pred_attacker(VAR_V_192) & pred_attacker(VAR_V_193) -> pred_attacker(tuple_client_A_out_1(VAR_V_192,VAR_V_193)))) # label(ax147) # label(axiom) # label(non_clause). [assumption].
% 179.16/179.47 75 (all VAR_0X40SID_577 all VAR_AENC_NA_A_579 all VAR_AENC_NB_578 all VAR_SIGN_A_PKA_580X30 (pred_eq_bitstring_bitstring(name_Nb(VAR_0X40SID_577),constr_adec(VAR_AENC_NB_578,name_skB)) & pred_attacker(tuple_client_B_in_5(VAR_AENC_NB_578)) & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(VAR_AENC_NA_A_579,name_skB))) & pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_579)) & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_A_PKA_580X30,constr_pkey(name_skS)))) & pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_580X30)) -> pred_attacker(tuple_client_B_out_6(name_objective)))) # label(ax184) # label(axiom) # label(non_clause). [assumption].
% 179.16/179.47 221 pred_eq_bitstring_bitstring(A,B) # label(ax103) # label(axiom). [clausify(13)].
% 179.16/179.47 227 pred_attacker(tuple_true) # label(ax109) # label(axiom). [assumption].
% 179.16/179.47 238 -pred_attacker(A) | -pred_attacker(B) | pred_attacker(tuple_key_retrieval_server_in_1(A,B)) # label(ax120) # label(axiom). [clausify(29)].
% 179.16/179.47 245 pred_attacker(tuple_false) # label(ax127) # label(axiom). [assumption].
% 179.16/179.47 249 -pred_attacker(tuple_client_B_out_6(A)) | pred_attacker(A) # label(ax131) # label(axiom). [clausify(39)].
% 179.16/179.47 255 -pred_attacker(A) | pred_attacker(tuple_client_B_in_5(A)) # label(ax137) # label(axiom). [clausify(45)].
% 179.16/179.47 257 -pred_attacker(A) | pred_attacker(tuple_client_B_in_3(A)) # label(ax139) # label(axiom). [clausify(47)].
% 179.16/179.47 259 -pred_attacker(A) | pred_attacker(tuple_client_B_in_2(A)) # label(ax141) # label(axiom). [clausify(49)].
% 179.16/179.47 265 -pred_attacker(A) | -pred_attacker(B) | pred_attacker(tuple_client_A_out_1(A,B)) # label(ax147) # label(axiom). [clausify(55)].
% 179.16/179.47 275 pred_attacker(constr_ZERO) # label(ax157) # label(axiom). [assumption].
% 179.16/179.47 276 pred_attacker(constr_CONST_4) # label(ax158) # label(axiom). [assumption].
% 179.16/179.47 302 -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(ax184) # label(axiom). [clausify(75)].
% 179.16/179.47 303 -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(302),unit_del(a,221),unit_del(c,221),unit_del(e,221)].
% 179.16/179.47 307 -pred_attacker(name_objective) # label(co0) # label(negated_conjecture). [assumption].
% 179.16/179.47 370 pred_attacker(tuple_client_B_in_5(tuple_false)). [resolve(255,a,245,a)].
% 179.16/179.47 373 pred_attacker(tuple_client_B_in_3(tuple_true)). [resolve(257,a,227,a)].
% 179.16/179.47 453 pred_attacker(tuple_client_B_in_5(constr_CONST_4)). [resolve(276,a,255,a)].
% 179.16/179.47 2813 -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(370,a,303,a)].
% 179.16/179.47 3003 -pred_attacker(A) | pred_attacker(tuple_client_A_out_1(A,tuple_client_B_in_3(tuple_true))). [resolve(373,a,265,b)].
% 179.16/179.47 5884 -pred_attacker(A) | pred_attacker(tuple_key_retrieval_server_in_1(A,tuple_client_B_in_5(constr_CONST_4))). [resolve(453,a,238,b)].
% 179.16/179.47 16725 pred_attacker(tuple_client_A_out_1(tuple_true,tuple_client_B_in_3(tuple_true))). [resolve(3003,a,227,a)].
% 179.16/179.47 21837 pred_attacker(tuple_key_retrieval_server_in_1(constr_ZERO,tuple_client_B_in_5(constr_CONST_4))). [resolve(5884,a,275,a)].
% 179.16/179.47 23758 pred_attacker(tuple_client_B_in_2(tuple_client_A_out_1(tuple_true,tuple_client_B_in_3(tuple_true)))). [resolve(16725,a,259,a)].
% 179.16/179.47 29093 pred_attacker(tuple_client_B_in_3(tuple_key_retrieval_server_in_1(constr_ZERO,tuple_client_B_in_5(constr_CONST_4)))). [resolve(21837,a,257,a)].
% 179.16/179.47 29107 -pred_attacker(tuple_client_B_in_3(A)) | pred_attacker(tuple_client_B_out_6(name_objective)). [resolve(23758,a,2813,b)].
% 179.16/179.47 34182 pred_attacker(tuple_client_B_out_6(name_objective)). [resolve(29107,a,29093,a)].
% 179.16/179.47 35972 $F. [resolve(34182,a,249,a),unit_del(a,307)].
% 179.16/179.47
% 179.16/179.47 % SZS output end Refutation
% 179.16/179.47 ============================== end of proof ==========================
% 179.16/179.47
% 179.16/179.47 ============================== STATISTICS ============================
% 179.16/179.47
% 179.16/179.47 Given=27028. Generated=47978085. Kept=35849. proofs=1.
% 179.16/179.47 Usable=27027. Sos=5657. Demods=13. Limbo=1789, Disabled=1564. Hints=0.
% 179.16/179.47 Megabytes=20.04.
% 179.16/179.47 User_CPU=153.82, System_CPU=24.58, Wall_clock=179.
% 179.16/179.47
% 179.16/179.47 ============================== end of statistics =====================
% 179.16/179.47
% 179.16/179.47 ============================== end of search =========================
% 179.16/179.47
% 179.16/179.47 THEOREM PROVED
% 179.16/179.47 % SZS status Theorem
% 179.16/179.47
% 179.16/179.47 Exiting with 1 proof.
% 179.16/179.47
% 179.16/179.47 Process 6645 exit (max_proofs) Mon Jun 6 08:17:49 2022
% 179.16/179.47 Prover9 interrupted
%------------------------------------------------------------------------------