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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SWW949+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:58 EDT 2022

% Result   : Timeout 300.04s 300.34s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SWW949+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 : n024.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 09:38:50 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.69/1.00  ============================== Prover9 ===============================
% 0.69/1.00  Prover9 (32) version 2009-11A, November 2009.
% 0.69/1.00  Process 30734 was started by sandbox2 on n024.cluster.edu,
% 0.69/1.00  Sun Jun  5 09:38:50 2022
% 0.69/1.00  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_30581_n024.cluster.edu".
% 0.69/1.00  ============================== end of head ===========================
% 0.69/1.00  
% 0.69/1.00  ============================== INPUT =================================
% 0.69/1.00  
% 0.69/1.00  % Reading from file /tmp/Prover9_30581_n024.cluster.edu
% 0.69/1.00  
% 0.69/1.00  set(prolog_style_variables).
% 0.69/1.00  set(auto2).
% 0.69/1.00      % set(auto2) -> set(auto).
% 0.69/1.00      % set(auto) -> set(auto_inference).
% 0.69/1.00      % set(auto) -> set(auto_setup).
% 0.69/1.00      % set(auto_setup) -> set(predicate_elim).
% 0.69/1.00      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.69/1.00      % set(auto) -> set(auto_limits).
% 0.69/1.00      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.69/1.00      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.69/1.00      % set(auto) -> set(auto_denials).
% 0.69/1.00      % set(auto) -> set(auto_process).
% 0.69/1.00      % set(auto2) -> assign(new_constants, 1).
% 0.69/1.00      % set(auto2) -> assign(fold_denial_max, 3).
% 0.69/1.00      % set(auto2) -> assign(max_weight, "200.000").
% 0.69/1.00      % set(auto2) -> assign(max_hours, 1).
% 0.69/1.00      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.69/1.00      % set(auto2) -> assign(max_seconds, 0).
% 0.69/1.00      % set(auto2) -> assign(max_minutes, 5).
% 0.69/1.00      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.69/1.00      % set(auto2) -> set(sort_initial_sos).
% 0.69/1.00      % set(auto2) -> assign(sos_limit, -1).
% 0.69/1.00      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.69/1.00      % set(auto2) -> assign(max_megs, 400).
% 0.69/1.00      % set(auto2) -> assign(stats, some).
% 0.69/1.00      % set(auto2) -> clear(echo_input).
% 0.69/1.00      % set(auto2) -> set(quiet).
% 0.69/1.00      % set(auto2) -> clear(print_initial_clauses).
% 0.69/1.00      % set(auto2) -> clear(print_given).
% 0.69/1.00  assign(lrs_ticks,-1).
% 0.69/1.00  assign(sos_limit,10000).
% 0.69/1.00  assign(order,kbo).
% 0.69/1.00  set(lex_order_vars).
% 0.69/1.00  clear(print_given).
% 0.69/1.00  
% 0.69/1.00  % formulas(sos).  % not echoed (124 formulas)
% 0.69/1.00  
% 0.69/1.00  ============================== end of input ==========================
% 0.69/1.00  
% 0.69/1.00  % From the command line: assign(max_seconds, 300).
% 0.69/1.00  
% 0.69/1.00  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.69/1.00  
% 0.69/1.00  % Formulas that are not ordinary clauses:
% 0.69/1.00  1 (all VAR_X_10X30 constr_xor(VAR_X_10X30,VAR_X_10X30) = constr_ZERO) # label(ax78) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  2 (all VAR_X_9 constr_xor(VAR_X_9,constr_ZERO) = VAR_X_9) # label(ax79) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  3 (all VAR_X_7 all VAR_Y_8 constr_xor(VAR_X_7,VAR_Y_8) = constr_xor(VAR_Y_8,VAR_X_7)) # label(ax80) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  4 (all VAR_X_0X30 all VAR_Y_0X30 all VAR_Z_0X30 constr_xor(VAR_X_0X30,constr_xor(VAR_Y_0X30,VAR_Z_0X30)) = constr_xor(constr_xor(VAR_X_0X30,VAR_Y_0X30),VAR_Z_0X30)) # label(ax81) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  5 (all VAR_V_30X30 all VAR_V_31 (pred_attacker(VAR_V_30X30) & pred_attacker(VAR_V_31) -> pred_attacker(constr_xor(VAR_V_30X30,VAR_V_31)))) # label(ax82) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  6 (all VAR_V_34 (pred_attacker(VAR_V_34) -> pred_attacker(tuple_knowledge_from_1st_round_out_3(VAR_V_34)))) # label(ax84) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  7 (all VAR_V_37 (pred_attacker(tuple_knowledge_from_1st_round_out_3(VAR_V_37)) -> pred_attacker(VAR_V_37))) # label(ax85) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  8 (all VAR_V_41 all VAR_V_42 (pred_attacker(VAR_V_41) & pred_attacker(VAR_V_42) -> pred_attacker(tuple_knowledge_from_1st_round_out_2(VAR_V_41,VAR_V_42)))) # label(ax86) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  9 (all VAR_V_49 all VAR_V_50X30 (pred_attacker(tuple_knowledge_from_1st_round_out_2(VAR_V_49,VAR_V_50X30)) -> pred_attacker(VAR_V_49))) # label(ax87) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  10 (all VAR_V_52 all VAR_V_53 (pred_attacker(tuple_knowledge_from_1st_round_out_2(VAR_V_52,VAR_V_53)) -> pred_attacker(VAR_V_53))) # label(ax88) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  11 (all VAR_V_56 (pred_attacker(VAR_V_56) -> pred_attacker(tuple_knowledge_from_1st_round_out_1(VAR_V_56)))) # label(ax89) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  12 (all VAR_V_59 (pred_attacker(tuple_knowledge_from_1st_round_out_1(VAR_V_59)) -> pred_attacker(VAR_V_59))) # label(ax90) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  13 (all VAR_V_63 all VAR_V_64 (pred_attacker(VAR_V_63) & pred_attacker(VAR_V_64) -> pred_attacker(constr_f(VAR_V_63,VAR_V_64)))) # label(ax92) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  14 (all VAR_V_66 (pred_attacker(VAR_V_66) -> pred_attacker(constr_cyc_shr_quart_len(VAR_V_66)))) # label(ax93) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  15 (all VAR_V_68 (pred_attacker(VAR_V_68) -> pred_attacker(constr_cyc_shr_half_len(VAR_V_68)))) # label(ax94) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  16 (all VAR_V_70X30 (pred_attacker(VAR_V_70X30) -> pred_attacker(constr_cyc_shl_quart_len(VAR_V_70X30)))) # label(ax95) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  17 (all VAR_V_72 (pred_attacker(VAR_V_72) -> pred_attacker(constr_cyc_shl_half_len(VAR_V_72)))) # label(ax96) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  18 (all VAR_V_74 (pred_attacker(VAR_V_74) -> pred_attacker(tuple_R_out_4(VAR_V_74)))) # label(ax98) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  19 (all VAR_V_77 (pred_attacker(tuple_R_out_4(VAR_V_77)) -> pred_attacker(VAR_V_77))) # label(ax99) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  20 (all VAR_V_80X30 (pred_attacker(VAR_V_80X30) -> pred_attacker(tuple_R_out_3(VAR_V_80X30)))) # label(ax100) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  21 (all VAR_V_83 (pred_attacker(tuple_R_out_3(VAR_V_83)) -> pred_attacker(VAR_V_83))) # label(ax101) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  22 (all VAR_V_86 (pred_attacker(VAR_V_86) -> pred_attacker(tuple_R_out_1(VAR_V_86)))) # label(ax102) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  23 (all VAR_V_89 (pred_attacker(tuple_R_out_1(VAR_V_89)) -> pred_attacker(VAR_V_89))) # label(ax103) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  24 (all VAR_V_93 all VAR_V_94 (pred_attacker(VAR_V_93) & pred_attacker(VAR_V_94) -> pred_attacker(tuple_R_in_2(VAR_V_93,VAR_V_94)))) # label(ax104) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  25 (all VAR_V_10X301 all VAR_V_10X302 (pred_attacker(tuple_R_in_2(VAR_V_10X301,VAR_V_10X302)) -> pred_attacker(VAR_V_10X301))) # label(ax105) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  26 (all VAR_V_10X304 all VAR_V_10X305 (pred_attacker(tuple_R_in_2(VAR_V_10X304,VAR_V_10X305)) -> pred_attacker(VAR_V_10X305))) # label(ax106) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  27 (all VAR_V_111 all VAR_V_112 (pred_mess(VAR_V_112,VAR_V_111) & pred_attacker(VAR_V_112) -> pred_attacker(VAR_V_111))) # label(ax112) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  28 (all VAR_V_113 all VAR_V_114 (pred_attacker(VAR_V_114) & pred_attacker(VAR_V_113) -> pred_mess(VAR_V_114,VAR_V_113))) # label(ax113) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  29 (all VAR_V_116 pred_equal(VAR_V_116,VAR_V_116)) # label(ax115) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  30 (all VAR_V_117 pred_attacker(name_new0x2Dname(VAR_V_117))) # label(ax116) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  31 (all VAR_M1_IN_244 (pred_attacker(tuple_R_in_2(VAR_M1_IN_244,constr_f(constr_xor(name_r1,constr_xor(VAR_M1_IN_244,name_t)),name_t))) -> pred_attacker(tuple_R_out_3(constr_xor(name_u,constr_cyc_shr_half_len(constr_xor(VAR_M1_IN_244,name_t))))))) # label(ax121) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  32 (all VAR_M1_IN_250X30 (pred_attacker(tuple_R_in_2(VAR_M1_IN_250X30,constr_f(constr_xor(name_r1,constr_xor(VAR_M1_IN_250X30,name_t)),name_t))) -> pred_attacker(tuple_R_out_4(name_objective)))) # label(ax122) # label(axiom) # label(non_clause).  [assumption].
% 0.69/1.00  
% 0.69/1.00  ============================== end of process non-clausal formulas ===
% 0.69/1.00  
% 0.69/1.00  ============================== PROCESS INITIAL CLAUSES ===============
% 0.69/1.00  
% 0.69/1.00  ============================== PREDICATE ELIMINATION =================
% 0.69/1.00  33 -pred_attacker(A) | -pred_attacker(B) | pred_mess(A,B) # label(ax113) # label(axiom).  [clausify(28)].
% 0.69/1.00  34 -pred_mess(A,B) | -pred_attacker(A) | pred_attacker(B) # label(ax112) # label(axiom).  [clausify(27)].
% 0.69/1.00  
% 0.69/1.00  ============================== end predicate elimination =============
% 0.69/1.00  
% 0.69/1.00  Auto_denials:
% 0.69/1.00    % copying label ax0 to answer in negative clause
% 0.69/1.00    % copying label ax1 to answer in negative clause
% 0.69/1.00    % copying label ax2 to answer in negative clause
% 0.69/1.00    % copying label ax3 to answer in negative clause
% 0.69/1.00    % copying label ax4 to answer in negative clause
% 0.69/1.00    % copying label ax5 to answer in negative clause
% 0.69/1.00    % copying label ax6 to answer in negative clause
% 0.69/1.00    % copying label ax7 to answer in negative clause
% 0.69/1.00    % copying label ax8 to answer in negative clause
% 0.69/1.00    % copying label ax9 to answer in negative clause
% 0.69/1.00    % copying label ax10 to answer in negative clause
% 0.69/1.00    % copying label ax11 to answer in negative clause
% 0.69/1.00    % copying label ax12 to answer in negative clause
% 0.69/1.00    % copying label ax13 to answer in negative clause
% 0.69/1.00    % copying label ax14 to answer in negative clause
% 0.69/1.00    % copying label ax15 to answer in negative clause
% 0.69/1.00    % copying label ax16 to answer in negative clause
% 0.69/1.00    % copying label ax17 to answer in negative clause
% 0.69/1.00    % copying label ax18 to answer in negative clause
% 0.69/1.00    % copying label ax19 to answer in negative clause
% 0.69/1.00    % copying label ax20 to answer in negative clause
% 0.69/1.00    % copying label ax21 to answer in negative clause
% 0.69/1.00    % copying label ax22 to answer in negative clause
% 0.69/1.00    % copying label ax23 to answer in negative clause
% 0.69/1.00    % copying label ax24 to answer in negative clause
% 0.69/1.00    % copying label ax25 to answer in negative clause
% 0.69/1.00    % copying label ax26 to answer in negative clause
% 0.69/1.00    % copying label ax27 to answer in negative clause
% 0.69/1.00    % copying label ax28 to answer in negative clause
% 0.69/1.00    % copying label ax29 to answer in negative clause
% 0.69/1.00    % copying label ax30 to answer in negative clause
% 0.69/1.00    % copying label ax31 to answer in negative clause
% 0.69/1.00    % copying label ax32 to answer in negative clause
% 0.69/1.00    % copying label ax33 to answer in negative clause
% 0.69/1.00    % copying label ax34 to answer in negative clause
% 0.69/1.00    % copying label ax35 to answer in negative clause
% 0.69/1.00    % copying label ax36 to answer in negative clause
% 0.69/1.00    % copying label ax37 to answer in negative clause
% 0.69/1.00    % copying label ax38 to answer in negative clause
% 0.69/1.00    % copying label ax39 to answer in negative clause
% 0.69/1.00    % copying label ax40 to answer in negative clause
% 0.69/1.00    % copying label ax41 to answer in negative clause
% 0.69/1.00    % copying label ax42 to answer in negative clause
% 0.69/1.00    % copying label ax43 to answer in negative clause
% 0.69/1.00    % copying label ax44 to answer in negative clause
% 0.69/1.00    % copying label ax45 to answer in negative clause
% 0.69/1.00    % copying label ax46 to answer in negative clause
% 0.69/1.00    % copying label ax47 to answer in negative clause
% 0.69/1.00    % copying label ax48 to answer in negative clause
% 0.69/1.00    % copying label ax49 to answer in negative clause
% 0.69/1.00    % copying label ax50 to answer in negative clause
% 0.69/1.00    % copying label ax51 to answer in negative clause
% 0.69/1.00    % copying label ax52 to answer in negative clause
% 0.69/1.00    % copying label ax53 to answer in negative clause
% 0.69/1.00    % copying label ax54 to answer in negative clause
% 0.69/1.00    % copying label ax55 to answer in negative clause
% 0.69/1.00    % copying label ax56 to answer in negative clause
% 0.69/1.00    % copying label ax57 to answer in negative clause
% 0.69/1.00    % copying label ax58 to answer in negative clause
% 0.69/1.00    % copying label ax59 to answer in negative clause
% 0.69/1.00    % copying label ax60 to answer in negative clause
% 0.69/1.00    % copying label ax61 to answer in negative clause
% 0.69/1.00    % copying label ax62 to answer in negative clause
% 0.69/1.00    % copying label ax63 to answer in negative clause
% 0.69/1.00    % copying label ax64 to answer in negative clause
% 0.69/1.00    % copying label ax65 to answer in negative clause
% 0.69/1.00    % copying label ax66 to answer in negative clause
% 0.69/1.00    % copying label ax67 to answer in negative clause
% 0.69/1.00    % copying label ax68 to answer in negative clause
% 0.69/1.00    % copying label ax69 to answer in negative clause
% 0.69/1.00    % copying label ax70 to answer in negative clause
% 0.69/1.00    % copying label ax71 to answer in negative clause
% 0.69/1.00    % copying label ax72 to answer in negative clause
% 0.69/1.00    % copying label ax73 to answer in negative clause
% 0.69/1.00    % copying label ax74 to answer in negative clause
% 0.69/1.00    % copying label ax75 to answer in negative
% 0.69/1.00  WARNING: denials share constants (see output).
% 0.69/1.00  
% 300.04/300.34  Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------