TSTP Solution File: SWW969+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SWW969+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:18:00 EDT 2022

% Result   : Timeout 300.05s 300.31s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWW969+1 : TPTP v8.1.0. Released v7.4.0.
% 0.03/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun  5 02:01:07 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.44/1.05  ============================== Prover9 ===============================
% 0.44/1.05  Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.05  Process 3321 was started by sandbox on n027.cluster.edu,
% 0.44/1.05  Sun Jun  5 02:01:08 2022
% 0.44/1.05  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3166_n027.cluster.edu".
% 0.44/1.05  ============================== end of head ===========================
% 0.44/1.05  
% 0.44/1.05  ============================== INPUT =================================
% 0.44/1.05  
% 0.44/1.05  % Reading from file /tmp/Prover9_3166_n027.cluster.edu
% 0.44/1.05  
% 0.44/1.05  set(prolog_style_variables).
% 0.44/1.05  set(auto2).
% 0.44/1.05      % set(auto2) -> set(auto).
% 0.44/1.05      % set(auto) -> set(auto_inference).
% 0.44/1.05      % set(auto) -> set(auto_setup).
% 0.44/1.05      % set(auto_setup) -> set(predicate_elim).
% 0.44/1.05      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.05      % set(auto) -> set(auto_limits).
% 0.44/1.05      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.05      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.05      % set(auto) -> set(auto_denials).
% 0.44/1.05      % set(auto) -> set(auto_process).
% 0.44/1.05      % set(auto2) -> assign(new_constants, 1).
% 0.44/1.05      % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.05      % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.05      % set(auto2) -> assign(max_hours, 1).
% 0.44/1.05      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.05      % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.05      % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.05      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.05      % set(auto2) -> set(sort_initial_sos).
% 0.44/1.05      % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.05      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.05      % set(auto2) -> assign(max_megs, 400).
% 0.44/1.05      % set(auto2) -> assign(stats, some).
% 0.44/1.05      % set(auto2) -> clear(echo_input).
% 0.44/1.05      % set(auto2) -> set(quiet).
% 0.44/1.05      % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.05      % set(auto2) -> clear(print_given).
% 0.44/1.05  assign(lrs_ticks,-1).
% 0.44/1.05  assign(sos_limit,10000).
% 0.44/1.05  assign(order,kbo).
% 0.44/1.05  set(lex_order_vars).
% 0.44/1.05  clear(print_given).
% 0.44/1.05  
% 0.44/1.05  % formulas(sos).  % not echoed (151 formulas)
% 0.44/1.05  
% 0.44/1.05  ============================== end of input ==========================
% 0.44/1.05  
% 0.44/1.05  % From the command line: assign(max_seconds, 300).
% 0.44/1.05  
% 0.44/1.05  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.05  
% 0.44/1.05  % Formulas that are not ordinary clauses:
% 0.44/1.05  1 (all VAR_K_61 all VAR_X0X30_57 all VAR_X1_58 all VAR_X2_59 all VAR_X3_60X30 constr_cbc_dec_4(constr_cbc_enc_4(VAR_X0X30_57,VAR_X1_58,VAR_X2_59,VAR_X3_60X30,VAR_K_61),VAR_K_61) = tuple_4(VAR_X0X30_57,VAR_X1_58,VAR_X2_59,VAR_X3_60X30)) # label(ax55) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  2 (all VAR_K_56 all VAR_X0X30_53 all VAR_X1_54 all VAR_X2_55 constr_cbc_dec_3(constr_cbc_enc_3(VAR_X0X30_53,VAR_X1_54,VAR_X2_55,VAR_K_56),VAR_K_56) = tuple_3(VAR_X0X30_53,VAR_X1_54,VAR_X2_55)) # label(ax56) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  3 (all VAR_K_52 all VAR_X0X30_50X30 all VAR_X1_51 constr_cbc_dec_2(constr_cbc_enc_2(VAR_X0X30_50X30,VAR_X1_51,VAR_K_52),VAR_K_52) = tuple_2(VAR_X0X30_50X30,VAR_X1_51)) # label(ax57) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  4 (all VAR_K_49 all VAR_X0X30_48 constr_cbc_dec_1(constr_cbc_enc_1(VAR_X0X30_48,VAR_K_49),VAR_K_49) = VAR_X0X30_48) # label(ax58) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  5 (all VAR_K_47 all VAR_X0X30_43 all VAR_X1_44 all VAR_X2_45 all VAR_X3_46 constr_cbc_4_get_3_prefixes(constr_cbc_enc_4(VAR_X0X30_43,VAR_X1_44,VAR_X2_45,VAR_X3_46,VAR_K_47)) = constr_cbc_enc_3(VAR_X0X30_43,VAR_X1_44,VAR_X2_45,VAR_K_47)) # label(ax59) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  6 (all VAR_K_42 all VAR_X0X30_38 all VAR_X1_39 all VAR_X2_40X30 all VAR_X3_41 constr_cbc_4_get_2_prefixes(constr_cbc_enc_4(VAR_X0X30_38,VAR_X1_39,VAR_X2_40X30,VAR_X3_41,VAR_K_42)) = constr_cbc_enc_2(VAR_X0X30_38,VAR_X1_39,VAR_K_42)) # label(ax60) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  7 (all VAR_K_37 all VAR_X0X30_33 all VAR_X1_34 all VAR_X2_35 all VAR_X3_36 constr_cbc_4_get_1_prefixes(constr_cbc_enc_4(VAR_X0X30_33,VAR_X1_34,VAR_X2_35,VAR_X3_36,VAR_K_37)) = constr_cbc_enc_1(VAR_X0X30_33,VAR_K_37)) # label(ax61) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  8 (all VAR_K_32 all VAR_X0X30_29 all VAR_X1_30X30 all VAR_X2_31 constr_cbc_3_get_2_prefixes(constr_cbc_enc_3(VAR_X0X30_29,VAR_X1_30X30,VAR_X2_31,VAR_K_32)) = constr_cbc_enc_2(VAR_X0X30_29,VAR_X1_30X30,VAR_K_32)) # label(ax62) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  9 (all VAR_K_28 all VAR_X0X30_25 all VAR_X1_26 all VAR_X2_27 constr_cbc_3_get_1_prefixes(constr_cbc_enc_3(VAR_X0X30_25,VAR_X1_26,VAR_X2_27,VAR_K_28)) = constr_cbc_enc_1(VAR_X0X30_25,VAR_K_28)) # label(ax63) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  10 (all VAR_K_0X30 all VAR_X0X30_23 all VAR_X1_24 constr_cbc_2_get_1_prefixes(constr_cbc_enc_2(VAR_X0X30_23,VAR_X1_24,VAR_K_0X30)) = constr_cbc_enc_1(VAR_X0X30_23,VAR_K_0X30)) # label(ax64) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  11 (all VAR_X0X30_19 all VAR_X1_20X30 all VAR_X2_21 all VAR_X3_22 constr_tuple_4_get_3_bitstring(tuple_4(VAR_X0X30_19,VAR_X1_20X30,VAR_X2_21,VAR_X3_22)) = VAR_X3_22) # label(ax65) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  12 (all VAR_X0X30_15 all VAR_X1_16 all VAR_X2_17 all VAR_X3_18 constr_tuple_4_get_2_bitstring(tuple_4(VAR_X0X30_15,VAR_X1_16,VAR_X2_17,VAR_X3_18)) = VAR_X2_17) # label(ax66) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  13 (all VAR_X0X30_13 all VAR_X1_14 constr_tuple_2_get_0x30_bitstring(tuple_2(VAR_X0X30_13,VAR_X1_14)) = VAR_X0X30_13) # label(ax67) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  14 (all VAR_X0X30_9 all VAR_X1_10X30 all VAR_X2_11 all VAR_X3_12 constr_tuple_4_get_1(tuple_4(VAR_X0X30_9,VAR_X1_10X30,VAR_X2_11,VAR_X3_12)) = VAR_X1_10X30) # label(ax68) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  15 (all VAR_X0X30_7 all VAR_X1_8 all VAR_X2_0X30 all VAR_X3_0X30 constr_tuple_4_get_0x30(tuple_4(VAR_X0X30_7,VAR_X1_8,VAR_X2_0X30,VAR_X3_0X30)) = VAR_X0X30_7) # label(ax69) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  16 (all VAR_X0X30_0X30 all VAR_X1_0X30 constr_tuple_2_get_1(tuple_2(VAR_X0X30_0X30,VAR_X1_0X30)) = VAR_X1_0X30) # label(ax70) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  17 (all VAR_X_81 all VAR_Y_82 pred_eq_bitstring_bitstring(VAR_X_81,VAR_Y_82)) # label(ax71) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  18 (all VAR_V_88 (pred_attacker(VAR_V_88) -> pred_attacker(constr_tuple_4_get_3_bitstring(VAR_V_88)))) # label(ax72) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  19 (all VAR_V_90X30 (pred_attacker(VAR_V_90X30) -> pred_attacker(constr_tuple_4_get_2_bitstring(VAR_V_90X30)))) # label(ax73) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  20 (all VAR_V_92 (pred_attacker(VAR_V_92) -> pred_attacker(constr_tuple_4_get_1(VAR_V_92)))) # label(ax74) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  21 (all VAR_V_94 (pred_attacker(VAR_V_94) -> pred_attacker(constr_tuple_4_get_0x30(VAR_V_94)))) # label(ax75) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  22 (all VAR_V_96 (pred_attacker(VAR_V_96) -> pred_attacker(constr_tuple_2_get_1(VAR_V_96)))) # label(ax76) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  23 (all VAR_V_98 (pred_attacker(VAR_V_98) -> pred_attacker(constr_tuple_2_get_0x30_bitstring(VAR_V_98)))) # label(ax77) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  24 (all VAR_V_10X300X30 (pred_attacker(VAR_V_10X300X30) -> pred_attacker(tuple_succ(VAR_V_10X300X30)))) # label(ax79) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  25 (all VAR_V_10X303 (pred_attacker(tuple_succ(VAR_V_10X303)) -> pred_attacker(VAR_V_10X303))) # label(ax80) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  26 (all VAR_V_10X306 (pred_attacker(VAR_V_10X306) -> pred_attacker(tuple_server_S_out_2(VAR_V_10X306)))) # label(ax81) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  27 (all VAR_V_10X309 (pred_attacker(tuple_server_S_out_2(VAR_V_10X309)) -> pred_attacker(VAR_V_10X309))) # label(ax82) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  28 (all VAR_V_114 all VAR_V_115 all VAR_V_116 (pred_attacker(VAR_V_114) & pred_attacker(VAR_V_115) & pred_attacker(VAR_V_116) -> pred_attacker(tuple_server_S_in_1(VAR_V_114,VAR_V_115,VAR_V_116)))) # label(ax83) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  29 (all VAR_V_129 all VAR_V_130X30 all VAR_V_131 (pred_attacker(tuple_server_S_in_1(VAR_V_129,VAR_V_130X30,VAR_V_131)) -> pred_attacker(VAR_V_129))) # label(ax84) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  30 (all VAR_V_133 all VAR_V_134 all VAR_V_135 (pred_attacker(tuple_server_S_in_1(VAR_V_133,VAR_V_134,VAR_V_135)) -> pred_attacker(VAR_V_134))) # label(ax85) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  31 (all VAR_V_137 all VAR_V_138 all VAR_V_139 (pred_attacker(tuple_server_S_in_1(VAR_V_137,VAR_V_138,VAR_V_139)) -> pred_attacker(VAR_V_139))) # label(ax86) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  32 (all VAR_V_143 (pred_attacker(VAR_V_143) -> pred_attacker(tuple_client_B_out_2(VAR_V_143)))) # label(ax88) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  33 (all VAR_V_146 (pred_attacker(tuple_client_B_out_2(VAR_V_146)) -> pred_attacker(VAR_V_146))) # label(ax89) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  34 (all VAR_V_149 (pred_attacker(VAR_V_149) -> pred_attacker(tuple_client_B_in_3(VAR_V_149)))) # label(ax90) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  35 (all VAR_V_152 (pred_attacker(tuple_client_B_in_3(VAR_V_152)) -> pred_attacker(VAR_V_152))) # label(ax91) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  36 (all VAR_V_155 (pred_attacker(VAR_V_155) -> pred_attacker(tuple_client_B_in_1(VAR_V_155)))) # label(ax92) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  37 (all VAR_V_158 (pred_attacker(tuple_client_B_in_1(VAR_V_158)) -> pred_attacker(VAR_V_158))) # label(ax93) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  38 (all VAR_V_161 (pred_attacker(VAR_V_161) -> pred_attacker(tuple_client_A_out_5(VAR_V_161)))) # label(ax94) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  39 (all VAR_V_164 (pred_attacker(tuple_client_A_out_5(VAR_V_164)) -> pred_attacker(VAR_V_164))) # label(ax95) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  40 (all VAR_V_167 (pred_attacker(VAR_V_167) -> pred_attacker(tuple_client_A_out_3(VAR_V_167)))) # label(ax96) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  41 (all VAR_V_170X30 (pred_attacker(tuple_client_A_out_3(VAR_V_170X30)) -> pred_attacker(VAR_V_170X30))) # label(ax97) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  42 (all VAR_V_175 all VAR_V_176 all VAR_V_177 (pred_attacker(VAR_V_175) & pred_attacker(VAR_V_176) & pred_attacker(VAR_V_177) -> pred_attacker(tuple_client_A_out_1(VAR_V_175,VAR_V_176,VAR_V_177)))) # label(ax98) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  43 (all VAR_V_190X30 all VAR_V_191 all VAR_V_192 (pred_attacker(tuple_client_A_out_1(VAR_V_190X30,VAR_V_191,VAR_V_192)) -> pred_attacker(VAR_V_190X30))) # label(ax99) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  44 (all VAR_V_194 all VAR_V_195 all VAR_V_196 (pred_attacker(tuple_client_A_out_1(VAR_V_194,VAR_V_195,VAR_V_196)) -> pred_attacker(VAR_V_195))) # label(ax100) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  45 (all VAR_V_198 all VAR_V_199 all VAR_V_20X300X30 (pred_attacker(tuple_client_A_out_1(VAR_V_198,VAR_V_199,VAR_V_20X300X30)) -> pred_attacker(VAR_V_20X300X30))) # label(ax101) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  46 (all VAR_V_20X303 (pred_attacker(VAR_V_20X303) -> pred_attacker(tuple_client_A_in_4(VAR_V_20X303)))) # label(ax102) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  47 (all VAR_V_20X306 (pred_attacker(tuple_client_A_in_4(VAR_V_20X306)) -> pred_attacker(VAR_V_20X306))) # label(ax103) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  48 (all VAR_V_20X309 (pred_attacker(VAR_V_20X309) -> pred_attacker(tuple_client_A_in_2(VAR_V_20X309)))) # label(ax104) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  49 (all VAR_V_212 (pred_attacker(tuple_client_A_in_2(VAR_V_212)) -> pred_attacker(VAR_V_212))) # label(ax105) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  50 (all VAR_V_219 all VAR_V_220X30 all VAR_V_221 all VAR_V_222 all VAR_V_223 (pred_attacker(VAR_V_219) & pred_attacker(VAR_V_220X30) & pred_attacker(VAR_V_221) & pred_attacker(VAR_V_222) & pred_attacker(VAR_V_223) -> pred_attacker(constr_cbc_enc_4(VAR_V_219,VAR_V_220X30,VAR_V_221,VAR_V_222,VAR_V_223)))) # label(ax106) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  51 (all VAR_V_228 all VAR_V_229 all VAR_V_230X30 all VAR_V_231 (pred_attacker(VAR_V_228) & pred_attacker(VAR_V_229) & pred_attacker(VAR_V_230X30) & pred_attacker(VAR_V_231) -> pred_attacker(constr_cbc_enc_3(VAR_V_228,VAR_V_229,VAR_V_230X30,VAR_V_231)))) # label(ax107) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  52 (all VAR_V_235 all VAR_V_236 all VAR_V_237 (pred_attacker(VAR_V_235) & pred_attacker(VAR_V_236) & pred_attacker(VAR_V_237) -> pred_attacker(constr_cbc_enc_2(VAR_V_235,VAR_V_236,VAR_V_237)))) # label(ax108) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  53 (all VAR_V_240X30 all VAR_V_241 (pred_attacker(VAR_V_240X30) & pred_attacker(VAR_V_241) -> pred_attacker(constr_cbc_enc_1(VAR_V_240X30,VAR_V_241)))) # label(ax109) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  54 (all VAR_V_244 all VAR_V_245 (pred_attacker(VAR_V_244) & pred_attacker(VAR_V_245) -> pred_attacker(constr_cbc_dec_4(VAR_V_244,VAR_V_245)))) # label(ax110) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  55 (all VAR_V_248 all VAR_V_249 (pred_attacker(VAR_V_248) & pred_attacker(VAR_V_249) -> pred_attacker(constr_cbc_dec_3(VAR_V_248,VAR_V_249)))) # label(ax111) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  56 (all VAR_V_252 all VAR_V_253 (pred_attacker(VAR_V_252) & pred_attacker(VAR_V_253) -> pred_attacker(constr_cbc_dec_2(VAR_V_252,VAR_V_253)))) # label(ax112) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  57 (all VAR_V_256 all VAR_V_257 (pred_attacker(VAR_V_256) & pred_attacker(VAR_V_257) -> pred_attacker(constr_cbc_dec_1(VAR_V_256,VAR_V_257)))) # label(ax113) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  58 (all VAR_V_259 (pred_attacker(VAR_V_259) -> pred_attacker(constr_cbc_4_get_3_prefixes(VAR_V_259)))) # label(ax114) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  59 (all VAR_V_261 (pred_attacker(VAR_V_261) -> pred_attacker(constr_cbc_4_get_2_prefixes(VAR_V_261)))) # label(ax115) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  60 (all VAR_V_263 (pred_attacker(VAR_V_263) -> pred_attacker(constr_cbc_4_get_1_prefixes(VAR_V_263)))) # label(ax116) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  61 (all VAR_V_265 (pred_attacker(VAR_V_265) -> pred_attacker(constr_cbc_3_get_2_prefixes(VAR_V_265)))) # label(ax117) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  62 (all VAR_V_267 (pred_attacker(VAR_V_267) -> pred_attacker(constr_cbc_3_get_1_prefixes(VAR_V_267)))) # label(ax118) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  63 (all VAR_V_269 (pred_attacker(VAR_V_269) -> pred_attacker(constr_cbc_2_get_1_prefixes(VAR_V_269)))) # label(ax119) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  64 (all VAR_V_278 all VAR_V_279 all VAR_V_280X30 all VAR_V_281 (pred_attacker(VAR_V_278) & pred_attacker(VAR_V_279) & pred_attacker(VAR_V_280X30) & pred_attacker(VAR_V_281) -> pred_attacker(tuple_4(VAR_V_278,VAR_V_279,VAR_V_280X30,VAR_V_281)))) # label(ax125) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  65 (all VAR_V_30X302 all VAR_V_30X303 all VAR_V_30X304 all VAR_V_30X305 (pred_attacker(tuple_4(VAR_V_30X302,VAR_V_30X303,VAR_V_30X304,VAR_V_30X305)) -> pred_attacker(VAR_V_30X302))) # label(ax126) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  66 (all VAR_V_30X307 all VAR_V_30X308 all VAR_V_30X309 all VAR_V_310X30 (pred_attacker(tuple_4(VAR_V_30X307,VAR_V_30X308,VAR_V_30X309,VAR_V_310X30)) -> pred_attacker(VAR_V_30X308))) # label(ax127) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  67 (all VAR_V_312 all VAR_V_313 all VAR_V_314 all VAR_V_315 (pred_attacker(tuple_4(VAR_V_312,VAR_V_313,VAR_V_314,VAR_V_315)) -> pred_attacker(VAR_V_314))) # label(ax128) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  68 (all VAR_V_317 all VAR_V_318 all VAR_V_319 all VAR_V_320X30 (pred_attacker(tuple_4(VAR_V_317,VAR_V_318,VAR_V_319,VAR_V_320X30)) -> pred_attacker(VAR_V_320X30))) # label(ax129) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  69 (all VAR_V_325 all VAR_V_326 all VAR_V_327 (pred_attacker(VAR_V_325) & pred_attacker(VAR_V_326) & pred_attacker(VAR_V_327) -> pred_attacker(tuple_3(VAR_V_325,VAR_V_326,VAR_V_327)))) # label(ax130) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  70 (all VAR_V_340X30 all VAR_V_341 all VAR_V_342 (pred_attacker(tuple_3(VAR_V_340X30,VAR_V_341,VAR_V_342)) -> pred_attacker(VAR_V_340X30))) # label(ax131) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  71 (all VAR_V_344 all VAR_V_345 all VAR_V_346 (pred_attacker(tuple_3(VAR_V_344,VAR_V_345,VAR_V_346)) -> pred_attacker(VAR_V_345))) # label(ax132) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  72 (all VAR_V_348 all VAR_V_349 all VAR_V_350X30 (pred_attacker(tuple_3(VAR_V_348,VAR_V_349,VAR_V_350X30)) -> pred_attacker(VAR_V_350X30))) # label(ax133) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  73 (all VAR_V_354 all VAR_V_355 (pred_attacker(VAR_V_354) & pred_attacker(VAR_V_355) -> pred_attacker(tuple_2(VAR_V_354,VAR_V_355)))) # label(ax134) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  74 (all VAR_V_362 all VAR_V_363 (pred_attacker(tuple_2(VAR_V_362,VAR_V_363)) -> pred_attacker(VAR_V_362))) # label(ax135) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  75 (all VAR_V_365 all VAR_V_366 (pred_attacker(tuple_2(VAR_V_365,VAR_V_366)) -> pred_attacker(VAR_V_366))) # label(ax136) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  76 (all VAR_V_368 all VAR_V_369 (pred_mess(VAR_V_369,VAR_V_368) & pred_attacker(VAR_V_369) -> pred_attacker(VAR_V_368))) # label(ax137) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  77 (all VAR_V_370X30 all VAR_V_371 (pred_attacker(VAR_V_371) & pred_attacker(VAR_V_370X30) -> pred_mess(VAR_V_371,VAR_V_370X30))) # label(ax138) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  78 (all VAR_V_373 pred_equal(VAR_V_373,VAR_V_373)) # label(ax143) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  79 (all VAR_V_374 pred_attacker(name_new0x2Dname(VAR_V_374))) # label(ax144) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  80 (all VAR_0X40SID_388 pred_attacker(tuple_client_A_out_1(name_A,name_B,name_Na(VAR_0X40SID_388)))) # label(ax145) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  81 (all VAR_0X40SID_459 all VAR_ENC_NA_B_ENC_KAB_A_458 (pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(VAR_ENC_NA_B_ENC_KAB_A_458,name_Kas))) & pred_eq_bitstring_bitstring(name_Na(VAR_0X40SID_459),constr_tuple_4_get_0x30(constr_cbc_dec_4(VAR_ENC_NA_B_ENC_KAB_A_458,name_Kas))) & pred_attacker(tuple_client_A_in_2(VAR_ENC_NA_B_ENC_KAB_A_458)) -> pred_attacker(tuple_client_A_out_3(constr_tuple_4_get_3_bitstring(constr_cbc_dec_4(VAR_ENC_NA_B_ENC_KAB_A_458,name_Kas)))))) # label(ax146) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  82 (all VAR_0X40SID_491 all VAR_ENC_NA_B_ENC_KAB_A_490X30 all VAR_ENC_NB_489 (pred_attacker(tuple_client_A_in_4(VAR_ENC_NB_489)) & pred_eq_bitstring_bitstring(name_B,constr_tuple_4_get_1(constr_cbc_dec_4(VAR_ENC_NA_B_ENC_KAB_A_490X30,name_Kas))) & pred_eq_bitstring_bitstring(name_Na(VAR_0X40SID_491),constr_tuple_4_get_0x30(constr_cbc_dec_4(VAR_ENC_NA_B_ENC_KAB_A_490X30,name_Kas))) & pred_attacker(tuple_client_A_in_2(VAR_ENC_NA_B_ENC_KAB_A_490X30)) -> pred_attacker(tuple_client_A_out_5(constr_cbc_enc_1(tuple_succ(constr_cbc_dec_1(VAR_ENC_NB_489,constr_tuple_4_get_2_bitstring(constr_cbc_dec_4(VAR_ENC_NA_B_ENC_KAB_A_490X30,name_Kas)))),constr_tuple_4_get_2_bitstring(constr_cbc_dec_4(VAR_ENC_NA_B_ENC_KAB_A_490X30,name_Kas))))))) # label(ax147) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  83 (all VAR_0X40SID_549 all VAR_ENC_KAB_A_548 (pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_cbc_dec_2(VAR_ENC_KAB_A_548,name_Kbs))) & pred_attacker(tuple_client_B_in_1(VAR_ENC_KAB_A_548)) -> pred_attacker(tuple_client_B_out_2(constr_cbc_enc_1(name_Nb_62(VAR_0X40SID_549),constr_tuple_2_get_0x30_bitstring(constr_cbc_dec_2(VAR_ENC_KAB_A_548,name_Kbs))))))) # label(ax148) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.05  84 (all VAR_0X40SID_619 all VAR_A_616 all VAR_B_617 all VAR_NA_618 (pred_attacker(tuple_server_S_in_1(VAR_A_616,VAR_B_617,VAR_NA_618)) -> pred_attacker(tuple_server_S_out_2(constr_cbc_enc_4(VAR_NA_618,VAR_B_617,name_Kab_65(VAR_0X40SID_619),constr_cbc_enc_2(name_Kab_65(VAR
% 0.44/1.05  WARNING: denials share constants (see output).
% 0.44/1.05  
% 0.44/1.06  _0X40SID_619),VAR_A_616,name_Kbs),name_Kas))))) # label(ax149) # label(axiom) # label(non_clause).  [assumption].
% 0.44/1.06  85 -(all VAR_V_646 pred_attacker(name_Kab_65(VAR_V_646))) # label(co0) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.44/1.06  
% 0.44/1.06  ============================== end of process non-clausal formulas ===
% 0.44/1.06  
% 0.44/1.06  ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.06  
% 0.44/1.06  ============================== PREDICATE ELIMINATION =================
% 0.44/1.06  86 -pred_attacker(A) | -pred_attacker(B) | pred_mess(A,B) # label(ax138) # label(axiom).  [clausify(77)].
% 0.44/1.06  87 -pred_mess(A,B) | -pred_attacker(A) | pred_attacker(B) # label(ax137) # label(axiom).  [clausify(76)].
% 0.44/1.06  
% 0.44/1.06  ============================== end predicate elimination =============
% 0.44/1.06  
% 0.44/1.06  Auto_denials:
% 0.44/1.06    % copying label ax0 to answer in negative clause
% 0.44/1.06    % copying label ax1 to answer in negative clause
% 0.44/1.06    % copying label ax2 to answer in negative clause
% 0.44/1.06    % copying label ax3 to answer in negative clause
% 0.44/1.06    % copying label ax4 to answer in negative clause
% 0.44/1.06    % copying label ax5 to answer in negative clause
% 0.44/1.06    % copying label ax6 to answer in negative clause
% 0.44/1.06    % copying label ax7 to answer in negative clause
% 0.44/1.06    % copying label ax8 to answer in negative clause
% 0.44/1.06    % copying label ax9 to answer in negative clause
% 0.44/1.06    % copying label ax10 to answer in negative clause
% 0.44/1.06    % copying label ax11 to answer in negative clause
% 0.44/1.06    % copying label ax12 to answer in negative clause
% 0.44/1.06    % copying label ax13 to answer in negative clause
% 0.44/1.06    % copying label ax14 to answer in negative clause
% 0.44/1.06    % copying label ax15 to answer in negative clause
% 0.44/1.06    % copying label ax16 to answer in negative clause
% 0.44/1.06    % copying label ax17 to answer in negative clause
% 0.44/1.06    % copying label ax18 to answer in negative clause
% 0.44/1.06    % copying label ax19 to answer in negative clause
% 0.44/1.06    % copying label ax20 to answer in negative clause
% 0.44/1.06    % copying label ax21 to answer in negative clause
% 0.44/1.06    % copying label ax22 to answer in negative clause
% 0.44/1.06    % copying label ax23 to answer in negative clause
% 0.44/1.06    % copying label ax24 to answer in negative clause
% 0.44/1.06    % copying label ax25 to answer in negative clause
% 0.44/1.06    % copying label ax26 to answer in negative clause
% 0.44/1.06    % copying label ax27 to answer in negative clause
% 0.44/1.06    % copying label ax28 to answer in negative clause
% 0.44/1.06    % copying label ax29 to answer in negative clause
% 0.44/1.06    % copying label ax30 to answer in negative clause
% 0.44/1.06    % copying label ax31 to answer in negative clause
% 0.44/1.06    % copying label ax32 to answer in negative clause
% 0.44/1.06    % copying label ax33 to answer in negative clause
% 0.44/1.06    % copying label ax34 to answer in negative clause
% 0.44/1.06    % copying label ax35 to answer in negative clause
% 0.44/1.06    % copying label ax36 to answer in negative clause
% 0.44/1.06    % copying label ax37 to answer in negative clause
% 0.44/1.06    % copying label ax38 to answer in negative clause
% 0.44/1.06    % copying label ax39 to answer in negative clause
% 0.44/1.06    % copying label ax40 to answer in negative clause
% 0.44/1.06    % copying label ax41 to answer in negative clause
% 0.44/1.06    % copying label ax42 to answer in negative clause
% 0.44/1.06    % copying label ax43 to answer in negative clause
% 0.44/1.06    % copying label ax44 to answer in negative clause
% 0.44/1.06    % copying label ax45 to answer in negative clause
% 0.44/1.06    % copying label ax46 to answer in negative clause
% 0.44/1.06    % copying label ax47 to answer in negative clause
% 0.44/1.06    % copying label ax48 to answer in negative clause
% 0.44/1.06    % copying label ax49 to answer in negative clause
% 0.44/1.06    % copying label ax50 to answer in negative clause
% 0.44/1.06    % copying label ax51 to answer in negative clause
% 0.44/1.06    % copying label ax52 to answer in negative clause
% 0.44/1.06    % copying label ax53 to answer in negative clause
% 0.44/1.06    % copying label ax54 to answer in negative clause
% 0.44/1.06    % copying label co0 to answer in negative clause
% 0.44/1.06    % assign(max_proofs, 56).  % (Horn set with more than one neg. clause)
% 0.44/1.06  
% 0.44/1.06  WARNING, because some of the denials share constants,
% 0.44/1.06  some of the denials or their descendents may be subsumed,
% 0.44/1.06  preventing the target number of proofs from being found.
% 0.44/1.06  The shared constants are:  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.44/1.06  
% 0.44/1.06  Term ordering decisions:
% 300.05/300.31  Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------