TSTP Solution File: GRP191-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP191-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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:42:13 EDT 2022
% Result : Unknown 0.45s 0.64s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP191-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/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 23:22:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n027.cluster.edu,
% 0.13/0.36 Mon Jun 13 23:22:47 2022
% 0.13/0.36 The command was "./sos". The process ID is 9991.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.13/0.36
% 0.13/0.36 All clauses are units, and equality is present; the
% 0.13/0.36 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 0.13/0.36 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] {-} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.13/0.36 Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 1
% 0.19/0.40 number of clauses initially in problem: 32
% 0.19/0.40 percentage of clauses intially in UL: 3
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 62
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 8
% 0.19/0.40 distinct predicate count: 1
% 0.19/0.40 distinct function count: 4
% 0.19/0.40 distinct constant count: 3
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.45/0.64
% 0.45/0.64 Model 3 (0.00 seconds, 0 Inserts)
% 0.45/0.64
% 0.45/0.64 Stopped by limit on number of solutions
% 0.45/0.64
% 0.45/0.64 Model 4 (0.00 seconds, 0 Inserts)
% 0.45/0.64
% 0.45/0.64 Stopped by limit on number of solutions
% 0.45/0.64
% 0.45/0.64 Model 5 (0.00 seconds, 0 Inserts)
% 0.45/0.64
% 0.45/0.64 Stopped by limit on number of solutions
% 0.45/0.64
% 0.45/0.64 Model 6 (0.00 seconds, 0 Inserts)
% 0.45/0.64
% 0.45/0.64 Stopped by limit on number of solutions
% 0.45/0.64
% 0.45/0.64 Stopped by limit on insertions
% 0.45/0.64
% 0.45/0.64 Model 7 [ 1 1 305 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.64
% 0.45/0.64 Stopped by limit on insertions
% 0.45/0.64
% 0.45/0.64 Model 8 [ 1 1 210 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.64
% 0.45/0.64 Model 9 (0.00 seconds, 250000 Inserts)
% 0.45/0.64
% 0.45/0.64 Stopped by limit on number of solutions
% 0.45/0.64
% 0.45/0.64 Model 10 (0.00 seconds, 250000 Inserts)
% 0.45/0.64
% 0.45/0.64 Stopped by limit on number of solutions
% 0.45/0.64
% 0.45/0.64 Model 11 (0.00 seconds, 250000 Inserts)
% 0.45/0.64
% 0.45/0.64 Stopped by limit on number of solutions
% 0.45/0.64 greatest_lower_bound(A,greatest_lower_bound(B,greatest_lower_bound(A,B)))=greatest_lower_bound(A,B).
% 0.45/0.64
% 0.45/0.64 ------------- memory usage ------------
% 0.45/0.64 22 mallocs of 32700 bytes each, 702.5 K.
% 0.45/0.64 type (bytes each) gets frees in use avail bytes
% 0.45/0.64 sym_ent ( 304) 110 0 110 0 32.7 K
% 0.45/0.64 term ( 32) 13617 12117 1500 22 47.6 K
% 0.45/0.64 rel ( 40) 13168 10566 2602 18 102.3 K
% 0.45/0.64 term_ptr ( 16) 10980 619 10361 18 162.2 K
% 0.45/0.64 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.45/0.64 fpa_head ( 24) 1586 10 1576 5 37.1 K
% 0.45/0.64 fpa_tree ( 56) 2684 2684 0 15 0.8 K
% 0.45/0.64 context (1288) 2589 2589 0 4 5.0 K
% 0.45/0.64 trail ( 24) 2875 2875 0 4 0.1 K
% 0.45/0.64 imd_tree ( 32) 935 28 907 21 29.0 K
% 0.45/0.64 imd_pos (4024) 8026 8026 0 8 31.4 K
% 0.45/0.64 is_tree ( 24) 1786 54 1732 22 41.1 K
% 0.45/0.64 is_pos (2424) 2542 2542 0 16 37.9 K
% 0.45/0.64 fsub_pos ( 16) 579 579 0 1 0.0 K
% 0.45/0.64 literal ( 32) 991 580 411 1 12.9 K
% 0.45/0.64 clause ( 88) 991 580 411 1 35.4 K
% 0.45/0.64 list ( 272) 10 3 7 1 2.1 K
% 0.45/0.64 clash_nd ( 80) 0 0 0 0 0.0 K
% 0.45/0.64 clause_ptr ( 16) 768 372 396 4 6.2 K
% 0.45/0.64 int_ptr ( 16) 9455 6743 2712 5 42.5 K
% 0.45/0.64 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.45/0.64 link_node ( 120) 0 0 0 0 0.0 K
% 0.45/0.64 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.45/0.64 formula_box( 168) 0 0 0 0 0.0 K
% 0.45/0.64 formula( 40) 0 0 0 0 0.0 K
% 0.45/0.64 formula_ptr( 16) 0 0 0 0 0.0 K
% 0.45/0.64 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.45/0.64
% 0.45/0.64 ********** is_delete, can't find end.
% 0.45/0.64 0.00
% 0.45/0.64 clausify time 0.00
% 0.45/0.64 process input 0.00
% 0.45/0.64 pick given time 0.00
% 0.45/0.64 para_into time 0.00
% 0.45/0.64 para_from time 0.00
% 0.45/0.64 pre_process time 0.00
% 0.45/0.64 renumber time 0.00
% 0.45/0.64 demod time 0.00
% 0.45/0.64 order equalities 0.00
% 0.45/0.64 unit deleletion 0.00
% 0.45/0.64 factor simplify 0.00
% 0.45/0.64 weigh cl time 0.00
% 0.45/0.64 hints keep time 0.00
% 0.45/0.64 sort lits time 0.00
% 0.45/0.64 forward subsume 0.00
% 0.45/0.64 delete cl time 0.00
% 0.45/0.64 keep cl time 0.00
% 0.45/0.64 hints time 0.00
% 0.45/0.64 print_cl time 0.00
% 0.45/0.64 conflict time 0.00
% 0.45/0.64 new demod time 0.00
% 0.45/0.64 post_process time 0.00
% 0.45/0.64 back demod time 0.00
% 0.45/0.64 back subsume 0.00
% 0.45/0.64 factor time 0.00
% 0.45/0.64 FINDER time 0.00
% 0.45/0.64 unindex time 0.00
% 0.45/0.64
% 0.45/0.64 ----------- soft-scott stats ----------
% 0.45/0.64
% 0.45/0.64 true clauses given 18 (32.1%)
% 0.45/0.64 false clauses given 38
% 0.45/0.64
% 0.45/0.64 FALSE TRUE
% 0.45/0.64 7 0 6
% 0.45/0.64 8 0 2
% 0.45/0.64 9 0 13
% 0.45/0.64 11 0 17
% 0.45/0.64 12 3 1
% 0.45/0.64 13 3 10
% 0.45/0.64 14 16 0
% 0.45/0.64 15 17 2
% 0.45/0.64 16 6 0
% 0.45/0.64 17 9 0
% 0.45/0.64 18 2 0
% 0.45/0.64 19 2 0
% 0.45/0.64 21 8 0
% 0.45/0.64 23 12 0
% 0.45/0.64 31 2 4
% 0.45/0.64 tot: 80 55 (40.7% true)
% 0.45/0.64
% 0.45/0.64
% 0.45/0.64 Model 11 (0.00 seconds, 250000 Inserts)
% 0.45/0.64
% 0.45/0.64 Forward subsumption counts, subsumer:number_subsumed.
% 0.45/0.64 1:1 2:0 3:0 4:0 5:0 6:0 7:0 8:6 9:5 10:0
% 0.45/0.64 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 0.45/0.64 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 0.45/0.64 31:0 32:0 33:0 34:551 35:0 36:0 37:0 38:0 39:0 40:0
% 0.45/0.64 41:0 42:0 43:0 44:0 45:0 46:1 47:0 48:0 49:1 50:2
% 0.45/0.64 51:0 52:0 53:0 54:0 55:0 56:0 57:0 58:0 59:0 60:0
% 0.45/0.64 61:0 62:0 63:0 64:0 65:0 66:0 67:0 68:0 69:0 70:0
% 0.45/0.64 71:0 72:0 73:0 74:0 75:0 76:0 77:0 78:0 79:0 80:0
% 0.45/0.64 81:0 82:0 83:1 84:0 85:0 86:0 87:0 88:1 89:1 90:0
% 0.45/0.64 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 0.45/0.64 All others: 9.
% 0.45/0.64
% 0.45/0.64 ********** ABNORMAL END **********
% 0.45/0.64
% 0.45/0.64 ********** is_delete, can't find end.
%------------------------------------------------------------------------------