TSTP Solution File: LAT285+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LAT285+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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 : Sun Jul 17 06:46:45 EDT 2022
% Result : Unknown 1.65s 1.87s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT285+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n008.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 : Wed Jun 29 13:04:08 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 n008.cluster.edu,
% 0.20/0.39 Wed Jun 29 13:04:08 2022
% 0.20/0.39 The command was "./sos". The process ID is 9417.
% 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=10.
% 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 62 during input processing: 0 [] {-} v1_xboole_0(A)|v1_xboole_0(B)| -m1_relset_1(C,A,B)| -v1_funct_1(C)| -v1_funct_2(C,A,B)|v1_partfun1(C,A,B).
% 0.20/0.39 Following clause subsumed by 40 during input processing: 0 [] {-} -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)| -v11_lattices(A)|v4_lattices(A).
% 0.20/0.39 Following clause subsumed by 41 during input processing: 0 [] {-} -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)| -v11_lattices(A)|v5_lattices(A).
% 0.20/0.39 Following clause subsumed by 42 during input processing: 0 [] {-} -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)| -v11_lattices(A)|v6_lattices(A).
% 0.20/0.39 Following clause subsumed by 43 during input processing: 0 [] {-} -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)| -v11_lattices(A)|v7_lattices(A).
% 0.20/0.39 Following clause subsumed by 44 during input processing: 0 [] {-} -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)| -v11_lattices(A)|v8_lattices(A).
% 0.20/0.39 Following clause subsumed by 45 during input processing: 0 [] {-} -l3_lattices(A)|v3_struct_0(A)| -v10_lattices(A)| -v11_lattices(A)|v9_lattices(A).
% 0.20/0.39 Following clause subsumed by 59 during input processing: 0 [] {-} v3_struct_0(A)| -l3_lattices(A)| -v15_lattices(A)|v13_lattices(A).
% 0.20/0.39 Following clause subsumed by 60 during input processing: 0 [] {-} v3_struct_0(A)| -l3_lattices(A)| -v15_lattices(A)|v14_lattices(A).
% 0.20/0.39 Following clause subsumed by 57 during input processing: 0 [] {-} v3_struct_0(A)| -l3_lattices(A)|v15_lattices(A)| -v13_lattices(A)| -v14_lattices(A).
% 0.20/0.39 Following clause subsumed by 66 during input processing: 0 [] {-} v3_struct_0(A)| -l3_lattices(A)| -v17_lattices(A)|v15_lattices(A).
% 0.20/0.39 Following clause subsumed by 67 during input processing: 0 [] {-} v3_struct_0(A)| -l3_lattices(A)| -v17_lattices(A)|v16_lattices(A).
% 0.20/0.39 Following clause subsumed by 63 during input processing: 0 [] {-} v3_struct_0(A)| -l3_lattices(A)| -v17_lattices(A)|v11_lattices(A).
% 0.20/0.39 Following clause subsumed by 69 during input processing: 0 [] {-} v3_struct_0(A)| -l3_lattices(A)|v17_lattices(A)| -v15_lattices(A)| -v16_lattices(A)| -v11_lattices(A).
% 0.20/0.39 Following clause subsumed by 118 during input processing: 0 [] {-} v1_xboole_0(A)| -v1_funct_1(B)| -v1_funct_2(B,k2_zfmisc_1(A,A),A)| -m1_relset_1(B,k2_zfmisc_1(A,A),A)| -v1_funct_1(C)| -v1_funct_2(C,k2_zfmisc_1(A,A),A)| -m1_relset_1(C,k2_zfmisc_1(A,A),A)|v3_lattices(g3_lattices(A,B,C)).
% 0.20/0.39
% 0.20/0.39 ------------> process sos:
% 0.20/0.39 Following clause subsumed by 413 during input processing: 0 [copy,413,flip.1] {-} k2_tarski(A,B)=k2_tarski(B,A).
% 0.20/0.39 Following clause subsumed by 414 during input processing: 0 [copy,414,flip.1] {-} k2_xboole_0(A,B)=k2_xboole_0(B,A).
% 0.20/0.39 Following clause subsumed by 415 during input processing: 0 [copy,415,flip.1] {-} k3_xboole_0(A,B)=k3_xboole_0(B,A).
% 0.20/0.39 Following clause subsumed by 532 during input processing: 0 [copy,532,flip.1] {-} A=A.
% 0.20/0.39 532 back subsumes 409.
% 0.20/0.39 532 back subsumes 402.
% 0.20/0.39 532 back subsumes 329.
% 0.20/0.39 532 back subsumes 328.
% 0.20/0.39 532 back subsumes 327.
% 0.20/0.39 532 back subsumes 326.
% 0.20/0.39 532 back subsumes 325.
% 0.20/0.39 532 back subsumes 324.
% 0.20/0.39 532 back subsumes 323.
% 0.20/0.39 Following clause subsumed by 416 during input processing: 0 [copy,533,flip.1] {-} k4_tarski(A,B)=k2_tarski(k2_tarski(A,B),k1_tarski(A)).
% 0.20/0.39
% 0.20/0.39 ======= end of input processing =======
% 0.99/1.16
% 0.99/1.16 Model 1 (0.00 seconds, 0 Inserts)
% 0.99/1.16
% 0.99/1.16 Stopped by limit on number of solutions
% 0.99/1.16
% 0.99/1.16
% 0.99/1.16 -------------- Softie stats --------------
% 0.99/1.16
% 0.99/1.16 UPDATE_STOP: 300
% 0.99/1.16 SFINDER_TIME_LIMIT: 2
% 0.99/1.16 SHORT_CLAUSE_CUTOFF: 4
% 0.99/1.16 number of clauses in intial UL: 372
% 0.99/1.16 number of clauses initially in problem: 501
% 0.99/1.16 percentage of clauses intially in UL: 74
% 0.99/1.16 percentage of distinct symbols occuring in initial UL: 91
% 0.99/1.16 percent of all initial clauses that are short: 99
% 0.99/1.16 absolute distinct symbol count: 126
% 0.99/1.16 distinct predicate count: 52
% 0.99/1.16 distinct function count: 57
% 0.99/1.16 distinct constant count: 17
% 0.99/1.16
% 0.99/1.16 ---------- no more Softie stats ----------
% 0.99/1.16
% 0.99/1.16
% 0.99/1.16
% 0.99/1.16 Model 2 (0.00 seconds, 0 Inserts)
% 0.99/1.16
% 0.99/1.16 Stopped by limit on number of solutions
% 0.99/1.16
% 0.99/1.16 =========== start of search ===========
% 1.65/1.87
% 1.65/1.87 Stopped by limit on insertions
% 1.65/1.87 k6_lopclset($c1)=g3_lattices(k1_lopclset($c1),k4_lopclset($c1),k5_lopclset($c1)).
% 1.65/1.87
% 1.65/1.87 ------------- memory usage ------------
% 1.65/1.87 39 mallocs of 32700 bytes each, 1245.4 K.
% 1.65/1.87 type (bytes each) gets frees in use avail bytes
% 1.65/1.87 sym_ent ( 304) 242 0 242 0 71.8 K
% 1.65/1.87 term ( 32) 49341 43095 6246 9 195.5 K
% 1.65/1.87 rel ( 40) 38932 33054 5878 5 229.8 K
% 1.65/1.87 term_ptr ( 16) 15734 1266 14468 0 226.1 K
% 1.65/1.87 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 1.65/1.87 fpa_head ( 24) 2743 26 2717 5 63.8 K
% 1.65/1.87 fpa_tree ( 56) 1054 1054 0 11 0.6 K
% 1.65/1.87 context (1288) 4665 4665 0 9 11.3 K
% 1.65/1.87 trail ( 24) 20412 20412 0 6 0.1 K
% 1.65/1.87 imd_tree ( 32) 18 2 16 0 0.5 K
% 1.65/1.87 imd_pos (4024) 53 53 0 2 7.9 K
% 1.65/1.87 is_tree ( 24) 1924 112 1812 0 42.5 K
% 1.65/1.87 is_pos (2424) 12223 12223 0 12 28.4 K
% 1.65/1.87 fsub_pos ( 16) 2771 2771 0 1 0.0 K
% 1.65/1.87 literal ( 32) 4681 1811 2870 0 89.7 K
% 1.65/1.87 clause ( 88) 1343 337 1006 0 86.5 K
% 1.65/1.87 list ( 272) 219 212 7 2 2.4 K
% 1.65/1.87 clash_nd ( 80) 200 200 0 7 0.5 K
% 1.65/1.87 clause_ptr ( 16) 647 58 589 2 9.2 K
% 1.65/1.87 int_ptr ( 16) 1648 826 822 0 12.8 K
% 1.65/1.87 ci_ptr ( 24) 0 0 0 0 0.0 K
% 1.65/1.87 link_node ( 120) 0 0 0 0 0.0 K
% 1.65/1.87 ans_lit_node( 24) 0 0 0 0 0.0 K
% 1.65/1.87 formula_box( 168) 0 0 0 0 0.0 K
% 1.65/1.87 formula( 40) 3690 3690 0 1804 70.5 K
% 1.65/1.87 formula_ptr( 16) 209 209 0 209 3.3 K
% 1.65/1.87 cl_attribute( 24) 0 0 0 0 0.0 K
% 1.65/1.87
% 1.65/1.87 ********** is_delete, can't find end.
% 1.65/1.87 ocess time 0.00
% 1.65/1.87 back demod time 0.00
% 1.65/1.87 back subsume 0.00
% 1.65/1.87 factor time 0.00
% 1.65/1.87 FINDER time 0.00
% 1.65/1.87 unindex time 0.00
% 1.65/1.87
% 1.65/1.87 ----------- soft-scott stats ----------
% 1.65/1.87
% 1.65/1.87 true clauses given 0 (0.0%)
% 1.65/1.87 false clauses given 2
% 1.65/1.87
% 1.65/1.87 FALSE TRUE
% 1.65/1.87 2 55 29
% 1.65/1.87 3 4 2
% 1.65/1.87 4 6 7
% 1.65/1.87 5 5 1
% 1.65/1.87 6 5 1
% 1.65/1.87 7 4 1
% 1.65/1.87 10 2 0
% 1.65/1.87 12 0 1
% 1.65/1.87 13 2 0
% 1.65/1.87 19 0 2
% 1.65/1.87 25 0 3
% 1.65/1.87 29 0 2
% 1.65/1.87 39 0 3
% 1.65/1.87 tot: 83 52 (38.5% true)
% 1.65/1.87
% 1.65/1.87
% 1.65/1.87 Model 2 (0.00 seconds, 0 Inserts)
% 1.65/1.87
% 1.65/1.87 Forward subsumption counts, subsumer:number_subsumed.
% 1.65/1.87 1:0 2:0 3:0 4:0 5:0 6:0 7:0 8:0 9:0 10:0
% 1.65/1.87 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 1.65/1.87 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:0 30:0
% 1.65/1.87 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:1
% 1.65/1.87 41:1 42:1 43:1 44:1 45:1 46:1 47:0 48:0 49:0 50:0
% 1.65/1.87 51:0 52:0 53:0 54:0 55:0 56:1 57:1 58:1 59:1 60:1
% 1.65/1.87 61:1 62:1 63:1 64:0 65:0 66:1 67:1 68:0 69:1 70:0
% 1.65/1.87 71:0 72:0 73:0 74:0 75:0 76:0 77:0 78:0 79:0 80:0
% 1.65/1.87 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 1.65/1.87 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 1.65/1.87 All others: 54.
% 1.65/1.87
% 1.65/1.87 ********** ABNORMAL END **********
% 1.65/1.87
% 1.65/1.87 ********** is_delete, can't find end.
%------------------------------------------------------------------------------