0.00/0.04 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : tptp2X_and_run_prover9 %d %s 0.03/0.23 % Computer : n173.star.cs.uiowa.edu 0.03/0.23 % Model : x86_64 x86_64 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.23 % Memory : 32218.625MB 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.23 % CPULimit : 300 0.03/0.23 % DateTime : Sat Jul 14 07:28:41 CDT 2018 0.03/0.24 % CPUTime : 0.07/0.45 ============================== Prover9 =============================== 0.07/0.45 Prover9 (32) version 2009-11A, November 2009. 0.07/0.45 Process 43610 was started by sandbox on n173.star.cs.uiowa.edu, 0.07/0.45 Sat Jul 14 07:28:41 2018 0.07/0.45 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_43578_n173.star.cs.uiowa.edu". 0.07/0.45 ============================== end of head =========================== 0.07/0.45 0.07/0.45 ============================== INPUT ================================= 0.07/0.45 0.07/0.45 % Reading from file /tmp/Prover9_43578_n173.star.cs.uiowa.edu 0.07/0.45 0.07/0.45 set(prolog_style_variables). 0.07/0.45 set(auto2). 0.07/0.45 % set(auto2) -> set(auto). 0.07/0.45 % set(auto) -> set(auto_inference). 0.07/0.45 % set(auto) -> set(auto_setup). 0.07/0.45 % set(auto_setup) -> set(predicate_elim). 0.07/0.45 % set(auto_setup) -> assign(eq_defs, unfold). 0.07/0.45 % set(auto) -> set(auto_limits). 0.07/0.45 % set(auto_limits) -> assign(max_weight, "100.000"). 0.07/0.45 % set(auto_limits) -> assign(sos_limit, 20000). 0.07/0.45 % set(auto) -> set(auto_denials). 0.07/0.45 % set(auto) -> set(auto_process). 0.07/0.45 % set(auto2) -> assign(new_constants, 1). 0.07/0.45 % set(auto2) -> assign(fold_denial_max, 3). 0.07/0.45 % set(auto2) -> assign(max_weight, "200.000"). 0.07/0.45 % set(auto2) -> assign(max_hours, 1). 0.07/0.45 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.07/0.45 % set(auto2) -> assign(max_seconds, 0). 0.07/0.45 % set(auto2) -> assign(max_minutes, 5). 0.07/0.45 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.07/0.45 % set(auto2) -> set(sort_initial_sos). 0.07/0.45 % set(auto2) -> assign(sos_limit, -1). 0.07/0.45 % set(auto2) -> assign(lrs_ticks, 3000). 0.07/0.45 % set(auto2) -> assign(max_megs, 400). 0.07/0.45 % set(auto2) -> assign(stats, some). 0.07/0.45 % set(auto2) -> clear(echo_input). 0.07/0.45 % set(auto2) -> set(quiet). 0.07/0.45 % set(auto2) -> clear(print_initial_clauses). 0.07/0.45 % set(auto2) -> clear(print_given). 0.07/0.45 assign(lrs_ticks,-1). 0.07/0.45 assign(sos_limit,10000). 0.07/0.45 assign(order,kbo). 0.07/0.45 set(lex_order_vars). 0.07/0.45 clear(print_given). 0.07/0.45 0.07/0.45 % formulas(sos). % not echoed (9 formulas) 0.07/0.45 0.07/0.45 ============================== end of input ========================== 0.07/0.45 0.07/0.45 % From the command line: assign(max_seconds, 300). 0.07/0.45 0.07/0.45 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.07/0.45 0.07/0.45 % Formulas that are not ordinary clauses: 0.07/0.45 1 (all X_2 all X_1 (h_false_only(X_2,X_1) <-> h_false(X_2,X_1) & -h_true(X_2,X_1))) # label(false_only_h) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 2 (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.07/0.45 3 (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.07/0.45 4 (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.07/0.45 5 (all X_2 all X_1 (h_true_only(X_2,X_1) | h_both(X_2,X_1) | h_false_only(X_2,X_1))) # label(exhaustion_h) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 6 (all X_2 all X_1 (h_true_only(X_2,X_1) <-> h_true(X_2,X_1) & -h_false(X_2,X_1))) # label(true_only_h) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 7 (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.07/0.45 8 (all X_2 all X_1 (-g_false(X_2,X_1) & g_true(X_2,X_1) <-> g_true_only(X_2,X_1))) # label(true_only_g) # label(axiom) # label(non_clause). [assumption]. 0.07/0.45 9 -((all A all B exists C (h_true_only(A,C) | g_false_only(A,B))) & (all A ((all B g_false_only(A,B)) | (exists B h_true_only(A,B)))) | -(exists A exists B all C (g_true_only(A,B) & (h_both(A,C) | h_false_only(A,C)) | g_both(A,B) & h_false_only(A,C))) & (exists A (-(exists B all C (g_both(A,B) & h_false_only(A,C) | g_true_only(A,B) & (h_false_only(A,C) | h_both(A,C)))) & (exists B ((exists C (g_both(A,B) & h_both(A,C))) & -(exists C (g_false_only(A,B) | h_true_only(A,C))))))) & -(exists A (((exists B h_both(A,B)) & -(exists B h_true_only(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 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 exists B all C (g_true_only(A,B) & (h_false_only(A,C) | h_both(A,C)) | h_false_only(A,C) & g_both(A,B))) & (exists A (((all B h_false_only(A,B)) | (exists B h_both(A,B)) & -(exists B h_true_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))))) # label(nc5) # label(negated_conjecture) # label(non_clause). [assumption]. 134.16/134.38 134.16/134.38 ============================== end of process non-clausal formulas === 134.16/134.38 134.16/134.38 ============================== PROCESS INITIAL CLAUSES =============== 134.16/134.38 134.16/134.38 ============================== PREDICATE ELIMINATION ================= 134.16/134.38 10 h_false_only(A,B) | -h_false(A,B) | h_true(A,B) # label(false_only_h) # label(axiom). [clausify(1)]. 134.16/134.38 11 -h_false_only(A,B) | h_false(A,B) # label(false_only_h) # label(axiom). [clausify(1)]. 134.16/134.38 12 -h_true_only(A,B) | -h_false(A,B) # label(true_only_h) # label(axiom). [clausify(6)]. 134.16/134.38 Derived: -h_true_only(A,B) | -h_false_only(A,B). [resolve(12,b,11,b)]. 134.16/134.38 13 h_true_only(A,B) | -h_true(A,B) | h_false(A,B) # label(true_only_h) # label(axiom). [clausify(6)]. 134.16/134.38 14 -h_false(A,B) | -h_true(A,B) | h_both(A,B) # label(both_h) # label(axiom). [clausify(7)]. 134.16/134.38 Derived: -h_true(A,B) | h_both(A,B) | -h_false_only(A,B). [resolve(14,a,11,b)]. 134.16/134.38 Derived: -h_true(A,B) | h_both(A,B) | h_true_only(A,B) | -h_true(A,B). [resolve(14,a,13,c)]. 134.16/134.38 15 h_false(A,B) | -h_both(A,B) # label(both_h) # label(axiom). [clausify(7)]. 134.16/134.38 Derived: -h_both(A,B) | -h_true_only(A,B). [resolve(15,a,12,b)]. 134.16/134.38 16 g_both(A,B) | -g_true(A,B) | -g_false(A,B) # label(both_g) # label(axiom). [clausify(2)]. 134.16/134.38 17 -g_both(A,B) | g_true(A,B) # label(both_g) # label(axiom). [clausify(2)]. 134.16/134.38 18 -g_false_only(A,B) | -g_true(A,B) # label(false_only_g) # label(axiom). [clausify(4)]. 134.16/134.38 Derived: -g_false_only(A,B) | -g_both(A,B). [resolve(18,b,17,b)]. 134.16/134.38 19 g_false_only(A,B) | g_true(A,B) | -g_false(A,B) # label(false_only_g) # label(axiom). [clausify(4)]. 134.16/134.38 Derived: g_false_only(A,B) | -g_false(A,B) | g_both(A,B) | -g_false(A,B). [resolve(19,b,16,b)]. 134.16/134.38 20 g_false(A,B) | -g_true(A,B) | g_true_only(A,B) # label(true_only_g) # label(axiom). [clausify(8)]. 134.16/134.38 Derived: g_false(A,B) | g_true_only(A,B) | -g_both(A,B). [resolve(20,b,17,b)]. 134.16/134.38 21 g_true(A,B) | -g_true_only(A,B) # label(true_only_g) # label(axiom). [clausify(8)]. 134.16/134.38 Derived: -g_true_only(A,B) | g_both(A,B) | -g_false(A,B). [resolve(21,a,16,b)]. 134.16/134.38 Derived: -g_true_only(A,B) | -g_false_only(A,B). [resolve(21,a,18,b)]. 134.16/134.38 134.16/134.38 ============================== end predicate elimination ============= 134.16/134.38 134.16/134.38 Auto_denials: (non-Horn, no changes). 134.16/134.38 134.16/134.38 Term ordering decisions: 134.16/134.38 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. f2=1. f5=1. f1=1. f3=1. f4=1. f6=1. f7=1. f8=1. f9=1. 134.16/134.38 134.16/134.38 ============================== end of process initial clauses ======== 134.16/134.38 134.16/134.38 ============================== CLAUSES FOR SEARCH ==================== 134.16/134.38 134.16/134.38 ============================== end of clauses for search ============= 134.16/134.38 134.16/134.38 ============================== SEARCH ================================ 134.16/134.38 134.16/134.38 % Starting search at 0.11 seconds. 134.16/134.38 134.16/134.38 ============================== STATISTICS ============================ 134.16/134.38 134.16/134.38 Given=40262. Generated=1771085. Kept=247140. proofs=0. 134.16/134.38 Usable=974. Sos=314. Demods=0. Limbo=21, Disabled=245954. Hints=0. 134.16/134.38 Kept_by_rule=0, Deleted_by_rule=0. 134.16/134.38 Forward_subsumed=1523945. Back_subsumed=245831. 134.16/134.38 Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. 134.16/134.38 New_demodulators=0 (0 lex), Back_demodulated=0. Back_unit_deleted=0. 134.16/134.38 Demod_attempts=0. Demod_rewrites=0. 134.16/134.38 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. 134.16/134.38 Nonunit_fsub_feature_tests=8638388. Nonunit_bsub_feature_tests=676781. 134.16/134.38 Megabytes=419.43. 134.16/134.38 User_CPU=132.30, System_CPU=1.63, Wall_clock=134. 134.16/134.38 134.16/134.38 Megs malloced by palloc(): 400. 134.16/134.38 type (bytes each) gets frees in use bytes 134.16/134.38 chunk ( 104) 563 563 0 0.0 K 134.16/134.38 string_buf ( 8) 508 508 0 0.0 K 134.16/134.38 token ( 20) 1454 1454 0 0.0 K 134.16/134.38 pterm ( 16) 737 737 0 0.0 K 134.16/134.38 hashtab ( 8) 9 9 0 0.0 K 134.16/134.38 hashnode ( 8) 99 99 0 0.0 K 134.16/134.38 term ( 20) 138191561 124147082 14044479 274306.2 K 134.16/134.38 term arg arrays: 44215.0 K 134.16/134.38 attribute ( 12) 459 0 459 5.4 K 134.16/134.38 ilist ( 8) 320282810 319347701 935109 7305.5 K 134.16/134.38 plist ( 8) 741970 492780 249190 1946.8 K 134.16/134.38 i2list ( 12) 5612357 5612357 0 0.0 K 134.16/134.38 just ( 12) 9612272 8736301 875971 10265.3 K 134.16/134.38 parajust ( 16) 0 0 0 0.0 K 134.16/134.38 instancejust ( 8) 0 0 0 0.0 K 134.16/134.38 ivyjust ( 24) 0 0 0 0.0 K 134.16/134.38 formula ( 28) 1598 1234 364 10.0 K 134.16/134.38 formula arg arrays: 1.4 K 134.16/134.38 topform ( 52) 1771227 1523953 247274 12556.9 K 134.16/134.38 clist_pos ( 20) 780700 533437 247263 4829.4 K 134.16/134.38 clist ( 16) 8 1 7 0.1 K 134.16/134.38 context ( 808) 39243831 39243829 2 1.6 K 134.16/134.38 trail ( 12) 64197149 64197147 2 0.0 K 134.16/134.38 ac_match_pos (70044) 0 0 0 0.0 K 134.16/134.38 ac_match_free_vars_pos (20020) 134.16/134.38 0 0 0 0.0 K 134.16/134.38 btm_state ( 60) 0 0 0 0.0 K 134.16/134.38 btu_state ( 60) 0 0 0 0.0 K 134.16/134.38 ac_position (285432) 0 0 0 0.0 K 134.16/134.38 fpa_trie ( 20) 23340 22524 816 15.9 K 134.16/134.38 fpa_state ( 28) 200926 200924 2 0.1 K 134.16/134.38 fpa_index ( 12) 10 0 10 0.1 K 134.16/134.38 fpa_chunk ( 20) 447174 443852 3322 64.9 K 134.16/134.38 fpa_list ( 16) 22986 0 22986 359.2 K 134.16/134.38 fpa_list chunks: 612.7 K 134.16/134.38 discrim ( 12) 3 0 3 0.0 K 134.16/134.38 discrim_pos ( 16) 0 0 0 0.0 K 134.16/134.38 flat2 ( 32) 0 0 0 0.0 K 134.16/134.38 flat ( 48) 0 0 0 0.0 K 134.16/134.38 flatterm ( 32) 0 0 0 0.0 K 134.16/134.38 mindex ( 28) 13 0 13 0.4 K 134.16/134.38 mindex_pos ( 56) 66675111 66675110 1 0.1 K 134.16/134.38 lindex ( 12) 5 0 5 0.1 K 134.16/134.38 clash ( 40) 0 0 0 0.0 K 134.16/134.38 di_tree ( 12) 16982809 16889720 93089 1090.9 K 134.16/134.38 avl_node ( 20) 493332 492704 628 12.3 K 134.16/134.38 134.16/134.38 Memory report, 20 @ 20 = 400 megs (400.00 megs used). 134.16/134.38 List 1, length 68, 0.3 K 134.16/134.38 List 2, length 94, 0.7 K 134.16/134.38 List 3, length 1598, 18.7 K 134.16/134.38 List 4, length 25, 0.4 K 134.16/134.38 List 8, length 207, 6.5 K 134.16/134.38 List 14, length 26, 1.4 K 134.16/134.38 List 15, length 54, 3.2 K 134.16/134.38 List 16, length 203, 12.7 K 134.16/134.38 List 26, length 282, 28.6 K 134.16/134.38 List 32, length 462, 57.8 K 134.16/134.38 List 64, length 99, 24.8 K 134.16/134.38 List 81, length 2, 0.6 K 134.16/134.38 List 94, length 2, 0.7 K 134.16/134.38 List 128, length 25, 12.5 K 134.16/134.38 List 202, length 1, 0.8 K 134.16/134.38 134.16/134.38 ============================== SELECTOR REPORT ======================= 134.16/134.38 Sos_deleted=0, Sos_displaced=0, Sos_size=314 134.16/134.38 SELECTOR PART PRIORITY ORDER SIZE SELECTED 134.16/134.38 I 2147483647 high age 0 160 134.16/134.38 H 1 high weight 0 0 134.16/134.38 A 1 low age 314 8021 134.16/134.38 F 4 low weight 0 0 134.16/134.38 T 4 low weight 314 32081 134.16/134.38 ============================== end of selector report ================ 134.16/134.38 134.16/134.38 ============================== end of statistics ===================== 134.16/134.38 134.16/134.38 Exiting with failure. 134.16/134.38 134.16/134.38 Process 43610 exit (max_megs) Sat Jul 14 07:30:55 2018 134.21/134.42 Prover9 interrupted 134.21/134.44 EOF