TSTP Solution File: SWW970+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWW970+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:18:00 EDT 2022
% Result : Theorem 21.99s 22.26s
% Output : Refutation 21.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWW970+1 : TPTP v8.1.0. Released v7.4.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 5 11:02:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.04 ============================== Prover9 ===============================
% 0.41/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.41/1.04 Process 5437 was started by sandbox2 on n020.cluster.edu,
% 0.41/1.04 Sun Jun 5 11:02:53 2022
% 0.41/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5102_n020.cluster.edu".
% 0.41/1.04 ============================== end of head ===========================
% 0.41/1.04
% 0.41/1.04 ============================== INPUT =================================
% 0.41/1.04
% 0.41/1.04 % Reading from file /tmp/Prover9_5102_n020.cluster.edu
% 0.41/1.04
% 0.41/1.04 set(prolog_style_variables).
% 0.41/1.04 set(auto2).
% 0.41/1.04 % set(auto2) -> set(auto).
% 0.41/1.04 % set(auto) -> set(auto_inference).
% 0.41/1.04 % set(auto) -> set(auto_setup).
% 0.41/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.41/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.41/1.04 % set(auto) -> set(auto_limits).
% 0.41/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.41/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.41/1.04 % set(auto) -> set(auto_denials).
% 0.41/1.04 % set(auto) -> set(auto_process).
% 0.41/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.41/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.41/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.41/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.41/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.41/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.41/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.41/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.41/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.41/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.41/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.41/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.41/1.04 % set(auto2) -> assign(stats, some).
% 0.41/1.04 % set(auto2) -> clear(echo_input).
% 0.41/1.04 % set(auto2) -> set(quiet).
% 0.41/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.41/1.04 % set(auto2) -> clear(print_given).
% 0.41/1.04 assign(lrs_ticks,-1).
% 0.41/1.04 assign(sos_limit,10000).
% 0.41/1.04 assign(order,kbo).
% 0.41/1.04 set(lex_order_vars).
% 0.41/1.04 clear(print_given).
% 0.41/1.04
% 0.41/1.04 % formulas(sos). % not echoed (139 formulas)
% 0.41/1.04
% 0.41/1.04 ============================== end of input ==========================
% 0.41/1.04
% 0.41/1.04 % From the command line: assign(max_seconds, 300).
% 0.41/1.04
% 0.41/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.41/1.04
% 0.41/1.04 % Formulas that are not ordinary clauses:
% 0.41/1.04 1 (all VAR_K_50X30 all VAR_X0X30_46 all VAR_X1_47 all VAR_X2_48 all VAR_X3_49 constr_cbc_dec_4(constr_cbc_enc_4(VAR_X0X30_46,VAR_X1_47,VAR_X2_48,VAR_X3_49,VAR_K_50X30),VAR_K_50X30) = tuple_4(VAR_X0X30_46,VAR_X1_47,VAR_X2_48,VAR_X3_49)) # label(ax66) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 2 (all VAR_K_45 all VAR_X0X30_42 all VAR_X1_43 all VAR_X2_44 constr_cbc_dec_3(constr_cbc_enc_3(VAR_X0X30_42,VAR_X1_43,VAR_X2_44,VAR_K_45),VAR_K_45) = tuple_3(VAR_X0X30_42,VAR_X1_43,VAR_X2_44)) # label(ax67) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 3 (all VAR_K_41 all VAR_X0X30_39 all VAR_X1_40X30 constr_cbc_dec_2(constr_cbc_enc_2(VAR_X0X30_39,VAR_X1_40X30,VAR_K_41),VAR_K_41) = tuple_2(VAR_X0X30_39,VAR_X1_40X30)) # label(ax68) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 4 (all VAR_K_38 all VAR_X0X30_37 constr_cbc_dec_1(constr_cbc_enc_1(VAR_X0X30_37,VAR_K_38),VAR_K_38) = VAR_X0X30_37) # label(ax69) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 5 (all VAR_K_36 all VAR_X0X30_32 all VAR_X1_33 all VAR_X2_34 all VAR_X3_35 constr_cbc_4_get_3_prefixes(constr_cbc_enc_4(VAR_X0X30_32,VAR_X1_33,VAR_X2_34,VAR_X3_35,VAR_K_36)) = constr_cbc_enc_3(VAR_X0X30_32,VAR_X1_33,VAR_X2_34,VAR_K_36)) # label(ax70) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 6 (all VAR_K_31 all VAR_X0X30_27 all VAR_X1_28 all VAR_X2_29 all VAR_X3_30X30 constr_cbc_4_get_2_prefixes(constr_cbc_enc_4(VAR_X0X30_27,VAR_X1_28,VAR_X2_29,VAR_X3_30X30,VAR_K_31)) = constr_cbc_enc_2(VAR_X0X30_27,VAR_X1_28,VAR_K_31)) # label(ax71) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 7 (all VAR_K_26 all VAR_X0X30_23 all VAR_X1_24 all VAR_X2_25 all VAR_X3_0X30 constr_cbc_4_get_1_prefixes(constr_cbc_enc_4(VAR_X0X30_23,VAR_X1_24,VAR_X2_25,VAR_X3_0X30,VAR_K_26)) = constr_cbc_enc_1(VAR_X0X30_23,VAR_K_26)) # label(ax72) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 8 (all VAR_K_22 all VAR_X0X30_19 all VAR_X1_20X30 all VAR_X2_21 constr_cbc_3_get_2_prefixes(constr_cbc_enc_3(VAR_X0X30_19,VAR_X1_20X30,VAR_X2_21,VAR_K_22)) = constr_cbc_enc_2(VAR_X0X30_19,VAR_X1_20X30,VAR_K_22)) # label(ax73) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 9 (all VAR_K_18 all VAR_X0X30_15 all VAR_X1_16 all VAR_X2_17 constr_cbc_3_get_1_prefixes(constr_cbc_enc_3(VAR_X0X30_15,VAR_X1_16,VAR_X2_17,VAR_K_18)) = constr_cbc_enc_1(VAR_X0X30_15,VAR_K_18)) # label(ax74) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 10 (all VAR_K_0X30 all VAR_X0X30_13 all VAR_X1_14 constr_cbc_2_get_1_prefixes(constr_cbc_enc_2(VAR_X0X30_13,VAR_X1_14,VAR_K_0X30)) = constr_cbc_enc_1(VAR_X0X30_13,VAR_K_0X30)) # label(ax75) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 11 (all VAR_X0X30_10X30 all VAR_X1_11 all VAR_X2_12 constr_tuple_3_get_2_bitstring(tuple_3(VAR_X0X30_10X30,VAR_X1_11,VAR_X2_12)) = VAR_X2_12) # label(ax76) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 12 (all VAR_X0X30_7 all VAR_X1_8 all VAR_X2_9 constr_tuple_3_get_1_bitstring(tuple_3(VAR_X0X30_7,VAR_X1_8,VAR_X2_9)) = VAR_X1_8) # label(ax77) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 13 (all VAR_X0X30_0X30 all VAR_X1_0X30 all VAR_X2_0X30 constr_tuple_3_get_0x30(tuple_3(VAR_X0X30_0X30,VAR_X1_0X30,VAR_X2_0X30)) = VAR_X0X30_0X30) # label(ax78) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 14 (all VAR_X_67 all VAR_Y_68 pred_eq_bitstring_bitstring(VAR_X_67,VAR_Y_68)) # label(ax79) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 15 (all VAR_V_74 (pred_attacker(VAR_V_74) -> pred_attacker(constr_tuple_3_get_2_bitstring(VAR_V_74)))) # label(ax80) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 16 (all VAR_V_76 (pred_attacker(VAR_V_76) -> pred_attacker(constr_tuple_3_get_1_bitstring(VAR_V_76)))) # label(ax81) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 17 (all VAR_V_78 (pred_attacker(VAR_V_78) -> pred_attacker(constr_tuple_3_get_0x30(VAR_V_78)))) # label(ax82) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 18 (all VAR_V_80X30 (pred_attacker(VAR_V_80X30) -> pred_attacker(tuple_server_S_out_3(VAR_V_80X30)))) # label(ax84) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 19 (all VAR_V_83 (pred_attacker(tuple_server_S_out_3(VAR_V_83)) -> pred_attacker(VAR_V_83))) # label(ax85) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 20 (all VAR_V_86 (pred_attacker(VAR_V_86) -> pred_attacker(tuple_server_S_out_2(VAR_V_86)))) # label(ax86) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 21 (all VAR_V_89 (pred_attacker(tuple_server_S_out_2(VAR_V_89)) -> pred_attacker(VAR_V_89))) # label(ax87) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 22 (all VAR_V_93 all VAR_V_94 (pred_attacker(VAR_V_93) & pred_attacker(VAR_V_94) -> pred_attacker(tuple_server_S_in_1(VAR_V_93,VAR_V_94)))) # label(ax88) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 23 (all VAR_V_10X301 all VAR_V_10X302 (pred_attacker(tuple_server_S_in_1(VAR_V_10X301,VAR_V_10X302)) -> pred_attacker(VAR_V_10X301))) # label(ax89) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 24 (all VAR_V_10X304 all VAR_V_10X305 (pred_attacker(tuple_server_S_in_1(VAR_V_10X304,VAR_V_10X305)) -> pred_attacker(VAR_V_10X305))) # label(ax90) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 25 (all VAR_V_10X309 (pred_attacker(VAR_V_10X309) -> pred_attacker(tuple_client_B_out_2(VAR_V_10X309)))) # label(ax92) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 26 (all VAR_V_112 (pred_attacker(tuple_client_B_out_2(VAR_V_112)) -> pred_attacker(VAR_V_112))) # label(ax93) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 27 (all VAR_V_115 (pred_attacker(VAR_V_115) -> pred_attacker(tuple_client_B_in_1(VAR_V_115)))) # label(ax94) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 28 (all VAR_V_118 (pred_attacker(tuple_client_B_in_1(VAR_V_118)) -> pred_attacker(VAR_V_118))) # label(ax95) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 29 (all VAR_V_125 all VAR_V_126 all VAR_V_127 all VAR_V_128 all VAR_V_129 (pred_attacker(VAR_V_125) & pred_attacker(VAR_V_126) & pred_attacker(VAR_V_127) & pred_attacker(VAR_V_128) & pred_attacker(VAR_V_129) -> pred_attacker(constr_cbc_enc_4(VAR_V_125,VAR_V_126,VAR_V_127,VAR_V_128,VAR_V_129)))) # label(ax96) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 30 (all VAR_V_134 all VAR_V_135 all VAR_V_136 all VAR_V_137 (pred_attacker(VAR_V_134) & pred_attacker(VAR_V_135) & pred_attacker(VAR_V_136) & pred_attacker(VAR_V_137) -> pred_attacker(constr_cbc_enc_3(VAR_V_134,VAR_V_135,VAR_V_136,VAR_V_137)))) # label(ax97) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 31 (all VAR_V_141 all VAR_V_142 all VAR_V_143 (pred_attacker(VAR_V_141) & pred_attacker(VAR_V_142) & pred_attacker(VAR_V_143) -> pred_attacker(constr_cbc_enc_2(VAR_V_141,VAR_V_142,VAR_V_143)))) # label(ax98) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 32 (all VAR_V_146 all VAR_V_147 (pred_attacker(VAR_V_146) & pred_attacker(VAR_V_147) -> pred_attacker(constr_cbc_enc_1(VAR_V_146,VAR_V_147)))) # label(ax99) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 33 (all VAR_V_150X30 all VAR_V_151 (pred_attacker(VAR_V_150X30) & pred_attacker(VAR_V_151) -> pred_attacker(constr_cbc_dec_4(VAR_V_150X30,VAR_V_151)))) # label(ax100) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 34 (all VAR_V_154 all VAR_V_155 (pred_attacker(VAR_V_154) & pred_attacker(VAR_V_155) -> pred_attacker(constr_cbc_dec_3(VAR_V_154,VAR_V_155)))) # label(ax101) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 35 (all VAR_V_158 all VAR_V_159 (pred_attacker(VAR_V_158) & pred_attacker(VAR_V_159) -> pred_attacker(constr_cbc_dec_2(VAR_V_158,VAR_V_159)))) # label(ax102) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 36 (all VAR_V_162 all VAR_V_163 (pred_attacker(VAR_V_162) & pred_attacker(VAR_V_163) -> pred_attacker(constr_cbc_dec_1(VAR_V_162,VAR_V_163)))) # label(ax103) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 37 (all VAR_V_165 (pred_attacker(VAR_V_165) -> pred_attacker(constr_cbc_4_get_3_prefixes(VAR_V_165)))) # label(ax104) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 38 (all VAR_V_167 (pred_attacker(VAR_V_167) -> pred_attacker(constr_cbc_4_get_2_prefixes(VAR_V_167)))) # label(ax105) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 39 (all VAR_V_169 (pred_attacker(VAR_V_169) -> pred_attacker(constr_cbc_4_get_1_prefixes(VAR_V_169)))) # label(ax106) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 40 (all VAR_V_171 (pred_attacker(VAR_V_171) -> pred_attacker(constr_cbc_3_get_2_prefixes(VAR_V_171)))) # label(ax107) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 41 (all VAR_V_173 (pred_attacker(VAR_V_173) -> pred_attacker(constr_cbc_3_get_1_prefixes(VAR_V_173)))) # label(ax108) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 42 (all VAR_V_175 (pred_attacker(VAR_V_175) -> pred_attacker(constr_cbc_2_get_1_prefixes(VAR_V_175)))) # label(ax109) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 43 (all VAR_V_184 all VAR_V_185 all VAR_V_186 all VAR_V_187 (pred_attacker(VAR_V_184) & pred_attacker(VAR_V_185) & pred_attacker(VAR_V_186) & pred_attacker(VAR_V_187) -> pred_attacker(tuple_4(VAR_V_184,VAR_V_185,VAR_V_186,VAR_V_187)))) # label(ax115) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 44 (all VAR_V_20X308 all VAR_V_20X309 all VAR_V_210X30 all VAR_V_211 (pred_attacker(tuple_4(VAR_V_20X308,VAR_V_20X309,VAR_V_210X30,VAR_V_211)) -> pred_attacker(VAR_V_20X308))) # label(ax116) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 45 (all VAR_V_213 all VAR_V_214 all VAR_V_215 all VAR_V_216 (pred_attacker(tuple_4(VAR_V_213,VAR_V_214,VAR_V_215,VAR_V_216)) -> pred_attacker(VAR_V_214))) # label(ax117) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 46 (all VAR_V_218 all VAR_V_219 all VAR_V_220X30 all VAR_V_221 (pred_attacker(tuple_4(VAR_V_218,VAR_V_219,VAR_V_220X30,VAR_V_221)) -> pred_attacker(VAR_V_220X30))) # label(ax118) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 47 (all VAR_V_223 all VAR_V_224 all VAR_V_225 all VAR_V_226 (pred_attacker(tuple_4(VAR_V_223,VAR_V_224,VAR_V_225,VAR_V_226)) -> pred_attacker(VAR_V_226))) # label(ax119) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.04 48 (all VAR_V_231 all VAR_V_232 all VAR_V_233 (pred_attacker(VAR_V_231) & pred_attacker(VAR_V_232) & pred_attacker(VAR_V_233) -> pred_attacker(tuple_3(VAR_V_23
% 0.41/1.05 WARNING: denials share constants (see output).
% 0.41/1.05
% 0.41/1.05 1,VAR_V_232,VAR_V_233)))) # label(ax120) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 49 (all VAR_V_246 all VAR_V_247 all VAR_V_248 (pred_attacker(tuple_3(VAR_V_246,VAR_V_247,VAR_V_248)) -> pred_attacker(VAR_V_246))) # label(ax121) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 50 (all VAR_V_250X30 all VAR_V_251 all VAR_V_252 (pred_attacker(tuple_3(VAR_V_250X30,VAR_V_251,VAR_V_252)) -> pred_attacker(VAR_V_251))) # label(ax122) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 51 (all VAR_V_254 all VAR_V_255 all VAR_V_256 (pred_attacker(tuple_3(VAR_V_254,VAR_V_255,VAR_V_256)) -> pred_attacker(VAR_V_256))) # label(ax123) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 52 (all VAR_V_260X30 all VAR_V_261 (pred_attacker(VAR_V_260X30) & pred_attacker(VAR_V_261) -> pred_attacker(tuple_2(VAR_V_260X30,VAR_V_261)))) # label(ax124) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 53 (all VAR_V_268 all VAR_V_269 (pred_attacker(tuple_2(VAR_V_268,VAR_V_269)) -> pred_attacker(VAR_V_268))) # label(ax125) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 54 (all VAR_V_271 all VAR_V_272 (pred_attacker(tuple_2(VAR_V_271,VAR_V_272)) -> pred_attacker(VAR_V_272))) # label(ax126) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 55 (all VAR_V_274 all VAR_V_275 (pred_mess(VAR_V_275,VAR_V_274) & pred_attacker(VAR_V_275) -> pred_attacker(VAR_V_274))) # label(ax127) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 56 (all VAR_V_276 all VAR_V_277 (pred_attacker(VAR_V_277) & pred_attacker(VAR_V_276) -> pred_mess(VAR_V_277,VAR_V_276))) # label(ax128) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 57 (all VAR_V_279 pred_equal(VAR_V_279,VAR_V_279)) # label(ax133) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 58 (all VAR_V_280X30 pred_attacker(name_new0x2Dname(VAR_V_280X30))) # label(ax134) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 59 (all VAR_ENC_A_KAB_T_330X30 (pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(VAR_ENC_A_KAB_T_330X30,name_Kbs))) & pred_attacker(tuple_client_B_in_1(VAR_ENC_A_KAB_T_330X30)) -> pred_attacker(tuple_client_B_out_2(name_objective)))) # label(ax135) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 60 (all VAR_0X40SID_388 (pred_attacker(tuple_server_S_in_1(name_A,name_B)) -> pred_attacker(tuple_server_S_out_3(constr_cbc_enc_4(name_B,name_Kab_54(VAR_0X40SID_388),name_T_55(VAR_0X40SID_388),constr_cbc_enc_3(name_A,name_Kab_54(VAR_0X40SID_388),name_T_55(VAR_0X40SID_388),name_Kbs),name_Kas))))) # label(ax136) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05 61 (all VAR_0X40SID_562 (pred_attacker(tuple_server_S_in_1(name_B,name_A)) -> pred_attacker(tuple_server_S_out_2(constr_cbc_enc_4(name_A,name_Kab_54(VAR_0X40SID_562),name_T_55(VAR_0X40SID_562),constr_cbc_enc_3(name_B,name_Kab_54(VAR_0X40SID_562),name_T_55(VAR_0X40SID_562),name_Kas),name_Kbs))))) # label(ax137) # label(axiom) # label(non_clause). [assumption].
% 0.41/1.05
% 0.41/1.05 ============================== end of process non-clausal formulas ===
% 0.41/1.05
% 0.41/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.41/1.05
% 0.41/1.05 ============================== PREDICATE ELIMINATION =================
% 0.41/1.05 62 -pred_attacker(A) | -pred_attacker(B) | pred_mess(A,B) # label(ax128) # label(axiom). [clausify(56)].
% 0.41/1.05 63 -pred_mess(A,B) | -pred_attacker(A) | pred_attacker(B) # label(ax127) # label(axiom). [clausify(55)].
% 0.41/1.05
% 0.41/1.05 ============================== end predicate elimination =============
% 0.41/1.05
% 0.41/1.05 Auto_denials:
% 0.41/1.05 % copying label ax0 to answer in negative clause
% 0.41/1.05 % copying label ax1 to answer in negative clause
% 0.41/1.05 % copying label ax2 to answer in negative clause
% 0.41/1.05 % copying label ax3 to answer in negative clause
% 0.41/1.05 % copying label ax4 to answer in negative clause
% 0.41/1.05 % copying label ax5 to answer in negative clause
% 0.41/1.05 % copying label ax6 to answer in negative clause
% 0.41/1.05 % copying label ax7 to answer in negative clause
% 0.41/1.05 % copying label ax8 to answer in negative clause
% 0.41/1.05 % copying label ax9 to answer in negative clause
% 0.41/1.05 % copying label ax10 to answer in negative clause
% 0.41/1.05 % copying label ax11 to answer in negative clause
% 0.41/1.05 % copying label ax12 to answer in negative clause
% 0.41/1.06 % copying label ax13 to answer in negative clause
% 0.41/1.06 % copying label ax14 to answer in negative clause
% 0.41/1.06 % copying label ax15 to answer in negative clause
% 0.41/1.06 % copying label ax16 to answer in negative clause
% 0.41/1.06 % copying label ax17 to answer in negative clause
% 0.41/1.06 % copying label ax18 to answer in negative clause
% 0.41/1.06 % copying label ax19 to answer in negative clause
% 0.41/1.06 % copying label ax20 to answer in negative clause
% 0.41/1.06 % copying label ax21 to answer in negative clause
% 0.41/1.06 % copying label ax22 to answer in negative clause
% 0.41/1.06 % copying label ax23 to answer in negative clause
% 0.41/1.06 % copying label ax24 to answer in negative clause
% 0.41/1.06 % copying label ax25 to answer in negative clause
% 0.41/1.06 % copying label ax26 to answer in negative clause
% 0.41/1.06 % copying label ax27 to answer in negative clause
% 0.41/1.06 % copying label ax28 to answer in negative clause
% 0.41/1.06 % copying label ax29 to answer in negative clause
% 0.41/1.06 % copying label ax30 to answer in negative clause
% 0.41/1.06 % copying label ax31 to answer in negative clause
% 0.41/1.06 % copying label ax32 to answer in negative clause
% 0.41/1.06 % copying label ax33 to answer in negative clause
% 0.41/1.06 % copying label ax34 to answer in negative clause
% 0.41/1.06 % copying label ax35 to answer in negative clause
% 0.41/1.06 % copying label ax36 to answer in negative clause
% 0.41/1.06 % copying label ax37 to answer in negative clause
% 0.41/1.06 % copying label ax38 to answer in negative clause
% 0.41/1.06 % copying label ax39 to answer in negative clause
% 0.41/1.06 % copying label ax40 to answer in negative clause
% 0.41/1.06 % copying label ax41 to answer in negative clause
% 0.41/1.06 % copying label ax42 to answer in negative clause
% 0.41/1.06 % copying label ax43 to answer in negative clause
% 0.41/1.06 % copying label ax44 to answer in negative clause
% 0.41/1.06 % copying label ax45 to answer in negative clause
% 0.41/1.06 % copying label ax46 to answer in negative clause
% 0.41/1.06 % copying label ax47 to answer in negative clause
% 0.41/1.06 % copying label ax48 to answer in negative clause
% 0.41/1.06 % copying label ax49 to answer in negative clause
% 0.41/1.06 % copying label ax50 to answer in negative clause
% 0.41/1.06 % copying label ax51 to answer in negative clause
% 0.41/1.06 % copying label ax52 to answer in negative clause
% 0.41/1.06 % copying label ax53 to answer in negative clause
% 0.41/1.06 % copying label ax54 to answer in negative clause
% 0.41/1.06 % copying label ax55 to answer in negative clause
% 0.41/1.06 % copying label ax56 to answer in negative clause
% 0.41/1.06 % copying label ax57 to answer in negative clause
% 0.41/1.06 % copying label ax58 to answer in negative clause
% 0.41/1.06 % copying label ax59 to answer in negative clause
% 0.41/1.06 % copying label ax60 to answer in negative clause
% 0.41/1.06 % copying label ax61 to answer in negative clause
% 0.41/1.06 % copying label ax62 to answer in negative clause
% 0.41/1.06 % copying label ax63 to answer in negative clause
% 0.41/1.06 % copying label ax64 to answer in negative clause
% 0.41/1.06 % copying label ax65 to answer in negative clause
% 0.41/1.06 % copying label co0 to answer in negative clause
% 0.41/1.06 % assign(max_proofs, 67). % (Horn set with more than one neg. clause)
% 0.41/1.06
% 0.41/1.06 WARNING, because some of the denials share constants,
% 0.41/1.06 some of the denials or their descendents may be subsumed,
% 0.41/1.06 preventing the target number of proofs from being found.
% 0.41/1.06 The shared constants are: name_objective, name_c, name_Kbs, name_Kas, name_I, name_B, name_A, constr_CONST_4, constr_CONST_3, constr_CONST_2, constr_CONST_1, constr_CONST_0x30.
% 0.41/1.06
% 0.41/1.06 Term ordering decisions:
% 0.41/1.06 Function symbol KB weights: name_A=1. name_B=1. name_Kbs=1. name_Kas=1. constr_CONST_0x30=1. constr_CONST_1=1. constr_CONST_2=1. constr_CONST_3=1. constr_CONST_4=1. name_I=1. name_c=1. name_objective=1. tuple_false=1. tuple_true=1. constr_cbc_enc_1=1. tuple_server_S_in_1=1. tuple_2=1. constr_cbc_dec_3=1. constr_cbc_dec_1=1. constr_cbc_dec_2=1. constr_cbc_dec_4=1. name_Kab_54=1. name_T_55=1. constr_tuple_3_get_0x30=1. tuple_client_B_in_1=1. tuple_client_B_out_2=1. tuple_server_S_out_2=1. tuple_server_S_out_3=1. constr_cbc_2_get_1_prefixes=1. constr_cbc_3_get_1_prefixes=1. constr_cbc_3_get_2_prefixes=1. constr_cbc_4_get_1_prefixes=1. constr_cbc_4_get_2_prefixes=1. constr_cbc_4_get_3_prefixes=1. constr_tuple_3_get_1_bitstring=1. constr_tuple_3_get_2_bitstring=1. name_new0x2Dname=1. tuple_3=1. constr_cbc_enc_2=1. constr_cbc_enc_3=1. tuple_4=1. constr_cbc_enc_4=1.
% 21.99/22.26
% 21.99/22.26 ============================== end of process initial clauses ========
% 21.99/22.26
% 21.99/22.26 ============================== CLAUSES FOR SEARCH ====================
% 21.99/22.26
% 21.99/22.26 ============================== end of clauses for search =============
% 21.99/22.26
% 21.99/22.26 ============================== SEARCH ================================
% 21.99/22.26
% 21.99/22.26 % Starting search at 0.03 seconds.
% 21.99/22.26
% 21.99/22.26 Low Water (keep): wt=7.000, iters=6002
% 21.99/22.26
% 21.99/22.26 Low Water (displace): id=9809, wt=7.000
% 21.99/22.26
% 21.99/22.26 Low Water (keep): wt=6.000, iters=3704
% 21.99/22.26
% 21.99/22.26 Low Water (keep): wt=5.000, iters=4296
% 21.99/22.26
% 21.99/22.26 ============================== PROOF =================================
% 21.99/22.26 % SZS status Theorem
% 21.99/22.26 % SZS output start Refutation
% 21.99/22.26
% 21.99/22.26 % Proof 1 at 4.32 (+ 0.28) seconds: co0.
% 21.99/22.26 % Length of proof is 17.
% 21.99/22.26 % Level of proof is 4.
% 21.99/22.26 % Maximum clause weight is 12.000.
% 21.99/22.26 % Given clauses 139.
% 21.99/22.26
% 21.99/22.26 14 (all VAR_X_67 all VAR_Y_68 pred_eq_bitstring_bitstring(VAR_X_67,VAR_Y_68)) # label(ax79) # label(axiom) # label(non_clause). [assumption].
% 21.99/22.26 17 (all VAR_V_78 (pred_attacker(VAR_V_78) -> pred_attacker(constr_tuple_3_get_0x30(VAR_V_78)))) # label(ax82) # label(axiom) # label(non_clause). [assumption].
% 21.99/22.26 26 (all VAR_V_112 (pred_attacker(tuple_client_B_out_2(VAR_V_112)) -> pred_attacker(VAR_V_112))) # label(ax93) # label(axiom) # label(non_clause). [assumption].
% 21.99/22.26 27 (all VAR_V_115 (pred_attacker(VAR_V_115) -> pred_attacker(tuple_client_B_in_1(VAR_V_115)))) # label(ax94) # label(axiom) # label(non_clause). [assumption].
% 21.99/22.26 59 (all VAR_ENC_A_KAB_T_330X30 (pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(VAR_ENC_A_KAB_T_330X30,name_Kbs))) & pred_attacker(tuple_client_B_in_1(VAR_ENC_A_KAB_T_330X30)) -> pred_attacker(tuple_client_B_out_2(name_objective)))) # label(ax135) # label(axiom) # label(non_clause). [assumption].
% 21.99/22.26 189 pred_eq_bitstring_bitstring(A,B) # label(ax79) # label(axiom). [clausify(14)].
% 21.99/22.26 192 -pred_attacker(A) | pred_attacker(constr_tuple_3_get_0x30(A)) # label(ax82) # label(axiom). [clausify(17)].
% 21.99/22.26 193 pred_attacker(tuple_true) # label(ax83) # label(axiom). [assumption].
% 21.99/22.26 203 -pred_attacker(tuple_client_B_out_2(A)) | pred_attacker(A) # label(ax93) # label(axiom). [clausify(26)].
% 21.99/22.26 204 -pred_attacker(A) | pred_attacker(tuple_client_B_in_1(A)) # label(ax94) # label(axiom). [clausify(27)].
% 21.99/22.26 242 -pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(A,name_Kbs))) | -pred_attacker(tuple_client_B_in_1(A)) | pred_attacker(tuple_client_B_out_2(name_objective)) # label(ax135) # label(axiom). [clausify(59)].
% 21.99/22.26 245 -pred_attacker(name_objective) # label(co0) # label(negated_conjecture) # answer(co0). [assumption].
% 21.99/22.26 246 pred_attacker(constr_tuple_3_get_0x30(tuple_true)). [hyper(192,a,193,a)].
% 21.99/22.26 16653 -pred_attacker(tuple_client_B_out_2(name_objective)) # answer(co0). [ur(203,b,245,a)].
% 21.99/22.26 16664 pred_attacker(tuple_client_B_in_1(constr_tuple_3_get_0x30(tuple_true))). [hyper(204,a,246,a)].
% 21.99/22.26 16686 -pred_attacker(tuple_client_B_in_1(A)) # answer(co0). [ur(242,a,189,a,c,16653,a)].
% 21.99/22.26 16687 $F # answer(co0). [resolve(16686,a,16664,a)].
% 21.99/22.26
% 21.99/22.26 % SZS output end Refutation
% 21.99/22.26 ============================== end of proof ==========================
% 21.99/22.26 % Redundant proof: 16688 $F # answer(co0). [resolve(16686,a,16614,a)].
% 21.99/22.26 % Redundant proof: 16689 $F # answer(co0). [resolve(16686,a,16448,a)].
% 21.99/22.26 % Redundant proof: 16690 $F # answer(co0). [resolve(16686,a,15628,a)].
% 21.99/22.26 % Redundant proof: 16691 $F # answer(co0). [resolve(16686,a,14942,a)].
% 21.99/22.26 % Redundant proof: 16692 $F # answer(co0). [resolve(16686,a,14378,a)].
% 21.99/22.26 % Redundant proof: 16693 $F # answer(co0). [resolve(16686,a,11131,a)].
% 21.99/22.26 % Redundant proof: 16694 $F # answer(co0). [resolve(16686,a,9810,a)].
% 21.99/22.26 % Redundant proof: 16695 $F # answer(co0). [resolve(16686,a,4320,a)].
% 21.99/22.26 % Redundant proof: 16696 $F # answer(co0). [resolve(16686,a,1724,a)].
% 21.99/22.26 % Redundant proof: 16697 $F # answer(co0). [resolve(16686,a,678,a)].
% 21.99/22.26 % Redundant proof: 16698 $F # answer(co0). [resolve(16686,a,263,a)].
% 21.99/22.26 % Redundant proof: 16699 $F # answer(co0). [resolve(16686,a,262,a)].
% 21.99/22.26
% 21.99/22.26 % Disable descendants (x means already disabled):
% 21.99/22.26 245 16643 16644 16645 16646 16647 16648 16649 16650 16651
% 21.99/22.26 16652x 16653 16654 16655 16656 1Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------