TSTP Solution File: GRP800+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP800+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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 : Sat Jul 16 11:44:34 EDT 2022
% Result : Unknown 0.91s 1.12s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP800+1 : TPTP v8.1.0. Released v7.5.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 19:34:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox on n014.cluster.edu,
% 0.20/0.36 Mon Jun 13 19:34:37 2022
% 0.20/0.36 The command was "./sos". The process ID is 11681.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 formula_list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.20/0.36
% 0.20/0.36 All clauses are units, and equality is present; the
% 0.20/0.36 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.20/0.36
% 0.20/0.36 dependent: set(knuth_bendix).
% 0.20/0.36 dependent: set(para_from).
% 0.20/0.36 dependent: set(para_into).
% 0.20/0.36 dependent: clear(para_from_right).
% 0.20/0.36 dependent: clear(para_into_right).
% 0.20/0.36 dependent: set(para_from_vars).
% 0.20/0.36 dependent: set(eq_units_both_ways).
% 0.20/0.36 dependent: set(dynamic_demod_all).
% 0.20/0.36 dependent: set(dynamic_demod).
% 0.20/0.36 dependent: set(order_eq).
% 0.20/0.36 dependent: set(back_demod).
% 0.20/0.36 dependent: set(lrpo).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36 Following clause subsumed by 48 during input processing: 0 [copy,48,flip.1] {-} b(A,m(i2(B,b(C,m(i2(D,E),C))),A))=b(C,m(i2(D,b(A,m(i2(B,E),A))),C)).
% 0.20/0.36 Following clause subsumed by 73 during input processing: 0 [copy,73,flip.1] {-} A=A.
% 0.20/0.36 Following clause subsumed by 43 during input processing: 0 [copy,74,flip.1] {-} j2(A,b(B,m(i2(C,b(D,m(E,D))),B)))=i2(C,b(D,m(j2(A,b(B,m(E,B))),D))).
% 0.20/0.36 Following clause subsumed by 53 during input processing: 0 [copy,75,flip.1] {-} i2(A,b(B,m(i1(C,i2(D,E)),B)))=i1(C,i2(D,i2(A,b(B,m(E,B))))).
% 0.20/0.36 Following clause subsumed by 55 during input processing: 0 [copy,76,flip.1] {-} r(A,B,b(C,m(b(D,m(i1(E,F),D)),C)))=b(D,m(i1(E,r(A,B,b(C,m(F,C)))),D)).
% 0.20/0.36 Following clause subsumed by 56 during input processing: 0 [copy,77,flip.1] {-} r(A,B,j2(C,i1(D,i1(E,F))))=i1(D,i1(E,r(A,B,j2(C,F)))).
% 0.20/0.36 Following clause subsumed by 57 during input processing: 0 [copy,78,flip.1] {-} r(A,B,i1(C,r(D,E,i2(F,G))))=r(D,E,i2(F,r(A,B,i1(C,G)))).
% 0.20/0.36 Following clause subsumed by 58 during input processing: 0 [copy,79,flip.1] {-} r(A,B,i2(C,r(D,E,j2(F,G))))=r(D,E,j2(F,r(A,B,i2(C,G)))).
% 0.20/0.36 Following clause subsumed by 60 during input processing: 0 [copy,80,flip.1] {-} r(A,B,i2(C,b(D,m(r(E,F,i1(G,H)),D))))=r(E,F,i1(G,r(A,B,i2(C,b(D,m(H,D)))))).
% 0.20/0.36 Following clause subsumed by 62 during input processing: 0 [copy,81,flip.1] {-} r(A,B,b(C,m(b(D,m(r(E,F,i2(G,H)),D)),C)))=r(E,F,i2(G,r(A,B,b(C,m(b(D,m(H,D)),C))))).
% 0.20/0.36 Following clause subsumed by 64 during input processing: 0 [copy,82,flip.1] {-} r(A,B,l(C,D,i1(E,b(F,m(i2(G,H),F)))))=l(C,D,i2(G,r(A,B,i1(E,b(F,m(H,F)))))).
% 0.20/0.36 Following clause subsumed by 66 during input processing: 0 [copy,83,flip.1] {-} r(A,B,l(C,D,i1(E,b(F,m(i1(G,H),F)))))=l(C,D,i1(G,r(A,B,i1(E,b(F,m(H,F)))))).
% 0.20/0.36 Following clause subsumed by 68 during input processing: 0 [copy,84,flip.1] {-} l(A,B,j2(C,b(D,m(l(E,F,b(G,m(H,G))),D))))=l(E,F,b(G,m(l(A,B,j2(C,b(D,m(H,D)))),G))).
% 0.20/0.36 Following clause subsumed by 69 during input processing: 0 [copy,85,flip.1] {-} r(A,B,j2(C,i1(D,l(E,F,j2(G,H)))))=l(E,F,j2(G,r(A,B,j2(C,i1(D,H))))).
% 0.20/0.36 Following clause subsumed by 70 during input processing: 0 [copy,86,flip.1] {-} r(A,B,i1(C,i1(D,l(E,F,i1(G,H)))))=l(E,F,i1(G,r(A,B,i1(C,i1(D,H))))).
% 0.20/0.36 Following clause subsumed by 71 during input processing: 0 [copy,87,flip.1] {-} l(A,B,j2(C,i1(D,l(E,F,i1(G,H)))))=l(E,F,i1(G,l(A,B,j2(C,i1(D,H))))).
% 0.20/0.36 Following clause subsumed by 72 during input processing: 0 [copy,88,flip.1] {-} r(A,B,i2(C,i2(D,l(E,F,i2(G,H)))))=l(E,F,i2(G,r(A,B,i2(C,i2(D,H))))).
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 1
% 0.20/0.40 number of clauses initially in problem: 69
% 0.20/0.40 percentage of clauses intially in UL: 1
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 58
% 0.20/0.40 percent of all initial clauses that are short: 98
% 0.20/0.40 absolute distinct symbol count: 17
% 0.20/0.40 distinct predicate count: 1
% 0.20/0.40 distinct function count: 11
% 0.20/0.40 distinct constant count: 5
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.91/1.11
% 0.91/1.11 Model 3 (0.00 seconds, 0 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on number of solutions
% 0.91/1.11
% 0.91/1.11 Model 4 (0.00 seconds, 0 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on number of solutions
% 0.91/1.11
% 0.91/1.11 Stopped by limit on insertions
% 0.91/1.11
% 0.91/1.11 Model 5 [ 5 1 2894 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on insertions
% 0.91/1.11
% 0.91/1.11 Model 6 [ 2 0 2722 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on insertions
% 0.91/1.11
% 0.91/1.11 Model 7 [ 13 0 575 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on insertions
% 0.91/1.11
% 0.91/1.11 Model 8 [ 6 1 843 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on insertions
% 0.91/1.11
% 0.91/1.11 Model 9 [ 8 0 1300 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on insertions
% 0.91/1.11
% 0.91/1.11 Model 10 [ 7 1 751 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on insertions
% 0.91/1.11
% 0.91/1.11 Model 11 [ 14 0 3319 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on insertions
% 0.91/1.11
% 0.91/1.11 Model 12 [ 16 0 2356 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on insertions
% 0.91/1.11
% 0.91/1.11 Model 13 [ 11 1 2211 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.11 m(b(A,B),b(b(A,e),e))=i2(A,B).
% 0.91/1.11
% 0.91/1.11 ------------- memory usage ------------
% 0.91/1.11 20 mallocs of 32700 bytes each, 638.7 K.
% 0.91/1.11 type (bytes each) gets frees in use avail bytes
% 0.91/1.11 sym_ent ( 304) 137 0 137 0 40.7 K
% 0.91/1.11 term ( 32) 10655 9309 1346 93 45.0 K
% 0.91/1.11 rel ( 40) 9624 7505 2119 94 86.4 K
% 0.91/1.11 term_ptr ( 16) 10871 1548 9323 70 146.8 K
% 0.91/1.11 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.91/1.11 fpa_head ( 24) 2932 328 2604 19 61.5 K
% 0.91/1.11 fpa_tree ( 56) 302 302 0 13 0.7 K
% 0.91/1.11 context (1288) 628 628 0 4 5.0 K
% 0.91/1.11 trail ( 24) 766 766 0 5 0.1 K
% 0.91/1.11 imd_tree ( 32) 217 92 125 59 5.8 K
% 0.91/1.11 imd_pos (4024) 1465 1465 0 6 23.6 K
% 0.91/1.11 is_tree ( 24) 1607 479 1128 49 27.6 K
% 0.91/1.11 is_pos (2424) 622 622 0 20 47.3 K
% 0.91/1.11 fsub_pos ( 16) 74 74 0 1 0.0 K
% 0.91/1.11 literal ( 32) 230 78 152 1 4.8 K
% 0.91/1.11 clause ( 88) 230 78 152 1 13.1 K
% 0.91/1.11 list ( 272) 46 39 7 2 2.4 K
% 0.91/1.11 clash_nd ( 80) 0 0 0 0 0.0 K
% 0.91/1.11 clause_ptr ( 16) 231 95 136 8 2.2 K
% 0.91/1.11 int_ptr ( 16) 1212 706 506 8 8.0 K
% 0.91/1.11 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.91/1.11 link_node ( 120) 0 0 0 0 0.0 K
% 0.91/1.11 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.91/1.11 formula_box( 168) 0 0 0 0 0.0 K
% 0.91/1.11 formula( 40) 209 209 0 205 8.0 K
% 0.91/1.11 formula_ptr( 16) 36 36 0 36 0.6 K
% 0.91/1.11 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.91/1.11
% 0.91/1.11 ********** is_delete, can't find end.
% 0.91/1.11 sec)
% 0.91/1.11 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.91/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.91/1.11 input time 0.00
% 0.91/1.11 clausify time 0.00
% 0.91/1.11 process input 0.00
% 0.91/1.11 pick given time 0.00
% 0.91/1.11 para_into time 0.00
% 0.91/1.11 para_from time 0.00
% 0.91/1.11 pre_process time 0.00
% 0.91/1.11 renumber time 0.00
% 0.91/1.11 demod time 0.00
% 0.91/1.11 order equalities 0.00
% 0.91/1.11 unit deleletion 0.00
% 0.91/1.11 factor simplify 0.00
% 0.91/1.11 weigh cl time 0.00
% 0.91/1.11 hints keep time 0.00
% 0.91/1.11 sort lits time 0.00
% 0.91/1.11 forward subsume 0.00
% 0.91/1.11 delete cl time 0.00
% 0.91/1.11 keep cl time 0.00
% 0.91/1.11 hints time 0.00
% 0.91/1.11 print_cl time 0.00
% 0.91/1.11 conflict time 0.00
% 0.91/1.11 new demod time 0.00
% 0.91/1.11 post_process time 0.00
% 0.91/1.11 back demod time 0.00
% 0.91/1.11 back subsume 0.00
% 0.91/1.11 factor time 0.00
% 0.91/1.11 FINDER time 0.00
% 0.91/1.11 unindex time 0.00
% 0.91/1.11
% 0.91/1.11 ----------- soft-scott stats ----------
% 0.91/1.11
% 0.91/1.11 true clauses given 1 (7.1%)
% 0.91/1.11 false clauses given 13
% 0.91/1.11
% 0.91/1.11 FALSE TRUE
% 0.91/1.11 7 0 1
% 0.91/1.11 11 1 0
% 0.91/1.11 13 2 0
% 0.91/1.11 14 2 0
% 0.91/1.11 19 1 0
% 0.91/1.11 21 3 0
% 0.91/1.11 23 8 0
% 0.91/1.11 27 11 0
% 0.91/1.11 29 2 0
% 0.91/1.11 31 6 0
% 0.91/1.11 35 4 0
% 0.91/1.11 53 1 0
% 0.91/1.11 tot: 41 1 (2.4% true)
% 0.91/1.11
% 0.91/1.11
% 0.91/1.11 Model 13 [ 11 1 2211 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.11
% 0.91/1.11 Forward subsumption counts, subsumer:number_subsumed.
% 0.91/1.11 1:0 2:0 3:0 4:0 5:0 6:0 7:0 8:0 9:0 10:0
% 0.91/1.11 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 0.91/1.11 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 0.91/1.11 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 0.91/1.11 41:0 42:0 43:1 44:0 45:0 46:0 47:0 48:1 49:0 50:0
% 0.91/1.11 51:0 52:0 53:1 54:0 55:1 56:1 57:1 58:1 59:0 60:1
% 0.91/1.11 61:0 62:1 63:0 64:1 65:0 66:1 67:0 68:1 69:1 70:1
% 0.91/1.11 71:1 72:1 73:58 74:0 75:0 76:0 77:0 78:0 79:0 80:0
% 0.91/1.11 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 0.91/1.11 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 0.91/1.11 All others: 0.
% 0.91/1.11
% 0.91/1.11 ********** ABNORMAL END **********
% 0.91/1.11
% 0.91/1.11 ********** is_delete, can't find end.
%------------------------------------------------------------------------------