TSTP Solution File: SWW961+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWW961+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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 0.82s 1.09s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW961+1 : TPTP v8.1.0. Released v7.4.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 4 15:10:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.44/1.06 ============================== Prover9 ===============================
% 0.44/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.06 Process 22865 was started by sandbox on n027.cluster.edu,
% 0.44/1.06 Sat Jun 4 15:10:07 2022
% 0.44/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22712_n027.cluster.edu".
% 0.44/1.06 ============================== end of head ===========================
% 0.44/1.06
% 0.44/1.06 ============================== INPUT =================================
% 0.44/1.06
% 0.44/1.06 % Reading from file /tmp/Prover9_22712_n027.cluster.edu
% 0.44/1.06
% 0.44/1.06 set(prolog_style_variables).
% 0.44/1.06 set(auto2).
% 0.44/1.06 % set(auto2) -> set(auto).
% 0.44/1.06 % set(auto) -> set(auto_inference).
% 0.44/1.06 % set(auto) -> set(auto_setup).
% 0.44/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.06 % set(auto) -> set(auto_limits).
% 0.44/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.06 % set(auto) -> set(auto_denials).
% 0.44/1.06 % set(auto) -> set(auto_process).
% 0.44/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.06 % set(auto2) -> assign(stats, some).
% 0.44/1.06 % set(auto2) -> clear(echo_input).
% 0.44/1.06 % set(auto2) -> set(quiet).
% 0.44/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.06 % set(auto2) -> clear(print_given).
% 0.44/1.06 assign(lrs_ticks,-1).
% 0.44/1.06 assign(sos_limit,10000).
% 0.44/1.06 assign(order,kbo).
% 0.44/1.06 set(lex_order_vars).
% 0.44/1.06 clear(print_given).
% 0.44/1.06
% 0.44/1.06 % formulas(sos). % not echoed (177 formulas)
% 0.44/1.06
% 0.44/1.06 ============================== end of input ==========================
% 0.44/1.06
% 0.44/1.06 % From the command line: assign(max_seconds, 300).
% 0.44/1.06
% 0.44/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.06
% 0.44/1.06 % Formulas that are not ordinary clauses:
% 0.44/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(ax78) # label(axiom) # label(non_clause). [assumption].
% 0.44/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(ax79) # label(axiom) # label(non_clause). [assumption].
% 0.44/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(ax80) # label(axiom) # label(non_clause). [assumption].
% 0.44/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.44/1.06 5 (all VAR_X_17 all VAR_Y_18 all VAR_Z_0X30 tuple_assoc_pair(VAR_X_17,tuple_assoc_pair(VAR_Y_18,VAR_Z_0X30)) = tuple_assoc_pair(tuple_assoc_pair(VAR_X_17,VAR_Y_18),VAR_Z_0X30)) # label(ax82) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 6 (all VAR_X0X30_15 all VAR_X1_16 constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(VAR_X0X30_15,VAR_X1_16)) = VAR_X1_16) # label(ax83) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 7 (all VAR_X0X30_13 all VAR_X1_14 constr_assoc_pair_2_get_0x30_bitstring(tuple_assoc_pair(VAR_X0X30_13,VAR_X1_14)) = VAR_X0X30_13) # label(ax84) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 8 (all VAR_X0X30_11 all VAR_X1_12 constr_assoc_pair_2_get_1(tuple_assoc_pair(VAR_X0X30_11,VAR_X1_12)) = VAR_X1_12) # label(ax85) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 9 (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.44/1.06 10 (all VAR_X0X30_7 all VAR_X1_8 constr_tuple_2_get_1_bitstring(tuple_2(VAR_X0X30_7,VAR_X1_8)) = VAR_X1_8) # label(ax87) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 11 (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.44/1.06 12 (all VAR_X_41 all VAR_Y_42 pred_eq_bitstring_bitstring(VAR_X_41,VAR_Y_42)) # label(ax89) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 13 (all VAR_V_48 (pred_attacker(VAR_V_48) -> pred_attacker(constr_tuple_2_get_1_bitstring(VAR_V_48)))) # label(ax90) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 14 (all VAR_V_50X30 (pred_attacker(VAR_V_50X30) -> pred_attacker(constr_tuple_2_get_0x30(VAR_V_50X30)))) # label(ax91) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 15 (all VAR_V_53 all VAR_V_54 (pred_attacker(VAR_V_53) & pred_attacker(VAR_V_54) -> pred_attacker(constr_sign(VAR_V_53,VAR_V_54)))) # label(ax93) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 16 (all VAR_V_56 (pred_attacker(VAR_V_56) -> pred_attacker(constr_pkey(VAR_V_56)))) # label(ax94) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 17 (all VAR_V_58 (pred_attacker(VAR_V_58) -> pred_attacker(tuple_out_3(VAR_V_58)))) # label(ax95) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 18 (all VAR_V_61 (pred_attacker(tuple_out_3(VAR_V_61)) -> pred_attacker(VAR_V_61))) # label(ax96) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 19 (all VAR_V_64 (pred_attacker(VAR_V_64) -> pred_attacker(tuple_out_2(VAR_V_64)))) # label(ax97) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 20 (all VAR_V_67 (pred_attacker(tuple_out_2(VAR_V_67)) -> pred_attacker(VAR_V_67))) # label(ax98) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 21 (all VAR_V_70X30 (pred_attacker(VAR_V_70X30) -> pred_attacker(tuple_out_1(VAR_V_70X30)))) # label(ax99) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 22 (all VAR_V_73 (pred_attacker(tuple_out_1(VAR_V_73)) -> pred_attacker(VAR_V_73))) # label(ax100) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 23 (all VAR_V_77 (pred_attacker(VAR_V_77) -> pred_attacker(tuple_key_retrieval_server_out_2(VAR_V_77)))) # label(ax101) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 24 (all VAR_V_80X30 (pred_attacker(tuple_key_retrieval_server_out_2(VAR_V_80X30)) -> pred_attacker(VAR_V_80X30))) # label(ax102) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 25 (all VAR_V_84 all VAR_V_85 (pred_attacker(VAR_V_84) & pred_attacker(VAR_V_85) -> pred_attacker(tuple_key_retrieval_server_in_1(VAR_V_84,VAR_V_85)))) # label(ax103) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 26 (all VAR_V_92 all VAR_V_93 (pred_attacker(tuple_key_retrieval_server_in_1(VAR_V_92,VAR_V_93)) -> pred_attacker(VAR_V_92))) # label(ax104) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 27 (all VAR_V_95 all VAR_V_96 (pred_attacker(tuple_key_retrieval_server_in_1(VAR_V_95,VAR_V_96)) -> pred_attacker(VAR_V_96))) # label(ax105) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 28 (all VAR_V_10X300X30 all VAR_V_10X301 (pred_attacker(VAR_V_10X300X30) & pred_attacker(VAR_V_10X301) -> pred_attacker(tuple_key_register_server_in_1(VAR_V_10X300X30,VAR_V_10X301)))) # label(ax106) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 29 (all VAR_V_10X308 all VAR_V_10X309 (pred_attacker(tuple_key_register_server_in_1(VAR_V_10X308,VAR_V_10X309)) -> pred_attacker(VAR_V_10X308))) # label(ax107) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 30 (all VAR_V_111 all VAR_V_112 (pred_attacker(tuple_key_register_server_in_1(VAR_V_111,VAR_V_112)) -> pred_attacker(VAR_V_112))) # label(ax108) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 31 (all VAR_V_115 (pred_attacker(VAR_V_115) -> pred_attacker(constr_getmess(VAR_V_115)))) # label(ax109) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 32 (all VAR_V_118 all VAR_V_119 (pred_attacker(VAR_V_118) & pred_attacker(VAR_V_119) -> pred_attacker(constr_enc(VAR_V_118,VAR_V_119)))) # label(ax111) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 33 (all VAR_V_122 all VAR_V_123 (pred_attacker(VAR_V_122) & pred_attacker(VAR_V_123) -> pred_attacker(constr_dec(VAR_V_122,VAR_V_123)))) # label(ax112) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 34 (all VAR_V_125 (pred_attacker(VAR_V_125) -> pred_attacker(tuple_client_B_out_6(VAR_V_125)))) # label(ax113) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 35 (all VAR_V_128 (pred_attacker(tuple_client_B_out_6(VAR_V_128)) -> pred_attacker(VAR_V_128))) # label(ax114) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 36 (all VAR_V_131 (pred_attacker(VAR_V_131) -> pred_attacker(tuple_client_B_out_4(VAR_V_131)))) # label(ax115) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 37 (all VAR_V_134 (pred_attacker(tuple_client_B_out_4(VAR_V_134)) -> pred_attacker(VAR_V_134))) # label(ax116) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 38 (all VAR_V_138 all VAR_V_139 (pred_attacker(VAR_V_138) & pred_attacker(VAR_V_139) -> pred_attacker(tuple_client_B_out_1(VAR_V_138,VAR_V_139)))) # label(ax117) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 39 (all VAR_V_146 all VAR_V_147 (pred_attacker(tuple_client_B_out_1(VAR_V_146,VAR_V_147)) -> pred_attacker(VAR_V_146))) # label(ax118) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 40 (all VAR_V_149 all VAR_V_150X30 (pred_attacker(tuple_client_B_out_1(VAR_V_149,VAR_V_150X30)) -> pred_attacker(VAR_V_150X30))) # label(ax119) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 41 (all VAR_V_153 (pred_attacker(VAR_V_153) -> pred_attacker(tuple_client_B_in_5(VAR_V_153)))) # label(ax120) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 42 (all VAR_V_156 (pred_attacker(tuple_client_B_in_5(VAR_V_156)) -> pred_attacker(VAR_V_156))) # label(ax121) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 43 (all VAR_V_159 (pred_attacker(VAR_V_159) -> pred_attacker(tuple_client_B_in_3(VAR_V_159)))) # label(ax122) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 44 (all VAR_V_162 (pred_attacker(tuple_client_B_in_3(VAR_V_162)) -> pred_attacker(VAR_V_162))) # label(ax123) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 45 (all VAR_V_165 (pred_attacker(VAR_V_165) -> pred_attacker(tuple_client_B_in_2(VAR_V_165)))) # label(ax124) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 46 (all VAR_V_168 (pred_attacker(tuple_client_B_in_2(VAR_V_168)) -> pred_attacker(VAR_V_168))) # label(ax125) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 47 (all VAR_V_171 (pred_attacker(VAR_V_171) -> pred_attacker(tuple_client_A_out_5(VAR_V_171)))) # label(ax126) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 48 (all VAR_V_174 (pred_attacker(tuple_client_A_out_5(VAR_V_174)) -> pred_attacker(VAR_V_174))) # label(ax127) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 49 (all VAR_V_177 (pred_attacker(VAR_V_177) -> pred_attacker(tuple_client_A_out_3(VAR_V_177)))) # label(ax128) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 50 (all VAR_V_180X30 (pred_attacker(tuple_client_A_out_3(VAR_V_180X30)) -> pred_attacker(VAR_V_180X30))) # label(ax129) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 51 (all VAR_V_184 all VAR_V_185 (pred_attacker(VAR_V_184) & pred_attacker(VAR_V_185) -> pred_attacker(tuple_client_A_out_1(VAR_V_184,VAR_V_185)))) # label(ax130) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 52 (all VAR_V_192 all VAR_V_193 (pred_attacker(tuple_client_A_out_1(VAR_V_192,VAR_V_193)) -> pred_attacker(VAR_V_192))) # label(ax131) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 53 (all VAR_V_195 all VAR_V_196 (pred_attacker(tuple_client_A_out_1(VAR_V_195,VAR_V_196)) -> pred_attacker(VAR_V_196))) # label(ax132) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 54 (all VAR_V_199 (pred_attacker(VAR_V_199) -> pred_attacker(tuple_client_A_in_4(VAR_V_199)))) # label(ax133) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 55 (all VAR_V_20X302 (pred_attacker(tuple_client_A_in_4(VAR_V_20X302)) -> pred_attacker(VAR_V_20X302))) # label(ax134) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 56 (all VAR_V_20X305 (pred_attacker(VAR_V_20X305) -> pred_attacker(tuple_client_A_in_2(VAR_V_20X305)))) # label(ax135) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 57 (all VAR_V_20X308 (pred_attacker(tuple_client_A_in_2(VAR_V_20X308)) -> pred_attacker(VAR_V_20X308))) # label(ax136) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 58 (all VAR_V_212 all VAR_V_213 (pred_attacker(VAR_V_212) & pred_attacker(VAR_V_213) -> pred_attacker(constr_checksign(VAR_V_212,VAR_V_213)))) # label(ax137) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 59 (all VAR_V_215 (pred_attacker(VAR_V_215) -> pred_attacker(constr_assoc_pair_2_get_1_bitstring(VAR_V_215)))) # label(ax138) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 60 (all VAR_V_217 (pred_attacker(VAR_V_217) -> pred_attacker(constr_assoc_pair_2_get_1(VAR_V_217)))) # label(ax139) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 61 (all VAR_V_219 (pred_attacker(VAR_V_219) -> pred_attacker(constr_assoc_pair_2_get_0x30_bitstring(VAR_V_219)))) # label(ax140) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 62 (all VAR_V_221 (pred_attacker(VAR_V_221) -> pred_attacker(constr_assoc_pair_2_get_0x30(VAR_V_221)))) # label(ax141) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 63 (all VAR_V_224 all VAR_V_225 (pred_attacker(VAR_V_224) & pred_attacker(VAR_V_225) -> pred_attacker(tuple_assoc_pair(VAR_V_224,VAR_V_225)))) # label(ax142) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 64 (all VAR_V_232 all VAR_V_233 (pred_attacker(tuple_assoc_pair(VAR_V_232,VAR_V_233)) -> pred_attacker(VAR_V_232))) # label(ax143) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 65 (all VAR_V_235 all VAR_V_236 (pred_attacker(tuple_assoc_pair(VAR_V_235,VAR_V_236)) -> pred_attacker(VAR_V_236))) # label(ax144) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 66 (all VAR_V_240X30 all VAR_V_241 (pred_attacker(VAR_V_240X30) & pred_attacker(VAR_V_241) -> pred_attacker(constr_aenc(VAR_V_240X30,VAR_V_241)))) # label(ax145) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 67 (all VAR_V_244 all VAR_V_245 (pred_attacker(VAR_V_244) & pred_attacker(VAR_V_245) -> pred_attacker(constr_adec(VAR_V_244,VAR_V_245)))) # label(ax146) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 68 (all VAR_V_252 all VAR_V_253 (pred_attacker(VAR_V_252) & pred_attacker(VAR_V_253) -> pred_attacker(tuple_2(VAR_V_252,VAR_V_253)))) # label(ax152) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 69 (all VAR_V_260X30 all VAR_V_261 (pred_attacker(tuple_2(VAR_V_260X30,VAR_V_261)) -> pred_attacker(VAR_V_260X30))) # label(ax153) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 70 (all VAR_V_263 all VAR_V_264 (pred_attacker(tuple_2(VAR_V_263,VAR_V_264)) -> pred_attacker(VAR_V_264))) # label(ax154) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 71 (all VAR_V_266 all VAR_V_267 (pred_mess(VAR_V_267,VAR_V_266) & pred_attacker(VAR_V_267) -> pred_attacker(VAR_V_266))) # label(ax155) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 72 (all VAR_V_268 all VAR_V_269 (pred_attacker(VAR_V_269) & pred_attacker(VAR_V_268) -> pred_mess(VAR_V_269,VAR_V_268))) # label(ax156) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 73 (all VAR_V_271 pred_equal(VAR_V_271,VAR_V_271)) # label(ax161) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 74 (all VAR_V_272 pred_attacker(name_new0x2Dname(VAR_V_272))) # label(ax162) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 75 (all VAR_0X40SID_392 all VAR_SIGN_I_PKI_391 (pred_eq_bitstring_bitstring(name_I,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_I_PKI_391,constr_pkey(name_skS)))) & pred_attacker(tuple_client_A_in_2(VAR_SIGN_I_PKI_391)) -> pred_attacker(tuple_client_A_out_3(constr_aenc(tuple_assoc_pair(name_Na(VAR_0X40SID_392),name_A),constr_tuple_2_get_1_bitstring(constr_checksign(VAR_SIGN_I_PKI_391,constr_pkey(name_skS)))))))) # label(ax169) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.06 76 (all VAR_0X40SID_463 all VAR_AENC_NA_NI_I_462 all VAR_SIGN_I_PKI_464 (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_462,name_skA)))) & pred_eq_bitstring_bitstring(name_Na(VAR_0X40SID_463),constr_assoc_pair_2_get_0x30(constr_adec(VAR_AENC_NA_NI_I_462,name_skA))) & pred_attacker(tuple_client_A_in_4(VAR_AENC_NA_NI_I_462)) & pred_eq_bitstring_bitstring(name_I,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_I_PKI_464,constr_pkey(name_skS)))) & pred_attacker(tuple_client_A_in_2(VAR_SIGN_I_PKI_464)) -> 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_462,name_skA))),constr_tuple_2_get_1_bitstring(constr_checksign(VAR_SIGN_I_PKI_464,constr_pkey(name_skS)))))))) # label(ax170) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.08 77 (all VAR_0X40SID_581 all VAR_AENC_NA_A_579 all VAR_SIGN_A_PKA_580X30 (pred_eq_bitstring_bitstring(name_A,constr_assoc_pair_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_4(constr_aenc(tuple_assoc_pair(constr_assoc_pair_2_get_0x30_bitstring(constr_adec(VAR_AENC_NA_A_579,name_skB)),tuple_assoc_pair(name_Nb(VAR_0X40SID_581),name_B)),constr_tuple_2_get_1_bitstring(constr_checksign(VAR_SIGN_A_PKA_580X30,constr_pkey(name_skS)))))))) # label(ax172) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.08 78 (all VAR_0X40SID_60X305 all VAR_AENC_NA_A_60X307 all VAR_AENC_NB_60X306 all VAR_SIGN_A_PKA_60X308 (pred_eq_bitstring_bitstring(name_Nb(VAR_0X40SID_60X305),constr_adec(VAR_AENC_NB_60X306,name_skB)) & pred_attacker(tuple_client_B_in_5(VAR_AENC_NB_60X306)) & pred_eq_bitstring_bitstring(name_A,constr_assoc_pair_2_get_1(constr_adec(VAR_AENC_NA_A_60X307,name_skB))) & pred_attacker(tuple_client_B_in_3(VAR_AENC_NA_A_60X307)) & pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(VAR_SIGN_A_PKA_60X308,constr_pkey(name_skS)))) & pred_attacker(tuple_client_B_in_2(VAR_SIGN_A_PKA_60X308)) -> pred_attacker(tuple_client_B_out_6(name_objective)))) # label(ax173) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.08 79 (all VAR_DST_647 all VAR_PKDST_648 all VAR_SRC_649 (pred_table(tuple_keys(VAR_DST_647,VAR_PKDST_648)) & pred_attacker(tuple_key_retrieval_server_in_1(VAR_SRC_649,VAR_DST_647)) -> pred_attacker(tuple_key_retrieval_server_out_2(constr_sign(tuple_2(VAR_DST_647,VAR_PKDST_648),name_skS))))) # label(ax174) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.08 80 (all VAR_HOST_70X301 all VAR_PK_70X302 (VAR_HOST_70X301 != name_B & VAR_HOST_70X301 != name_A & pred_attacker(tuple_key_register_server_in_1(VAR_HOST_70X301,VAR_PK_70X302)) -> pred_table(tuple_keys(VAR_HOST_70X301,VAR_PK_70X302)))) # label(ax175) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.08
% 0.82/1.08 ============================== end of process non-clausal formulas ===
% 0.82/1.08
% 0.82/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.82/1.08
% 0.82/1.08 ============================== PREDICATE ELIMINATION =================
% 0.82/1.08 81 -pred_attacker(A) | -pred_attacker(B) | pred_mess(A,B) # label(ax156) # label(axiom). [clausify(72)].
% 0.82/1.08 82 -pred_mess(A,B) | -pred_attacker(A) | pred_attacker(B) # label(ax155) # label(axiom). [clausify(71)].
% 0.82/1.08
% 0.82/1.08 ============================== end predicate elimination =============
% 0.82/1.08
% 0.82/1.08 Auto_denials: (non-Horn, no changes).
% 0.82/1.08
% 0.82/1.08 Term ordering decisions:
% 0.82/1.08 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_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.82/1.08
% 0.82/1.08 ============================== end of process initial clauses ========
% 0.82/1.09
% 0.82/1.09 ============================== CLAUSES FOR SEARCH ====================
% 0.82/1.09
% 0.82/1.09 ============================== end of clauses for search =============
% 0.82/1.09
% 0.82/1.09 ============================== SEARCH ================================
% 0.82/1.09
% 0.82/1.09 % Starting search at 0.04 seconds.
% 0.82/1.09
% 0.82/1.09 ============================== PROOF =================================
% 0.82/1.09 % SZS status Theorem
% 0.82/1.09 % SZS output start Refutation
% 0.82/1.09
% 0.82/1.09 % Proof 1 at 0.04 (+ 0.00) seconds.
% 0.82/1.09 % Length of proof is 12.
% 0.82/1.09 % Level of proof is 5.
% 0.82/1.09 % Maximum clause weight is 11.000.
% 0.82/1.09 % Given clauses 110.
% 0.82/1.09
% 0.82/1.09 5 (all VAR_X_17 all VAR_Y_18 all VAR_Z_0X30 tuple_assoc_pair(VAR_X_17,tuple_assoc_pair(VAR_Y_18,VAR_Z_0X30)) = tuple_assoc_pair(tuple_assoc_pair(VAR_X_17,VAR_Y_18),VAR_Z_0X30)) # label(ax82) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.09 6 (all VAR_X0X30_15 all VAR_X1_16 constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(VAR_X0X30_15,VAR_X1_16)) = VAR_X1_16) # label(ax83) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.09 64 (all VAR_V_232 all VAR_V_233 (pred_attacker(tuple_assoc_pair(VAR_V_232,VAR_V_233)) -> pred_attacker(VAR_V_232))) # label(ax143) # label(axiom) # label(non_clause). [assumption].
% 0.82/1.09 200 tuple_assoc_pair(tuple_assoc_pair(A,B),C) = tuple_assoc_pair(A,tuple_assoc_pair(B,C)) # label(ax82) # label(axiom). [clausify(5)].
% 0.82/1.09 201 constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(A,B)) = B # label(ax83) # label(axiom). [clausify(6)].
% 0.82/1.09 261 -pred_attacker(tuple_assoc_pair(A,B)) | pred_attacker(A) # label(ax143) # label(axiom). [clausify(64)].
% 0.82/1.09 288 pred_attacker(tuple_client_B_out_1(name_B,name_A)) # label(ax171) # label(axiom). [assumption].
% 0.82/1.09 296 -pred_attacker(name_objective) # label(co0) # label(negated_conjecture). [assumption].
% 0.82/1.09 309 tuple_assoc_pair(A,B) = B. [para(200(a,1),201(a,1,1)),rewrite([201(3)])].
% 0.82/1.09 312 -pred_attacker(A) | pred_attacker(B). [back_rewrite(261),rewrite([309(1)])].
% 0.82/1.09 317 pred_attacker(A). [resolve(312,a,288,a)].
% 0.82/1.09 318 $F. [resolve(317,a,296,a)].
% 0.82/1.09
% 0.82/1.09 % SZS output end Refutation
% 0.82/1.09 ============================== end of proof ==========================
% 0.82/1.09
% 0.82/1.09 ============================== STATISTICS ============================
% 0.82/1.09
% 0.82/1.09 Given=110. Generated=215. Kept=195. proofs=1.
% 0.82/1.09 Usable=108. Sos=4. Demods=9. Limbo=0, Disabled=259. Hints=0.
% 0.82/1.09 Megabytes=0.31.
% 0.82/1.09 User_CPU=0.04, System_CPU=0.00, Wall_clock=1.
% 0.82/1.09
% 0.82/1.09 ============================== end of statistics =====================
% 0.82/1.09
% 0.82/1.09 ============================== end of search =========================
% 0.82/1.09
% 0.82/1.09 THEOREM PROVED
% 0.82/1.09 % SZS status Theorem
% 0.82/1.09
% 0.82/1.09 Exiting with 1 proof.
% 0.82/1.09
% 0.82/1.09 Process 22865 exit (max_proofs) Sat Jun 4 15:10:08 2022
% 0.82/1.09 Prover9 interrupted
%------------------------------------------------------------------------------