TSTP Solution File: SWC072-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWC072-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:10 EDT 2022
% Result : Unknown 1.06s 1.24s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.13 % Problem : SWC072-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : sos-script %s
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 12 20:03:51 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.45 ----- Otter 3.2, August 2001 -----
% 0.20/0.45 The process was started by sandbox on n023.cluster.edu,
% 0.20/0.45 Sun Jun 12 20:03:51 2022
% 0.20/0.45 The command was "./sos". The process ID is 14817.
% 0.20/0.45
% 0.20/0.45 set(prolog_style_variables).
% 0.20/0.45 set(auto).
% 0.20/0.45 dependent: set(auto1).
% 0.20/0.45 dependent: set(process_input).
% 0.20/0.45 dependent: clear(print_kept).
% 0.20/0.45 dependent: clear(print_new_demod).
% 0.20/0.45 dependent: clear(print_back_demod).
% 0.20/0.45 dependent: clear(print_back_sub).
% 0.20/0.45 dependent: set(control_memory).
% 0.20/0.45 dependent: assign(max_mem, 12000).
% 0.20/0.45 dependent: assign(pick_given_ratio, 4).
% 0.20/0.45 dependent: assign(stats_level, 1).
% 0.20/0.45 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.45 dependent: assign(sos_limit, 5000).
% 0.20/0.45 dependent: assign(max_weight, 60).
% 0.20/0.45 clear(print_given).
% 0.20/0.45
% 0.20/0.45 list(usable).
% 0.20/0.45
% 0.20/0.45 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 0.20/0.45
% 0.20/0.45 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.45 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.45 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.45 clauses in usable.
% 0.20/0.45
% 0.20/0.45 dependent: set(knuth_bendix).
% 0.20/0.45 dependent: set(para_from).
% 0.20/0.45 dependent: set(para_into).
% 0.20/0.45 dependent: clear(para_from_right).
% 0.20/0.45 dependent: clear(para_into_right).
% 0.20/0.45 dependent: set(para_from_vars).
% 0.20/0.45 dependent: set(eq_units_both_ways).
% 0.20/0.45 dependent: set(dynamic_demod_all).
% 0.20/0.45 dependent: set(dynamic_demod).
% 0.20/0.45 dependent: set(order_eq).
% 0.20/0.45 dependent: set(back_demod).
% 0.20/0.45 dependent: set(lrpo).
% 0.20/0.45 dependent: set(hyper_res).
% 0.20/0.45 dependent: set(unit_deletion).
% 0.20/0.45 dependent: set(factor).
% 0.20/0.45
% 0.20/0.45 ------------> process usable:
% 0.20/0.45 Following clause subsumed by 23 during input processing: 0 [] {-} -ssList(A)|ssList(tl(A))|nil=A.
% 0.20/0.45 Following clause subsumed by 24 during input processing: 0 [] {-} -ssList(A)|ssItem(hd(A))|nil=A.
% 0.20/0.45 Following clause subsumed by 67 during input processing: 0 [] {-} -leq(A,B)| -ssItem(B)| -ssItem(A)|lt(A,B)|A=B.
% 0.20/0.45 142 back subsumes 141.
% 0.20/0.45 152 back subsumes 146.
% 0.20/0.45
% 0.20/0.45 ------------> process sos:
% 0.20/0.45 Following clause subsumed by 435 during input processing: 0 [copy,435,flip.1] {-} A=A.
% 0.20/0.45 435 back subsumes 343.
% 0.20/0.45 435 back subsumes 286.
% 0.20/0.45 435 back subsumes 285.
% 0.20/0.45 435 back subsumes 284.
% 0.20/0.45 435 back subsumes 274.
% 0.20/0.45 435 back subsumes 261.
% 0.20/0.45 435 back subsumes 260.
% 0.20/0.45 435 back subsumes 259.
% 0.20/0.45 435 back subsumes 219.
% 0.20/0.45 435 back subsumes 207.
% 0.20/0.45 435 back subsumes 206.
% 0.20/0.45 435 back subsumes 205.
% 0.20/0.45 435 back subsumes 204.
% 0.20/0.45 435 back subsumes 187.
% 0.20/0.45 435 back subsumes 184.
% 0.20/0.45 435 back subsumes 182.
% 0.20/0.45 435 back subsumes 178.
% 0.20/0.45 435 back subsumes 175.
% 0.20/0.45 435 back subsumes 152.
% 0.20/0.45 435 back subsumes 151.
% 0.20/0.45 435 back subsumes 150.
% 0.20/0.45 435 back subsumes 149.
% 0.20/0.45 435 back subsumes 148.
% 0.20/0.45 435 back subsumes 140.
% 0.20/0.45 435 back subsumes 139.
% 0.20/0.45
% 0.20/0.45 ======= end of input processing =======
% 0.46/0.63
% 0.46/0.63 Model 1 (0.00 seconds, 0 Inserts)
% 0.46/0.63
% 0.46/0.63 Stopped by limit on number of solutions
% 0.46/0.63
% 0.46/0.63
% 0.46/0.63 -------------- Softie stats --------------
% 0.46/0.63
% 0.46/0.63 UPDATE_STOP: 300
% 0.46/0.63 SFINDER_TIME_LIMIT: 2
% 0.46/0.63 SHORT_CLAUSE_CUTOFF: 4
% 0.46/0.63 number of clauses in intial UL: 336
% 0.46/0.63 number of clauses initially in problem: 401
% 0.46/0.63 percentage of clauses intially in UL: 83
% 0.46/0.63 percentage of distinct symbols occuring in initial UL: 97
% 0.46/0.63 percent of all initial clauses that are short: 100
% 0.46/0.63 absolute distinct symbol count: 73
% 0.46/0.63 distinct predicate count: 20
% 0.46/0.63 distinct function count: 46
% 0.46/0.63 distinct constant count: 7
% 0.46/0.63
% 0.46/0.63 ---------- no more Softie stats ----------
% 0.46/0.63
% 0.46/0.63
% 0.46/0.63
% 0.46/0.63 Stopped by limit on insertions
% 0.46/0.63
% 0.46/0.63 =========== start of search ===========
% 1.06/1.24
% 1.06/1.24 Stopped by limit on insertions
% 1.06/1.24
% 1.06/1.24 Stopped by limit on insertions
% 1.06/1.24
% 1.06/1.24 Model 2 (0.00 seconds, 0 Inserts)
% 1.06/1.24
% 1.06/1.24 Stopped by limit on number of solutions
% 1.06/1.24
% 1.06/1.24 Model 3 (0.00 seconds, 0 Inserts)
% 1.06/1.24
% 1.06/1.24 Stopped by limit on number of solutions
% 1.06/1.24
% 1.06/1.24 Stopped by limit on insertions
% 1.06/1.24
% 1.06/1.24 Stopped by limit on insertions
% 1.06/1.24
% 1.06/1.24 Stopped by limit on insertions
% 1.06/1.24 cons(skac2,app(sk1,nil))=app(cons(skac2,sk1),nil).
% 1.06/1.24
% 1.06/1.24 ------------- memory usage ------------
% 1.06/1.24 43 mallocs of 32700 bytes each, 1373.1 K.
% 1.06/1.24 type (bytes each) gets frees in use avail bytes
% 1.06/1.24 sym_ent ( 304) 183 0 183 0 54.3 K
% 1.06/1.24 term ( 32) 88100 81861 6239 7 195.2 K
% 1.06/1.24 rel ( 40) 63700 56824 6876 3 268.7 K
% 1.06/1.24 term_ptr ( 16) 26507 3212 23295 51 364.8 K
% 1.06/1.24 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 1.06/1.24 fpa_head ( 24) 2170 70 2100 4 49.3 K
% 1.06/1.24 fpa_tree ( 56) 13571 13571 0 20 1.1 K
% 1.06/1.24 context (1288) 19245 19245 0 11 13.8 K
% 1.06/1.24 trail ( 24) 101990 101990 0 6 0.1 K
% 1.06/1.24 imd_tree ( 32) 68 16 52 7 1.8 K
% 1.06/1.24 imd_pos (4024) 0 0 0 0 0.0 K
% 1.06/1.24 is_tree ( 24) 1579 153 1426 33 34.2 K
% 1.06/1.24 is_pos (2424) 71444 71444 0 6 14.2 K
% 1.06/1.24 fsub_pos ( 16) 10007 10007 0 1 0.0 K
% 1.06/1.24 literal ( 32) 21119 16886 4233 0 132.3 K
% 1.06/1.24 clause ( 88) 3812 2775 1037 0 89.1 K
% 1.06/1.24 list ( 272) 10 3 7 1 2.1 K
% 1.06/1.24 clash_nd ( 80) 7064 7064 0 9 0.7 K
% 1.06/1.24 clause_ptr ( 16) 993 137 856 4 13.4 K
% 1.06/1.24 int_ptr ( 16) 9220 4624 4596 0 71.8 K
% 1.06/1.24 ci_ptr ( 24) 0 0 0 0 0.0 K
% 1.06/1.24 link_node ( 120) 0 0 0 0 0.0 K
% 1.06/1.24 ans_lit_node( 24) 0 0 0 0 0.0 K
% 1.06/1.24 formula_box( 168) 0 0 0 0 0.0 K
% 1.06/1.24 formula( 40) 0 0 0 0 0.0 K
% 1.06/1.24 formula_ptr( 16) 0 0 0 0 0.0 K
% 1.06/1.24 cl_attribute( 24) 0 0 0 0 0.0 K
% 1.06/1.24
% 1.06/1.24 ********** is_delete, can't find end.
% 1.06/1.24 ep time 0.00
% 1.06/1.24 sort lits time 0.00
% 1.06/1.24 forward subsume 0.00
% 1.06/1.24 delete cl time 0.00
% 1.06/1.24 keep cl time 0.00
% 1.06/1.24 hints time 0.00
% 1.06/1.24 print_cl time 0.00
% 1.06/1.24 conflict time 0.00
% 1.06/1.24 new demod time 0.00
% 1.06/1.24 post_process time 0.00
% 1.06/1.24 back demod time 0.00
% 1.06/1.24 back subsume 0.00
% 1.06/1.24 factor time 0.00
% 1.06/1.24 FINDER time 0.00
% 1.06/1.24 unindex time 0.00
% 1.06/1.24
% 1.06/1.24 ----------- soft-scott stats ----------
% 1.06/1.24
% 1.06/1.24 true clauses given 1 (11.1%)
% 1.06/1.24 false clauses given 8
% 1.06/1.24
% 1.06/1.24 FALSE TRUE
% 1.06/1.24 2 1 2
% 1.06/1.24 3 35 9
% 1.06/1.24 4 13 2
% 1.06/1.24 5 1 0
% 1.06/1.24 6 1 2
% 1.06/1.24 7 0 35
% 1.06/1.24 9 1 26
% 1.06/1.24 10 0 2
% 1.06/1.24 11 1 54
% 1.06/1.24 12 3 21
% 1.06/1.24 13 0 34
% 1.06/1.24 14 0 10
% 1.06/1.24 15 0 29
% 1.06/1.24 16 0 17
% 1.06/1.24 17 0 15
% 1.06/1.24 19 0 7
% 1.06/1.24 21 0 21
% 1.06/1.24 22 0 13
% 1.06/1.24 23 0 7
% 1.06/1.24 31 0 1
% 1.06/1.24 33 0 3
% 1.06/1.24 35 0 1
% 1.06/1.24 tot: 56 311 (84.7% true)
% 1.06/1.24
% 1.06/1.24
% 1.06/1.24 Model 3 (0.00 seconds, 0 Inserts)
% 1.06/1.24
% 1.06/1.24 Forward subsumption counts, subsumer:number_subsumed.
% 1.06/1.24 1:0 2:0 3:2 4:0 5:11 6:0 7:4 8:0 9:6 10:47
% 1.06/1.24 11:6 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:1
% 1.06/1.24 21:0 22:0 23:1 24:1 25:0 26:0 27:0 28:0 29:0 30:0
% 1.06/1.24 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 1.06/1.24 41:0 42:0 43:0 44:0 45:0 46:0 47:0 48:0 49:0 50:0
% 1.06/1.24 51:0 52:0 53:0 54:0 55:0 56:1 57:0 58:0 59:0 60:1
% 1.06/1.24 61:0 62:0 63:0 64:0 65:0 66:0 67:1 68:0 69:0 70:0
% 1.06/1.24 71:0 72:0 73:0 74:0 75:0 76:0 77:0 78:0 79:0 80:0
% 1.06/1.24 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 1.06/1.24 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 1.06/1.24 All others: 657.
% 1.06/1.24
% 1.06/1.24 ********** ABNORMAL END **********
% 1.06/1.24
% 1.06/1.24 ********** is_delete, can't find end.
%------------------------------------------------------------------------------