TSTP Solution File: GRP399-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP399-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:51 EDT 2022
% Result : Unknown 0.19s 0.51s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP399-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 13:38:11 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n029.cluster.edu,
% 0.12/0.35 Tue Jun 14 13:38:11 2022
% 0.12/0.35 The command was "./sos". The process ID is 22979.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.12/0.35
% 0.12/0.35 All clauses are units, and equality is present; the
% 0.12/0.35 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35
% 0.12/0.35 There is no negative clause, so all clause lists will
% 0.12/0.35 be printed at the end of the search.
% 0.12/0.35
% 0.12/0.35 dependent: set(print_lists_at_end).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] {-} greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 0.12/0.35 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.12/0.35 Following clause subsumed by 31 during input processing: 0 [copy,31,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 0
% 0.12/0.39 number of clauses initially in problem: 29
% 0.12/0.39 percentage of clauses intially in UL: 0
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 0
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 6
% 0.12/0.39 distinct predicate count: 1
% 0.12/0.39 distinct function count: 4
% 0.12/0.39 distinct constant count: 1
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 0.19/0.51
% 0.19/0.51 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.51
% 0.19/0.51 Stopped by limit on number of solutions
% 0.19/0.51
% 0.19/0.51 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.51
% 0.19/0.51 Stopped by limit on number of solutions
% 0.19/0.51
% 0.19/0.51 Model 5 (0.00 seconds, 0 Inserts)
% 0.19/0.51
% 0.19/0.51 Stopped by limit on number of solutions
% 0.19/0.51
% 0.19/0.51 Model 6 (0.00 seconds, 0 Inserts)
% 0.19/0.51
% 0.19/0.51 Stopped by limit on number of solutions
% 0.19/0.51
% 0.19/0.51 Stopped by limit on insertions
% 0.19/0.51
% 0.19/0.51 Model 7 [ 2 0 60 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.51
% 0.19/0.51 Model 8 (0.00 seconds, 250000 Inserts)
% 0.19/0.51
% 0.19/0.51 Stopped by limit on number of solutions
% 0.19/0.51
% 0.19/0.51 Model 9 (0.00 seconds, 250000 Inserts)
% 0.19/0.51
% 0.19/0.51 Stopped by limit on number of solutions
% 0.19/0.51
% 0.19/0.51 Model 10 (0.00 seconds, 250000 Inserts)
% 0.19/0.51
% 0.19/0.51 Stopped by limit on number of solutions
% 0.19/0.51 greatest_lower_bound(A,greatest_lower_bound(B,greatest_lower_bound(A,B)))=greatest_lower_bound(A,B).
% 0.19/0.51
% 0.19/0.51 ------------- memory usage ------------
% 0.19/0.51 18 mallocs of 32700 bytes each, 574.8 K.
% 0.19/0.51 type (bytes each) gets frees in use avail bytes
% 0.19/0.51 sym_ent ( 304) 107 0 107 0 31.8 K
% 0.19/0.51 term ( 32) 9564 8466 1098 8 34.6 K
% 0.19/0.51 rel ( 40) 8859 7089 1770 4 69.3 K
% 0.19/0.51 term_ptr ( 16) 7778 419 7359 0 115.0 K
% 0.19/0.51 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.19/0.51 fpa_head ( 24) 1344 11 1333 0 31.2 K
% 0.19/0.51 fpa_tree ( 56) 1227 1227 0 15 0.8 K
% 0.19/0.51 context (1288) 1817 1817 0 4 5.0 K
% 0.19/0.51 trail ( 24) 2070 2070 0 4 0.1 K
% 0.19/0.51 imd_tree ( 32) 667 10 657 0 20.5 K
% 0.19/0.51 imd_pos (4024) 4609 4609 0 12 47.2 K
% 0.19/0.51 is_tree ( 24) 1176 34 1142 0 26.8 K
% 0.19/0.51 is_pos (2424) 1673 1673 0 16 37.9 K
% 0.19/0.51 fsub_pos ( 16) 424 424 0 1 0.0 K
% 0.19/0.51 literal ( 32) 710 425 285 0 8.9 K
% 0.19/0.51 clause ( 88) 710 425 285 0 24.5 K
% 0.19/0.51 list ( 272) 10 3 7 1 2.1 K
% 0.19/0.51 clash_nd ( 80) 0 0 0 0 0.0 K
% 0.19/0.51 clause_ptr ( 16) 524 252 272 2 4.3 K
% 0.19/0.51 int_ptr ( 16) 7022 5294 1728 0 27.0 K
% 0.19/0.51 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.19/0.51 link_node ( 120) 0 0 0 0 0.0 K
% 0.19/0.51 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.19/0.51 formula_box( 168) 0 0 0 0 0.0 K
% 0.19/0.51 formula( 40) 0 0 0 0 0.0 K
% 0.19/0.51 formula_ptr( 16) 0 0 0 0 0.0 K
% 0.19/0.51 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.19/0.51
% 0.19/0.51 ********** is_delete, can't find end.
% 0.19/0.51 0.00
% 0.19/0.51 para_into time 0.00
% 0.19/0.51 para_from time 0.00
% 0.19/0.51 pre_process time 0.00
% 0.19/0.51 renumber time 0.00
% 0.19/0.51 demod time 0.00
% 0.19/0.51 order equalities 0.00
% 0.19/0.51 unit deleletion 0.00
% 0.19/0.51 factor simplify 0.00
% 0.19/0.51 weigh cl time 0.00
% 0.19/0.51 hints keep time 0.00
% 0.19/0.51 sort lits time 0.00
% 0.19/0.51 forward subsume 0.00
% 0.19/0.51 delete cl time 0.00
% 0.19/0.51 keep cl time 0.00
% 0.19/0.51 hints time 0.00
% 0.19/0.51 print_cl time 0.00
% 0.19/0.51 conflict time 0.00
% 0.19/0.51 new demod time 0.00
% 0.19/0.51 post_process time 0.00
% 0.19/0.51 back demod time 0.00
% 0.19/0.51 back subsume 0.00
% 0.19/0.51 factor time 0.00
% 0.19/0.51 FINDER time 0.00
% 0.19/0.51 unindex time 0.00
% 0.19/0.51
% 0.19/0.51 ----------- soft-scott stats ----------
% 0.19/0.51
% 0.19/0.51 true clauses given 11 (30.6%)
% 0.19/0.51 false clauses given 25
% 0.19/0.51
% 0.19/0.51 FALSE TRUE
% 0.19/0.51 7 0 1
% 0.19/0.51 9 0 10
% 0.19/0.51 10 8 0
% 0.19/0.51 11 5 14
% 0.19/0.51 12 7 1
% 0.19/0.51 13 5 9
% 0.19/0.51 14 3 0
% 0.19/0.51 15 10 2
% 0.19/0.51 16 2 0
% 0.19/0.51 17 3 0
% 0.19/0.51 19 4 0
% 0.19/0.51 21 4 0
% 0.19/0.51 26 2 0
% 0.19/0.51 28 3 0
% 0.19/0.51 31 2 4
% 0.19/0.51 tot: 58 41 (41.4% true)
% 0.19/0.51
% 0.19/0.51
% 0.19/0.51 Model 10 (0.00 seconds, 250000 Inserts)
% 0.19/0.51
% 0.19/0.51 Forward subsumption counts, subsumer:number_subsumed.
% 0.19/0.51 1:0 2:0 3:0 4:0 5:0 6:0 7:4 8:4 9:0 10:0
% 0.19/0.51 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 0.19/0.51 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 0.19/0.51 31:403 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 0.19/0.51 41:0 42:0 43:0 44:0 45:0 46:1 47:0 48:0 49:0 50:0
% 0.19/0.51 51:1 52:1 53:0 54:0 55:0 56:0 57:0 58:0 59:0 60:0
% 0.19/0.51 61:0 62:0 63:0 64:0 65:0 66:0 67:0 68:0 69:0 70:0
% 0.19/0.51 71:0 72:0 73:1 74:0 75:0 76:0 77:0 78:1 79:1 80:0
% 0.19/0.51 81:0 82:0 83:0 84:1 85:1 86:0 87:0 88:1 89:0 90:0
% 0.19/0.51 91:1 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 0.19/0.51 All others: 3.
% 0.19/0.51
% 0.19/0.51 ********** ABNORMAL END **********
% 0.19/0.51
% 0.19/0.51 ********** is_delete, can't find end.
%------------------------------------------------------------------------------