TSTP Solution File: SWC197-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWC197-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:59:52 EDT 2022
% Result : Unknown 0.90s 1.10s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC197-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 08:14:23 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.40 ----- Otter 3.2, August 2001 -----
% 0.18/0.40 The process was started by sandbox on n014.cluster.edu,
% 0.18/0.40 Sun Jun 12 08:14:23 2022
% 0.18/0.40 The command was "./sos". The process ID is 22091.
% 0.18/0.40
% 0.18/0.40 set(prolog_style_variables).
% 0.18/0.40 set(auto).
% 0.18/0.40 dependent: set(auto1).
% 0.18/0.40 dependent: set(process_input).
% 0.18/0.40 dependent: clear(print_kept).
% 0.18/0.40 dependent: clear(print_new_demod).
% 0.18/0.40 dependent: clear(print_back_demod).
% 0.18/0.40 dependent: clear(print_back_sub).
% 0.18/0.40 dependent: set(control_memory).
% 0.18/0.40 dependent: assign(max_mem, 12000).
% 0.18/0.40 dependent: assign(pick_given_ratio, 4).
% 0.18/0.40 dependent: assign(stats_level, 1).
% 0.18/0.40 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.40 dependent: assign(sos_limit, 5000).
% 0.18/0.40 dependent: assign(max_weight, 60).
% 0.18/0.40 clear(print_given).
% 0.18/0.40
% 0.18/0.40 list(usable).
% 0.18/0.40
% 0.18/0.40 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 0.18/0.40
% 0.18/0.40 This ia a non-Horn set with equality. The strategy will be
% 0.18/0.40 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.18/0.40 unit deletion, with positive clauses in sos and nonpositive
% 0.18/0.40 clauses in usable.
% 0.18/0.40
% 0.18/0.40 dependent: set(knuth_bendix).
% 0.18/0.40 dependent: set(para_from).
% 0.18/0.40 dependent: set(para_into).
% 0.18/0.40 dependent: clear(para_from_right).
% 0.18/0.40 dependent: clear(para_into_right).
% 0.18/0.40 dependent: set(para_from_vars).
% 0.18/0.40 dependent: set(eq_units_both_ways).
% 0.18/0.40 dependent: set(dynamic_demod_all).
% 0.18/0.40 dependent: set(dynamic_demod).
% 0.18/0.40 dependent: set(order_eq).
% 0.18/0.40 dependent: set(back_demod).
% 0.18/0.40 dependent: set(lrpo).
% 0.18/0.40 dependent: set(hyper_res).
% 0.18/0.40 dependent: set(unit_deletion).
% 0.18/0.40 dependent: set(factor).
% 0.18/0.40
% 0.18/0.40 ------------> process usable:
% 0.18/0.40 Following clause subsumed by 23 during input processing: 0 [] {-} -ssList(A)|ssList(tl(A))|nil=A.
% 0.18/0.40 Following clause subsumed by 24 during input processing: 0 [] {-} -ssList(A)|ssItem(hd(A))|nil=A.
% 0.18/0.40 Following clause subsumed by 67 during input processing: 0 [] {-} -leq(A,B)| -ssItem(B)| -ssItem(A)|lt(A,B)|A=B.
% 0.18/0.40 138 back subsumes 137.
% 0.18/0.40 148 back subsumes 142.
% 0.18/0.40
% 0.18/0.40 ------------> process sos:
% 0.18/0.40 Following clause subsumed by 436 during input processing: 0 [copy,436,flip.1] {-} A=A.
% 0.18/0.40 436 back subsumes 335.
% 0.18/0.40 436 back subsumes 279.
% 0.18/0.40 436 back subsumes 278.
% 0.18/0.40 436 back subsumes 277.
% 0.18/0.40 436 back subsumes 267.
% 0.18/0.40 436 back subsumes 254.
% 0.18/0.40 436 back subsumes 253.
% 0.18/0.40 436 back subsumes 252.
% 0.18/0.40 436 back subsumes 215.
% 0.18/0.40 436 back subsumes 203.
% 0.18/0.40 436 back subsumes 202.
% 0.18/0.40 436 back subsumes 201.
% 0.18/0.40 436 back subsumes 200.
% 0.18/0.40 436 back subsumes 183.
% 0.18/0.40 436 back subsumes 180.
% 0.18/0.40 436 back subsumes 178.
% 0.18/0.40 436 back subsumes 174.
% 0.18/0.40 436 back subsumes 171.
% 0.18/0.40 436 back subsumes 148.
% 0.18/0.40 436 back subsumes 147.
% 0.18/0.40 436 back subsumes 146.
% 0.18/0.40 436 back subsumes 145.
% 0.18/0.40 436 back subsumes 144.
% 0.18/0.40 436 back subsumes 136.
% 0.18/0.40 436 back subsumes 135.
% 0.18/0.40
% 0.18/0.40 ======= end of input processing =======
% 0.18/0.45
% 0.18/0.45 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.45
% 0.18/0.45 Stopped by limit on number of solutions
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45 -------------- Softie stats --------------
% 0.18/0.45
% 0.18/0.45 UPDATE_STOP: 300
% 0.18/0.45 SFINDER_TIME_LIMIT: 2
% 0.18/0.45 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.45 number of clauses in intial UL: 335
% 0.18/0.45 number of clauses initially in problem: 403
% 0.18/0.45 percentage of clauses intially in UL: 83
% 0.18/0.45 percentage of distinct symbols occuring in initial UL: 91
% 0.18/0.45 percent of all initial clauses that are short: 100
% 0.18/0.45 absolute distinct symbol count: 78
% 0.18/0.45 distinct predicate count: 20
% 0.18/0.45 distinct function count: 46
% 0.18/0.45 distinct constant count: 12
% 0.18/0.45
% 0.18/0.45 ---------- no more Softie stats ----------
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45 =========== start of search ===========
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10
% 0.90/1.10 Model 2 (0.00 seconds, 0 Inserts)
% 0.90/1.10
% 0.90/1.10 Stopped by limit on number of solutions
% 0.90/1.10
% 0.90/1.10 Model 3 (0.00 seconds, 0 Inserts)
% 0.90/1.10
% 0.90/1.10 Stopped by limit on number of solutions
% 0.90/1.10
% 0.90/1.10 Model 4 (0.00 seconds, 0 Inserts)
% 0.90/1.10
% 0.90/1.10 Stopped by limit on number of solutions
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10 cons(skac2,app(sk1,nil))=app(cons(skac2,sk1),nil).
% 0.90/1.10
% 0.90/1.10 ------------- memory usage ------------
% 0.90/1.10 43 mallocs of 32700 bytes each, 1373.1 K.
% 0.90/1.10 type (bytes each) gets frees in use avail bytes
% 0.90/1.10 sym_ent ( 304) 184 0 184 0 54.6 K
% 0.90/1.10 term ( 32) 86449 80321 6128 7 191.7 K
% 0.90/1.10 rel ( 40) 62494 55789 6705 3 262.0 K
% 0.90/1.10 term_ptr ( 16) 25744 2634 23110 51 361.9 K
% 0.90/1.10 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.90/1.10 fpa_head ( 24) 2194 61 2133 4 50.1 K
% 0.90/1.10 fpa_tree ( 56) 13206 13206 0 20 1.1 K
% 0.90/1.10 context (1288) 19195 19195 0 11 13.8 K
% 0.90/1.10 trail ( 24) 99920 99920 0 6 0.1 K
% 0.90/1.10 imd_tree ( 32) 78 15 63 7 2.2 K
% 0.90/1.10 imd_pos (4024) 0 0 0 0 0.0 K
% 0.90/1.10 is_tree ( 24) 1542 128 1414 33 33.9 K
% 0.90/1.10 is_pos (2424) 67538 67538 0 6 14.2 K
% 0.90/1.10 fsub_pos ( 16) 9748 9748 0 1 0.0 K
% 0.90/1.10 literal ( 32) 20706 16580 4126 0 128.9 K
% 0.90/1.10 clause ( 88) 3787 2748 1039 0 89.3 K
% 0.90/1.10 list ( 272) 10 3 7 1 2.1 K
% 0.90/1.10 clash_nd ( 80) 7103 7103 0 9 0.7 K
% 0.90/1.10 clause_ptr ( 16) 986 134 852 4 13.4 K
% 0.90/1.10 int_ptr ( 16) 9119 4590 4529 0 70.8 K
% 0.90/1.10 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.90/1.10 link_node ( 120) 0 0 0 0 0.0 K
% 0.90/1.10 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.90/1.10 formula_box( 168) 0 0 0 0 0.0 K
% 0.90/1.10 formula( 40) 0 0 0 0 0.0 K
% 0.90/1.10 formula_ptr( 16) 0 0 0 0 0.0 K
% 0.90/1.10 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.90/1.10
% 0.90/1.10 ********** is_delete, can't find end.
% 0.90/1.10 0.00
% 0.90/1.10 factor simplify 0.00
% 0.90/1.10 weigh cl time 0.00
% 0.90/1.10 hints keep time 0.00
% 0.90/1.10 sort lits time 0.00
% 0.90/1.10 forward subsume 0.00
% 0.90/1.10 delete cl time 0.00
% 0.90/1.10 keep cl time 0.00
% 0.90/1.10 hints time 0.00
% 0.90/1.10 print_cl time 0.00
% 0.90/1.10 conflict time 0.00
% 0.90/1.10 new demod time 0.00
% 0.90/1.10 post_process time 0.00
% 0.90/1.10 back demod time 0.00
% 0.90/1.10 back subsume 0.00
% 0.90/1.10 factor time 0.00
% 0.90/1.10 FINDER time 0.00
% 0.90/1.10 unindex time 0.00
% 0.90/1.10
% 0.90/1.10 ----------- soft-scott stats ----------
% 0.90/1.10
% 0.90/1.10 true clauses given 1 (11.1%)
% 0.90/1.10 false clauses given 8
% 0.90/1.10
% 0.90/1.10 FALSE TRUE
% 0.90/1.10 2 5 3
% 0.90/1.10 3 36 9
% 0.90/1.10 4 11 4
% 0.90/1.10 5 1 1
% 0.90/1.10 6 1 1
% 0.90/1.10 7 0 35
% 0.90/1.10 9 0 27
% 0.90/1.10 10 0 2
% 0.90/1.10 11 1 54
% 0.90/1.10 12 0 24
% 0.90/1.10 13 0 34
% 0.90/1.10 14 0 10
% 0.90/1.10 15 0 30
% 0.90/1.10 16 0 17
% 0.90/1.10 17 0 15
% 0.90/1.10 19 0 7
% 0.90/1.10 21 0 21
% 0.90/1.10 22 0 13
% 0.90/1.10 23 0 7
% 0.90/1.10 tot: 55 314 (85.1% true)
% 0.90/1.10
% 0.90/1.10
% 0.90/1.10 Model 4 (0.00 seconds, 0 Inserts)
% 0.90/1.10
% 0.90/1.10 Forward subsumption counts, subsumer:number_subsumed.
% 0.90/1.10 1:0 2:0 3:2 4:0 5:11 6:0 7:4 8:0 9:6 10:47
% 0.90/1.10 11:6 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:1
% 0.90/1.10 21:0 22:0 23:1 24:1 25:0 26:0 27:0 28:0 29:0 30:0
% 0.90/1.10 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 0.90/1.10 41:0 42:0 43:0 44:0 45:0 46:0 47:0 48:0 49:0 50:0
% 0.90/1.10 51:0 52:0 53:0 54:0 55:0 56:1 57:0 58:0 59:0 60:1
% 0.90/1.10 61:0 62:0 63:0 64:0 65:0 66:0 67:1 68:0 69:0 70:0
% 0.90/1.10 71:0 72:0 73:0 74:0 75:0 76:0 77:0 78:0 79:0 80:0
% 0.90/1.10 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 0.90/1.10 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 0.90/1.10 All others: 649.
% 0.90/1.10
% 0.90/1.10 ********** ABNORMAL END **********
% 0.90/1.10
% 0.90/1.10 ********** is_delete, can't find end.
%------------------------------------------------------------------------------