TSTP Solution File: SYO606+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYO606+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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 19:17:33 EDT 2022
% Result : Unknown 88.25s 88.49s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO606+1 : TPTP v8.1.0. Released v7.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n010.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 : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 8 21:39:31 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.76/1.01 ============================== Prover9 ===============================
% 0.76/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.01 Process 24332 was started by sandbox2 on n010.cluster.edu,
% 0.76/1.01 Fri Jul 8 21:39:32 2022
% 0.76/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23970_n010.cluster.edu".
% 0.76/1.01 ============================== end of head ===========================
% 0.76/1.01
% 0.76/1.01 ============================== INPUT =================================
% 0.76/1.01
% 0.76/1.01 % Reading from file /tmp/Prover9_23970_n010.cluster.edu
% 0.76/1.01
% 0.76/1.01 set(prolog_style_variables).
% 0.76/1.01 set(auto2).
% 0.76/1.01 % set(auto2) -> set(auto).
% 0.76/1.01 % set(auto) -> set(auto_inference).
% 0.76/1.01 % set(auto) -> set(auto_setup).
% 0.76/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.01 % set(auto) -> set(auto_limits).
% 0.76/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.01 % set(auto) -> set(auto_denials).
% 0.76/1.01 % set(auto) -> set(auto_process).
% 0.76/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.01 % set(auto2) -> assign(stats, some).
% 0.76/1.01 % set(auto2) -> clear(echo_input).
% 0.76/1.01 % set(auto2) -> set(quiet).
% 0.76/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.01 % set(auto2) -> clear(print_given).
% 0.76/1.01 assign(lrs_ticks,-1).
% 0.76/1.01 assign(sos_limit,10000).
% 0.76/1.01 assign(order,kbo).
% 0.76/1.01 set(lex_order_vars).
% 0.76/1.01 clear(print_given).
% 0.76/1.01
% 0.76/1.01 % formulas(sos). % not echoed (9 formulas)
% 0.76/1.01
% 0.76/1.01 ============================== end of input ==========================
% 0.76/1.01
% 0.76/1.01 % From the command line: assign(max_seconds, 300).
% 0.76/1.01
% 0.76/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.01
% 0.76/1.01 % Formulas that are not ordinary clauses:
% 0.76/1.01 1 (all X_2 all X_1 (g_true_only(X_2,X_1) <-> g_true(X_2,X_1) & -g_false(X_2,X_1))) # label(true_only_g) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 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.76/1.01 3 (all X_2 all X_1 (g_false_only(X_2,X_1) <-> g_false(X_2,X_1) & -g_true(X_2,X_1))) # label(false_only_g) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 4 (all X_2 all X_1 (g_true_only(X_2,X_1) | g_both(X_2,X_1) | g_false_only(X_2,X_1))) # label(exhaustion_g) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 5 (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.76/1.01 6 (all X_2 all X_1 (h_both(X_2,X_1) <-> h_true(X_2,X_1) & h_false(X_2,X_1))) # label(both_h) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.01 7 (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.76/1.01 8 (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.76/1.01 9 -((all A ((all B g_false_only(A,B)) | (exists B h_true_only(A,B)))) & (all A all B exists C (g_false_only(A,B) | h_true_only(A,C))) | (exists A ((exists B g_true_only(A,B)) & ((exists B h_both(A,B)) & -(exists B h_true_only(A,B)) | (all B h_false_only(A,B))) | (exists B g_both(A,B)) & -(exists B g_true_only(A,B)) & (all B h_false_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 g_both(A,B)) & -(exists B g_true_only(A,B)) & (exists B h_both(A,B)) & -(exists B h_true_only(A,B)))) & -(exists A ((exists B g_true_only(A,B)) & ((exists B h_both(A,B)) & -(exists B h_true_only(A,B)) | (all B h_false_only(A,B))) | (exists B g_both(A,B)) & -(exists B g_true_only(A,B)) & (all B h_false_only(A,B)))) & (exists A ((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 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_true_only(A,B) & (h_both(A,C) | h_false_only(A,C)) | g_both(A,B) & h_false_only(A,C)))) # label(nc5) # label(negated_conjecture) # label(non_clause). [assumption].
% 88.21/88.48
% 88.21/88.48 ============================== end of process non-clausal formulas ===
% 88.21/88.48
% 88.21/88.48 ============================== PROCESS INITIAL CLAUSES ===============
% 88.21/88.48
% 88.21/88.48 ============================== PREDICATE ELIMINATION =================
% 88.21/88.48 10 g_true_only(A,B) | -g_true(A,B) | g_false(A,B) # label(true_only_g) # label(axiom). [clausify(1)].
% 88.21/88.48 11 -g_true_only(A,B) | g_true(A,B) # label(true_only_g) # label(axiom). [clausify(1)].
% 88.21/88.48 12 -g_both(A,B) | g_true(A,B) # label(both_g) # label(axiom). [clausify(2)].
% 88.21/88.48 13 g_both(A,B) | -g_true(A,B) | -g_false(A,B) # label(both_g) # label(axiom). [clausify(2)].
% 88.21/88.48 Derived: g_both(A,B) | -g_false(A,B) | -g_true_only(A,B). [resolve(13,b,11,b)].
% 88.21/88.48 14 -g_false_only(A,B) | -g_true(A,B) # label(false_only_g) # label(axiom). [clausify(3)].
% 88.21/88.48 Derived: -g_false_only(A,B) | -g_true_only(A,B). [resolve(14,b,11,b)].
% 88.21/88.48 Derived: -g_false_only(A,B) | -g_both(A,B). [resolve(14,b,12,b)].
% 88.21/88.48 15 g_false_only(A,B) | -g_false(A,B) | g_true(A,B) # label(false_only_g) # label(axiom). [clausify(3)].
% 88.21/88.48 Derived: g_false_only(A,B) | -g_false(A,B) | g_both(A,B) | -g_false(A,B). [resolve(15,c,13,b)].
% 88.21/88.48 16 h_true_only(A,B) | -h_true(A,B) | h_false(A,B) # label(true_only_h) # label(axiom). [clausify(5)].
% 88.21/88.48 17 -h_true_only(A,B) | h_true(A,B) # label(true_only_h) # label(axiom). [clausify(5)].
% 88.21/88.48 18 -h_both(A,B) | h_true(A,B) # label(both_h) # label(axiom). [clausify(6)].
% 88.21/88.48 19 h_both(A,B) | -h_true(A,B) | -h_false(A,B) # label(both_h) # label(axiom). [clausify(6)].
% 88.21/88.48 Derived: h_both(A,B) | -h_false(A,B) | -h_true_only(A,B). [resolve(19,b,17,b)].
% 88.21/88.48 20 -h_false_only(A,B) | -h_true(A,B) # label(false_only_h) # label(axiom). [clausify(7)].
% 88.21/88.48 Derived: -h_false_only(A,B) | -h_true_only(A,B). [resolve(20,b,17,b)].
% 88.21/88.48 Derived: -h_false_only(A,B) | -h_both(A,B). [resolve(20,b,18,b)].
% 88.21/88.48 21 h_false_only(A,B) | -h_false(A,B) | h_true(A,B) # label(false_only_h) # label(axiom). [clausify(7)].
% 88.21/88.48 Derived: h_false_only(A,B) | -h_false(A,B) | h_both(A,B) | -h_false(A,B). [resolve(21,c,19,b)].
% 88.21/88.48
% 88.21/88.48 ============================== end predicate elimination =============
% 88.21/88.48
% 88.21/88.48 Auto_denials: (non-Horn, no changes).
% 88.21/88.48
% 88.21/88.48 Term ordering decisions:
% 88.21/88.48 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. f8=1. f1=1. f2=1. f3=1. f4=1. f6=1. f7=1. f9=1.
% 88.21/88.48
% 88.21/88.48 ============================== end of process initial clauses ========
% 88.21/88.48
% 88.21/88.48 ============================== CLAUSES FOR SEARCH ====================
% 88.21/88.48
% 88.21/88.48 ============================== end of clauses for search =============
% 88.21/88.48
% 88.21/88.48 ============================== SEARCH ================================
% 88.21/88.48
% 88.21/88.48 % Starting search at 0.14 seconds.
% 88.21/88.48
% 88.21/88.48 ============================== STATISTICS ============================
% 88.21/88.48
% 88.21/88.48 Given=41818. Generated=1581083. Kept=253543. proofs=0.
% 88.21/88.48 Usable=770. Sos=34. Demods=0. Limbo=46, Disabled=252814. Hints=0.
% 88.21/88.48 Kept_by_rule=0, Deleted_by_rule=0.
% 88.21/88.48 Forward_subsumed=1327540. Back_subsumed=252692.
% 88.21/88.48 Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0.
% 88.21/88.48 New_demodulators=0 (0 lex), Back_demodulated=0. Back_unit_deleted=0.
% 88.21/88.48 Demod_attempts=0. Demod_rewrites=0.
% 88.21/88.48 Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0.
% 88.21/88.48 Nonunit_fsub_feature_tests=7585805. Nonunit_bsub_feature_tests=710499.
% 88.21/88.48 Megabytes=419.43.
% 88.21/88.48 User_CPU=86.36, System_CPU=1.14, Wall_clock=87.
% 88.21/88.48
% 88.21/88.48 Megs malloced by palloc(): 400.
% 88.21/88.48 type (bytes each) gets frees in use bytes
% 88.21/88.48 chunk ( 104) 562 562 0 0.0 K
% 88.21/88.48 string_buf ( 8) 507 507 0 0.0 K
% 88.21/88.48 token ( 20) 1455 1455 0 0.0 K
% 88.21/88.48 pterm ( 16) 737 737 0 0.0 K
% 88.21/88.48 hashtab ( 8) 9 9 0 0.0 K
% 88.21/88.49 hashnode ( 8) 99 99 0 0.0 K
% 88.21/88.49 term ( 20) 120201259 106161380 14039879 274216.4 K
% 88.21/88.49 term arg arrays: 44193.0 K
% 88.21/88.49 attribute ( 12) 459 0 459 5.4 K
% 88.21/88.49 ilist ( 8) 303447492 302487597 959895 7499.2 K
% 88.21/88.49 plist ( 8) 761628 506495 255133 1993.2 K
% 88.21/88.49 i2list ( 12) 5290986 5290986 0 0.0 K
% 88.21/88.49 just ( 12) 8237164 7396106 841058 9856.1 K
% 88.21/88.49 parajust ( 16) 0 0 0 0.0 K
% 88.21/88.49 instancejust ( 8) 0 0 0 0.0 K
% 88.21/88.49 ivyjust ( 24) 0 0 0 0.0 K
% 88.21/88.49 formula ( 28) 1613 1249 364 10.0 K
% 88.21/88.49 formula arg arrays: 1.4 K
% 88.21/88.49 topform ( 52) 1581224 1327548 253676 12882.0 K
% 88.21/88.49 clist_pos ( 20) 801894 548230 253664 4954.4 K
% 88.21/88.49 clist ( 16) 8 1 7 0.1 K
% 88.21/88.49 context ( 808) 34562678 34562676 2 1.6 K
% 88.21/88.49 trail ( 12) 60482978 60482976 2 0.0 K
% 88.21/88.49 ac_match_pos (70044) 0 0 0 0.0 K
% 88.21/88.49 ac_match_free_vars_pos (20020)
% 88.21/88.49 0 0 0 0.0 K
% 88.21/88.49 btm_state ( 60) 0 0 0 0.0 K
% 88.21/88.49 btu_state ( 60) 0 0 0 0.0 K
% 88.21/88.49 ac_position (285432) 0 0 0 0.0 K
% 88.21/88.49 fpa_trie ( 20) 23961 23139 822 16.1 K
% 88.21/88.49 fpa_state ( 28) 194435 194433 2 0.1 K
% 88.21/88.49 fpa_index ( 12) 10 0 10 0.1 K
% 88.21/88.49 fpa_chunk ( 20) 444092 442052 2040 39.8 K
% 88.21/88.49 fpa_list ( 16) 23593 0 23593 368.6 K
% 88.21/88.49 fpa_list chunks: 343.5 K
% 88.21/88.49 discrim ( 12) 3 0 3 0.0 K
% 88.21/88.49 discrim_pos ( 16) 0 0 0 0.0 K
% 88.21/88.49 flat2 ( 32) 0 0 0 0.0 K
% 88.21/88.49 flat ( 48) 0 0 0 0.0 K
% 88.21/88.49 flatterm ( 32) 0 0 0 0.0 K
% 88.21/88.49 mindex ( 28) 13 0 13 0.4 K
% 88.21/88.49 mindex_pos ( 56) 58425561 58425560 1 0.1 K
% 88.21/88.49 lindex ( 12) 5 0 5 0.1 K
% 88.21/88.49 clash ( 40) 0 0 0 0.0 K
% 88.21/88.49 di_tree ( 12) 16191926 16134073 57853 678.0 K
% 88.21/88.49 avl_node ( 20) 506158 506090 68 1.3 K
% 88.21/88.49
% 88.21/88.49 Memory report, 20 @ 20 = 400 megs (400.00 megs used).
% 88.21/88.49 List 1, length 73, 0.3 K
% 88.21/88.49 List 4, length 5, 0.1 K
% 88.21/88.49 List 8, length 214, 6.7 K
% 88.21/88.49 List 12, length 1, 0.0 K
% 88.21/88.49 List 14, length 26, 1.4 K
% 88.21/88.49 List 15, length 54, 3.2 K
% 88.21/88.49 List 16, length 409, 25.6 K
% 88.21/88.49 List 26, length 282, 28.6 K
% 88.21/88.49 List 32, length 773, 96.6 K
% 88.21/88.49 List 64, length 940, 235.0 K
% 88.21/88.49 List 81, length 2, 0.6 K
% 88.21/88.49 List 94, length 2, 0.7 K
% 88.21/88.49 List 128, length 321, 160.5 K
% 88.21/88.49 List 202, length 1, 0.8 K
% 88.21/88.49 List 256, length 57, 57.0 K
% 88.21/88.49
% 88.21/88.49 ============================== SELECTOR REPORT =======================
% 88.21/88.49 Sos_deleted=0, Sos_displaced=0, Sos_size=34
% 88.21/88.49 SELECTOR PART PRIORITY ORDER SIZE SELECTED
% 88.21/88.49 I 2147483647 high age 0 163
% 88.21/88.49 H 1 high weight 0 0
% 88.21/88.49 A 1 low age 34 8331
% 88.21/88.49 F 4 low weight 0 0
% 88.21/88.49 T 4 low weight 34 33324
% 88.21/88.49 ============================== end of selector report ================
% 88.21/88.49
% 88.21/88.49 ============================== end of statistics =====================
% 88.21/88.49
% 88.21/88.49 Exiting with failure.
% 88.21/88.49
% 88.21/88.49 Process 24332 exit (max_megs) Fri Jul 8 21:40:59 2022
% 88.21/88.49 Prover9 interrupted
%------------------------------------------------------------------------------