TSTP Solution File: SWW956+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWW956+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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.05s 300.35s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWW956+1 : TPTP v8.1.0. Released v7.4.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 4 11:38:01 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.47/1.05 ============================== Prover9 ===============================
% 0.47/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.05 Process 28931 was started by sandbox2 on n025.cluster.edu,
% 0.47/1.05 Sat Jun 4 11:38:02 2022
% 0.47/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28778_n025.cluster.edu".
% 0.47/1.05 ============================== end of head ===========================
% 0.47/1.05
% 0.47/1.05 ============================== INPUT =================================
% 0.47/1.05
% 0.47/1.05 % Reading from file /tmp/Prover9_28778_n025.cluster.edu
% 0.47/1.05
% 0.47/1.05 set(prolog_style_variables).
% 0.47/1.05 set(auto2).
% 0.47/1.05 % set(auto2) -> set(auto).
% 0.47/1.05 % set(auto) -> set(auto_inference).
% 0.47/1.05 % set(auto) -> set(auto_setup).
% 0.47/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.05 % set(auto) -> set(auto_limits).
% 0.47/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.05 % set(auto) -> set(auto_denials).
% 0.47/1.05 % set(auto) -> set(auto_process).
% 0.47/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.05 % set(auto2) -> assign(stats, some).
% 0.47/1.05 % set(auto2) -> clear(echo_input).
% 0.47/1.05 % set(auto2) -> set(quiet).
% 0.47/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.05 % set(auto2) -> clear(print_given).
% 0.47/1.05 assign(lrs_ticks,-1).
% 0.47/1.05 assign(sos_limit,10000).
% 0.47/1.05 assign(order,kbo).
% 0.47/1.05 set(lex_order_vars).
% 0.47/1.05 clear(print_given).
% 0.47/1.05
% 0.47/1.05 % formulas(sos). % not echoed (94 formulas)
% 0.47/1.05
% 0.47/1.05 ============================== end of input ==========================
% 0.47/1.05
% 0.47/1.05 % From the command line: assign(max_seconds, 300).
% 0.47/1.05
% 0.47/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.05
% 0.47/1.05 % Formulas that are not ordinary clauses:
% 0.47/1.05 1 (all VAR_K_0X30 all VAR_M_0X30 constr_dec(constr_enc(VAR_M_0X30,VAR_K_0X30),VAR_K_0X30) = VAR_M_0X30) # label(ax55) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 2 (all VAR_G_0X30 all VAR_P_0X30 all VAR_X_0X30 all VAR_Y_0X30 constr_mod(constr_exp(constr_exp(VAR_G_0X30,VAR_X_0X30),VAR_Y_0X30),VAR_P_0X30) = constr_mod(constr_exp(constr_exp(VAR_G_0X30,VAR_Y_0X30),VAR_X_0X30),VAR_P_0X30)) # label(ax56) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 3 (all VAR_V_30X30 all VAR_V_31 (pred_attacker(VAR_V_30X30) & pred_attacker(VAR_V_31) -> pred_attacker(constr_mod(VAR_V_30X30,VAR_V_31)))) # label(ax58) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 4 (all VAR_V_34 all VAR_V_35 (pred_attacker(VAR_V_34) & pred_attacker(VAR_V_35) -> pred_attacker(constr_exp(VAR_V_34,VAR_V_35)))) # label(ax60) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 5 (all VAR_V_38 all VAR_V_39 (pred_attacker(VAR_V_38) & pred_attacker(VAR_V_39) -> pred_attacker(constr_enc(VAR_V_38,VAR_V_39)))) # label(ax61) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 6 (all VAR_V_42 all VAR_V_43 (pred_attacker(VAR_V_42) & pred_attacker(VAR_V_43) -> pred_attacker(constr_dec(VAR_V_42,VAR_V_43)))) # label(ax62) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 7 (all VAR_V_45 (pred_attacker(VAR_V_45) -> pred_attacker(tuple_B_out_3(VAR_V_45)))) # label(ax68) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 8 (all VAR_V_48 (pred_attacker(tuple_B_out_3(VAR_V_48)) -> pred_attacker(VAR_V_48))) # label(ax69) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 9 (all VAR_V_51 (pred_attacker(VAR_V_51) -> pred_attacker(tuple_B_in_2(VAR_V_51)))) # label(ax70) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 10 (all VAR_V_54 (pred_attacker(tuple_B_in_2(VAR_V_54)) -> pred_attacker(VAR_V_54))) # label(ax71) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.05 11 (all VAR_V_58 all VAR_V_59 (pred_attacker(VAR_V_58) & pred_attacker(VAR_V_59) -> pred_attacker(tuple_B_in_1(V
% 0.47/1.05 WARNING: denials share constants (see output).
% 0.47/1.05
% 0.47/1.06 AR_V_58,VAR_V_59)))) # label(ax72) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 12 (all VAR_V_66 all VAR_V_67 (pred_attacker(tuple_B_in_1(VAR_V_66,VAR_V_67)) -> pred_attacker(VAR_V_66))) # label(ax73) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 13 (all VAR_V_69 all VAR_V_70X30 (pred_attacker(tuple_B_in_1(VAR_V_69,VAR_V_70X30)) -> pred_attacker(VAR_V_70X30))) # label(ax74) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 14 (all VAR_V_73 (pred_attacker(VAR_V_73) -> pred_attacker(tuple_A_out_4(VAR_V_73)))) # label(ax75) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 15 (all VAR_V_76 (pred_attacker(tuple_A_out_4(VAR_V_76)) -> pred_attacker(VAR_V_76))) # label(ax76) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 16 (all VAR_V_79 (pred_attacker(VAR_V_79) -> pred_attacker(tuple_A_out_2(VAR_V_79)))) # label(ax77) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 17 (all VAR_V_82 (pred_attacker(tuple_A_out_2(VAR_V_82)) -> pred_attacker(VAR_V_82))) # label(ax78) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 18 (all VAR_V_86 all VAR_V_87 (pred_attacker(VAR_V_86) & pred_attacker(VAR_V_87) -> pred_attacker(tuple_A_out_1(VAR_V_86,VAR_V_87)))) # label(ax79) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 19 (all VAR_V_94 all VAR_V_95 (pred_attacker(tuple_A_out_1(VAR_V_94,VAR_V_95)) -> pred_attacker(VAR_V_94))) # label(ax80) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 20 (all VAR_V_97 all VAR_V_98 (pred_attacker(tuple_A_out_1(VAR_V_97,VAR_V_98)) -> pred_attacker(VAR_V_98))) # label(ax81) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 21 (all VAR_V_10X301 (pred_attacker(VAR_V_10X301) -> pred_attacker(tuple_A_in_3(VAR_V_10X301)))) # label(ax82) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 22 (all VAR_V_10X304 (pred_attacker(tuple_A_in_3(VAR_V_10X304)) -> pred_attacker(VAR_V_10X304))) # label(ax83) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 23 (all VAR_V_110X30 all VAR_V_111 (pred_mess(VAR_V_111,VAR_V_110X30) & pred_attacker(VAR_V_111) -> pred_attacker(VAR_V_110X30))) # label(ax84) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 24 (all VAR_V_112 all VAR_V_113 (pred_attacker(VAR_V_113) & pred_attacker(VAR_V_112) -> pred_mess(VAR_V_113,VAR_V_112))) # label(ax85) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 25 (all VAR_V_115 pred_equal(VAR_V_115,VAR_V_115)) # label(ax87) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 26 (all VAR_V_116 pred_attacker(name_new0x2Dname(VAR_V_116))) # label(ax88) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 27 (all VAR_B_186 (pred_attacker(tuple_A_in_3(VAR_B_186)) -> pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(VAR_B_186,name_Na),name_P_7)))))) # label(ax91) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06 28 (all VAR_A_219 all VAR_G_221 all VAR_P_220X30 (pred_attacker(tuple_B_in_2(VAR_A_219)) & pred_attacker(tuple_B_in_1(VAR_P_220X30,VAR_G_221)) -> pred_attacker(tuple_B_out_3(constr_mod(constr_exp(VAR_G_221,name_Nb),VAR_P_220X30))))) # label(ax92) # label(axiom) # label(non_clause). [assumption].
% 0.47/1.06
% 0.47/1.06 ============================== end of process non-clausal formulas ===
% 0.47/1.06
% 0.47/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.06
% 0.47/1.06 ============================== PREDICATE ELIMINATION =================
% 0.47/1.06 29 -pred_attacker(A) | -pred_attacker(B) | pred_mess(A,B) # label(ax85) # label(axiom). [clausify(24)].
% 0.47/1.06 30 -pred_mess(A,B) | -pred_attacker(A) | pred_attacker(B) # label(ax84) # label(axiom). [clausify(23)].
% 0.47/1.06
% 0.47/1.06 ============================== end predicate elimination =============
% 0.47/1.06
% 0.47/1.06 Auto_denials:
% 0.47/1.06 % copying label co0 to answer in negative clause
% 0.47/1.06 % copying label ax0 to answer in negative clause
% 0.47/1.06 % copying label ax1 to answer in negative clause
% 0.47/1.06 % copying label ax2 to answer in negative clause
% 0.47/1.06 % copying label ax3 to answer in negative clause
% 0.47/1.06 % copying label ax4 to answer in negative clause
% 0.47/1.06 % copying label ax5 to answer in negative clause
% 0.47/1.06 % copying label ax6 to answer in negative clause
% 0.47/1.06 % copying label ax7 to answer in negative clause
% 0.47/1.06 % copying label ax8 to answer in negative clause
% 0.47/1.06 %Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------