TSTP Solution File: SEU196+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU196+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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:37 EDT 2022
% Result : Unknown 0.40s 0.57s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU196+2 : TPTP v8.1.0. Released v3.3.0.
% 0.14/0.13 % Command : sos-script %s
% 0.14/0.35 % Computer : n025.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 19 09:17:13 EDT 2022
% 0.20/0.35 % CPUTime :
% 0.20/0.40 ----- Otter 3.2, August 2001 -----
% 0.20/0.40 The process was started by sandbox on n025.cluster.edu,
% 0.20/0.40 Sun Jun 19 09:17:13 2022
% 0.20/0.40 The command was "./sos". The process ID is 13846.
% 0.20/0.40
% 0.20/0.40 set(prolog_style_variables).
% 0.20/0.40 set(auto).
% 0.20/0.40 dependent: set(auto1).
% 0.20/0.40 dependent: set(process_input).
% 0.20/0.40 dependent: clear(print_kept).
% 0.20/0.40 dependent: clear(print_new_demod).
% 0.20/0.40 dependent: clear(print_back_demod).
% 0.20/0.40 dependent: clear(print_back_sub).
% 0.20/0.40 dependent: set(control_memory).
% 0.20/0.40 dependent: assign(max_mem, 12000).
% 0.20/0.40 dependent: assign(pick_given_ratio, 4).
% 0.20/0.40 dependent: assign(stats_level, 1).
% 0.20/0.40 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.40 dependent: assign(sos_limit, 5000).
% 0.20/0.40 dependent: assign(max_weight, 60).
% 0.20/0.40 clear(print_given).
% 0.20/0.40
% 0.20/0.40 formula_list(usable).
% 0.20/0.40
% 0.20/0.40 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.20/0.40
% 0.20/0.40 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.40 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.40 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.40 clauses in usable.
% 0.20/0.40
% 0.20/0.40 dependent: set(knuth_bendix).
% 0.20/0.40 dependent: set(para_from).
% 0.20/0.40 dependent: set(para_into).
% 0.20/0.40 dependent: clear(para_from_right).
% 0.20/0.40 dependent: clear(para_into_right).
% 0.20/0.40 dependent: set(para_from_vars).
% 0.20/0.40 dependent: set(eq_units_both_ways).
% 0.20/0.40 dependent: set(dynamic_demod_all).
% 0.20/0.40 dependent: set(dynamic_demod).
% 0.20/0.40 dependent: set(order_eq).
% 0.20/0.40 dependent: set(back_demod).
% 0.20/0.40 dependent: set(lrpo).
% 0.20/0.40 dependent: set(hyper_res).
% 0.20/0.40 dependent: set(unit_deletion).
% 0.20/0.40 dependent: set(factor).
% 0.20/0.40
% 0.20/0.40 ------------> process usable:
% 0.20/0.40 Following clause subsumed by 10 during input processing: 0 [] {-} subset(A,singleton(B))|A!=singleton(B).
% 0.20/0.40 Following clause subsumed by 153 during input processing: 0 [] {-} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 0.20/0.40 Following clause subsumed by 154 during input processing: 0 [] {-} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 0.20/0.40 Following clause subsumed by 155 during input processing: 0 [] {-} in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 0.20/0.40 Following clause subsumed by 41 during input processing: 0 [] {-} -element(A,B)|empty(B)|in(A,B).
% 0.20/0.40 Following clause subsumed by 146 during input processing: 0 [] {-} set_difference(A,B)!=empty_set|subset(A,B).
% 0.20/0.40 Following clause subsumed by 147 during input processing: 0 [] {-} set_difference(A,B)=empty_set| -subset(A,B).
% 0.20/0.40 Following clause subsumed by 144 during input processing: 0 [] {-} -subset(singleton(A),B)|in(A,B).
% 0.20/0.40 Following clause subsumed by 145 during input processing: 0 [] {-} subset(singleton(A),B)| -in(A,B).
% 0.20/0.40 Following clause subsumed by 150 during input processing: 0 [] {-} -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 0.20/0.40 Following clause subsumed by 151 during input processing: 0 [] {-} subset(A,singleton(B))|A!=empty_set.
% 0.20/0.40 Following clause subsumed by 10 during input processing: 0 [] {-} subset(A,singleton(B))|A!=singleton(B).
% 0.20/0.40 Following clause subsumed by 142 during input processing: 0 [] {-} -in(A,B)|set_union2(singleton(A),B)=B.
% 0.20/0.40 Following clause subsumed by 152 during input processing: 0 [] {-} -in(A,B)|subset(A,union(B)).
% 0.20/0.40 64 back subsumes 61.
% 0.20/0.40 173 back subsumes 42.
% 0.20/0.40 250 back subsumes 249.
% 0.20/0.40
% 0.20/0.40 ------------> process sos:
% 0.20/0.40 Following clause subsumed by 367 during input processing: 0 [] {-} empty(empty_set).
% 0.20/0.40 Following clause subsumed by 339 during input processing: 0 [copy,339,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.20/0.40 Following clause subsumed by 340 during input processing: 0 [copy,340,flip.1] {-} set_union2(A,B)=set_union2(B,A).
% 0.20/0.40 382 back subsumes 316.
% 0.20/0.40 382 back subsumes 315.
% 0.20/0.40 382 back subsumes 267.
% 0.20/0.40 382 back subsumes 266.
% 0.20/0.40 Following clause subsumed by 427 during input processing: 0 [copy,427,flip.1] {-} A=A.
% 0.20/0.40 427 back subsumes 327.
% 0.20/0.40 427 back subsumes 317.
% 0.20/0.40 427 back subsumes 256.
% 0.20/0.40 427 back subsumes 255.
% 0.20/0.40 427 back subsumes 247.
% 0.20/0.40 Following clause subsumed by 428 during input processing: 0 [copy,428,flip.1] {-} set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 0.20/0.40 438 back subsumes 37.
% 0.20/0.40 440 back subsumes 38.
% 0.20/0.40
% 0.20/0.40 ======= end of input processing =======
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55 Failed to model usable list: disabling FINDER
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55 -------------- Softie stats --------------
% 0.21/0.55
% 0.21/0.55 UPDATE_STOP: 300
% 0.21/0.55 SFINDER_TIME_LIMIT: 2
% 0.21/0.55 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.55 number of clauses in intial UL: 277
% 0.21/0.55 number of clauses initially in problem: 393
% 0.21/0.55 percentage of clauses intially in UL: 70
% 0.21/0.55 percentage of distinct symbols occuring in initial UL: 84
% 0.21/0.55 percent of all initial clauses that are short: 100
% 0.21/0.55 absolute distinct symbol count: 94
% 0.21/0.55 distinct predicate count: 9
% 0.21/0.55 distinct function count: 78
% 0.21/0.55 distinct constant count: 7
% 0.21/0.55
% 0.21/0.55 ---------- no more Softie stats ----------
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55 =========== start of search ===========
% 0.40/0.57 set_difference(A,A)=empty_set.
% 0.40/0.57
% 0.40/0.57 ------------- memory usage ------------
% 0.40/0.57 54 mallocs of 32700 bytes each, 1724.4 K.
% 0.40/0.57 type (bytes each) gets frees in use avail bytes
% 0.40/0.57 sym_ent ( 304) 221 0 221 0 65.6 K
% 0.40/0.57 term ( 32) 55637 47612 8025 61 252.7 K
% 0.40/0.57 rel ( 40) 44779 35341 9438 52 370.7 K
% 0.40/0.57 term_ptr ( 16) 32100 9545 22555 277 356.8 K
% 0.40/0.57 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 0.40/0.57 fpa_head ( 24) 4364 548 3816 136 92.6 K
% 0.40/0.57 fpa_tree ( 56) 2785 2785 0 22 1.2 K
% 0.40/0.57 context (1288) 7934 7934 0 7 8.8 K
% 0.40/0.57 trail ( 24) 64600 64600 0 7 0.2 K
% 0.40/0.57 imd_tree ( 32) 90 31 59 0 1.8 K
% 0.40/0.57 imd_pos (4024) 296 296 0 3 11.8 K
% 0.40/0.57 is_tree ( 24) 4405 879 3526 199 87.3 K
% 0.40/0.57 is_pos (2424) 107265 107265 0 12 28.4 K
% 0.40/0.57 fsub_pos ( 16) 6419 6419 0 1 0.0 K
% 0.40/0.57 literal ( 32) 6355 2868 3487 9 109.2 K
% 0.40/0.57 clause ( 88) 1975 783 1192 2 102.6 K
% 0.40/0.57 list ( 272) 198 191 7 2 2.4 K
% 0.40/0.57 clash_nd ( 80) 376 376 0 5 0.4 K
% 0.40/0.57 clause_ptr ( 16) 1242 340 902 6 14.2 K
% 0.40/0.57 int_ptr ( 16) 6321 2381 3940 10 61.7 K
% 0.40/0.57 ci_ptr ( 24) 0 0 0 0 0.0 K
% 0.40/0.57 link_node ( 120) 0 0 0 0 0.0 K
% 0.40/0.57 ans_lit_node( 24) 0 0 0 0 0.0 K
% 0.40/0.57 formula_box( 168) 0 0 0 0 0.0 K
% 0.40/0.57 formula( 40) 2664 2664 0 1225 47.9 K
% 0.40/0.57 formula_ptr( 16) 188 188 0 188 2.9 K
% 0.40/0.57 cl_attribute( 24) 0 0 0 0 0.0 K
% 0.40/0.57
% 0.40/0.57 ********** is_delete, can't find end.
% 0.40/0.57 or time 0.00
% 0.40/0.57 FINDER time 0.00
% 0.40/0.57 unindex time 0.00
% 0.40/0.57
% 0.40/0.57 Forward subsumption counts, subsumer:number_subsumed.
% 0.40/0.57 1:0 2:0 3:1 4:0 5:0 6:0 7:0 8:0 9:0 10:2
% 0.40/0.57 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 0.40/0.57 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 0.40/0.57 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 0.40/0.57 41:1 42:0 43:0 44:0 45:0 46:0 47:1 48:0 49:0 50:0
% 0.40/0.57 51:0 52:0 53:0 54:0 55:0 56:0 57:0 58:0 59:0 60:0
% 0.40/0.57 61:0 62:0 63:0 64:0 65:0 66:0 67:0 68:0 69:0 70:0
% 0.40/0.57 71:0 72:0 73:0 74:0 75:0 76:0 77:0 78:1 79:0 80:0
% 0.40/0.57 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 0.40/0.57 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 0.40/0.57 All others: 294.
% 0.40/0.57
% 0.40/0.57 ********** ABNORMAL END **********
% 0.40/0.57
% 0.40/0.57 ********** is_delete, can't find end.
%------------------------------------------------------------------------------