%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM924+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:07 EDT 2022
% Result : Unknown 1.13s 1.33s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM924+1 : TPTP v8.1.0. Released v5.3.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n004.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 : Wed Jul 6 00:20:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n004.cluster.edu,
% 0.12/0.36 Wed Jul 6 00:20:53 2022
% 0.12/0.36 The command was "./sos". The process ID is 25577.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=1, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 There is a clause for symmetry of equality, so it is
% 0.12/0.36 assumed that equality is fully axiomatized; therefore,
% 0.12/0.36 paramodulation is disabled.
% 0.12/0.36
% 0.12/0.36 dependent: clear(para_from).
% 0.12/0.36 dependent: clear(para_into).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36 Following clause subsumed by 13 during input processing: 0 [] {-} -ord_less_eq_int(number_number_of_int(A),number_number_of_int(B))|ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 14 during input processing: 0 [] {-} ord_less_eq_int(number_number_of_int(A),number_number_of_int(B))| -ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 17 during input processing: 0 [] {-} -ord_less_eq_int(bit1(A),bit1(B))|ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 18 during input processing: 0 [] {-} ord_less_eq_int(bit1(A),bit1(B))| -ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 19 during input processing: 0 [] {-} -ord_less_eq_int(bit0(A),bit0(B))|ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 20 during input processing: 0 [] {-} ord_less_eq_int(bit0(A),bit0(B))| -ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 25 during input processing: 0 [flip.1] {-} number_number_of_nat(A)!=zero_zero_nat|ord_less_eq_int(A,pls).
% 0.12/0.36 Following clause subsumed by 26 during input processing: 0 [flip.1] {-} number_number_of_nat(A)=zero_zero_nat| -ord_less_eq_int(A,pls).
% 0.12/0.36 Following clause subsumed by 44 during input processing: 0 [] {-} -ord_less_eq_int(bit0(A),bit1(B))|ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 45 during input processing: 0 [] {-} ord_less_eq_int(bit0(A),bit1(B))| -ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 61 during input processing: 0 [] {-} -ord_less_eq_int(bit1(A),bit0(B))|ord_less_int(A,B).
% 0.12/0.36 Following clause subsumed by 62 during input processing: 0 [] {-} ord_less_eq_int(bit1(A),bit0(B))| -ord_less_int(A,B).
% 0.12/0.36 Following clause subsumed by 63 during input processing: 0 [] {-} -ord_less_int(bit0(A),bit1(B))|ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 64 during input processing: 0 [] {-} ord_less_int(bit0(A),bit1(B))| -ord_less_eq_int(A,B).
% 0.12/0.36 Following clause subsumed by 70 during input processing: 0 [] {-} ord_less_eq_int(plus_plus_int(A,one_one_int),B)| -ord_less_int(A,B).
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 135 during input processing: 0 [] {-} ord_less_eq_int(pls,pls).
% 0.12/0.36 Following clause subsumed by 141 during input processing: 0 [demod,137,137,137,143] {-} times_times_int(A,times_times_int(B,C))=times_times_int(A,times_times_int(B,C)).
% 0.19/0.36 Following clause subsumed by 141 during input processing: 0 [demod,137,137,137] {-} times_times_int(A,B)=times_times_int(A,B).
% 0.19/0.36 Following clause subsumed by 141 during input processing: 0 [demod,137,137,137] {-} times_times_int(A,B)=times_times_int(A,B).
% 0.19/0.36 Following clause subsumed by 168 during input processing: 0 [demod,137,170,137,137] {-} plus_plus_int(times_times_int(A,C),times_times_int(B,C))=plus_plus_int(times_times_int(A,C),times_times_int(B,C)).
% 0.19/0.36 Following clause subsumed by 168 during input processing: 0 [demod,137,172,137,137] {-} plus_plus_int(times_times_int(A,B),times_times_int(A,C))=plus_plus_int(times_times_int(A,B),times_times_int(A,C)).
% 0.19/0.36 Following clause subsumed by 138 during input processing: 0 [copy,138,flip.1] {-} times_times_int(A,B)=times_times_int(B,A).
% 0.19/0.36 Following clause subsumed by 191 during input processing: 0 [copy,141,flip.1] {-} times_times_int(A,B)=times_times_int(A,B).
% 0.19/0.36 Following clause subsumed by 191 during input processing: 0 [copy,154,flip.1] {-} zero_zero_nat=zero_zero_nat.
% 0.19/0.36 Following clause subsumed by 191 during input processing: 0 [copy,168,flip.1] {-} plus_plus_int(A,B)=plus_plus_int(A,B).
% 0.19/0.36 Following clause subsumed by 191 during input processing: 0 [copy,176,flip.1] {-} one_one_nat=one_one_nat.
% 0.19/0.36 Following clause subsumed by 186 during input processing: 0 [copy,186,flip.1] {-} plus_plus_int(A,plus_plus_int(B,C))=plus_plus_int(B,plus_plus_int(A,C)).
% 0.19/0.36 Following clause subsumed by 187 during input processing: 0 [copy,187,flip.1] {-} plus_plus_int(A,B)=plus_plus_int(B,A).
% 0.19/0.36 Following clause subsumed by 191 during input processing: 0 [copy,191,flip.1] {-} A=A.
% 0.19/0.36 191 back subsumes 176.
% 0.19/0.36 191 back subsumes 168.
% 0.19/0.36 191 back subsumes 154.
% 0.19/0.36 191 back subsumes 141.
% 0.19/0.36 191 back subsumes 97.
% 0.19/0.36 207 back subsumes 84.
% 0.19/0.36 207 back subsumes 83.
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.42
% 0.19/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.42
% 0.19/0.42 Stopped by limit on number of solutions
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 -------------- Softie stats --------------
% 0.19/0.42
% 0.19/0.42 UPDATE_STOP: 300
% 0.19/0.42 SFINDER_TIME_LIMIT: 2
% 0.19/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.42 number of clauses in intial UL: 50
% 0.19/0.42 number of clauses initially in problem: 150
% 0.19/0.42 percentage of clauses intially in UL: 33
% 0.19/0.42 percentage of distinct symbols occuring in initial UL: 61
% 0.19/0.42 percent of all initial clauses that are short: 100
% 0.19/0.42 absolute distinct symbol count: 26
% 0.19/0.42 distinct predicate count: 7
% 0.19/0.42 distinct function count: 10
% 0.19/0.42 distinct constant count: 9
% 0.19/0.42
% 0.19/0.42 ---------- no more Softie stats ----------
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 =========== start of search ===========
% 1.13/1.33
% 1.13/1.33 Stopped by limit on insertions
% 1.13/1.33
% 1.13/1.33 Model 2 [ 4 1 710 ] (0.00 seconds, 250000 Inserts)
% 1.13/1.33
% 1.13/1.33 Stopped by limit on insertions
% 1.13/1.33
% 1.13/1.33 Model 3 [ 4 1 1258 ] (0.00 seconds, 250000 Inserts)
% 1.13/1.33
% 1.13/1.33 Stopped by limit on insertions
% 1.13/1.33
% 1.13/1.33 Model 4 [ 5 1 897 ] (0.00 seconds, 250000 Inserts)
% 1.13/1.33
% 1.13/1.33 Stopped by limit on insertions
% 1.13/1.33
% 1.13/1.33 Stopped by limit on insertions
% 1.13/1.33
% 1.13/1.33 Model 5 [ 9 1 1142 ] (0.00 seconds, 250000 Inserts)
% 1.13/1.33
% 1.13/1.33 Stopped by limit on insertions
% 1.13/1.33
% 1.13/1.33 Model 6 [ 8 1 1341 ] (0.00 seconds, 250000 Inserts)
% 1.13/1.33 number_number_of_nat(plus_plus_int(pls,bit0(pls)))=plus_plus_nat(zero_zero_nat,number_number_of_nat(bit0(pls))).
% 1.13/1.33
% 1.13/1.33 ------------- memory usage ------------
% 1.13/1.33 17 mallocs of 32700 bytes each, 542.9 K.
% 1.13/1.33 type (bytes each) gets frees in use avail bytes
% 1.13/1.33 sym_ent ( 304) 183 0 183 0 54.3 K
% 1.13/1.33 term ( 32) 14469 12243 2226 6 69.8 K
% 1.13/1.33 rel ( 40) 11520 9080 2440 4 95.5 K
% 1.13/1.33 term_ptr ( 16) 6805 2544 4261 0 66.6 K
% 1.13/1.33 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 1.13/1.33 fpa_head ( 24) 1332 401 931 110 24.4 K
% 1.13/1.33 fpa_tree ( 56) 2024 2024 0 18 1.0 K
% 1.13/1.33 context (1288) 2106 2106 0 5 6.3 K
% 1.13/1.33 trail ( 24) 1571 1571 0 4 0.1 K
% 1.13/1.33 imd_tree ( 32) 166 50 116 1 3.7 K
% 1.13/1.33 imd_pos (4024) 350 350 0 3 11.8 K
% 1.13/1.33 is_tree ( 24) 1228 405 823 2 19.3 K
% 1.13/1.33 is_pos (2424) 3975 3975 0 6 14.2 K
% 1.13/1.33 fsub_pos ( 16) 853 853 0 1 0.0 K
% 1.13/1.33 literal ( 32) 1048 331 717 0 22.4 K
% 1.13/1.33 clause ( 88) 588 139 449 0 38.6 K
% 1.13/1.33 list ( 272) 118 111 7 2 2.4 K
% 1.13/1.33 clash_nd ( 80) 46 46 0 1 0.1 K
% 1.13/1.33 clause_ptr ( 16) 504 173 331 2 5.2 K
% 1.13/1.33 int_ptr ( 16) 1228 433 795 0 12.4 K
% 1.13/1.33 ci_ptr ( 24) 0 0 0 0 0.0 K
% 1.13/1.33 link_node ( 120) 0 0 0 0 0.0 K
% 1.13/1.33 ans_lit_node( 24) 0 0 0 0 0.0 K
% 1.13/1.33 formula_box( 168) 0 0 0 0 0.0 K
% 1.13/1.33 formula( 40) 767 767 0 437 17.1 K
% 1.13/1.33 formula_ptr( 16) 108 108 0 108 1.7 K
% 1.13/1.33 cl_attribute( 24) 0 0 0 0 0.0 K
% 1.13/1.33
% 1.13/1.33 ********** is_delete, can't find end.
% 1.13/1.33 etion 0.00
% 1.13/1.33 factor simplify 0.00
% 1.13/1.33 weigh cl time 0.00
% 1.13/1.33 hints keep time 0.00
% 1.13/1.33 sort lits time 0.00
% 1.13/1.33 forward subsume 0.00
% 1.13/1.33 delete cl time 0.00
% 1.13/1.33 keep cl time 0.00
% 1.13/1.33 hints time 0.00
% 1.13/1.33 print_cl time 0.00
% 1.13/1.33 conflict time 0.00
% 1.13/1.33 new demod time 0.00
% 1.13/1.33 post_process time 0.00
% 1.13/1.33 back demod time 0.00
% 1.13/1.33 back subsume 0.00
% 1.13/1.33 factor time 0.00
% 1.13/1.33 FINDER time 0.00
% 1.13/1.33 unindex time 0.00
% 1.13/1.33
% 1.13/1.33 ----------- soft-scott stats ----------
% 1.13/1.33
% 1.13/1.33 true clauses given 1 (8.3%)
% 1.13/1.33 false clauses given 11
% 1.13/1.33
% 1.13/1.33 FALSE TRUE
% 1.13/1.33 3 1 0
% 1.13/1.33 4 2 1
% 1.13/1.33 5 16 4
% 1.13/1.33 6 9 4
% 1.13/1.33 7 13 5
% 1.13/1.33 8 9 3
% 1.13/1.33 9 3 4
% 1.13/1.33 10 5 2
% 1.13/1.33 11 3 4
% 1.13/1.33 12 5 2
% 1.13/1.33 13 5 0
% 1.13/1.33 14 1 1
% 1.13/1.33 15 1 1
% 1.13/1.33 16 7 2
% 1.13/1.33 18 0 3
% 1.13/1.33 19 0 2
% 1.13/1.33 tot: 80 38 (32.2% true)
% 1.13/1.33
% 1.13/1.33
% 1.13/1.33 Model 6 [ 8 1 1341 ] (0.00 seconds, 250000 Inserts)
% 1.13/1.33
% 1.13/1.33 Forward subsumption counts, subsumer:number_subsumed.
% 1.13/1.33 1:0 2:0 3:0 4:0 5:0 6:0 7:0 8:0 9:0 10:0
% 1.13/1.33 11:0 12:0 13:1 14:1 15:0 16:0 17:1 18:1 19:1 20:1
% 1.13/1.33 21:0 22:0 23:0 24:0 25:1 26:1 27:0 28:0 29:0 30:0
% 1.13/1.33 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:1 40:0
% 1.13/1.33 41:0 42:0 43:0 44:1 45:1 46:0 47:0 48:0 49:0 50:0
% 1.13/1.33 51:0 52:0 53:0 54:0 55:0 56:0 57:0 58:0 59:0 60:0
% 1.13/1.33 61:1 62:1 63:1 64:1 65:0 66:0 67:0 68:0 69:0 70:1
% 1.13/1.33 71:0 72:0 73:0 74:0 75:0 76:0 77:0 78:0 79:0 80:0
% 1.13/1.33 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 1.13/1.33 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 1.13/1.33 All others: 71.
% 1.13/1.33
% 1.13/1.33 ********** ABNORMAL END **********
% 1.13/1.33
% 1.13/1.33 ********** is_delete, can't find end.
%------------------------------------------------------------------------------