TSTP Solution File: GRP784+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP784+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:30 EDT 2022
% Result : Unknown 0.90s 1.14s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP784+1 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : sos-script %s
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 12:29:48 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox2 on n011.cluster.edu,
% 0.14/0.37 Mon Jun 13 12:29:48 2022
% 0.14/0.37 The command was "./sos". The process ID is 27955.
% 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=1, equality=1, symmetry=0, max_lits=1.
% 0.14/0.37
% 0.14/0.37 All clauses are units, and equality is present; the
% 0.14/0.37 strategy will be Knuth-Bendix with positive clauses in sos.
% 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
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37 Following clause subsumed by 51 during input processing: 0 [demod,15,15,15,15,15,15] {-} 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.14/0.37 Following clause subsumed by 76 during input processing: 0 [copy,76,flip.1] {-} A=A.
% 0.14/0.37 Following clause subsumed by 47 during input processing: 0 [copy,77,flip.1] {-} b(A,m(i1(B,i2(C,b(D,m(E,D)))),A))=i2(C,b(D,m(b(A,m(i1(B,E),A)),D))).
% 0.14/0.37 Following clause subsumed by 49 during input processing: 0 [copy,78,flip.1] {-} b(A,m(b(B,m(j2(C,b(D,m(E,D))),B)),A))=j2(C,b(D,m(b(A,m(b(B,m(E,B)),A)),D))).
% 0.14/0.37 Following clause subsumed by 51 during input processing: 0 [copy,79,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.14/0.37 Following clause subsumed by 52 during input processing: 0 [copy,80,flip.1] {-} l(A,B,i2(C,i1(D,i2(E,F))))=i1(D,i2(E,l(A,B,i2(C,F)))).
% 0.14/0.37 Following clause subsumed by 57 during input processing: 0 [copy,81,flip.1] {-} r(A,B,b(C,m(r(D,E,i2(F,G)),C)))=r(D,E,i2(F,r(A,B,b(C,m(G,C))))).
% 0.14/0.37 Following clause subsumed by 59 during input processing: 0 [copy,82,flip.1] {-} r(A,B,i1(C,r(D,E,b(F,m(G,F)))))=r(D,E,b(F,m(r(A,B,i1(C,G)),F))).
% 0.14/0.37 Following clause subsumed by 61 during input processing: 0 [copy,83,flip.1] {-} l(A,B,i1(C,b(D,m(l(E,F,b(G,m(H,G))),D))))=l(E,F,b(G,m(l(A,B,i1(C,b(D,m(H,D)))),G))).
% 0.14/0.37 Following clause subsumed by 63 during input processing: 0 [copy,84,flip.1] {-} r(A,B,i2(C,i2(D,r(E,F,b(G,m(H,G))))))=r(E,F,b(G,m(r(A,B,i2(C,i2(D,H))),G))).
% 0.14/0.37 Following clause subsumed by 64 during input processing: 0 [copy,85,flip.1] {-} r(A,B,i1(C,i1(D,r(E,F,i2(G,H)))))=r(E,F,i2(G,r(A,B,i1(C,i1(D,H))))).
% 0.14/0.37 Following clause subsumed by 65 during input processing: 0 [copy,86,flip.1] {-} l(A,B,i1(C,i2(D,l(E,F,i2(G,H)))))=l(E,F,i2(G,l(A,B,i1(C,i2(D,H))))).
% 0.14/0.37 Following clause subsumed by 67 during input processing: 0 [copy,87,flip.1] {-} r(A,B,i2(C,b(D,m(l(E,F,i1(G,H)),D))))=l(E,F,i1(G,r(A,B,i2(C,b(D,m(H,D)))))).
% 0.14/0.37 Following clause subsumed by 69 during input processing: 0 [copy,88,flip.1] {-} r(A,B,i1(C,b(D,m(r(E,F,b(G,m(H,G))),D))))=r(E,F,b(G,m(r(A,B,i1(C,b(D,m(H,D)))),G))).
% 0.14/0.37 Following clause subsumed by 71 during input processing: 0 [copy,89,flip.1] {-} r(A,B,i1(C,b(D,m(l(E,F,b(G,m(H,G))),D))))=l(E,F,b(G,m(r(A,B,i1(C,b(D,m(H,D)))),G))).
% 0.14/0.37 Following clause subsumed by 73 during input processing: 0 [copy,90,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.14/0.37 Following clause subsumed by 75 during input processing: 0 [copy,91,flip.1] {-} r(A,B,b(C,m(b(D,m(r(E,F,b(G,m(H,G))),D)),C)))=r(E,F,b(G,m(r(A,B,b(C,m(b(D,m(H,D)),C))),G))).
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.22/0.42
% 0.22/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.22/0.42
% 0.22/0.42 Stopped by limit on number of solutions
% 0.22/0.42
% 0.22/0.42
% 0.22/0.42 -------------- Softie stats --------------
% 0.22/0.42
% 0.22/0.42 UPDATE_STOP: 300
% 0.22/0.42 SFINDER_TIME_LIMIT: 2
% 0.22/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.22/0.42 number of clauses in intial UL: 1
% 0.22/0.42 number of clauses initially in problem: 68
% 0.22/0.42 percentage of clauses intially in UL: 1
% 0.22/0.42 percentage of distinct symbols occuring in initial UL: 58
% 0.22/0.42 percent of all initial clauses that are short: 98
% 0.22/0.42 absolute distinct symbol count: 17
% 0.22/0.42 distinct predicate count: 1
% 0.22/0.42 distinct function count: 11
% 0.22/0.42 distinct constant count: 5
% 0.22/0.42
% 0.22/0.42 ---------- no more Softie stats ----------
% 0.22/0.42
% 0.22/0.42
% 0.22/0.42
% 0.22/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.22/0.42
% 0.22/0.42 Stopped by limit on number of solutions
% 0.22/0.42
% 0.22/0.42 =========== start of search ===========
% 0.22/0.54
% 0.22/0.54
% 0.22/0.54 Changing weight limit from 60 to 63.
% 0.22/0.54
% 0.22/0.54 Model 3 (0.00 seconds, 0 Inserts)
% 0.22/0.54
% 0.22/0.54 Stopped by limit on number of solutions
% 0.22/0.54
% 0.22/0.54 Model 4 (0.00 seconds, 0 Inserts)
% 0.22/0.54
% 0.22/0.54 Stopped by limit on number of solutions
% 0.22/0.54
% 0.22/0.54 Stopped by limit on insertions
% 0.22/0.54
% 0.22/0.54 Model 5 [ 5 1 2894 ] (0.00 seconds, 250000 Inserts)
% 0.22/0.54
% 0.22/0.54 Resetting weight limit to 63 after 5 givens.
% 0.22/0.54
% 0.90/1.13
% 0.90/1.13 Stopped by limit on insertions
% 0.90/1.13
% 0.90/1.13 Model 6 [ 2 0 2722 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.13
% 0.90/1.13 Stopped by limit on insertions
% 0.90/1.13
% 0.90/1.13 Model 7 [ 13 0 575 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.13
% 0.90/1.13 Stopped by limit on insertions
% 0.90/1.13
% 0.90/1.13 Model 8 [ 6 0 843 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.13
% 0.90/1.13 Stopped by limit on insertions
% 0.90/1.13
% 0.90/1.13 Model 9 [ 8 1 1300 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.13
% 0.90/1.13 Stopped by limit on insertions
% 0.90/1.13
% 0.90/1.13 Model 10 [ 7 0 751 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.13
% 0.90/1.13 Stopped by limit on insertions
% 0.90/1.13
% 0.90/1.13 Model 11 [ 14 1 3319 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.13
% 0.90/1.13 Stopped by limit on insertions
% 0.90/1.13
% 0.90/1.13 Model 12 [ 16 1 2356 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.13
% 0.90/1.13 Stopped by limit on insertions
% 0.90/1.13
% 0.90/1.13 Model 13 [ 11 1 2211 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.13 m(b(A,B),b(b(A,e),e))=i2(A,B).
% 0.90/1.13
% 0.90/1.13 ------------- memory usage ------------
% 0.90/1.13 21 mallocs of 32700 bytes each, 670.6 K.
% 0.90/1.13 type (bytes each) gets frees in use avail bytes
% 0.90/1.13 sym_ent ( 304) 137 0 137 0 40.7 K
% 0.90/1.13 term ( 32) 10818 9533 1285 48 41.7 K
% 0.90/1.13 rel ( 40) 9807 7628 2179 44 86.8 K
% 0.90/1.13 term_ptr ( 16) 12902 1405 11497 0 179.6 K
% 0.90/1.13 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.90/1.13 fpa_head ( 24) 3285 317 2968 0 69.6 K
% 0.90/1.13 fpa_tree ( 56) 299 299 0 13 0.7 K
% 0.90/1.13 context (1288) 627 627 0 4 5.0 K
% 0.90/1.13 trail ( 24) 823 823 0 6 0.1 K
% 0.90/1.13 imd_tree ( 32) 249 42 207 0 6.5 K
% 0.90/1.13 imd_pos (4024) 1370 1370 0 5 19.6 K
% 0.90/1.13 is_tree ( 24) 1831 426 1405 0 32.9 K
% 0.90/1.13 is_pos (2424) 664 664 0 22 52.1 K
% 0.90/1.13 fsub_pos ( 16) 74 74 0 1 0.0 K
% 0.90/1.13 literal ( 32) 228 75 153 0 4.8 K
% 0.90/1.13 clause ( 88) 228 75 153 0 13.1 K
% 0.90/1.13 list ( 272) 46 39 7 2 2.4 K
% 0.90/1.13 clash_nd ( 80) 0 0 0 0 0.0 K
% 0.90/1.13 clause_ptr ( 16) 234 92 142 2 2.2 K
% 0.90/1.13 int_ptr ( 16) 1240 668 572 0 8.9 K
% 0.90/1.13 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.90/1.13 link_node ( 120) 0 0 0 0 0.0 K
% 0.90/1.13 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.90/1.13 formula_box( 168) 0 0 0 0 0.0 K
% 0.90/1.13 formula( 40) 209 209 0 205 8.0 K
% 0.90/1.13 formula_ptr( 16) 36 36 0 36 0.6 K
% 0.90/1.13 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.90/1.13
% 0.90/1.13 ********** is_delete, can't find end.
% 0.90/1.13 _into time 0.00
% 0.90/1.13 para_from time 0.00
% 0.90/1.13 pre_process time 0.00
% 0.90/1.13 renumber time 0.00
% 0.90/1.13 demod time 0.00
% 0.90/1.13 order equalities 0.00
% 0.90/1.13 unit deleletion 0.00
% 0.90/1.13 factor simplify 0.00
% 0.90/1.13 weigh cl time 0.00
% 0.90/1.13 hints keep time 0.00
% 0.90/1.13 sort lits time 0.00
% 0.90/1.13 forward subsume 0.00
% 0.90/1.13 delete cl time 0.00
% 0.90/1.13 keep cl time 0.00
% 0.90/1.13 hints time 0.00
% 0.90/1.13 print_cl time 0.00
% 0.90/1.13 conflict time 0.00
% 0.90/1.13 new demod time 0.00
% 0.90/1.13 post_process time 0.00
% 0.90/1.13 back demod time 0.00
% 0.90/1.13 back subsume 0.00
% 0.90/1.13 factor time 0.00
% 0.90/1.13 FINDER time 0.00
% 0.90/1.13 unindex time 0.00
% 0.90/1.13
% 0.90/1.13 ----------- soft-scott stats ----------
% 0.90/1.13
% 0.90/1.13 true clauses given 1 (7.1%)
% 0.90/1.13 false clauses given 13
% 0.90/1.13
% 0.90/1.13 FALSE TRUE
% 0.90/1.13 7 0 1
% 0.90/1.13 11 1 0
% 0.90/1.13 13 2 0
% 0.90/1.13 14 2 0
% 0.90/1.13 19 1 0
% 0.90/1.13 21 3 0
% 0.90/1.13 25 1 0
% 0.90/1.13 27 11 0
% 0.90/1.13 31 8 0
% 0.90/1.13 35 8 0
% 0.90/1.13 39 2 0
% 0.90/1.13 63 1 0
% 0.90/1.13 tot: 40 1 (2.4% true)
% 0.90/1.13
% 0.90/1.13
% 0.90/1.13 Model 13 [ 11 1 2211 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.13
% 0.90/1.13 Forward subsumption counts, subsumer:number_subsumed.
% 0.90/1.13 1:0 2:0 3:0 4:0 5:0 6:0 7:0 8:0 9:0 10:0
% 0.90/1.13 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 0.90/1.13 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 0.90/1.13 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 0.90/1.13 41:0 42:0 43:0 44:0 45:0 46:0 47:1 48:0 49:1 50:0
% 0.90/1.13 51:2 52:1 53:0 54:0 55:0 56:0 57:1 58:0 59:1 60:0
% 0.90/1.13 61:1 62:0 63:1 64:1 65:1 66:0 67:1 68:0 69:1 70:0
% 0.90/1.13 71:1 72:0 73:1 74:0 75:1 76:58 77:0 78:0 79:0 80:0
% 0.90/1.13 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 0.90/1.13 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 0.90/1.13 All others: 0.
% 0.90/1.13
% 0.90/1.13 ********** ABNORMAL END **********
% 0.90/1.13
% 0.90/1.13 ********** is_delete, can't find end.
%------------------------------------------------------------------------------