TSTP Solution File: SWC028-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWC028-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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 : Tue Jul 19 21:58:57 EDT 2022
% Result : Unknown 0.91s 1.12s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC028-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n017.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 : Sun Jun 12 06:07:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.44 ----- Otter 3.2, August 2001 -----
% 0.20/0.44 The process was started by sandbox on n017.cluster.edu,
% 0.20/0.44 Sun Jun 12 06:07:21 2022
% 0.20/0.44 The command was "./sos". The process ID is 1422.
% 0.20/0.44
% 0.20/0.44 set(prolog_style_variables).
% 0.20/0.44 set(auto).
% 0.20/0.44 dependent: set(auto1).
% 0.20/0.44 dependent: set(process_input).
% 0.20/0.44 dependent: clear(print_kept).
% 0.20/0.44 dependent: clear(print_new_demod).
% 0.20/0.44 dependent: clear(print_back_demod).
% 0.20/0.44 dependent: clear(print_back_sub).
% 0.20/0.44 dependent: set(control_memory).
% 0.20/0.44 dependent: assign(max_mem, 12000).
% 0.20/0.44 dependent: assign(pick_given_ratio, 4).
% 0.20/0.44 dependent: assign(stats_level, 1).
% 0.20/0.44 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.44 dependent: assign(sos_limit, 5000).
% 0.20/0.44 dependent: assign(max_weight, 60).
% 0.20/0.44 clear(print_given).
% 0.20/0.44
% 0.20/0.44 list(usable).
% 0.20/0.44
% 0.20/0.44 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 0.20/0.44
% 0.20/0.44 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.44 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.44 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.44 clauses in usable.
% 0.20/0.44
% 0.20/0.44 dependent: set(knuth_bendix).
% 0.20/0.44 dependent: set(para_from).
% 0.20/0.44 dependent: set(para_into).
% 0.20/0.44 dependent: clear(para_from_right).
% 0.20/0.44 dependent: clear(para_into_right).
% 0.20/0.44 dependent: set(para_from_vars).
% 0.20/0.44 dependent: set(eq_units_both_ways).
% 0.20/0.44 dependent: set(dynamic_demod_all).
% 0.20/0.44 dependent: set(dynamic_demod).
% 0.20/0.44 dependent: set(order_eq).
% 0.20/0.44 dependent: set(back_demod).
% 0.20/0.44 dependent: set(lrpo).
% 0.20/0.44 dependent: set(hyper_res).
% 0.20/0.44 dependent: set(unit_deletion).
% 0.20/0.44 dependent: set(factor).
% 0.20/0.44
% 0.20/0.44 ------------> process usable:
% 0.20/0.44 Following clause subsumed by 23 during input processing: 0 [] {-} -ssList(A)|ssList(tl(A))|nil=A.
% 0.20/0.44 Following clause subsumed by 24 during input processing: 0 [] {-} -ssList(A)|ssItem(hd(A))|nil=A.
% 0.20/0.44 Following clause subsumed by 67 during input processing: 0 [] {-} -leq(A,B)| -ssItem(B)| -ssItem(A)|lt(A,B)|A=B.
% 0.20/0.44 137 back subsumes 136.
% 0.20/0.44 147 back subsumes 141.
% 0.20/0.44
% 0.20/0.44 ------------> process sos:
% 0.20/0.44 Following clause subsumed by 436 during input processing: 0 [copy,436,flip.1] {-} A=A.
% 0.20/0.44 436 back subsumes 334.
% 0.20/0.44 436 back subsumes 278.
% 0.20/0.44 436 back subsumes 277.
% 0.20/0.44 436 back subsumes 276.
% 0.20/0.44 436 back subsumes 266.
% 0.20/0.44 436 back subsumes 253.
% 0.20/0.44 436 back subsumes 252.
% 0.20/0.44 436 back subsumes 251.
% 0.20/0.44 436 back subsumes 214.
% 0.20/0.44 436 back subsumes 202.
% 0.20/0.44 436 back subsumes 201.
% 0.20/0.44 436 back subsumes 200.
% 0.20/0.44 436 back subsumes 199.
% 0.20/0.44 436 back subsumes 182.
% 0.20/0.44 436 back subsumes 179.
% 0.20/0.44 436 back subsumes 177.
% 0.20/0.44 436 back subsumes 173.
% 0.20/0.44 436 back subsumes 170.
% 0.20/0.44 436 back subsumes 147.
% 0.20/0.44 436 back subsumes 146.
% 0.20/0.44 436 back subsumes 145.
% 0.20/0.44 436 back subsumes 144.
% 0.20/0.44 436 back subsumes 143.
% 0.20/0.44 436 back subsumes 135.
% 0.20/0.44 436 back subsumes 134.
% 0.20/0.44
% 0.20/0.44 ======= end of input processing =======
% 0.47/0.65
% 0.47/0.65 Model 1 (0.00 seconds, 0 Inserts)
% 0.47/0.65
% 0.47/0.65 Stopped by limit on number of solutions
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65 -------------- Softie stats --------------
% 0.47/0.65
% 0.47/0.65 UPDATE_STOP: 300
% 0.47/0.65 SFINDER_TIME_LIMIT: 2
% 0.47/0.65 SHORT_CLAUSE_CUTOFF: 4
% 0.47/0.65 number of clauses in intial UL: 335
% 0.47/0.65 number of clauses initially in problem: 399
% 0.47/0.65 percentage of clauses intially in UL: 83
% 0.47/0.65 percentage of distinct symbols occuring in initial UL: 97
% 0.47/0.65 percent of all initial clauses that are short: 100
% 0.47/0.65 absolute distinct symbol count: 73
% 0.47/0.65 distinct predicate count: 20
% 0.47/0.65 distinct function count: 46
% 0.47/0.65 distinct constant count: 7
% 0.47/0.65
% 0.47/0.65 ---------- no more Softie stats ----------
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65 Stopped by limit on insertions
% 0.47/0.65
% 0.47/0.65 =========== start of search ===========
% 0.91/1.11
% 0.91/1.11 Stopped by limit on insertions
% 0.91/1.11
% 0.91/1.11 Model 2 (0.00 seconds, 0 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on number of solutions
% 0.91/1.11
% 0.91/1.11 Stopped by limit on insertions
% 0.91/1.11
% 0.91/1.11 Stopped by limit on insertions
% 0.91/1.11
% 0.91/1.11 Model 3 (0.00 seconds, 0 Inserts)
% 0.91/1.11
% 0.91/1.11 Stopped by limit on number of solutions
% 0.91/1.11
% 0.91/1.11 Stopped by limit on insertions
% 0.91/1.11 cons(skac3,app(nil,nil))=app(cons(skac3,nil),nil).
% 0.91/1.11
% 0.91/1.11 ------------- memory usage ------------
% 0.91/1.11 39 mallocs of 32700 bytes each, 1245.4 K.
% 0.91/1.11 type (bytes each) gets frees in use avail bytes
% 0.91/1.11 sym_ent ( 304) 179 0 179 0 53.1 K
% 0.91/1.11 term ( 32) 80826 75208 5618 12 175.9 K
% 0.91/1.11 rel ( 40) 58272 52242 6030 10 235.9 K
% 0.91/1.11 term_ptr ( 16) 23220 1986 21234 33 332.3 K
% 0.91/1.11 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.91/1.11 fpa_head ( 24) 1923 39 1884 10 44.4 K
% 0.91/1.11 fpa_tree ( 56) 11131 11131 0 20 1.1 K
% 0.91/1.11 context (1288) 16959 16959 0 11 13.8 K
% 0.91/1.11 trail ( 24) 96094 96094 0 6 0.1 K
% 0.91/1.11 imd_tree ( 32) 38 9 29 9 1.2 K
% 0.91/1.11 imd_pos (4024) 0 0 0 0 0.0 K
% 0.91/1.11 is_tree ( 24) 1355 70 1285 20 30.6 K
% 0.91/1.11 is_pos (2424) 61782 61782 0 6 14.2 K
% 0.91/1.11 fsub_pos ( 16) 8701 8701 0 1 0.0 K
% 0.91/1.11 literal ( 32) 19362 15564 3798 2 118.8 K
% 0.91/1.11 clause ( 88) 3506 2579 927 1 79.8 K
% 0.91/1.11 list ( 272) 10 3 7 1 2.1 K
% 0.91/1.11 clash_nd ( 80) 5977 5977 0 9 0.7 K
% 0.91/1.11 clause_ptr ( 16) 834 80 754 3 11.8 K
% 0.91/1.11 int_ptr ( 16) 7833 3993 3840 5 60.1 K
% 0.91/1.11 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.91/1.11 link_node ( 120) 0 0 0 0 0.0 K
% 0.91/1.11 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.91/1.11 formula_box( 168) 0 0 0 0 0.0 K
% 0.91/1.11 formula( 40) 0 0 0 0 0.0 K
% 0.91/1.11 formula_ptr( 16) 0 0 0 0 0.0 K
% 0.91/1.11 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.91/1.11
% 0.91/1.11 ********** is_delete, can't find end.
% 0.91/1.11 me 0.00
% 0.91/1.11 forward subsume 0.00
% 0.91/1.11 delete cl time 0.00
% 0.91/1.11 keep cl time 0.00
% 0.91/1.11 hints time 0.00
% 0.91/1.11 print_cl time 0.00
% 0.91/1.11 conflict time 0.00
% 0.91/1.11 new demod time 0.00
% 0.91/1.11 post_process time 0.00
% 0.91/1.11 back demod time 0.00
% 0.91/1.11 back subsume 0.00
% 0.91/1.11 factor time 0.00
% 0.91/1.11 FINDER time 0.00
% 0.91/1.11 unindex time 0.00
% 0.91/1.11
% 0.91/1.11 ----------- soft-scott stats ----------
% 0.91/1.11
% 0.91/1.11 true clauses given 1 (12.5%)
% 0.91/1.11 false clauses given 7
% 0.91/1.11
% 0.91/1.11 FALSE TRUE
% 0.91/1.11 2 2 2
% 0.91/1.11 3 30 15
% 0.91/1.11 4 6 14
% 0.91/1.11 6 2 3
% 0.91/1.11 7 0 29
% 0.91/1.11 9 0 12
% 0.91/1.11 10 0 2
% 0.91/1.11 11 0 45
% 0.91/1.11 12 0 21
% 0.91/1.11 13 0 33
% 0.91/1.11 14 0 8
% 0.91/1.11 15 0 26
% 0.91/1.11 16 0 13
% 0.91/1.11 17 0 12
% 0.91/1.11 19 0 5
% 0.91/1.11 21 0 15
% 0.91/1.11 22 0 12
% 0.91/1.11 23 0 5
% 0.91/1.11 tot: 40 272 (87.2% true)
% 0.91/1.11
% 0.91/1.11
% 0.91/1.11 Model 3 (0.00 seconds, 0 Inserts)
% 0.91/1.11
% 0.91/1.11 Forward subsumption counts, subsumer:number_subsumed.
% 0.91/1.11 1:0 2:0 3:2 4:0 5:11 6:0 7:4 8:0 9:6 10:47
% 0.91/1.11 11:6 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:1
% 0.91/1.11 21:0 22:0 23:1 24:1 25:0 26:0 27:0 28:0 29:0 30:0
% 0.91/1.11 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 0.91/1.11 41:0 42:0 43:0 44:0 45:0 46:0 47:0 48:0 49:0 50:0
% 0.91/1.11 51:0 52:0 53:0 54:0 55:0 56:1 57:0 58:0 59:0 60:1
% 0.91/1.11 61:0 62:0 63:0 64:0 65:0 66:0 67:1 68:0 69:0 70:0
% 0.91/1.11 71:0 72:0 73:0 74:0 75:0 76:0 77:0 78:0 79:0 80:0
% 0.91/1.11 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 0.91/1.11 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 0.91/1.11 All others: 575.
% 0.91/1.11
% 0.91/1.11 ********** ABNORMAL END **********
% 0.91/1.11
% 0.91/1.11 ********** is_delete, can't find end.
%------------------------------------------------------------------------------