TSTP Solution File: NUM926+5 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM926+5 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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 : Mon Jul 18 14:23:19 EDT 2022
% Result : Unknown 0.19s 0.57s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM926+5 : TPTP v8.1.0. Released v5.3.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jul 7 16:26:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 ----- Otter 3.2, August 2001 -----
% 0.12/0.37 The process was started by sandbox on n020.cluster.edu,
% 0.12/0.37 Thu Jul 7 16:26:59 2022
% 0.12/0.37 The command was "./sos". The process ID is 28772.
% 0.12/0.37
% 0.12/0.37 set(prolog_style_variables).
% 0.12/0.37 set(auto).
% 0.12/0.37 dependent: set(auto1).
% 0.12/0.37 dependent: set(process_input).
% 0.12/0.37 dependent: clear(print_kept).
% 0.12/0.37 dependent: clear(print_new_demod).
% 0.12/0.37 dependent: clear(print_back_demod).
% 0.12/0.37 dependent: clear(print_back_sub).
% 0.12/0.37 dependent: set(control_memory).
% 0.12/0.37 dependent: assign(max_mem, 12000).
% 0.12/0.37 dependent: assign(pick_given_ratio, 4).
% 0.12/0.37 dependent: assign(stats_level, 1).
% 0.12/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.37 dependent: assign(sos_limit, 5000).
% 0.12/0.37 dependent: assign(max_weight, 60).
% 0.12/0.37 clear(print_given).
% 0.12/0.37
% 0.12/0.37 formula_list(usable).
% 0.12/0.37
% 0.12/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.12/0.37
% 0.12/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.37 clauses in usable.
% 0.12/0.37
% 0.12/0.37 dependent: set(knuth_bendix).
% 0.12/0.37 dependent: set(para_from).
% 0.12/0.37 dependent: set(para_into).
% 0.12/0.37 dependent: clear(para_from_right).
% 0.12/0.37 dependent: clear(para_into_right).
% 0.12/0.37 dependent: set(para_from_vars).
% 0.12/0.37 dependent: set(eq_units_both_ways).
% 0.12/0.37 dependent: set(dynamic_demod_all).
% 0.12/0.37 dependent: set(dynamic_demod).
% 0.12/0.37 dependent: set(order_eq).
% 0.12/0.37 dependent: set(back_demod).
% 0.12/0.37 dependent: set(lrpo).
% 0.12/0.37 dependent: set(hyper_res).
% 0.12/0.37 dependent: set(unit_deletion).
% 0.12/0.37 dependent: set(factor).
% 0.12/0.37
% 0.12/0.37 ------------> process usable:
% 0.12/0.37 Following clause subsumed by 53 during input processing: 0 [] {-} -ord_less(int,bit1(A),bit1(B))|ord_less(int,A,B).
% 0.12/0.37 Following clause subsumed by 54 during input processing: 0 [] {-} ord_less(int,bit1(A),bit1(B))| -ord_less(int,A,B).
% 0.12/0.37 Following clause subsumed by 55 during input processing: 0 [] {-} -ord_less_eq(int,bit1(A),bit1(B))|ord_less_eq(int,A,B).
% 0.12/0.37 Following clause subsumed by 56 during input processing: 0 [] {-} ord_less_eq(int,bit1(A),bit1(B))| -ord_less_eq(int,A,B).
% 0.12/0.37 Following clause subsumed by 58 during input processing: 0 [] {-} -ord_less(int,bit0(A),bit0(B))|ord_less(int,A,B).
% 0.12/0.37 Following clause subsumed by 59 during input processing: 0 [] {-} ord_less(int,bit0(A),bit0(B))| -ord_less(int,A,B).
% 0.12/0.37 Following clause subsumed by 60 during input processing: 0 [] {-} -ord_less_eq(int,bit0(A),bit0(B))|ord_less_eq(int,A,B).
% 0.12/0.37 Following clause subsumed by 61 during input processing: 0 [] {-} ord_less_eq(int,bit0(A),bit0(B))| -ord_less_eq(int,A,B).
% 0.12/0.37 Following clause subsumed by 74 during input processing: 0 [] {-} -ord_less_eq(int,bit1(A),bit0(B))|ord_less(int,A,B).
% 0.12/0.37 Following clause subsumed by 75 during input processing: 0 [] {-} ord_less_eq(int,bit1(A),bit0(B))| -ord_less(int,A,B).
% 0.12/0.37 Following clause subsumed by 76 during input processing: 0 [] {-} -ord_less(int,bit0(A),bit1(B))|ord_less_eq(int,A,B).
% 0.12/0.37 Following clause subsumed by 77 during input processing: 0 [] {-} ord_less(int,bit0(A),bit1(B))| -ord_less_eq(int,A,B).
% 0.12/0.37 Following clause subsumed by 78 during input processing: 0 [] {-} ord_less_eq(int,plus_plus(int,A,one_one(int)),B)| -ord_less(int,A,B).
% 0.12/0.37 Following clause subsumed by 87 during input processing: 0 [flip.2] {-} -comm_semiring_1(A)|times_times(A,times_times(A,B,C),D)=times_times(A,B,times_times(A,C,D)).
% 0.12/0.37 Following clause subsumed by 92 during input processing: 0 [flip.2] {-} -comm_semiring_1(A)|plus_plus(A,plus_plus(A,B,C),D)=plus_plus(A,B,plus_plus(A,C,D)).
% 0.12/0.37 Following clause subsumed by 105 during input processing: 0 [] {-} -ord_less(int,bit1(A),bit0(B))|ord_less(int,A,B).
% 0.12/0.37 Following clause subsumed by 106 during input processing: 0 [] {-} ord_less(int,bit1(A),bit0(B))| -ord_less(int,A,B).
% 0.12/0.37 Following clause subsumed by 113 during input processing: 0 [] {-} -ord_less_eq(int,bit0(A),bit1(B))|ord_less_eq(int,A,B).
% 0.12/0.37 Following clause subsumed by 114 during input processing: 0 [] {-} ord_less_eq(int,bit0(A),bit1(B))| -ord_less_eq(int,A,B).
% 0.12/0.37 33 back subsumes 30.
% 0.12/0.37 87 back subsumes 85.
% 0.12/0.37 88 back subsumes 84.
% 0.12/0.37 Following clause subsumed by 115 during input processing: 0 [copy,118,flip.1] {-} plus_plus(int,power_power(int,A,number_number_of(nat,bit0(bit1(pls)))),power_power(int,B,number_number_of(nat,bit0(bit1(pls)))))!=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)).
% 0.12/0.37
% 0.12/0.37 ------------> process sos:
% 0.12/0.37 Following clause subsumed by 151 during input processing: 0 [] {-} ord_less_eq(int,pls,pls).
% 0.12/0.37 Following clause subsumed by 198 during input processing: 0 [copy,170,flip.1] {-} number_number_of(nat,bit1(pls))=number_number_of(nat,bit1(pls)).
% 0.12/0.37 Following clause subsumed by 174 during input processing: 0 [copy,174,flip.1] {-} times_times(int,A,B)=times_times(int,B,A).
% 0.12/0.37 Following clause subsumed by 179 during input processing: 0 [copy,179,flip.1] {-} plus_plus(int,A,plus_plus(int,B,C))=plus_plus(int,B,plus_plus(int,A,C)).
% 0.12/0.37 Following clause subsumed by 180 during input processing: 0 [copy,180,flip.1] {-} plus_plus(int,A,B)=plus_plus(int,B,A).
% 0.12/0.37 Following clause subsumed by 198 during input processing: 0 [copy,198,flip.1] {-} A=A.
% 0.12/0.37 198 back subsumes 170.
% 0.12/0.37 198 back subsumes 116.
% 0.12/0.37 Following clause subsumed by 198 during input processing: 0 [copy,199,flip.1,demod,205,205,205,208] {-} power_power(int,plus_plus(int,A,B),plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls))))=power_power(int,plus_plus(int,A,B),plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))).
% 0.12/0.37 Following clause subsumed by 154 during input processing: 0 [copy,202,flip.1] {-} power_power(int,power_power(int,A,B),C)=power_power(int,A,times_times(nat,B,C)).
% 0.12/0.37 Following clause subsumed by 217 during input processing: 0 [copy,216,flip.1] {-} plus_plus(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),power_power(int,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))))!=plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),one_one(int)).
% 0.12/0.37 Following clause subsumed by 216 during input processing: 0 [copy,217,flip.1] {-} plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),one_one(int))!=plus_plus(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),power_power(int,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls))))).
% 0.12/0.37 Following clause subsumed by 222 during input processing: 0 [copy,221,flip.1] {-} power_power(int,A,number_number_of(nat,bit1(bit1(pls))))=times_times(int,A,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls))))).
% 0.12/0.37 Following clause subsumed by 221 during input processing: 0 [copy,222,flip.1] {-} times_times(int,A,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))))=power_power(int,A,number_number_of(nat,bit1(bit1(pls)))).
% 0.12/0.37 Following clause subsumed by 220 during input processing: 0 [copy,232,flip.1] {-} power_power(int,plus_plus(int,A,B),number_number_of(nat,bit1(bit1(pls))))=plus_plus(int,power_power(int,A,number_number_of(nat,bit1(bit1(pls)))),plus_plus(int,times_times(int,bit1(bit1(pls)),times_times(int,power_power(int,A,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),B)),plus_plus(int,times_times(int,bit1(bit1(pls)),times_times(int,A,power_power(int,B,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))))),power_power(int,B,number_number_of(nat,bit1(bit1(pls))))))).
% 0.12/0.37
% 0.12/0.37 ======= end of input processing =======
% 0.19/0.57
% 0.19/0.57 Stopped by limit on insertions
% 0.19/0.57
% 0.19/0.57
% 0.19/0.57 Failed to model usable list: disabling FINDER
% 0.19/0.57
% 0.19/0.57
% 0.19/0.57
% 0.19/0.57 -------------- Softie stats --------------
% 0.19/0.57
% 0.19/0.57 UPDATE_STOP: 300
% 0.19/0.57 SFINDER_TIME_LIMIT: 2
% 0.19/0.57 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.57 number of clauses in intial UL: 98
% 0.19/0.57 number of clauses initially in problem: 184
% 0.19/0.57 percentage of clauses intially in UL: 53
% 0.19/0.57 percentage of distinct symbols occuring in initial UL: 80
% 0.19/0.57 percent of all initial clauses that are short: 100
% 0.19/0.57 absolute distinct symbol count: 30
% 0.19/0.57 distinct predicate count: 14
% 0.19/0.57 distinct function count: 9
% 0.19/0.57 distinct constant count: 7
% 0.19/0.57
% 0.19/0.57 ---------- no more Softie stats ----------
% 0.19/0.57
% 0.19/0.57
% 0.19/0.57
% 0.19/0.57 =========== start of search ===========
% 0.19/0.57
% 0.19/0.57
% 0.19/0.57 Changing weight limit from 60 to 76.
% 0.19/0.57
% 0.19/0.57 Resetting weight limit to 76 after 5 givens.
% 0.19/0.57
% 0.19/0.57 plus_plus(int,one_one(int),one_one(int))=bit0(bit1(pls)).
% 0.19/0.57
% 0.19/0.57 ------------- memory usage ------------
% 0.19/0.57 25 mallocs of 32700 bytes each, 798.3 K.
% 0.19/0.57 type (bytes each) gets frees in use avail bytes
% 0.19/0.57 sym_ent ( 304) 186 0 186 0 55.2 K
% 0.19/0.57 term ( 32) 26337 23110 3227 24 101.6 K
% 0.19/0.57 rel ( 40) 22108 18200 3908 8 153.0 K
% 0.19/0.57 term_ptr ( 16) 12313 3500 8813 48 138.5 K
% 0.19/0.57 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.19/0.57 fpa_head ( 24) 3086 855 2231 33 53.1 K
% 0.19/0.57 fpa_tree ( 56) 2254 2254 0 57 3.1 K
% 0.19/0.57 context (1288) 2181 2181 0 5 6.3 K
% 0.19/0.57 trail ( 24) 1975 1975 0 5 0.1 K
% 0.19/0.57 imd_tree ( 32) 198 66 132 10 4.4 K
% 0.19/0.57 imd_pos (4024) 355 355 0 4 15.7 K
% 0.19/0.57 is_tree ( 24) 2292 843 1449 23 34.5 K
% 0.19/0.57 is_pos (2424) 6366 6366 0 11 26.0 K
% 0.19/0.57 fsub_pos ( 16) 1023 1023 0 1 0.0 K
% 0.19/0.57 literal ( 32) 1241 361 880 0 27.5 K
% 0.19/0.57 clause ( 88) 643 172 471 0 40.5 K
% 0.19/0.57 list ( 272) 153 146 7 2 2.4 K
% 0.19/0.57 clash_nd ( 80) 50 50 0 3 0.2 K
% 0.19/0.57 clause_ptr ( 16) 464 149 315 2 5.0 K
% 0.19/0.57 int_ptr ( 16) 1745 891 854 0 13.3 K
% 0.19/0.57 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.19/0.57 link_node ( 120) 0 0 0 0 0.0 K
% 0.19/0.57 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.19/0.57 formula_box( 168) 0 0 0 0 0.0 K
% 0.19/0.57 formula( 40) 1031 1031 0 656 25.6 K
% 0.19/0.57 formula_ptr( 16) 143 143 0 143 2.2 K
% 0.19/0.57 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.19/0.57
% 0.19/0.57 ********** is_delete, can't find end.
% 0.19/0.57 ubsume 0.00
% 0.19/0.57 factor time 0.00
% 0.19/0.57 FINDER time 0.00
% 0.19/0.57 unindex time 0.00
% 0.19/0.57
% 0.19/0.57 Forward subsumption counts, subsumer:number_subsumed.
% 0.19/0.57 1:0 2:0 3:0 4:0 5:0 6:0 7:0 8:0 9:0 10:0
% 0.19/0.57 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 0.19/0.57 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 0.19/0.57 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 0.19/0.57 41:0 42:1 43:0 44:0 45:0 46:0 47:0 48:0 49:0 50:0
% 0.19/0.57 51:0 52:1 53:1 54:1 55:1 56:1 57:0 58:3 59:3 60:3
% 0.19/0.57 61:3 62:0 63:0 64:0 65:0 66:0 67:0 68:0 69:0 70:0
% 0.19/0.57 71:0 72:0 73:0 74:2 75:2 76:2 77:2 78:1 79:0 80:0
% 0.19/0.57 81:0 82:0 83:0 84:0 85:0 86:0 87:1 88:0 89:0 90:0
% 0.19/0.57 91:0 92:1 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 0.19/0.57 All others: 84.
% 0.19/0.57
% 0.19/0.57 ********** ABNORMAL END **********
% 0.19/0.57
% 0.19/0.57 ********** is_delete, can't find end.
%------------------------------------------------------------------------------