TSTP Solution File: SWC202-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWC202-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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:53 EDT 2022
% Result : Unknown 0.89s 1.12s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.10 % Problem : SWC202-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.11 % Command : sos-script %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Sun Jun 12 04:03:55 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.15/0.38 ----- Otter 3.2, August 2001 -----
% 0.15/0.38 The process was started by sandbox2 on n032.cluster.edu,
% 0.15/0.38 Sun Jun 12 04:03:55 2022
% 0.15/0.38 The command was "./sos". The process ID is 8600.
% 0.15/0.38
% 0.15/0.38 set(prolog_style_variables).
% 0.15/0.38 set(auto).
% 0.15/0.38 dependent: set(auto1).
% 0.15/0.38 dependent: set(process_input).
% 0.15/0.38 dependent: clear(print_kept).
% 0.15/0.38 dependent: clear(print_new_demod).
% 0.15/0.38 dependent: clear(print_back_demod).
% 0.15/0.38 dependent: clear(print_back_sub).
% 0.15/0.38 dependent: set(control_memory).
% 0.15/0.38 dependent: assign(max_mem, 12000).
% 0.15/0.38 dependent: assign(pick_given_ratio, 4).
% 0.15/0.38 dependent: assign(stats_level, 1).
% 0.15/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.38 dependent: assign(sos_limit, 5000).
% 0.15/0.39 dependent: assign(max_weight, 60).
% 0.15/0.39 clear(print_given).
% 0.15/0.39
% 0.15/0.39 list(usable).
% 0.15/0.39
% 0.15/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 0.15/0.39
% 0.15/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.15/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.15/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.15/0.39 clauses in usable.
% 0.15/0.39
% 0.15/0.39 dependent: set(knuth_bendix).
% 0.15/0.39 dependent: set(para_from).
% 0.15/0.39 dependent: set(para_into).
% 0.15/0.39 dependent: clear(para_from_right).
% 0.15/0.39 dependent: clear(para_into_right).
% 0.15/0.39 dependent: set(para_from_vars).
% 0.15/0.39 dependent: set(eq_units_both_ways).
% 0.15/0.39 dependent: set(dynamic_demod_all).
% 0.15/0.39 dependent: set(dynamic_demod).
% 0.15/0.39 dependent: set(order_eq).
% 0.15/0.39 dependent: set(back_demod).
% 0.15/0.39 dependent: set(lrpo).
% 0.15/0.39 dependent: set(hyper_res).
% 0.15/0.39 dependent: set(unit_deletion).
% 0.15/0.39 dependent: set(factor).
% 0.15/0.39
% 0.15/0.39 ------------> process usable:
% 0.15/0.39 Following clause subsumed by 23 during input processing: 0 [] {-} -ssList(A)|ssList(tl(A))|nil=A.
% 0.15/0.39 Following clause subsumed by 24 during input processing: 0 [] {-} -ssList(A)|ssItem(hd(A))|nil=A.
% 0.15/0.39 Following clause subsumed by 67 during input processing: 0 [] {-} -leq(A,B)| -ssItem(B)| -ssItem(A)|lt(A,B)|A=B.
% 0.15/0.39 143 back subsumes 142.
% 0.15/0.39 153 back subsumes 147.
% 0.15/0.39
% 0.15/0.39 ------------> process sos:
% 0.15/0.39 Following clause subsumed by 441 during input processing: 0 [copy,441,flip.1] {-} A=A.
% 0.15/0.39 441 back subsumes 342.
% 0.15/0.39 441 back subsumes 286.
% 0.15/0.39 441 back subsumes 285.
% 0.15/0.39 441 back subsumes 284.
% 0.15/0.39 441 back subsumes 274.
% 0.15/0.39 441 back subsumes 261.
% 0.15/0.39 441 back subsumes 260.
% 0.15/0.39 441 back subsumes 259.
% 0.15/0.39 441 back subsumes 220.
% 0.15/0.39 441 back subsumes 208.
% 0.15/0.39 441 back subsumes 207.
% 0.15/0.39 441 back subsumes 206.
% 0.15/0.39 441 back subsumes 205.
% 0.15/0.39 441 back subsumes 188.
% 0.15/0.39 441 back subsumes 185.
% 0.15/0.39 441 back subsumes 183.
% 0.15/0.39 441 back subsumes 179.
% 0.15/0.39 441 back subsumes 176.
% 0.15/0.39 441 back subsumes 153.
% 0.15/0.39 441 back subsumes 152.
% 0.15/0.39 441 back subsumes 151.
% 0.15/0.39 441 back subsumes 150.
% 0.15/0.39 441 back subsumes 149.
% 0.15/0.39 441 back subsumes 141.
% 0.15/0.39 441 back subsumes 140.
% 0.15/0.39
% 0.15/0.39 ======= end of input processing =======
% 0.15/0.45
% 0.15/0.45 Model 1 (0.00 seconds, 0 Inserts)
% 0.15/0.45
% 0.15/0.45 Stopped by limit on number of solutions
% 0.15/0.45
% 0.15/0.45
% 0.15/0.45 -------------- Softie stats --------------
% 0.15/0.45
% 0.15/0.45 UPDATE_STOP: 300
% 0.15/0.45 SFINDER_TIME_LIMIT: 2
% 0.15/0.45 SHORT_CLAUSE_CUTOFF: 4
% 0.15/0.45 number of clauses in intial UL: 337
% 0.15/0.45 number of clauses initially in problem: 406
% 0.15/0.45 percentage of clauses intially in UL: 83
% 0.15/0.45 percentage of distinct symbols occuring in initial UL: 93
% 0.15/0.45 percent of all initial clauses that are short: 100
% 0.15/0.45 absolute distinct symbol count: 76
% 0.15/0.45 distinct predicate count: 20
% 0.15/0.45 distinct function count: 47
% 0.15/0.45 distinct constant count: 9
% 0.15/0.45
% 0.15/0.45 ---------- no more Softie stats ----------
% 0.15/0.45
% 0.15/0.45
% 0.15/0.45
% 0.15/0.45 Model 2 (0.00 seconds, 0 Inserts)
% 0.15/0.45
% 0.15/0.45 Stopped by limit on number of solutions
% 0.15/0.45
% 0.15/0.45 =========== start of search ===========
% 0.89/1.11
% 0.89/1.11 Model 3 (0.00 seconds, 0 Inserts)
% 0.89/1.11
% 0.89/1.11 Stopped by limit on number of solutions
% 0.89/1.11
% 0.89/1.11 Model 4 (0.00 seconds, 0 Inserts)
% 0.89/1.11
% 0.89/1.11 Stopped by limit on number of solutions
% 0.89/1.11
% 0.89/1.11 Stopped by limit on insertions
% 0.89/1.11
% 0.89/1.11 Stopped by limit on insertions
% 0.89/1.11
% 0.89/1.11 Stopped by limit on insertions
% 0.89/1.11
% 0.89/1.11 Stopped by limit on insertions
% 0.89/1.11
% 0.89/1.11 Stopped by limit on insertions
% 0.89/1.11 cons(skac3,app(sk1,nil))=app(cons(skac3,sk1),nil).
% 0.89/1.11
% 0.89/1.11 ------------- memory usage ------------
% 0.89/1.11 43 mallocs of 32700 bytes each, 1373.1 K.
% 0.89/1.11 type (bytes each) gets frees in use avail bytes
% 0.89/1.11 sym_ent ( 304) 185 0 185 0 54.9 K
% 0.89/1.11 term ( 32) 88925 82804 6121 7 191.5 K
% 0.89/1.11 rel ( 40) 64760 58037 6723 3 262.7 K
% 0.89/1.11 term_ptr ( 16) 25866 2870 22996 64 360.3 K
% 0.89/1.11 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.89/1.11 fpa_head ( 24) 2226 64 2162 4 50.8 K
% 0.89/1.11 fpa_tree ( 56) 15666 15666 0 21 1.1 K
% 0.89/1.11 context (1288) 20547 20547 0 11 13.8 K
% 0.89/1.11 trail ( 24) 109187 109187 0 6 0.1 K
% 0.89/1.11 imd_tree ( 32) 97 20 77 9 2.7 K
% 0.89/1.11 imd_pos (4024) 0 0 0 0 0.0 K
% 0.89/1.11 is_tree ( 24) 1689 154 1535 40 36.9 K
% 0.89/1.11 is_pos (2424) 68439 68439 0 6 14.2 K
% 0.89/1.11 fsub_pos ( 16) 9698 9698 0 1 0.0 K
% 0.89/1.11 literal ( 32) 20862 16801 4061 0 126.9 K
% 0.89/1.11 clause ( 88) 3789 2740 1049 0 90.1 K
% 0.89/1.11 list ( 272) 10 3 7 1 2.1 K
% 0.89/1.11 clash_nd ( 80) 8478 8478 0 9 0.7 K
% 0.89/1.11 clause_ptr ( 16) 1020 156 864 4 13.6 K
% 0.89/1.11 int_ptr ( 16) 9085 4702 4383 0 68.5 K
% 0.89/1.11 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.89/1.11 link_node ( 120) 0 0 0 0 0.0 K
% 0.89/1.11 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.89/1.11 formula_box( 168) 0 0 0 0 0.0 K
% 0.89/1.11 formula( 40) 0 0 0 0 0.0 K
% 0.89/1.11 formula_ptr( 16) 0 0 0 0 0.0 K
% 0.89/1.11 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.89/1.11
% 0.89/1.11 ********** is_delete, can't find end.
% 0.89/1.11 ep time 0.00
% 0.89/1.11 sort lits time 0.00
% 0.89/1.11 forward subsume 0.00
% 0.89/1.11 delete cl time 0.00
% 0.89/1.11 keep cl time 0.00
% 0.89/1.11 hints time 0.00
% 0.89/1.11 print_cl time 0.00
% 0.89/1.11 conflict time 0.00
% 0.89/1.11 new demod time 0.00
% 0.89/1.11 post_process time 0.00
% 0.89/1.11 back demod time 0.00
% 0.89/1.11 back subsume 0.00
% 0.89/1.11 factor time 0.00
% 0.89/1.11 FINDER time 0.00
% 0.89/1.11 unindex time 0.00
% 0.89/1.11
% 0.89/1.11 ----------- soft-scott stats ----------
% 0.89/1.11
% 0.89/1.11 true clauses given 1 (11.1%)
% 0.89/1.11 false clauses given 8
% 0.89/1.11
% 0.89/1.11 FALSE TRUE
% 0.89/1.11 2 4 2
% 0.89/1.11 3 43 7
% 0.89/1.11 4 15 10
% 0.89/1.11 5 1 0
% 0.89/1.11 6 3 2
% 0.89/1.11 7 1 29
% 0.89/1.11 9 2 23
% 0.89/1.11 10 0 2
% 0.89/1.11 11 1 43
% 0.89/1.11 12 0 24
% 0.89/1.11 13 0 33
% 0.89/1.11 14 0 8
% 0.89/1.11 15 0 28
% 0.89/1.11 16 0 14
% 0.89/1.11 17 0 14
% 0.89/1.11 18 0 2
% 0.89/1.11 19 0 6
% 0.89/1.12 20 0 2
% 0.89/1.12 21 0 18
% 0.89/1.12 22 0 12
% 0.89/1.12 23 0 6
% 0.89/1.12 tot: 70 285 (80.3% true)
% 0.89/1.12
% 0.89/1.12
% 0.89/1.12 Model 4 (0.00 seconds, 0 Inserts)
% 0.89/1.12
% 0.89/1.12 Forward subsumption counts, subsumer:number_subsumed.
% 0.89/1.12 1:0 2:0 3:2 4:0 5:11 6:0 7:4 8:0 9:6 10:47
% 0.89/1.12 11:6 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:1
% 0.89/1.12 21:0 22:0 23:1 24:1 25:0 26:0 27:0 28:0 29:0 30:0
% 0.89/1.12 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 0.89/1.12 41:0 42:0 43:0 44:0 45:0 46:0 47:0 48:0 49:0 50:0
% 0.89/1.12 51:0 52:0 53:0 54:0 55:0 56:1 57:0 58:0 59:0 60:1
% 0.89/1.12 61:0 62:0 63:0 64:0 65:0 66:0 67:1 68:0 69:0 70:0
% 0.89/1.12 71:0 72:0 73:0 74:0 75:0 76:0 77:0 78:0 79:0 80:0
% 0.89/1.12 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 0.89/1.12 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 0.89/1.12 All others: 641.
% 0.89/1.12
% 0.89/1.12 ********** ABNORMAL END **********
% 0.89/1.12
% 0.89/1.12 ********** is_delete, can't find end.
%------------------------------------------------------------------------------