TSTP Solution File: SWW948+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWW948+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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.01s 300.30s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SWW948+1 : TPTP v8.1.0. Released v7.4.0.
% 0.08/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28 % CPULimit : 300
% 0.10/0.28 % WCLimit : 600
% 0.10/0.29 % DateTime : Sun Jun 5 12:51:03 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.53/0.81 ============================== Prover9 ===============================
% 0.53/0.81 Prover9 (32) version 2009-11A, November 2009.
% 0.53/0.81 Process 21455 was started by sandbox2 on n032.cluster.edu,
% 0.53/0.81 Sun Jun 5 12:51:04 2022
% 0.53/0.81 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_21302_n032.cluster.edu".
% 0.53/0.81 ============================== end of head ===========================
% 0.53/0.81
% 0.53/0.81 ============================== INPUT =================================
% 0.53/0.81
% 0.53/0.81 % Reading from file /tmp/Prover9_21302_n032.cluster.edu
% 0.53/0.81
% 0.53/0.81 set(prolog_style_variables).
% 0.53/0.81 set(auto2).
% 0.53/0.81 % set(auto2) -> set(auto).
% 0.53/0.81 % set(auto) -> set(auto_inference).
% 0.53/0.81 % set(auto) -> set(auto_setup).
% 0.53/0.81 % set(auto_setup) -> set(predicate_elim).
% 0.53/0.81 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.53/0.81 % set(auto) -> set(auto_limits).
% 0.53/0.81 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.53/0.81 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.53/0.81 % set(auto) -> set(auto_denials).
% 0.53/0.81 % set(auto) -> set(auto_process).
% 0.53/0.81 % set(auto2) -> assign(new_constants, 1).
% 0.53/0.81 % set(auto2) -> assign(fold_denial_max, 3).
% 0.53/0.81 % set(auto2) -> assign(max_weight, "200.000").
% 0.53/0.81 % set(auto2) -> assign(max_hours, 1).
% 0.53/0.81 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.53/0.81 % set(auto2) -> assign(max_seconds, 0).
% 0.53/0.81 % set(auto2) -> assign(max_minutes, 5).
% 0.53/0.81 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.53/0.81 % set(auto2) -> set(sort_initial_sos).
% 0.53/0.81 % set(auto2) -> assign(sos_limit, -1).
% 0.53/0.81 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.53/0.81 % set(auto2) -> assign(max_megs, 400).
% 0.53/0.81 % set(auto2) -> assign(stats, some).
% 0.53/0.81 % set(auto2) -> clear(echo_input).
% 0.53/0.81 % set(auto2) -> set(quiet).
% 0.53/0.81 % set(auto2) -> clear(print_initial_clauses).
% 0.53/0.81 % set(auto2) -> clear(print_given).
% 0.53/0.81 assign(lrs_ticks,-1).
% 0.53/0.81 assign(sos_limit,10000).
% 0.53/0.81 assign(order,kbo).
% 0.53/0.81 set(lex_order_vars).
% 0.53/0.81 clear(print_given).
% 0.53/0.81
% 0.53/0.81 % formulas(sos). % not echoed (108 formulas)
% 0.53/0.81
% 0.53/0.81 ============================== end of input ==========================
% 0.53/0.81
% 0.53/0.81 % From the command line: assign(max_seconds, 300).
% 0.53/0.81
% 0.53/0.81 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.53/0.81
% 0.53/0.81 % Formulas that are not ordinary clauses:
% 0.53/0.81 1 (all VAR_X_10X30 constr_xor(VAR_X_10X30,VAR_X_10X30) = constr_ZERO) # label(ax66) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.81 2 (all VAR_X_9 constr_xor(VAR_X_9,constr_ZERO) = VAR_X_9) # label(ax67) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.81 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(ax68) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.81 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(ax69) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.81 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(ax70) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.81 6 (all VAR_V_34 (pred_attacker(VAR_V_34) -> pred_attacker(tuple_knowledge_from_1st_round_out_3(VAR_V_34)))) # label(ax72) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.81 7 (all VAR_V_37 (pred_attacker(tuple_knowledge_from_1st_round_out_3(VAR_V_37)) -> pred_attacker(VAR_V_37))) # label(ax73) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.81 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(ax74) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.81 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(ax75) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.81 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(ax76) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.81 11 (all VAR_V_56 (pred_attacker(VAR_V_56) -> pred_attacker(tuple_knowledge_from_1st_round_out_1(VAR_V_56)))) # label(ax77) # label(axiom) # label(non_cl
% 0.53/0.82 WARNING: denials share constants (see output).
% 0.53/0.82
% 0.53/0.82 ause). [assumption].
% 0.53/0.82 12 (all VAR_V_59 (pred_attacker(tuple_knowledge_from_1st_round_out_1(VAR_V_59)) -> pred_attacker(VAR_V_59))) # label(ax78) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 13 (all VAR_V_62 (pred_attacker(VAR_V_62) -> pred_attacker(constr_h(VAR_V_62)))) # label(ax79) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 14 (all VAR_V_64 (pred_attacker(VAR_V_64) -> pred_attacker(tuple_R_out_4(VAR_V_64)))) # label(ax82) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 15 (all VAR_V_67 (pred_attacker(tuple_R_out_4(VAR_V_67)) -> pred_attacker(VAR_V_67))) # label(ax83) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 16 (all VAR_V_70X30 (pred_attacker(VAR_V_70X30) -> pred_attacker(tuple_R_out_3(VAR_V_70X30)))) # label(ax84) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 17 (all VAR_V_73 (pred_attacker(tuple_R_out_3(VAR_V_73)) -> pred_attacker(VAR_V_73))) # label(ax85) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 18 (all VAR_V_76 (pred_attacker(VAR_V_76) -> pred_attacker(tuple_R_out_1(VAR_V_76)))) # label(ax86) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 19 (all VAR_V_79 (pred_attacker(tuple_R_out_1(VAR_V_79)) -> pred_attacker(VAR_V_79))) # label(ax87) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 20 (all VAR_V_83 all VAR_V_84 (pred_attacker(VAR_V_83) & pred_attacker(VAR_V_84) -> pred_attacker(tuple_R_in_2(VAR_V_83,VAR_V_84)))) # label(ax88) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 21 (all VAR_V_91 all VAR_V_92 (pred_attacker(tuple_R_in_2(VAR_V_91,VAR_V_92)) -> pred_attacker(VAR_V_91))) # label(ax89) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 22 (all VAR_V_94 all VAR_V_95 (pred_attacker(tuple_R_in_2(VAR_V_94,VAR_V_95)) -> pred_attacker(VAR_V_95))) # label(ax90) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 23 (all VAR_V_10X301 all VAR_V_10X302 (pred_mess(VAR_V_10X302,VAR_V_10X301) & pred_attacker(VAR_V_10X302) -> pred_attacker(VAR_V_10X301))) # label(ax96) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 24 (all VAR_V_10X303 all VAR_V_10X304 (pred_attacker(VAR_V_10X304) & pred_attacker(VAR_V_10X303) -> pred_mess(VAR_V_10X304,VAR_V_10X303))) # label(ax97) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 25 (all VAR_V_10X306 pred_equal(VAR_V_10X306,VAR_V_10X306)) # label(ax99) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 26 (all VAR_V_10X307 pred_attacker(name_new0x2Dname(VAR_V_10X307))) # label(ax100) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 27 (all VAR_R1_IN_234 (pred_attacker(tuple_R_in_2(VAR_R1_IN_234,constr_h(constr_xor(constr_xor(name_r0x30,VAR_R1_IN_234),name_k)))) -> pred_attacker(tuple_R_out_3(constr_h(constr_xor(constr_xor(constr_h(constr_xor(constr_xor(name_r0x30,VAR_R1_IN_234),name_k)),name_k),name_r0x30)))))) # label(ax105) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82 28 (all VAR_R1_IN_244 (pred_attacker(tuple_R_in_2(VAR_R1_IN_244,constr_h(constr_xor(constr_xor(name_r0x30,VAR_R1_IN_244),name_k)))) -> pred_attacker(tuple_R_out_4(name_objective_R)))) # label(ax106) # label(axiom) # label(non_clause). [assumption].
% 0.53/0.82
% 0.53/0.82 ============================== end of process non-clausal formulas ===
% 0.53/0.82
% 0.53/0.82 ============================== PROCESS INITIAL CLAUSES ===============
% 0.53/0.82
% 0.53/0.82 ============================== PREDICATE ELIMINATION =================
% 0.53/0.82 29 -pred_attacker(A) | -pred_attacker(B) | pred_mess(A,B) # label(ax97) # label(axiom). [clausify(24)].
% 0.53/0.82 30 -pred_mess(A,B) | -pred_attacker(A) | pred_attacker(B) # label(ax96) # label(axiom). [clausify(23)].
% 0.53/0.82
% 0.53/0.82 ============================== end predicate elimination =============
% 0.53/0.82
% 0.53/0.82 Auto_denials:
% 0.53/0.82 % copying label ax0 to answer in negative clause
% 0.53/0.82 % copying label ax1 to answer in negative clause
% 0.53/0.82 % copying label ax2 to answer in negative clause
% 0.53/0.82 % copying label ax3 to answer in negative clause
% 0.53/0.82 % copying label ax4 to answer in negative clause
% 0.53/0.82 % copying label ax5 to answer in negative clause
% 0.53/0.82 % copying label ax6 to answer in negative clause
% 0.53/0.82 % copying label ax7 to answer in negative clause
% 0.53/0.82 % copying label ax8 to answer in negative clause
% 0.53/0.82 % copying label ax9 to answer in negative clause
% 0.53/0.82 % copying label ax10 to answer in negative clause
% 0.53/0.82 % copying label ax11 to answer in negative clause
% 0.53/0.82 % copying label ax12 to answer in negative clause
% 0.53/0.82 % copying label ax13 to answer in negative clause
% 0.53/0.82 % copying label ax14 to answer in negative clause
% 0.53/0.82 % copying label ax15 to answer in negative clause
% 0.53/0.82 % copying label ax16 to answer in negative clause
% 0.53/0.82 % copying label ax17 to answer in negative clause
% 0.53/0.82 % copying label ax18 to answer in negative clause
% 0.53/0.82 % copying label ax19 to answer in negative clause
% 0.53/0.82 % copying label ax20 to answer in negative clause
% 0.53/0.82 % copying label ax21 to answer in negative clause
% 0.53/0.82 % copying label ax22 to answer in negative clause
% 0.53/0.82 % copying label ax23 to answer in negative clause
% 0.53/0.82 % copying label ax24 to answer in negative clause
% 0.53/0.82 % copying label ax25 to answer in negative clause
% 0.53/0.82 % copying label ax26 to answer in negative clause
% 0.53/0.82 % copying label ax27 to answer in negative clause
% 0.53/0.82 % copying label ax28 to answer in negative clause
% 0.53/0.82 % copying label ax29 to answer in negative clause
% 0.53/0.82 % copying label ax30 to answer in negative clause
% 0.53/0.82 % copying label ax31 to answer in negative clause
% 0.53/0.82 % copying label ax32 to answer in negative clause
% 0.53/0.82 % copying label ax33 to answer in negative clause
% 0.53/0.82 % copying label ax34 to answer in negative clause
% 0.53/0.82 % copying label ax35 to answer in negative clause
% 0.53/0.82 % copying label ax36 to answer in negative clause
% 0.53/0.82 % copying label ax37 to answer in negative clause
% 0.53/0.82 % copying label ax38 to answer in negative clause
% 0.53/0.82 % copying label ax39 to answer in negative clause
% 0.53/0.82 % copying label ax40 to answer in negative clause
% 0.53/0.82 % copying label ax41 to answer in negative clause
% 0.53/0.82 % copying label ax42 to answer in negative clause
% 0.53/0.82 % copying label ax43 to answer in negative clause
% 0.53/0.82 % copying label ax44 to answer in negative clause
% 0.53/0.82 % copying label ax45 to answer in negative clause
% 0.53/0.82 % copying label ax46 to answer in negative clause
% 0.53/0.82 % copying label ax47 to answer in negative clause
% 0.53/0.82 % copying label ax48 to answer in negative clause
% 0.53/0.82 % copying label ax49 to answer in negative clause
% 0.53/0.82 % copying label ax50 to answer in negative clause
% 0.53/0.82 % copying label ax51 to answer in negative clause
% 0.53/0.82 % copying label ax52 to answer in negative clause
% 0.53/0.82 % copying label ax53 to answer in negative clause
% 0.53/0.82 % copying label ax54 to answer in negative clause
% 0.53/0.82 % copying label ax55 to answer in negative clause
% 0.53/0.82 % copying label ax56 to answer in negative clause
% 0.53/0.82 % copying label ax57 to answer in negative clause
% 0.53/0.82 % copying label ax58 to answer in negative clause
% 0.53/0.82 % copying label ax59 to answer in negative clause
% 0.53/0.82 % copying label ax60 to answer in negative clause
% 0.53/0.82 % copying label ax61 to answer in negative clause
% 0.53/0.82 % copying label ax62 to answer in negative clause
% 0.53/0.82 % copying label ax63 to answer in negative clause
% 0.53/0.82 % copying label ax64 to answer in negative clause
% 0.53/0.82 % copying label ax65 to answer in negative clause
% 0.53/0.82 % copying label co0 to answer in negative clause
% 0.53/0.82 % assign(max_proofs, 67). % (Horn set with more than one neg. clause)
% 0.53/0.82
% 0.53/0.82 WARNING, because some of the denials share constants,
% 0.53/0.82 some of the denials or their descendents may be subsumed,
% 0.53/0.82 preventing the target number of proofs from being found.
% 0.53/0.82 The shared constants are: name_r1_from_1st, name_r0x30_from_1st, name_r0x30, name_objective_R, name_k, name_c, constr_ZERO, constr_CONST_4, constr_CONST_3, constr_CONST_2, constr_CONST_1, constr_CONST_0x30.
% 0.53/0.82
% 0.53/0.82 Term ordering decisions:
% 0.53/0.82 Function symbol KB weights: name_k=1. name_r0x30=1. name_r0x30_from_1st=1. constr_ZERO=1. name_r1_from_1st=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_R=1. tuple_false=1. tuple_true=1. constr_xor=1. tuple_R_in_2=1. tuple_knowledge_from_1st_round_out_2=1. constr_h=1. tuple_R_out_1=1. tuple_R_out_3=1. tuple_R_out_4=1. tuple_knowledge_from_1st_round_out_1=1. tuple_knowledge_from_1st_round_out_3=1. name_new0x2Dname=1.
% 0.53/0.82
% 0.53/0.82 ============================== end of process initial clauses ========
% 0.53/0.82
% 0.53/0.82 ============================== CLAUSES FOR SEARCH ====================
% 0.53/0.82
% 0.53/0.82 =====================Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------