%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM924+5 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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:11 EDT 2022
% Result : Unknown 0.20s 0.58s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM924+5 : TPTP v8.1.0. Released v5.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jul 6 21:35:38 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox on n019.cluster.edu,
% 0.14/0.37 Wed Jul 6 21:35:38 2022
% 0.14/0.37 The command was "./sos". The process ID is 3136.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 formula_list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.14/0.37
% 0.14/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.37 clauses in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(knuth_bendix).
% 0.14/0.37 dependent: set(para_from).
% 0.14/0.37 dependent: set(para_into).
% 0.14/0.37 dependent: clear(para_from_right).
% 0.14/0.37 dependent: clear(para_into_right).
% 0.14/0.37 dependent: set(para_from_vars).
% 0.14/0.37 dependent: set(eq_units_both_ways).
% 0.14/0.37 dependent: set(dynamic_demod_all).
% 0.14/0.37 dependent: set(dynamic_demod).
% 0.14/0.37 dependent: set(order_eq).
% 0.14/0.37 dependent: set(back_demod).
% 0.14/0.37 dependent: set(lrpo).
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: set(unit_deletion).
% 0.14/0.37 dependent: set(factor).
% 0.14/0.37
% 0.14/0.38 ------------> process usable:
% 0.14/0.38 Following clause subsumed by 66 during input processing: 0 [] {-} -ord_less_eq(int,bit1(A),bit1(B))|ord_less_eq(int,A,B).
% 0.14/0.38 Following clause subsumed by 67 during input processing: 0 [] {-} ord_less_eq(int,bit1(A),bit1(B))| -ord_less_eq(int,A,B).
% 0.14/0.38 Following clause subsumed by 68 during input processing: 0 [] {-} -ord_less_eq(int,bit0(A),bit0(B))|ord_less_eq(int,A,B).
% 0.14/0.38 Following clause subsumed by 69 during input processing: 0 [] {-} ord_less_eq(int,bit0(A),bit0(B))| -ord_less_eq(int,A,B).
% 0.14/0.38 Following clause subsumed by 83 during input processing: 0 [] {-} -number_ring(A)|number_number_of(A,times_times(int,B,C))=times_times(A,number_number_of(A,B),number_number_of(A,C)).
% 0.14/0.38 Following clause subsumed by 98 during input processing: 0 [] {-} -ord_less_eq(int,bit0(A),bit1(B))|ord_less_eq(int,A,B).
% 0.14/0.38 Following clause subsumed by 99 during input processing: 0 [] {-} ord_less_eq(int,bit0(A),bit1(B))| -ord_less_eq(int,A,B).
% 0.14/0.38 Following clause subsumed by 115 during input processing: 0 [] {-} -ord_less_eq(int,bit1(A),bit0(B))|ord_less(int,A,B).
% 0.14/0.38 Following clause subsumed by 116 during input processing: 0 [] {-} ord_less_eq(int,bit1(A),bit0(B))| -ord_less(int,A,B).
% 0.14/0.38 Following clause subsumed by 117 during input processing: 0 [] {-} -ord_less(int,bit0(A),bit1(B))|ord_less_eq(int,A,B).
% 0.14/0.38 Following clause subsumed by 118 during input processing: 0 [] {-} ord_less(int,bit0(A),bit1(B))| -ord_less_eq(int,A,B).
% 0.14/0.38 Following clause subsumed by 124 during input processing: 0 [] {-} ord_less_eq(int,plus_plus(int,A,one_one(int)),B)| -ord_less(int,A,B).
% 0.14/0.38
% 0.14/0.38 ------------> process sos:
% 0.14/0.38 Following clause subsumed by 187 during input processing: 0 [] {-} ord_less_eq(int,pls,pls).
% 0.14/0.38 Following clause subsumed by 190 during input processing: 0 [copy,190,flip.1] {-} times_times(int,A,B)=times_times(int,B,A).
% 0.14/0.38 Following clause subsumed by 254 during input processing: 0 [copy,193,flip.1] {-} times_times(int,A,B)=times_times(int,A,B).
% 0.14/0.38 Following clause subsumed by 254 during input processing: 0 [copy,203,flip.1] {-} number_number_of(nat,pls)=number_number_of(nat,pls).
% 0.14/0.38 Following clause subsumed by 254 during input processing: 0 [copy,216,flip.1] {-} plus_plus(int,A,B)=plus_plus(int,A,B).
% 0.14/0.38 Following clause subsumed by 254 during input processing: 0 [copy,225,flip.1] {-} number_number_of(nat,bit1(pls))=number_number_of(nat,bit1(pls)).
% 0.14/0.38 Following clause subsumed by 231 during input processing: 0 [copy,231,flip.1] {-} plus_plus(int,A,plus_plus(int,B,C))=plus_plus(int,B,plus_plus(int,A,C)).
% 0.14/0.38 Following clause subsumed by 232 during input processing: 0 [copy,232,flip.1] {-} plus_plus(int,A,B)=plus_plus(int,B,A).
% 0.14/0.38 Following clause subsumed by 254 during input processing: 0 [copy,254,flip.1] {-} A=A.
% 0.14/0.38 254 back subsumes 225.
% 0.14/0.38 254 back subsumes 216.
% 0.14/0.38 254 back subsumes 203.
% 0.14/0.38 254 back subsumes 193.
% 0.14/0.38 254 back subsumes 149.
% 0.14/0.38
% 0.14/0.38 ======= end of input processing =======
% 0.20/0.57
% 0.20/0.57 Stopped by limit on insertions
% 0.20/0.57
% 0.20/0.57
% 0.20/0.57 Failed to model usable list: disabling FINDER
% 0.20/0.57
% 0.20/0.57
% 0.20/0.57
% 0.20/0.57 -------------- Softie stats --------------
% 0.20/0.57
% 0.20/0.57 UPDATE_STOP: 300
% 0.20/0.57 SFINDER_TIME_LIMIT: 2
% 0.20/0.57 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.57 number of clauses in intial UL: 117
% 0.20/0.57 number of clauses initially in problem: 226
% 0.20/0.57 percentage of clauses intially in UL: 51
% 0.20/0.57 percentage of distinct symbols occuring in initial UL: 84
% 0.20/0.57 percent of all initial clauses that are short: 100
% 0.20/0.57 absolute distinct symbol count: 33
% 0.20/0.57 distinct predicate count: 16
% 0.20/0.57 distinct function count: 10
% 0.20/0.57 distinct constant count: 7
% 0.20/0.57
% 0.20/0.57 ---------- no more Softie stats ----------
% 0.20/0.57
% 0.20/0.57
% 0.20/0.57
% 0.20/0.57 =========== start of search ===========
% 0.20/0.58 plus_plus(int,power_power(int,s,plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))),one_one(int))=plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),times_times(int,m,$c1)),$c1).
% 0.20/0.58
% 0.20/0.58 ------------- memory usage ------------
% 0.20/0.58 28 mallocs of 32700 bytes each, 894.1 K.
% 0.20/0.58 type (bytes each) gets frees in use avail bytes
% 0.20/0.58 sym_ent ( 304) 177 0 177 0 52.5 K
% 0.20/0.58 term ( 32) 28791 24801 3990 30 125.6 K
% 0.20/0.58 rel ( 40) 23685 18868 4817 28 189.3 K
% 0.20/0.58 term_ptr ( 16) 13821 3882 9939 0 155.3 K
% 0.20/0.58 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.20/0.58 fpa_head ( 24) 2702 659 2043 31 48.6 K
% 0.20/0.58 fpa_tree ( 56) 2333 2333 0 33 1.8 K
% 0.20/0.58 context (1288) 2926 2926 0 5 6.3 K
% 0.20/0.58 trail ( 24) 3066 3066 0 4 0.1 K
% 0.20/0.58 imd_tree ( 32) 172 81 91 39 4.1 K
% 0.20/0.58 imd_pos (4024) 452 452 0 3 11.8 K
% 0.20/0.58 is_tree ( 24) 2299 676 1623 0 38.0 K
% 0.20/0.58 is_pos (2424) 10312 10312 0 9 21.3 K
% 0.20/0.58 fsub_pos ( 16) 1683 1683 0 1 0.0 K
% 0.20/0.58 literal ( 32) 1846 564 1282 0 40.1 K
% 0.20/0.58 clause ( 88) 816 217 599 0 51.5 K
% 0.20/0.58 list ( 272) 166 159 7 2 2.4 K
% 0.20/0.58 clash_nd ( 80) 101 101 0 3 0.2 K
% 0.20/0.58 clause_ptr ( 16) 601 182 419 2 6.6 K
% 0.20/0.58 int_ptr ( 16) 2815 1419 1396 0 21.8 K
% 0.20/0.58 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.20/0.58 link_node ( 120) 0 0 0 0 0.0 K
% 0.20/0.58 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.20/0.58 formula_box( 168) 0 0 0 0 0.0 K
% 0.20/0.58 formula( 40) 1309 1309 0 741 28.9 K
% 0.20/0.58 formula_ptr( 16) 156 156 0 156 2.4 K
% 0.20/0.58 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.20/0.58
% 0.20/0.58 ********** is_delete, can't find end.
% 0.20/0.58 0
% 0.20/0.58 print_cl time 0.00
% 0.20/0.58 conflict time 0.00
% 0.20/0.58 new demod time 0.00
% 0.20/0.58 post_process time 0.00
% 0.20/0.58 back demod time 0.00
% 0.20/0.58 back subsume 0.00
% 0.20/0.58 factor time 0.00
% 0.20/0.58 FINDER time 0.00
% 0.20/0.58 unindex time 0.00
% 0.20/0.58
% 0.20/0.58 Forward subsumption counts, subsumer:number_subsumed.
% 0.20/0.58 1:0 2:0 3:0 4:0 5:0 6:0 7:0 8:0 9:0 10:0
% 0.20/0.58 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 0.20/0.58 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 0.20/0.58 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 0.20/0.58 41:0 42:0 43:0 44:0 45:0 46:0 47:0 48:0 49:0 50:0
% 0.20/0.58 51:0 52:0 53:0 54:0 55:0 56:0 57:0 58:0 59:0 60:0
% 0.20/0.58 61:0 62:0 63:0 64:0 65:3 66:1 67:1 68:3 69:3 70:0
% 0.20/0.58 71:0 72:0 73:0 74:0 75:0 76:0 77:0 78:0 79:0 80:0
% 0.20/0.58 81:0 82:0 83:1 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 0.20/0.58 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:2 99:2
% 0.20/0.58 All others: 110.
% 0.20/0.58
% 0.20/0.58 ********** ABNORMAL END **********
% 0.20/0.58
% 0.20/0.58 ********** is_delete, can't find end.
%------------------------------------------------------------------------------