0.03/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n011.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 : 180 0.12/0.33 % DateTime : Thu Aug 29 09:18:27 EDT 2019 0.12/0.33 % CPUTime : 0.42/1.00 ============================== Prover9 =============================== 0.42/1.00 Prover9 (32) version 2009-11A, November 2009. 0.42/1.00 Process 10540 was started by sandbox on n011.cluster.edu, 0.42/1.00 Thu Aug 29 09:18:28 2019 0.42/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_10387_n011.cluster.edu". 0.42/1.00 ============================== end of head =========================== 0.42/1.00 0.42/1.00 ============================== INPUT ================================= 0.42/1.00 0.42/1.00 % Reading from file /tmp/Prover9_10387_n011.cluster.edu 0.42/1.00 0.42/1.00 set(prolog_style_variables). 0.42/1.00 set(auto2). 0.42/1.00 % set(auto2) -> set(auto). 0.42/1.00 % set(auto) -> set(auto_inference). 0.42/1.00 % set(auto) -> set(auto_setup). 0.42/1.00 % set(auto_setup) -> set(predicate_elim). 0.42/1.00 % set(auto_setup) -> assign(eq_defs, unfold). 0.42/1.00 % set(auto) -> set(auto_limits). 0.42/1.00 % set(auto_limits) -> assign(max_weight, "100.000"). 0.42/1.00 % set(auto_limits) -> assign(sos_limit, 20000). 0.42/1.00 % set(auto) -> set(auto_denials). 0.42/1.00 % set(auto) -> set(auto_process). 0.42/1.00 % set(auto2) -> assign(new_constants, 1). 0.42/1.00 % set(auto2) -> assign(fold_denial_max, 3). 0.42/1.00 % set(auto2) -> assign(max_weight, "200.000"). 0.42/1.00 % set(auto2) -> assign(max_hours, 1). 0.42/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.42/1.00 % set(auto2) -> assign(max_seconds, 0). 0.42/1.00 % set(auto2) -> assign(max_minutes, 5). 0.42/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.42/1.00 % set(auto2) -> set(sort_initial_sos). 0.42/1.00 % set(auto2) -> assign(sos_limit, -1). 0.42/1.00 % set(auto2) -> assign(lrs_ticks, 3000). 0.42/1.00 % set(auto2) -> assign(max_megs, 400). 0.42/1.00 % set(auto2) -> assign(stats, some). 0.42/1.00 % set(auto2) -> clear(echo_input). 0.42/1.00 % set(auto2) -> set(quiet). 0.42/1.00 % set(auto2) -> clear(print_initial_clauses). 0.42/1.00 % set(auto2) -> clear(print_given). 0.42/1.00 assign(lrs_ticks,-1). 0.42/1.00 assign(sos_limit,10000). 0.42/1.00 assign(order,kbo). 0.42/1.00 set(lex_order_vars). 0.42/1.00 clear(print_given). 0.42/1.00 0.42/1.00 % formulas(sos). % not echoed (9 formulas) 0.42/1.00 0.42/1.00 ============================== end of input ========================== 0.42/1.00 0.42/1.00 % From the command line: assign(max_seconds, 180). 0.42/1.00 0.42/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.42/1.00 0.42/1.00 % Formulas that are not ordinary clauses: 0.42/1.00 1 (all X_2 all X_1 (h_false(X_2,X_1) & h_true(X_2,X_1) <-> h_both(X_2,X_1))) # label(both_h) # label(axiom) # label(non_clause). [assumption]. 0.42/1.00 2 (all X_2 all X_1 (g_true_only(X_2,X_1) <-> -g_false(X_2,X_1) & g_true(X_2,X_1))) # label(true_only_g) # label(axiom) # label(non_clause). [assumption]. 0.42/1.00 3 (all X_2 all X_1 (h_both(X_2,X_1) | h_false_only(X_2,X_1) | h_true_only(X_2,X_1))) # label(exhaustion_h) # label(axiom) # label(non_clause). [assumption]. 0.42/1.00 4 (all X_2 all X_1 (h_false_only(X_2,X_1) <-> -h_true(X_2,X_1) & h_false(X_2,X_1))) # label(false_only_h) # label(axiom) # label(non_clause). [assumption]. 0.42/1.00 5 (all X_2 all X_1 (g_true_only(X_2,X_1) | g_false_only(X_2,X_1) | g_both(X_2,X_1))) # label(exhaustion_g) # label(axiom) # label(non_clause). [assumption]. 0.42/1.00 6 (all X_2 all X_1 (g_both(X_2,X_1) <-> g_true(X_2,X_1) & g_false(X_2,X_1))) # label(both_g) # label(axiom) # label(non_clause). [assumption]. 0.42/1.00 7 (all X_2 all X_1 (g_false_only(X_2,X_1) <-> -g_true(X_2,X_1) & g_false(X_2,X_1))) # label(false_only_g) # label(axiom) # label(non_clause). [assumption]. 0.42/1.00 8 (all X_2 all X_1 (-h_false(X_2,X_1) & h_true(X_2,X_1) <-> h_true_only(X_2,X_1))) # label(true_only_h) # label(axiom) # label(non_clause). [assumption]. 0.42/1.00 9 -((all A all B exists C (g_false_only(A,B) | h_true_only(A,C))) & (all A ((exists B h_true_only(A,B)) | (all B g_false_only(A,B)))) | (exists A ((-(exists B h_true_only(A,B)) & (exists B h_both(A,B)) | (all B h_false_only(A,B))) & (exists B g_true_only(A,B)) | (all B h_false_only(A,B)) & -(exists B g_true_only(A,B)) & (exists B g_both(A,B)))) & (exists A exists B all C (g_true_only(A,B) & (h_false_only(A,C) | h_both(A,C)) | g_both(A,B) & h_false_only(A,C))) | (exists A (-(exists B g_true_only(A,B)) & -(exists B h_true_only(A,B)) & (exists B h_both(A,B)) & (exists B g_both(A,B)))) & -(exists A ((all B h_false_only(A,B)) & -(exists B g_true_only(A,B)) & (exists B g_both(A,B)) | (exists B g_true_only(A,B)) & ((all B h_false_only(A,B)) | -(exists B h_true_only(A,B)) & (exists B h_both(A,B))))) & -(exists A exists B all C (g_both(A,B) & h_false_only(A,C) | (h_false_only(A,C) | h_both(A,C)) & g_true_only(A,B))) & (exists A (-(exists B all C (g_both(A,B) & h_false_only(A,C) | (h_both(A,C) | h_false_only(A,C)) & g_true_only(A,B))) & (exists B ((exists C (h_both(A,C) & g_both(A,B))) & -(exists C (g_false_only(A,B) | h_true_only(A,C)))))))) # label(nc5) # label(negated_conjecture) # label(non_clause). [assumption]. 103.07/103.35 103.07/103.35 ============================== end of process non-clausal formulas === 103.07/103.35 103.07/103.35 ============================== PROCESS INITIAL CLAUSES =============== 103.07/103.35 103.07/103.35 ============================== PREDICATE ELIMINATION ================= 103.07/103.35 10 h_false(A,B) | -h_both(A,B) # label(both_h) # label(axiom). [clausify(1)]. 103.07/103.35 11 -h_false(A,B) | -h_true(A,B) | h_both(A,B) # label(both_h) # label(axiom). [clausify(1)]. 103.07/103.35 12 -h_false_only(A,B) | h_false(A,B) # label(false_only_h) # label(axiom). [clausify(4)]. 103.07/103.35 Derived: -h_false_only(A,B) | -h_true(A,B) | h_both(A,B). [resolve(12,b,11,a)]. 103.07/103.35 13 h_false_only(A,B) | h_true(A,B) | -h_false(A,B) # label(false_only_h) # label(axiom). [clausify(4)]. 103.07/103.35 Derived: h_false_only(A,B) | h_true(A,B) | -h_both(A,B). [resolve(13,c,10,a)]. 103.07/103.35 14 h_false(A,B) | -h_true(A,B) | h_true_only(A,B) # label(true_only_h) # label(axiom). [clausify(8)]. 103.07/103.35 Derived: -h_true(A,B) | h_true_only(A,B) | -h_true(A,B) | h_both(A,B). [resolve(14,a,11,a)]. 103.07/103.35 15 -h_false(A,B) | -h_true_only(A,B) # label(true_only_h) # label(axiom). [clausify(8)]. 103.07/103.35 Derived: -h_true_only(A,B) | -h_both(A,B). [resolve(15,a,10,a)]. 103.07/103.35 Derived: -h_true_only(A,B) | -h_false_only(A,B). [resolve(15,a,12,b)]. 103.07/103.35 16 g_true_only(A,B) | g_false(A,B) | -g_true(A,B) # label(true_only_g) # label(axiom). [clausify(2)]. 103.07/103.35 17 -g_true_only(A,B) | -g_false(A,B) # label(true_only_g) # label(axiom). [clausify(2)]. 103.07/103.35 18 -g_both(A,B) | g_false(A,B) # label(both_g) # label(axiom). [clausify(6)]. 103.07/103.35 Derived: -g_both(A,B) | -g_true_only(A,B). [resolve(18,b,17,b)]. 103.07/103.35 19 g_both(A,B) | -g_true(A,B) | -g_false(A,B) # label(both_g) # label(axiom). [clausify(6)]. 103.07/103.35 Derived: g_both(A,B) | -g_true(A,B) | g_true_only(A,B) | -g_true(A,B). [resolve(19,c,16,b)]. 103.07/103.35 20 -g_false_only(A,B) | g_false(A,B) # label(false_only_g) # label(axiom). [clausify(7)]. 103.07/103.35 Derived: -g_false_only(A,B) | -g_true_only(A,B). [resolve(20,b,17,b)]. 103.07/103.35 Derived: -g_false_only(A,B) | g_both(A,B) | -g_true(A,B). [resolve(20,b,19,c)]. 103.07/103.35 21 g_false_only(A,B) | g_true(A,B) | -g_false(A,B) # label(false_only_g) # label(axiom). [clausify(7)]. 103.07/103.35 Derived: g_false_only(A,B) | g_true(A,B) | -g_both(A,B). [resolve(21,c,18,b)]. 103.07/103.35 103.07/103.35 ============================== end predicate elimination ============= 103.07/103.35 103.07/103.35 Auto_denials: (non-Horn, no changes). 103.07/103.35 103.07/103.35 Term ordering decisions: 103.07/103.35 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. f5=1. f9=1. f1=1. f2=1. f3=1. f4=1. f6=1. f7=1. f8=1. 103.07/103.35 103.07/103.35 ============================== end of process initial clauses ======== 103.07/103.35 103.07/103.35 ============================== CLAUSES FOR SEARCH ==================== 103.07/103.35 103.07/103.35 ============================== end of clauses for search ============= 103.07/103.35 103.07/103.35 ============================== SEARCH ================================ 103.07/103.35 103.07/103.35 % Starting search at 0.15 seconds. 103.07/103.35 103.07/103.35 ============================== STATISTICS ============================ 103.07/103.35 103.07/103.35 Given=54137. Generated=2192896. Kept=257448. proofs=0. 103.07/103.35 Usable=1003. Sos=165. Demods=0. Limbo=13, Disabled=256391. Hints=0. 103.07/103.35 Kept_by_rule=0, Deleted_by_rule=0. 103.07/103.35 Forward_subsumed=1935448. Back_subsumed=256267. 103.07/103.35 Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. 103.07/103.35 New_demodulators=0 (0 lex), Back_demodulated=0. Back_unit_deleted=0. 103.07/103.35 Demod_attempts=0. Demod_rewrites=0. 103.07/103.35 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. 103.07/103.35 Nonunit_fsub_feature_tests=10230441. Nonunit_bsub_feature_tests=674172. 103.07/103.35 Megabytes=419.43. 103.07/103.35 User_CPU=100.99, System_CPU=1.38, Wall_clock=102. 103.07/103.35 103.07/103.35 Megs malloced by palloc(): 400. 103.07/103.35 type (bytes each) gets frees in use bytes 103.07/103.35 chunk ( 104) 564 564 0 0.0 K 103.07/103.35 string_buf ( 8) 509 509 0 0.0 K 103.07/103.35 token ( 20) 1454 1454 0 0.0 K 103.07/103.35 pterm ( 16) 737 737 0 0.0 K 103.07/103.35 hashtab ( 8) 9 9 0 0.0 K 103.07/103.35 hashnode ( 8) 99 99 0 0.0 K 103.07/103.35 term ( 20) 167881620 153865067 14016553 273760.8 K 103.07/103.35 term arg arrays: 43778.7 K 103.07/103.35 attribute ( 12) 459 0 459 5.4 K 103.07/103.35 ilist ( 8) 365146110 364172945 973165 7602.9 K 103.07/103.35 plist ( 8) 773032 513661 259371 2026.3 K 103.07/103.35 i2list ( 12) 4743518 4743518 0 0.0 K 103.07/103.35 just ( 12) 11534223 10564727 969496 11361.3 K 103.07/103.35 parajust ( 16) 0 0 0 0.0 K 103.07/103.35 instancejust ( 8) 0 0 0 0.0 K 103.07/103.35 ivyjust ( 24) 0 0 0 0.0 K 103.07/103.35 formula ( 28) 1728 1364 364 10.0 K 103.07/103.35 formula arg arrays: 1.4 K 103.07/103.35 topform ( 52) 2193038 1935456 257582 13080.3 K 103.07/103.35 clist_pos ( 20) 825637 568065 257572 5030.7 K 103.07/103.35 clist ( 16) 8 1 7 0.1 K 103.07/103.35 context ( 808) 47564420 47564419 1 0.8 K 103.07/103.35 trail ( 12) 85243357 85243356 1 0.0 K 103.07/103.35 ac_match_pos (70044) 0 0 0 0.0 K 103.07/103.35 ac_match_free_vars_pos (20020) 103.07/103.35 0 0 0 0.0 K 103.07/103.35 btm_state ( 60) 0 0 0 0.0 K 103.07/103.35 btu_state ( 60) 0 0 0 0.0 K 103.07/103.35 ac_position (285432) 0 0 0 0.0 K 103.07/103.35 fpa_trie ( 20) 33180 32310 870 17.0 K 103.07/103.35 fpa_state ( 28) 270890 270890 0 0.0 K 103.07/103.35 fpa_index ( 12) 10 0 10 0.1 K 103.07/103.35 fpa_chunk ( 20) 473405 470585 2820 55.1 K 103.07/103.35 fpa_list ( 16) 32794 0 32794 512.4 K 103.07/103.35 fpa_list chunks: 505.5 K 103.07/103.35 discrim ( 12) 3 0 3 0.0 K 103.07/103.35 discrim_pos ( 16) 0 0 0 0.0 K 103.07/103.35 flat2 ( 32) 0 0 0 0.0 K 103.07/103.35 flat ( 48) 0 0 0 0.0 K 103.07/103.35 flatterm ( 32) 0 0 0 0.0 K 103.07/103.35 mindex ( 28) 13 0 13 0.4 K 103.07/103.35 mindex_pos ( 56) 80770590 80770590 0 0.0 K 103.07/103.35 lindex ( 12) 5 0 5 0.1 K 103.07/103.35 clash ( 40) 0 0 0 0.0 K 103.07/103.35 di_tree ( 12) 17698765 17613199 85566 1002.7 K 103.07/103.35 avl_node ( 20) 514108 513778 330 6.4 K 103.07/103.35 103.07/103.35 Memory report, 20 @ 20 = 400 megs (400.00 megs used). 103.07/103.35 List 1, length 71, 0.3 K 103.07/103.35 List 2, length 91, 0.7 K 103.07/103.35 List 3, length 861, 10.1 K 103.07/103.35 List 4, length 7, 0.1 K 103.07/103.35 List 8, length 246, 7.7 K 103.07/103.35 List 14, length 27, 1.5 K 103.07/103.35 List 15, length 63, 3.7 K 103.07/103.35 List 16, length 334, 20.9 K 103.07/103.35 List 18, length 2, 0.1 K 103.07/103.35 List 26, length 282, 28.6 K 103.07/103.35 List 32, length 657, 82.1 K 103.07/103.35 List 64, length 348, 87.0 K 103.07/103.35 List 81, length 1, 0.3 K 103.07/103.35 List 94, length 2, 0.7 K 103.07/103.35 List 108, length 1, 0.4 K 103.07/103.35 List 128, length 158, 79.0 K 103.07/103.35 List 202, length 2, 1.6 K 103.07/103.35 103.07/103.35 ============================== SELECTOR REPORT ======================= 103.07/103.35 Sos_deleted=0, Sos_displaced=0, Sos_size=165 103.07/103.35 SELECTOR PART PRIORITY ORDER SIZE SELECTED 103.07/103.35 I 2147483647 high age 0 163 103.07/103.35 H 1 high weight 0 0 103.07/103.35 A 1 low age 165 10795 103.07/103.35 F 4 low weight 0 0 103.07/103.35 T 4 low weight 165 43179 103.07/103.35 ============================== end of selector report ================ 103.07/103.35 103.07/103.35 ============================== end of statistics ===================== 103.07/103.35 103.07/103.35 Exiting with failure. 103.07/103.35 103.07/103.35 Process 10540 exit (max_megs) Thu Aug 29 09:20:10 2019 103.07/103.35 Prover9 interrupted 103.10/103.35 EOF