TSTP Solution File: GRP788+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP788+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:31 EDT 2022
% Result : Unknown 0.91s 1.13s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP788+1 : TPTP v8.1.0. Released v7.5.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n027.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 20:23:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.37 ----- Otter 3.2, August 2001 -----
% 0.21/0.37 The process was started by sandbox on n027.cluster.edu,
% 0.21/0.37 Mon Jun 13 20:23:47 2022
% 0.21/0.37 The command was "./sos". The process ID is 15206.
% 0.21/0.37
% 0.21/0.37 set(prolog_style_variables).
% 0.21/0.37 set(auto).
% 0.21/0.37 dependent: set(auto1).
% 0.21/0.37 dependent: set(process_input).
% 0.21/0.37 dependent: clear(print_kept).
% 0.21/0.37 dependent: clear(print_new_demod).
% 0.21/0.37 dependent: clear(print_back_demod).
% 0.21/0.37 dependent: clear(print_back_sub).
% 0.21/0.37 dependent: set(control_memory).
% 0.21/0.37 dependent: assign(max_mem, 12000).
% 0.21/0.37 dependent: assign(pick_given_ratio, 4).
% 0.21/0.37 dependent: assign(stats_level, 1).
% 0.21/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.37 dependent: assign(sos_limit, 5000).
% 0.21/0.37 dependent: assign(max_weight, 60).
% 0.21/0.37 clear(print_given).
% 0.21/0.37
% 0.21/0.37 formula_list(usable).
% 0.21/0.37
% 0.21/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.21/0.37
% 0.21/0.37 All clauses are units, and equality is present; the
% 0.21/0.37 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.21/0.37
% 0.21/0.37 dependent: set(knuth_bendix).
% 0.21/0.37 dependent: set(para_from).
% 0.21/0.37 dependent: set(para_into).
% 0.21/0.37 dependent: clear(para_from_right).
% 0.21/0.37 dependent: clear(para_into_right).
% 0.21/0.37 dependent: set(para_from_vars).
% 0.21/0.37 dependent: set(eq_units_both_ways).
% 0.21/0.37 dependent: set(dynamic_demod_all).
% 0.21/0.37 dependent: set(dynamic_demod).
% 0.21/0.37 dependent: set(order_eq).
% 0.21/0.37 dependent: set(back_demod).
% 0.21/0.37 dependent: set(lrpo).
% 0.21/0.37
% 0.21/0.37 ------------> process usable:
% 0.21/0.37
% 0.21/0.37 ------------> process sos:
% 0.21/0.37 Following clause subsumed by 52 during input processing: 0 [copy,52,flip.1] {-} j2(A,i2(B,j2(C,i2(D,E))))=j2(C,i2(D,j2(A,i2(B,E)))).
% 0.21/0.37 Following clause subsumed by 72 during input processing: 0 [copy,72,flip.1] {-} A=A.
% 0.21/0.37 Following clause subsumed by 45 during input processing: 0 [copy,73,flip.1] {-} i2(A,b(B,m(b(C,m(b(D,m(E,D)),C)),B)))=b(C,m(b(D,m(i2(A,b(B,m(E,B))),D)),C)).
% 0.21/0.37 Following clause subsumed by 53 during input processing: 0 [copy,74,flip.1] {-} l(A,B,j2(C,i1(D,i1(E,F))))=i1(D,i1(E,l(A,B,j2(C,F)))).
% 0.21/0.37 Following clause subsumed by 55 during input processing: 0 [copy,75,flip.1] {-} r(A,B,b(C,m(i2(D,i2(E,F)),C)))=i2(D,i2(E,r(A,B,b(C,m(F,C))))).
% 0.21/0.37 Following clause subsumed by 57 during input processing: 0 [copy,76,flip.1] {-} l(A,B,i2(C,l(D,E,b(F,m(G,F)))))=l(D,E,b(F,m(l(A,B,i2(C,G)),F))).
% 0.21/0.37 Following clause subsumed by 58 during input processing: 0 [copy,77,flip.1] {-} r(A,B,i1(C,l(D,E,j2(F,G))))=l(D,E,j2(F,r(A,B,i1(C,G)))).
% 0.21/0.37 Following clause subsumed by 59 during input processing: 0 [copy,78,flip.1] {-} l(A,B,i1(C,i1(D,l(E,F,i1(G,H)))))=l(E,F,i1(G,l(A,B,i1(C,i1(D,H))))).
% 0.21/0.37 Following clause subsumed by 60 during input processing: 0 [copy,79,flip.1] {-} r(A,B,i2(C,j2(D,r(E,F,i2(G,H)))))=r(E,F,i2(G,r(A,B,i2(C,j2(D,H))))).
% 0.21/0.37 Following clause subsumed by 61 during input processing: 0 [copy,80,flip.1] {-} r(A,B,i1(C,i2(D,l(E,F,i1(G,H)))))=l(E,F,i1(G,r(A,B,i1(C,i2(D,H))))).
% 0.21/0.37 Following clause subsumed by 63 during input processing: 0 [copy,81,flip.1] {-} l(A,B,b(C,m(i2(D,r(E,F,i2(G,H))),C)))=r(E,F,i2(G,l(A,B,b(C,m(i2(D,H),C))))).
% 0.21/0.37 Following clause subsumed by 65 during input processing: 0 [copy,82,flip.1] {-} l(A,B,b(C,m(b(D,m(l(E,F,i1(G,H)),D)),C)))=l(E,F,i1(G,l(A,B,b(C,m(b(D,m(H,D)),C))))).
% 0.21/0.37 Following clause subsumed by 66 during input processing: 0 [copy,83,flip.1] {-} r(A,B,i1(C,j2(D,r(E,F,i2(G,H)))))=r(E,F,i2(G,r(A,B,i1(C,j2(D,H))))).
% 0.21/0.37 Following clause subsumed by 68 during input processing: 0 [copy,84,flip.1] {-} l(A,B,b(C,m(b(D,m(r(E,F,i2(G,H)),D)),C)))=r(E,F,i2(G,l(A,B,b(C,m(b(D,m(H,D)),C))))).
% 0.21/0.37 Following clause subsumed by 70 during input processing: 0 [copy,85,flip.1] {-} l(A,B,j2(C,b(D,m(r(E,F,i1(G,H)),D))))=r(E,F,i1(G,l(A,B,j2(C,b(D,m(H,D)))))).
% 0.21/0.37 Following clause subsumed by 71 during input processing: 0 [copy,86,flip.1] {-} l(A,B,i1(C,i2(D,r(E,F,i1(G,H)))))=r(E,F,i1(G,l(A,B,i1(C,i2(D,H))))).
% 0.21/0.37
% 0.21/0.37 ======= end of input processing =======
% 0.21/0.41
% 0.21/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 -------------- Softie stats --------------
% 0.21/0.41
% 0.21/0.41 UPDATE_STOP: 300
% 0.21/0.41 SFINDER_TIME_LIMIT: 2
% 0.21/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.41 number of clauses in intial UL: 1
% 0.21/0.41 number of clauses initially in problem: 69
% 0.21/0.41 percentage of clauses intially in UL: 1
% 0.21/0.41 percentage of distinct symbols occuring in initial UL: 58
% 0.21/0.41 percent of all initial clauses that are short: 98
% 0.21/0.41 absolute distinct symbol count: 17
% 0.21/0.41 distinct predicate count: 1
% 0.21/0.41 distinct function count: 11
% 0.21/0.41 distinct constant count: 5
% 0.21/0.41
% 0.21/0.41 ---------- no more Softie stats ----------
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41 =========== start of search ===========
% 0.91/1.12
% 0.91/1.12 Model 3 (0.00 seconds, 0 Inserts)
% 0.91/1.12
% 0.91/1.12 Stopped by limit on number of solutions
% 0.91/1.12
% 0.91/1.12 Model 4 (0.00 seconds, 0 Inserts)
% 0.91/1.12
% 0.91/1.12 Stopped by limit on number of solutions
% 0.91/1.12
% 0.91/1.12 Stopped by limit on insertions
% 0.91/1.12
% 0.91/1.12 Model 5 [ 5 1 2894 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.12
% 0.91/1.12 Stopped by limit on insertions
% 0.91/1.12
% 0.91/1.12 Model 6 [ 2 1 2722 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.12
% 0.91/1.12 Stopped by limit on insertions
% 0.91/1.12
% 0.91/1.12 Model 7 [ 13 0 575 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.12
% 0.91/1.12 Stopped by limit on insertions
% 0.91/1.12
% 0.91/1.12 Model 8 [ 6 0 843 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.12
% 0.91/1.12 Stopped by limit on insertions
% 0.91/1.12
% 0.91/1.12 Model 9 [ 8 1 1300 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.12
% 0.91/1.12 Stopped by limit on insertions
% 0.91/1.12
% 0.91/1.12 Model 10 [ 7 0 751 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.12
% 0.91/1.12 Stopped by limit on insertions
% 0.91/1.12
% 0.91/1.12 Model 11 [ 14 1 3319 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.12
% 0.91/1.12 Stopped by limit on insertions
% 0.91/1.12
% 0.91/1.12 Model 12 [ 16 1 2356 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.12
% 0.91/1.12 Stopped by limit on insertions
% 0.91/1.12
% 0.91/1.12 Model 13 [ 11 0 2211 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.12 m(b(A,B),b(b(A,e),e))=i2(A,B).
% 0.91/1.12
% 0.91/1.12 ------------- memory usage ------------
% 0.91/1.12 20 mallocs of 32700 bytes each, 638.7 K.
% 0.91/1.12 type (bytes each) gets frees in use avail bytes
% 0.91/1.12 sym_ent ( 304) 137 0 137 0 40.7 K
% 0.91/1.12 term ( 32) 9933 8564 1369 44 44.2 K
% 0.91/1.12 rel ( 40) 8912 6762 2150 40 85.5 K
% 0.91/1.12 term_ptr ( 16) 11288 1536 9752 0 152.4 K
% 0.91/1.12 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.91/1.12 fpa_head ( 24) 3176 372 2804 0 65.7 K
% 0.91/1.12 fpa_tree ( 56) 300 300 0 13 0.7 K
% 0.91/1.12 context (1288) 632 632 0 4 5.0 K
% 0.91/1.12 trail ( 24) 746 746 0 5 0.1 K
% 0.91/1.12 imd_tree ( 32) 223 44 179 0 5.6 K
% 0.91/1.12 imd_pos (4024) 1349 1349 0 4 15.7 K
% 0.91/1.12 is_tree ( 24) 1712 486 1226 0 28.7 K
% 0.91/1.12 is_pos (2424) 605 605 0 20 47.3 K
% 0.91/1.12 fsub_pos ( 16) 73 73 0 1 0.0 K
% 0.91/1.12 literal ( 32) 231 75 156 0 4.9 K
% 0.91/1.12 clause ( 88) 231 75 156 0 13.4 K
% 0.91/1.12 list ( 272) 46 39 7 2 2.4 K
% 0.91/1.12 clash_nd ( 80) 0 0 0 0 0.0 K
% 0.91/1.12 clause_ptr ( 16) 235 97 138 4 2.2 K
% 0.91/1.12 int_ptr ( 16) 1197 683 514 0 8.0 K
% 0.91/1.12 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.91/1.12 link_node ( 120) 0 0 0 0 0.0 K
% 0.91/1.12 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.91/1.12 formula_box( 168) 0 0 0 0 0.0 K
% 0.91/1.12 formula( 40) 208 208 0 204 8.0 K
% 0.91/1.12 formula_ptr( 16) 36 36 0 36 0.6 K
% 0.91/1.12 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.91/1.12
% 0.91/1.12 ********** is_delete, can't find end.
% 0.91/1.12 sec)
% 0.91/1.12 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.91/1.12 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.91/1.12 input time 0.00
% 0.91/1.12 clausify time 0.00
% 0.91/1.12 process input 0.00
% 0.91/1.12 pick given time 0.00
% 0.91/1.12 para_into time 0.00
% 0.91/1.12 para_from time 0.00
% 0.91/1.12 pre_process time 0.00
% 0.91/1.12 renumber time 0.00
% 0.91/1.12 demod time 0.00
% 0.91/1.12 order equalities 0.00
% 0.91/1.12 unit deleletion 0.00
% 0.91/1.12 factor simplify 0.00
% 0.91/1.12 weigh cl time 0.00
% 0.91/1.12 hints keep time 0.00
% 0.91/1.12 sort lits time 0.00
% 0.91/1.12 forward subsume 0.00
% 0.91/1.12 delete cl time 0.00
% 0.91/1.12 keep cl time 0.00
% 0.91/1.12 hints time 0.00
% 0.91/1.12 print_cl time 0.00
% 0.91/1.12 conflict time 0.00
% 0.91/1.12 new demod time 0.00
% 0.91/1.12 post_process time 0.00
% 0.91/1.12 back demod time 0.00
% 0.91/1.12 back subsume 0.00
% 0.91/1.12 factor time 0.00
% 0.91/1.12 FINDER time 0.00
% 0.91/1.12 unindex time 0.00
% 0.91/1.12
% 0.91/1.12 ----------- soft-scott stats ----------
% 0.91/1.12
% 0.91/1.12 true clauses given 1 (7.1%)
% 0.91/1.12 false clauses given 13
% 0.91/1.12
% 0.91/1.12 FALSE TRUE
% 0.91/1.12 7 0 1
% 0.91/1.12 11 1 0
% 0.91/1.12 13 2 0
% 0.91/1.12 14 2 0
% 0.91/1.12 15 1 0
% 0.91/1.12 17 1 0
% 0.91/1.12 19 1 0
% 0.91/1.12 21 2 0
% 0.91/1.12 23 4 0
% 0.91/1.12 24 1 0
% 0.91/1.12 25 2 0
% 0.91/1.12 27 13 0
% 0.91/1.12 31 6 0
% 0.91/1.12 35 4 0
% 0.91/1.12 tot: 40 1 (2.4% true)
% 0.91/1.12
% 0.91/1.12
% 0.91/1.12 Model 13 [ 11 0 2211 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.12
% 0.91/1.12 Forward subsumption counts, subsumer:number_subsumed.
% 0.91/1.12 1:0 2:0 3:0 4:0 5:0 6:0 7:0 8:0 9:0 10:0
% 0.91/1.12 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 0.91/1.12 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 0.91/1.12 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 0.91/1.12 41:0 42:0 43:0 44:0 45:1 46:0 47:0 48:0 49:0 50:0
% 0.91/1.12 51:0 52:1 53:1 54:0 55:1 56:0 57:1 58:1 59:1 60:1
% 0.91/1.12 61:1 62:0 63:1 64:0 65:1 66:1 67:0 68:1 69:0 70:1
% 0.91/1.12 71:1 72:58 73:0 74:0 75:0 76:0 77:0 78:0 79:0 80:0
% 0.91/1.12 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 0.91/1.12 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 0.91/1.12 All others: 0.
% 0.91/1.12
% 0.91/1.12 ********** ABNORMAL END **********
% 0.91/1.12
% 0.91/1.12 ********** is_delete, can't find end.
%------------------------------------------------------------------------------