TSTP Solution File: GRP820+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP820+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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:38 EDT 2022
% Result : Unknown 0.81s 1.05s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.07 % Problem : GRP820+1 : TPTP v8.1.0. Released v7.5.0.
% 0.01/0.07 % Command : sos-script %s
% 0.07/0.26 % Computer : n025.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Mon Jun 13 20:30:24 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.10/0.28 ----- Otter 3.2, August 2001 -----
% 0.10/0.28 The process was started by sandbox2 on n025.cluster.edu,
% 0.10/0.28 Mon Jun 13 20:30:24 2022
% 0.10/0.28 The command was "./sos". The process ID is 20975.
% 0.10/0.28
% 0.10/0.28 set(prolog_style_variables).
% 0.10/0.28 set(auto).
% 0.10/0.28 dependent: set(auto1).
% 0.10/0.28 dependent: set(process_input).
% 0.10/0.28 dependent: clear(print_kept).
% 0.10/0.28 dependent: clear(print_new_demod).
% 0.10/0.28 dependent: clear(print_back_demod).
% 0.10/0.28 dependent: clear(print_back_sub).
% 0.10/0.28 dependent: set(control_memory).
% 0.10/0.28 dependent: assign(max_mem, 12000).
% 0.10/0.28 dependent: assign(pick_given_ratio, 4).
% 0.10/0.28 dependent: assign(stats_level, 1).
% 0.10/0.28 dependent: assign(pick_semantic_ratio, 3).
% 0.10/0.28 dependent: assign(sos_limit, 5000).
% 0.10/0.28 dependent: assign(max_weight, 60).
% 0.10/0.28 clear(print_given).
% 0.10/0.28
% 0.10/0.28 formula_list(usable).
% 0.10/0.28
% 0.10/0.28 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.10/0.28
% 0.10/0.28 All clauses are units, and equality is present; the
% 0.10/0.28 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.10/0.28
% 0.10/0.28 dependent: set(knuth_bendix).
% 0.10/0.28 dependent: set(para_from).
% 0.10/0.28 dependent: set(para_into).
% 0.10/0.28 dependent: clear(para_from_right).
% 0.10/0.28 dependent: clear(para_into_right).
% 0.10/0.28 dependent: set(para_from_vars).
% 0.10/0.28 dependent: set(eq_units_both_ways).
% 0.10/0.28 dependent: set(dynamic_demod_all).
% 0.10/0.28 dependent: set(dynamic_demod).
% 0.10/0.28 dependent: set(order_eq).
% 0.10/0.28 dependent: set(back_demod).
% 0.10/0.28 dependent: set(lrpo).
% 0.10/0.28
% 0.10/0.28 ------------> process usable:
% 0.10/0.28
% 0.10/0.28 ------------> process sos:
% 0.10/0.28 Following clause subsumed by 49 during input processing: 0 [copy,49,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.10/0.28 Following clause subsumed by 77 during input processing: 0 [copy,77,flip.1] {-} A=A.
% 0.10/0.28 Following clause subsumed by 55 during input processing: 0 [copy,78,flip.1] {-} l(A,B,i2(C,i1(D,i1(E,F))))=i1(D,i1(E,l(A,B,i2(C,F)))).
% 0.10/0.28 Following clause subsumed by 56 during input processing: 0 [copy,79,flip.1] {-} l(A,B,i1(C,i1(D,i1(E,F))))=i1(D,i1(E,l(A,B,i1(C,F)))).
% 0.10/0.28 Following clause subsumed by 58 during input processing: 0 [copy,80,flip.1] {-} l(A,B,j2(C,l(D,E,b(F,m(G,F)))))=l(D,E,b(F,m(l(A,B,j2(C,G)),F))).
% 0.10/0.28 Following clause subsumed by 59 during input processing: 0 [copy,81,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.10/0.28 Following clause subsumed by 61 during input processing: 0 [copy,82,flip.1] {-} l(A,B,i1(C,b(D,m(l(E,F,j2(G,H)),D))))=l(E,F,j2(G,l(A,B,i1(C,b(D,m(H,D)))))).
% 0.10/0.28 Following clause subsumed by 63 during input processing: 0 [copy,83,flip.1] {-} r(A,B,j2(C,i2(D,l(E,F,b(G,m(H,G))))))=l(E,F,b(G,m(r(A,B,j2(C,i2(D,H))),G))).
% 0.10/0.28 Following clause subsumed by 65 during input processing: 0 [copy,84,flip.1] {-} r(A,B,i2(C,b(D,m(l(E,F,b(G,m(H,G))),D))))=l(E,F,b(G,m(r(A,B,i2(C,b(D,m(H,D)))),G))).
% 0.10/0.28 Following clause subsumed by 67 during input processing: 0 [copy,85,flip.1] {-} r(A,B,b(C,m(i1(D,r(E,F,i2(G,H))),C)))=r(E,F,i2(G,r(A,B,b(C,m(i1(D,H),C))))).
% 0.10/0.28 Following clause subsumed by 68 during input processing: 0 [copy,86,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.10/0.28 Following clause subsumed by 70 during input processing: 0 [copy,87,flip.1] {-} l(A,B,i2(C,b(D,m(l(E,F,i1(G,H)),D))))=l(E,F,i1(G,l(A,B,i2(C,b(D,m(H,D)))))).
% 0.10/0.28 Following clause subsumed by 72 during input processing: 0 [copy,88,flip.1] {-} l(A,B,b(C,m(i1(D,r(E,F,b(G,m(H,G)))),C)))=r(E,F,b(G,m(l(A,B,b(C,m(i1(D,H),C))),G))).
% 0.10/0.28 Following clause subsumed by 74 during input processing: 0 [copy,89,flip.1] {-} l(A,B,i1(C,b(D,m(l(E,F,i1(G,H)),D))))=l(E,F,i1(G,l(A,B,i1(C,b(D,m(H,D)))))).
% 0.10/0.28 Following clause subsumed by 76 during input processing: 0 [copy,90,flip.1] {-} l(A,B,i2(C,i2(D,r(E,F,b(G,m(H,G))))))=r(E,F,b(G,m(l(A,B,i2(C,i2(D,H))),G))).
% 0.10/0.28
% 0.10/0.28 ======= end of input processing =======
% 0.10/0.33
% 0.10/0.33 Model 1 (0.00 seconds, 0 Inserts)
% 0.10/0.33
% 0.10/0.33 Stopped by limit on number of solutions
% 0.10/0.33
% 0.10/0.33
% 0.10/0.33 -------------- Softie stats --------------
% 0.10/0.33
% 0.10/0.33 UPDATE_STOP: 300
% 0.10/0.33 SFINDER_TIME_LIMIT: 2
% 0.10/0.33 SHORT_CLAUSE_CUTOFF: 4
% 0.10/0.33 number of clauses in intial UL: 1
% 0.10/0.33 number of clauses initially in problem: 69
% 0.10/0.33 percentage of clauses intially in UL: 1
% 0.10/0.33 percentage of distinct symbols occuring in initial UL: 61
% 0.10/0.33 percent of all initial clauses that are short: 98
% 0.10/0.33 absolute distinct symbol count: 18
% 0.10/0.33 distinct predicate count: 1
% 0.10/0.33 distinct function count: 11
% 0.10/0.33 distinct constant count: 6
% 0.10/0.33
% 0.10/0.33 ---------- no more Softie stats ----------
% 0.10/0.33
% 0.10/0.33
% 0.10/0.33
% 0.10/0.33 Model 2 (0.00 seconds, 0 Inserts)
% 0.10/0.33
% 0.10/0.33 Stopped by limit on number of solutions
% 0.10/0.33
% 0.10/0.33 =========== start of search ===========
% 0.81/1.05
% 0.81/1.05 Model 3 (0.00 seconds, 0 Inserts)
% 0.81/1.05
% 0.81/1.05 Stopped by limit on number of solutions
% 0.81/1.05
% 0.81/1.05 Model 4 (0.00 seconds, 0 Inserts)
% 0.81/1.05
% 0.81/1.05 Stopped by limit on number of solutions
% 0.81/1.05
% 0.81/1.05 Stopped by limit on insertions
% 0.81/1.05
% 0.81/1.05 Model 5 [ 5 1 4294 ] (0.00 seconds, 250000 Inserts)
% 0.81/1.05
% 0.81/1.05 Stopped by limit on insertions
% 0.81/1.05
% 0.81/1.05 Model 6 [ 5 1 726 ] (0.00 seconds, 250000 Inserts)
% 0.81/1.05
% 0.81/1.05 Stopped by limit on insertions
% 0.81/1.05
% 0.81/1.05 Model 7 [ 2 1 1159 ] (0.00 seconds, 250000 Inserts)
% 0.81/1.05
% 0.81/1.05 Stopped by limit on insertions
% 0.81/1.05
% 0.81/1.05 Model 8 [ 8 1 2204 ] (0.00 seconds, 250000 Inserts)
% 0.81/1.05
% 0.81/1.05 Stopped by limit on insertions
% 0.81/1.05
% 0.81/1.05 Model 9 [ 9 0 642 ] (0.00 seconds, 250000 Inserts)
% 0.81/1.05
% 0.81/1.05 Stopped by limit on insertions
% 0.81/1.05
% 0.81/1.05 Model 10 [ 19 1 2297 ] (0.00 seconds, 250000 Inserts)
% 0.81/1.05
% 0.81/1.05 Stopped by limit on insertions
% 0.81/1.05
% 0.81/1.05 Model 11 [ 15 1 3631 ] (0.00 seconds, 250000 Inserts)
% 0.81/1.05
% 0.81/1.05 Stopped by limit on insertions
% 0.81/1.05
% 0.81/1.05 Model 12 [ 10 0 516 ] (0.00 seconds, 250000 Inserts)
% 0.81/1.05
% 0.81/1.05 Stopped by limit on insertions
% 0.81/1.05
% 0.81/1.05 Model 13 [ 17 1 2008 ] (0.00 seconds, 250000 Inserts)
% 0.81/1.05 m(b(A,B),b(b(A,e),e))=i2(A,B).
% 0.81/1.05
% 0.81/1.05 ------------- memory usage ------------
% 0.81/1.05 20 mallocs of 32700 bytes each, 638.7 K.
% 0.81/1.05 type (bytes each) gets frees in use avail bytes
% 0.81/1.05 sym_ent ( 304) 139 0 139 0 41.3 K
% 0.81/1.05 term ( 32) 10607 9311 1296 34 41.6 K
% 0.81/1.05 rel ( 40) 9542 7446 2096 29 83.0 K
% 0.81/1.05 term_ptr ( 16) 11120 1459 9661 0 151.0 K
% 0.81/1.05 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.81/1.05 fpa_head ( 24) 3138 335 2803 0 65.7 K
% 0.81/1.05 fpa_tree ( 56) 307 307 0 15 0.8 K
% 0.81/1.05 context (1288) 638 638 0 4 5.0 K
% 0.81/1.05 trail ( 24) 790 790 0 5 0.1 K
% 0.81/1.05 imd_tree ( 32) 279 53 226 0 7.1 K
% 0.81/1.05 imd_pos (4024) 1105 1105 0 5 19.6 K
% 0.81/1.05 is_tree ( 24) 1603 440 1163 0 27.3 K
% 0.81/1.05 is_pos (2424) 611 611 0 20 47.3 K
% 0.81/1.05 fsub_pos ( 16) 80 80 0 1 0.0 K
% 0.81/1.05 literal ( 32) 238 82 156 0 4.9 K
% 0.81/1.05 clause ( 88) 238 82 156 0 13.4 K
% 0.81/1.05 list ( 272) 46 39 7 2 2.4 K
% 0.81/1.05 clash_nd ( 80) 0 0 0 0 0.0 K
% 0.81/1.05 clause_ptr ( 16) 241 99 142 4 2.3 K
% 0.81/1.05 int_ptr ( 16) 1283 759 524 0 8.2 K
% 0.81/1.05 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.81/1.05 link_node ( 120) 0 0 0 0 0.0 K
% 0.81/1.05 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.81/1.05 formula_box( 168) 0 0 0 0 0.0 K
% 0.81/1.05 formula( 40) 211 211 0 206 8.0 K
% 0.81/1.05 formula_ptr( 16) 36 36 0 36 0.6 K
% 0.81/1.05 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.81/1.05
% 0.81/1.05 ********** is_delete, can't find end.
% 0.81/1.05 sec)
% 0.81/1.05 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.81/1.05 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.81/1.05 input time 0.00
% 0.81/1.05 clausify time 0.00
% 0.81/1.05 process input 0.00
% 0.81/1.05 pick given time 0.00
% 0.81/1.05 para_into time 0.00
% 0.81/1.05 para_from time 0.00
% 0.81/1.05 pre_process time 0.00
% 0.81/1.05 renumber time 0.00
% 0.81/1.05 demod time 0.00
% 0.81/1.05 order equalities 0.00
% 0.81/1.05 unit deleletion 0.00
% 0.81/1.05 factor simplify 0.00
% 0.81/1.05 weigh cl time 0.00
% 0.81/1.05 hints keep time 0.00
% 0.81/1.05 sort lits time 0.00
% 0.81/1.05 forward subsume 0.00
% 0.81/1.05 delete cl time 0.00
% 0.81/1.05 keep cl time 0.00
% 0.81/1.05 hints time 0.00
% 0.81/1.05 print_cl time 0.00
% 0.81/1.05 conflict time 0.00
% 0.81/1.05 new demod time 0.00
% 0.81/1.05 post_process time 0.00
% 0.81/1.05 back demod time 0.00
% 0.81/1.05 back subsume 0.00
% 0.81/1.05 factor time 0.00
% 0.81/1.05 FINDER time 0.00
% 0.81/1.05 unindex time 0.00
% 0.81/1.05
% 0.81/1.05 ----------- soft-scott stats ----------
% 0.81/1.05
% 0.81/1.05 true clauses given 2 (13.3%)
% 0.81/1.05 false clauses given 13
% 0.81/1.05
% 0.81/1.05 FALSE TRUE
% 0.81/1.05 11 1 0
% 0.81/1.05 13 2 0
% 0.81/1.05 14 2 0
% 0.81/1.05 19 2 0
% 0.81/1.05 21 5 0
% 0.81/1.05 23 5 0
% 0.81/1.05 27 5 0
% 0.81/1.05 31 12 0
% 0.81/1.05 35 4 0
% 0.81/1.05 53 1 0
% 0.81/1.05 tot: 39 0 (0.0% true)
% 0.81/1.05
% 0.81/1.05
% 0.81/1.05 Model 13 [ 17 1 2008 ] (0.00 seconds, 250000 Inserts)
% 0.81/1.05
% 0.81/1.05 Forward subsumption counts, subsumer:number_subsumed.
% 0.81/1.05 1:0 2:0 3:0 4:0 5:0 6:0 7:0 8:0 9:0 10:0
% 0.81/1.05 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 0.81/1.05 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 0.81/1.05 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 0.81/1.05 41:0 42:0 43:0 44:0 45:0 46:0 47:0 48:0 49:1 50:0
% 0.81/1.05 51:0 52:0 53:0 54:0 55:1 56:1 57:0 58:1 59:1 60:0
% 0.81/1.05 61:1 62:0 63:1 64:0 65:1 66:0 67:1 68:1 69:0 70:1
% 0.81/1.05 71:0 72:1 73:0 74:1 75:0 76:1 77:66 78:0 79:0 80:0
% 0.81/1.05 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 0.81/1.05 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 0.81/1.05 All others: 0.
% 0.81/1.05
% 0.81/1.05 ********** ABNORMAL END **********
% 0.81/1.05
% 0.81/1.05 ********** is_delete, can't find end.
%------------------------------------------------------------------------------