TSTP Solution File: SEU194+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU194+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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 14:27:36 EDT 2022
% Result : Unknown 0.39s 0.56s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU194+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 20 11:05:29 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.39 ----- Otter 3.2, August 2001 -----
% 0.20/0.39 The process was started by sandbox2 on n013.cluster.edu,
% 0.20/0.39 Mon Jun 20 11:05:29 2022
% 0.20/0.39 The command was "./sos". The process ID is 24935.
% 0.20/0.39
% 0.20/0.39 set(prolog_style_variables).
% 0.20/0.39 set(auto).
% 0.20/0.39 dependent: set(auto1).
% 0.20/0.39 dependent: set(process_input).
% 0.20/0.39 dependent: clear(print_kept).
% 0.20/0.39 dependent: clear(print_new_demod).
% 0.20/0.39 dependent: clear(print_back_demod).
% 0.20/0.39 dependent: clear(print_back_sub).
% 0.20/0.39 dependent: set(control_memory).
% 0.20/0.39 dependent: assign(max_mem, 12000).
% 0.20/0.39 dependent: assign(pick_given_ratio, 4).
% 0.20/0.39 dependent: assign(stats_level, 1).
% 0.20/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.39 dependent: assign(sos_limit, 5000).
% 0.20/0.39 dependent: assign(max_weight, 60).
% 0.20/0.39 clear(print_given).
% 0.20/0.39
% 0.20/0.39 formula_list(usable).
% 0.20/0.39
% 0.20/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.20/0.39
% 0.20/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.39 clauses in usable.
% 0.20/0.39
% 0.20/0.39 dependent: set(knuth_bendix).
% 0.20/0.39 dependent: set(para_from).
% 0.20/0.39 dependent: set(para_into).
% 0.20/0.39 dependent: clear(para_from_right).
% 0.20/0.39 dependent: clear(para_into_right).
% 0.20/0.39 dependent: set(para_from_vars).
% 0.20/0.39 dependent: set(eq_units_both_ways).
% 0.20/0.39 dependent: set(dynamic_demod_all).
% 0.20/0.39 dependent: set(dynamic_demod).
% 0.20/0.39 dependent: set(order_eq).
% 0.20/0.39 dependent: set(back_demod).
% 0.20/0.39 dependent: set(lrpo).
% 0.20/0.39 dependent: set(hyper_res).
% 0.20/0.39 dependent: set(unit_deletion).
% 0.20/0.39 dependent: set(factor).
% 0.20/0.39
% 0.20/0.39 ------------> process usable:
% 0.20/0.39 Following clause subsumed by 10 during input processing: 0 [] {-} subset(A,singleton(B))|A!=singleton(B).
% 0.20/0.39 Following clause subsumed by 149 during input processing: 0 [] {-} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 0.20/0.39 Following clause subsumed by 150 during input processing: 0 [] {-} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 0.20/0.39 Following clause subsumed by 151 during input processing: 0 [] {-} in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 0.20/0.39 Following clause subsumed by 37 during input processing: 0 [] {-} -element(A,B)|empty(B)|in(A,B).
% 0.20/0.39 Following clause subsumed by 142 during input processing: 0 [] {-} set_difference(A,B)!=empty_set|subset(A,B).
% 0.20/0.39 Following clause subsumed by 143 during input processing: 0 [] {-} set_difference(A,B)=empty_set| -subset(A,B).
% 0.20/0.39 Following clause subsumed by 140 during input processing: 0 [] {-} -subset(singleton(A),B)|in(A,B).
% 0.20/0.39 Following clause subsumed by 141 during input processing: 0 [] {-} subset(singleton(A),B)| -in(A,B).
% 0.20/0.39 Following clause subsumed by 146 during input processing: 0 [] {-} -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 0.20/0.39 Following clause subsumed by 147 during input processing: 0 [] {-} subset(A,singleton(B))|A!=empty_set.
% 0.20/0.39 Following clause subsumed by 10 during input processing: 0 [] {-} subset(A,singleton(B))|A!=singleton(B).
% 0.20/0.39 Following clause subsumed by 138 during input processing: 0 [] {-} -in(A,B)|set_union2(singleton(A),B)=B.
% 0.20/0.39 Following clause subsumed by 148 during input processing: 0 [] {-} -in(A,B)|subset(A,union(B)).
% 0.20/0.39 60 back subsumes 57.
% 0.20/0.39 169 back subsumes 38.
% 0.20/0.39 244 back subsumes 243.
% 0.20/0.39
% 0.20/0.39 ------------> process sos:
% 0.20/0.39 Following clause subsumed by 359 during input processing: 0 [] {-} empty(empty_set).
% 0.20/0.39 Following clause subsumed by 331 during input processing: 0 [copy,331,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.20/0.39 Following clause subsumed by 332 during input processing: 0 [copy,332,flip.1] {-} set_union2(A,B)=set_union2(B,A).
% 0.20/0.39 374 back subsumes 308.
% 0.20/0.39 374 back subsumes 307.
% 0.20/0.39 374 back subsumes 259.
% 0.20/0.39 374 back subsumes 258.
% 0.20/0.39 Following clause subsumed by 419 during input processing: 0 [copy,419,flip.1] {-} A=A.
% 0.20/0.39 419 back subsumes 319.
% 0.20/0.39 419 back subsumes 309.
% 0.20/0.39 419 back subsumes 241.
% 0.20/0.39 Following clause subsumed by 420 during input processing: 0 [copy,420,flip.1] {-} set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 0.20/0.39
% 0.20/0.39 ======= end of input processing =======
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 Failed to model usable list: disabling FINDER
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 -------------- Softie stats --------------
% 0.20/0.53
% 0.20/0.53 UPDATE_STOP: 300
% 0.20/0.53 SFINDER_TIME_LIMIT: 2
% 0.20/0.53 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.53 number of clauses in intial UL: 273
% 0.20/0.53 number of clauses initially in problem: 389
% 0.20/0.53 percentage of clauses intially in UL: 70
% 0.20/0.53 percentage of distinct symbols occuring in initial UL: 81
% 0.20/0.53 percent of all initial clauses that are short: 100
% 0.20/0.53 absolute distinct symbol count: 92
% 0.20/0.53 distinct predicate count: 9
% 0.20/0.53 distinct function count: 76
% 0.20/0.53 distinct constant count: 7
% 0.20/0.53
% 0.20/0.53 ---------- no more Softie stats ----------
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 =========== start of search ===========
% 0.39/0.55 set_difference(A,A)=empty_set.
% 0.39/0.55
% 0.39/0.55 ------------- memory usage ------------
% 0.39/0.55 53 mallocs of 32700 bytes each, 1692.5 K.
% 0.39/0.55 type (bytes each) gets frees in use avail bytes
% 0.39/0.55 sym_ent ( 304) 219 0 219 0 65.0 K
% 0.39/0.55 term ( 32) 53759 45945 7814 61 246.1 K
% 0.39/0.55 rel ( 40) 43235 34029 9206 52 361.6 K
% 0.39/0.55 term_ptr ( 16) 31280 9202 22078 277 349.3 K
% 0.39/0.55 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.39/0.55 fpa_head ( 24) 4258 546 3712 140 90.3 K
% 0.39/0.55 fpa_tree ( 56) 2728 2728 0 22 1.2 K
% 0.39/0.55 context (1288) 7701 7701 0 7 8.8 K
% 0.39/0.55 trail ( 24) 59249 59249 0 7 0.2 K
% 0.39/0.55 imd_tree ( 32) 82 27 55 0 1.7 K
% 0.39/0.55 imd_pos (4024) 296 296 0 3 11.8 K
% 0.39/0.55 is_tree ( 24) 4304 849 3455 199 85.6 K
% 0.39/0.55 is_pos (2424) 103666 103666 0 12 28.4 K
% 0.39/0.55 fsub_pos ( 16) 6226 6226 0 1 0.0 K
% 0.39/0.55 literal ( 32) 6111 2709 3402 9 106.6 K
% 0.39/0.55 clause ( 88) 1909 741 1168 2 100.5 K
% 0.39/0.55 list ( 272) 195 188 7 2 2.4 K
% 0.39/0.55 clash_nd ( 80) 368 368 0 5 0.4 K
% 0.39/0.55 clause_ptr ( 16) 1212 328 884 6 13.9 K
% 0.39/0.55 int_ptr ( 16) 6126 2269 3857 10 60.4 K
% 0.39/0.55 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.39/0.55 link_node ( 120) 0 0 0 0 0.0 K
% 0.39/0.55 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.39/0.55 formula_box( 168) 0 0 0 0 0.0 K
% 0.39/0.55 formula( 40) 2591 2591 0 1202 47.0 K
% 0.39/0.55 formula_ptr( 16) 185 185 0 185 2.9 K
% 0.39/0.55 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.39/0.55
% 0.39/0.55 ********** is_delete, can't find end.
% 0.39/0.55 or time 0.00
% 0.39/0.55 FINDER time 0.00
% 0.39/0.55 unindex time 0.00
% 0.39/0.55
% 0.39/0.55 Forward subsumption counts, subsumer:number_subsumed.
% 0.39/0.55 1:0 2:0 3:1 4:0 5:0 6:0 7:0 8:0 9:0 10:2
% 0.39/0.55 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 0.39/0.55 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 0.39/0.55 31:0 32:0 33:0 34:0 35:0 36:0 37:1 38:0 39:0 40:0
% 0.39/0.55 41:0 42:0 43:1 44:0 45:0 46:0 47:0 48:0 49:0 50:0
% 0.39/0.55 51:0 52:0 53:0 54:0 55:0 56:0 57:0 58:0 59:0 60:0
% 0.39/0.55 61:0 62:0 63:0 64:0 65:0 66:0 67:0 68:0 69:0 70:0
% 0.39/0.55 71:0 72:0 73:0 74:1 75:0 76:0 77:0 78:0 79:0 80:0
% 0.39/0.55 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 0.39/0.55 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 0.39/0.55 All others: 282.
% 0.39/0.55
% 0.39/0.55 ********** ABNORMAL END **********
% 0.39/0.55
% 0.39/0.55 ********** is_delete, can't find end.
%------------------------------------------------------------------------------