0.04/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.34 % Computer : n028.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.34 % DateTime : Thu Jul 2 11:46:51 EDT 2020 0.13/0.35 % CPUTime : 0.47/1.08 ============================== Prover9 =============================== 0.47/1.08 Prover9 (32) version 2009-11A, November 2009. 0.47/1.08 Process 6892 was started by sandbox2 on n028.cluster.edu, 0.47/1.08 Thu Jul 2 11:46:52 2020 0.47/1.08 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_6739_n028.cluster.edu". 0.47/1.08 ============================== end of head =========================== 0.47/1.08 0.47/1.08 ============================== INPUT ================================= 0.47/1.08 0.47/1.08 % Reading from file /tmp/Prover9_6739_n028.cluster.edu 0.47/1.08 0.47/1.08 set(prolog_style_variables). 0.47/1.08 set(auto2). 0.47/1.08 % set(auto2) -> set(auto). 0.47/1.08 % set(auto) -> set(auto_inference). 0.47/1.08 % set(auto) -> set(auto_setup). 0.47/1.08 % set(auto_setup) -> set(predicate_elim). 0.47/1.08 % set(auto_setup) -> assign(eq_defs, unfold). 0.47/1.08 % set(auto) -> set(auto_limits). 0.47/1.08 % set(auto_limits) -> assign(max_weight, "100.000"). 0.47/1.08 % set(auto_limits) -> assign(sos_limit, 20000). 0.47/1.08 % set(auto) -> set(auto_denials). 0.47/1.08 % set(auto) -> set(auto_process). 0.47/1.08 % set(auto2) -> assign(new_constants, 1). 0.47/1.08 % set(auto2) -> assign(fold_denial_max, 3). 0.47/1.08 % set(auto2) -> assign(max_weight, "200.000"). 0.47/1.08 % set(auto2) -> assign(max_hours, 1). 0.47/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.47/1.08 % set(auto2) -> assign(max_seconds, 0). 0.47/1.08 % set(auto2) -> assign(max_minutes, 5). 0.47/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.47/1.08 % set(auto2) -> set(sort_initial_sos). 0.47/1.08 % set(auto2) -> assign(sos_limit, -1). 0.47/1.08 % set(auto2) -> assign(lrs_ticks, 3000). 0.47/1.08 % set(auto2) -> assign(max_megs, 400). 0.47/1.08 % set(auto2) -> assign(stats, some). 0.47/1.08 % set(auto2) -> clear(echo_input). 0.47/1.08 % set(auto2) -> set(quiet). 0.47/1.08 % set(auto2) -> clear(print_initial_clauses). 0.47/1.08 % set(auto2) -> clear(print_given). 0.47/1.08 assign(lrs_ticks,-1). 0.47/1.08 assign(sos_limit,10000). 0.47/1.08 assign(order,kbo). 0.47/1.08 set(lex_order_vars). 0.47/1.08 clear(print_given). 0.47/1.08 0.47/1.08 % formulas(sos). % not echoed (82 formulas) 0.47/1.08 0.47/1.08 ============================== end of input ========================== 0.47/1.08 0.47/1.08 % From the command line: assign(max_seconds, 960). 0.47/1.08 0.47/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.47/1.08 0.47/1.08 % Formulas that are not ordinary clauses: 0.47/1.08 1 (all VAR_K_0X30 all VAR_M_0X30 VAR_M_0X30 = constr_comm_dec(constr_comm_enc(VAR_M_0X30,VAR_K_0X30),VAR_K_0X30)) # label(ax46) # label(axiom) # label(non_clause). [assumption]. 0.47/1.08 2 (all VAR_V_65 (pred_attacker(tuple_A_out_4(VAR_V_65)) -> pred_attacker(VAR_V_65))) # label(ax65) # label(axiom) # label(non_clause). [assumption]. 0.47/1.08 3 (all VAR_V_91 all VAR_V_92 (pred_attacker(VAR_V_91) & pred_attacker(VAR_V_92) -> pred_mess(VAR_V_92,VAR_V_91))) # label(ax73) # label(axiom) # label(non_clause). [assumption]. 0.47/1.08 4 (all VAR_V_47 (pred_attacker(tuple_B_out_2(VAR_V_47)) -> pred_attacker(VAR_V_47))) # label(ax59) # label(axiom) # label(non_clause). [assumption]. 0.47/1.08 5 (all VAR_V_74 (pred_attacker(VAR_V_74) -> pred_attacker(tuple_A_out_1(VAR_V_74)))) # label(ax68) # label(axiom) # label(non_clause). [assumption]. 0.47/1.08 6 (all VAR_V_94 pred_equal(VAR_V_94,VAR_V_94)) # label(ax75) # label(axiom) # label(non_clause). [assumption]. 0.47/1.08 7 (all VAR_V_71 (pred_attacker(tuple_A_out_3(VAR_V_71)) -> pred_attacker(VAR_V_71))) # label(ax67) # label(axiom) # label(non_clause). [assumption]. 0.47/1.08 8 (all VAR_MSG1_142 (pred_attacker(tuple_A_in_2(VAR_MSG1_142)) -> pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))))) # label(ax79) # label(axiom) # label(non_clause). [assumption]. 0.47/1.08 9 (all VAR_K_8 all VAR_M_7 VAR_M_7 = constr_dec(constr_enc(VAR_M_7,VAR_K_8),VAR_K_8)) # label(ax45) # label(axiom) # label(non_clause). [assumption]. 0.47/1.08 10 (all VAR_V_37 all VAR_V_38 (pred_attacker(VAR_V_38) & pred_attacker(VAR_V_37) -> pred_attacker(constr_comm_enc(VAR_V_37,VAR_V_38)))) # label(ax51) # label(axiom) # label(non_clause). [assumption]. 0.47/1.08 11 (all VAR_V_77 (pred_attacker(tuple_A_out_1(VAR_V_77)) -> pred_attacker(VAR_V_77))) # label(ax69) # label(axiom) # label(non_clause). [assumption]. 0.47/1.08 12 (all VAR_V_41 all VAR_V_42 (pred_attacker(VAR_V_41) & pred_attacker(VAR_V_42) -> pred_attacker(constr_comm_dec(VAR_V_41,VAR_V_42)))) # label(ax52) # label(axiom) # label(non_clause). [ass 0.82/1.08 WARNING: denials share constants (see output). 0.82/1.08 0.82/1.08 umption]. 0.82/1.08 13 (all VAR_MSG1_128 (pred_attacker(tuple_A_in_2(VAR_MSG1_128)) -> pred_attacker(tuple_A_out_3(constr_comm_dec(VAR_MSG1_128,name_Ka))))) # label(ax78) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 14 (all VAR_V_44 (pred_attacker(VAR_V_44) -> pred_attacker(tuple_B_out_2(VAR_V_44)))) # label(ax58) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 15 (all VAR_V_83 (pred_attacker(tuple_A_in_2(VAR_V_83)) -> pred_attacker(VAR_V_83))) # label(ax71) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 16 (all VAR_V_56 (pred_attacker(VAR_V_56) -> pred_attacker(tuple_B_in_1(VAR_V_56)))) # label(ax62) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 17 (all VAR_V_68 (pred_attacker(VAR_V_68) -> pred_attacker(tuple_A_out_3(VAR_V_68)))) # label(ax66) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 18 (all VAR_V_59 (pred_attacker(tuple_B_in_1(VAR_V_59)) -> pred_attacker(VAR_V_59))) # label(ax63) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 19 (all VAR_V_95 pred_attacker(name_new0x2Dname(VAR_V_95))) # label(ax76) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 20 (all VAR_V_33 all VAR_V_34 (pred_attacker(VAR_V_33) & pred_attacker(VAR_V_34) -> pred_attacker(constr_dec(VAR_V_33,VAR_V_34)))) # label(ax50) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 21 (all VAR_V_50X30 (pred_attacker(VAR_V_50X30) -> pred_attacker(tuple_B_in_3(VAR_V_50X30)))) # label(ax60) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 22 (all VAR_V_53 (pred_attacker(tuple_B_in_3(VAR_V_53)) -> pred_attacker(VAR_V_53))) # label(ax61) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 23 (all VAR_V_80X30 (pred_attacker(VAR_V_80X30) -> pred_attacker(tuple_A_in_2(VAR_V_80X30)))) # label(ax70) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 24 (all VAR_V_62 (pred_attacker(VAR_V_62) -> pred_attacker(tuple_A_out_4(VAR_V_62)))) # label(ax64) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 25 (all VAR_MSG1_162 (pred_attacker(tuple_B_in_1(VAR_MSG1_162)) -> pred_attacker(tuple_B_out_2(constr_comm_enc(VAR_MSG1_162,name_Kb))))) # label(ax80) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 26 (all VAR_V_29 all VAR_V_30X30 (pred_attacker(VAR_V_30X30) & pred_attacker(VAR_V_29) -> pred_attacker(constr_enc(VAR_V_29,VAR_V_30X30)))) # label(ax49) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 27 (all VAR_V_89 all VAR_V_90X30 (pred_mess(VAR_V_90X30,VAR_V_89) & pred_attacker(VAR_V_90X30) -> pred_attacker(VAR_V_89))) # label(ax72) # label(axiom) # label(non_clause). [assumption]. 0.82/1.08 0.82/1.08 ============================== end of process non-clausal formulas === 0.82/1.08 0.82/1.08 ============================== PROCESS INITIAL CLAUSES =============== 0.82/1.08 0.82/1.08 ============================== PREDICATE ELIMINATION ================= 0.82/1.08 28 -pred_mess(A,B) | -pred_attacker(A) | pred_attacker(B) # label(ax72) # label(axiom). [clausify(27)]. 0.82/1.08 29 -pred_attacker(A) | -pred_attacker(B) | pred_mess(B,A) # label(ax73) # label(axiom). [clausify(3)]. 0.82/1.08 0.82/1.08 ============================== end predicate elimination ============= 0.82/1.08 0.82/1.08 Auto_denials: 0.82/1.08 % copying label co0 to answer in negative clause 0.82/1.08 % copying label ax7 to answer in negative clause 0.82/1.08 % copying label ax38 to answer in negative clause 0.82/1.08 % copying label ax18 to answer in negative clause 0.82/1.08 % copying label ax11 to answer in negative clause 0.82/1.08 % copying label ax35 to answer in negative clause 0.82/1.08 % copying label ax31 to answer in negative clause 0.82/1.08 % copying label ax26 to answer in negative clause 0.82/1.08 % copying label ax34 to answer in negative clause 0.82/1.08 % copying label ax39 to answer in negative clause 0.82/1.08 % copying label ax17 to answer in negative clause 0.82/1.08 % copying label ax10 to answer in negative clause 0.82/1.08 % copying label ax44 to answer in negative clause 0.82/1.08 % copying label ax3 to answer in negative clause 0.82/1.08 % copying label ax28 to answer in negative clause 0.82/1.08 % copying label ax32 to answer in negative clause 0.82/1.08 % copying label ax29 to answer in negative clause 0.82/1.08 % copying label ax36 to answer in negative clause 0.82/1.08 % copying label ax30 to answer in negative clause 0.82/1.08 % copying label ax4 to answer in negative clause 0.82/1.08 % copying label ax27 to answer in negative claAlarm clock 119.70/120.05 Prover9 interrupted 119.70/120.05 EOF