TSTP Solution File: LAT317+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LAT317+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:47:16 EDT 2022
% Result : Unknown 1.19s 1.39s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LAT317+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 30 10:11:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.39 ----- Otter 3.2, August 2001 -----
% 0.12/0.39 The process was started by sandbox on n008.cluster.edu,
% 0.12/0.39 Thu Jun 30 10:11:53 2022
% 0.12/0.39 The command was "./sos". The process ID is 29119.
% 0.12/0.39
% 0.12/0.39 set(prolog_style_variables).
% 0.12/0.39 set(auto).
% 0.12/0.39 dependent: set(auto1).
% 0.12/0.39 dependent: set(process_input).
% 0.12/0.39 dependent: clear(print_kept).
% 0.12/0.39 dependent: clear(print_new_demod).
% 0.12/0.39 dependent: clear(print_back_demod).
% 0.12/0.39 dependent: clear(print_back_sub).
% 0.12/0.39 dependent: set(control_memory).
% 0.12/0.39 dependent: assign(max_mem, 12000).
% 0.12/0.39 dependent: assign(pick_given_ratio, 4).
% 0.12/0.39 dependent: assign(stats_level, 1).
% 0.12/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.39 dependent: assign(sos_limit, 5000).
% 0.12/0.39 dependent: assign(max_weight, 60).
% 0.12/0.39 clear(print_given).
% 0.12/0.39
% 0.12/0.39 formula_list(usable).
% 0.12/0.39
% 0.12/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=13.
% 0.12/0.39
% 0.12/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.39 clauses in usable.
% 0.12/0.39
% 0.12/0.39 dependent: set(knuth_bendix).
% 0.12/0.39 dependent: set(para_from).
% 0.12/0.39 dependent: set(para_into).
% 0.12/0.39 dependent: clear(para_from_right).
% 0.12/0.39 dependent: clear(para_into_right).
% 0.12/0.39 dependent: set(para_from_vars).
% 0.12/0.39 dependent: set(eq_units_both_ways).
% 0.12/0.39 dependent: set(dynamic_demod_all).
% 0.12/0.39 dependent: set(dynamic_demod).
% 0.12/0.39 dependent: set(order_eq).
% 0.12/0.39 dependent: set(back_demod).
% 0.12/0.39 dependent: set(lrpo).
% 0.12/0.39 dependent: set(hyper_res).
% 0.12/0.39 dependent: set(unit_deletion).
% 0.12/0.39 dependent: set(factor).
% 0.12/0.39
% 0.12/0.39 ------------> process usable:
% 0.12/0.39 Following clause subsumed by 32 during input processing: 0 [] {-} v3_struct_0(A)| -l3_lattices(A)|v3_lattices(k1_lattice2(A)).
% 0.12/0.39 Following clause subsumed by 58 during input processing: 0 [] {-} v3_struct_0(A)| -v4_lattices(A)| -l2_lattices(A)|v1_funct_1(u2_lattices(A)).
% 0.12/0.39 Following clause subsumed by 59 during input processing: 0 [] {-} v3_struct_0(A)| -v4_lattices(A)| -l2_lattices(A)|v1_funct_2(u2_lattices(A),k2_zfmisc_1(u1_struct_0(A),u1_struct_0(A)),u1_struct_0(A)).
% 0.12/0.39 Following clause subsumed by 58 during input processing: 0 [] {-} v3_struct_0(A)| -v5_lattices(A)| -l2_lattices(A)|v1_funct_1(u2_lattices(A)).
% 0.12/0.39 Following clause subsumed by 59 during input processing: 0 [] {-} v3_struct_0(A)| -v5_lattices(A)| -l2_lattices(A)|v1_funct_2(u2_lattices(A),k2_zfmisc_1(u1_struct_0(A),u1_struct_0(A)),u1_struct_0(A)).
% 0.12/0.39 Following clause subsumed by 29 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.12/0.39 Following clause subsumed by 74 during input processing: 0 [] {-} -v1_xboole_0(k1_tarski(A)).
% 0.12/0.39 Following clause subsumed by 55 during input processing: 0 [] {-} v3_struct_0(A)| -v6_lattices(A)| -l1_lattices(A)|v1_funct_1(u1_lattices(A)).
% 0.12/0.39 Following clause subsumed by 56 during input processing: 0 [] {-} v3_struct_0(A)| -v6_lattices(A)| -l1_lattices(A)|v1_funct_2(u1_lattices(A),k2_zfmisc_1(u1_struct_0(A),u1_struct_0(A)),u1_struct_0(A)).
% 0.12/0.39 Following clause subsumed by 55 during input processing: 0 [] {-} v3_struct_0(A)| -v7_lattices(A)| -l1_lattices(A)|v1_funct_1(u1_lattices(A)).
% 0.12/0.39 Following clause subsumed by 56 during input processing: 0 [] {-} v3_struct_0(A)| -v7_lattices(A)| -l1_lattices(A)|v1_funct_2(u1_lattices(A),k2_zfmisc_1(u1_struct_0(A),u1_struct_0(A)),u1_struct_0(A)).
% 0.12/0.39 Following clause subsumed by 67 during input processing: 0 [] {-} v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)| -v3_struct_0(k1_lattice2(A)).
% 0.12/0.39 Following clause subsumed by 32 during input processing: 0 [] {-} v3_struct_0(A)| -v10_lattices(A)| -l3_lattices(A)|v3_lattices(k1_lattice2(A)).
% 0.12/0.39
% 0.12/0.39 ------------> process sos:
% 0.12/0.39 Following clause subsumed by 220 during input processing: 0 [copy,220,flip.1] {-} k2_tarski(A,B)=k2_tarski(B,A).
% 0.12/0.39 Following clause subsumed by 261 during input processing: 0 [copy,261,flip.1] {-} A=A.
% 0.12/0.39 261 back subsumes 211.
% 0.12/0.39 261 back subsumes 197.
% 0.12/0.39 261 back subsumes 155.
% 0.12/0.39 261 back subsumes 154.
% 0.12/0.39 Following clause subsumed by 221 during input processing: 0 [copy,262,flip.1] {-} k4_tarski(A,B)=k2_tarski(k2_tarski(A,B),k1_tarski(A)).
% 0.12/0.39
% 0.12/0.39 ======= end of input processing =======
% 1.06/1.25
% 1.06/1.25 Stopped by limit on insertions
% 1.06/1.25
% 1.06/1.25
% 1.06/1.25 Failed to model usable list: disabling FINDER
% 1.06/1.25
% 1.06/1.25
% 1.06/1.25
% 1.06/1.25 -------------- Softie stats --------------
% 1.06/1.25
% 1.06/1.25 UPDATE_STOP: 300
% 1.06/1.25 SFINDER_TIME_LIMIT: 2
% 1.06/1.25 SHORT_CLAUSE_CUTOFF: 4
% 1.06/1.25 number of clauses in intial UL: 201
% 1.06/1.25 number of clauses initially in problem: 248
% 1.06/1.25 percentage of clauses intially in UL: 81
% 1.06/1.25 percentage of distinct symbols occuring in initial UL: 84
% 1.06/1.25 percent of all initial clauses that are short: 99
% 1.06/1.25 absolute distinct symbol count: 92
% 1.06/1.25 distinct predicate count: 33
% 1.06/1.25 distinct function count: 40
% 1.06/1.25 distinct constant count: 19
% 1.06/1.25
% 1.06/1.25 ---------- no more Softie stats ----------
% 1.06/1.25
% 1.06/1.25
% 1.06/1.25
% 1.06/1.25 =========== start of search ===========
% 1.19/1.39 k4_lattices($c18,$f4(u1_struct_0($c18)),$f4(u1_struct_0($c18)))=k2_lattices($c18,$f4(u1_struct_0($c18)),$f4(u1_struct_0($c18))).
% 1.19/1.39
% 1.19/1.39 ------------- memory usage ------------
% 1.19/1.39 84 mallocs of 32700 bytes each, 2682.4 K.
% 1.19/1.39 type (bytes each) gets frees in use avail bytes
% 1.19/1.39 sym_ent ( 304) 209 0 209 0 62.0 K
% 1.19/1.39 term ( 32) 375229 365620 9609 65 302.3 K
% 1.19/1.39 rel ( 40) 304694 288511 16183 16 632.8 K
% 1.19/1.39 term_ptr ( 16) 50099 2494 47605 0 743.8 K
% 1.19/1.39 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 1.19/1.39 fpa_head ( 24) 4248 226 4022 10 94.5 K
% 1.19/1.39 fpa_tree ( 56) 7613 7613 0 25 1.4 K
% 1.19/1.39 context (1288) 33685 33685 0 10 12.6 K
% 1.19/1.39 trail ( 24) 309012 309012 0 9 0.2 K
% 1.19/1.39 imd_tree ( 32) 181 7 174 0 5.4 K
% 1.19/1.39 imd_pos (4024) 0 0 0 0 0.0 K
% 1.19/1.39 is_tree ( 24) 5372 450 4922 2 115.4 K
% 1.19/1.39 is_pos (2424) 209750 209750 0 10 23.7 K
% 1.19/1.39 fsub_pos ( 16) 21204 21204 0 1 0.0 K
% 1.19/1.39 literal ( 32) 66192 59111 7081 2 221.3 K
% 1.19/1.39 clause ( 88) 9762 8267 1495 0 128.5 K
% 1.19/1.39 list ( 272) 131 124 7 2 2.4 K
% 1.19/1.39 clash_nd ( 80) 4000 4000 0 8 0.6 K
% 1.19/1.39 clause_ptr ( 16) 1437 119 1318 2 20.6 K
% 1.19/1.39 int_ptr ( 16) 23054 12785 10269 7 160.6 K
% 1.19/1.39 ci_ptr ( 24) 0 0 0 0 0.0 K
% 1.19/1.39 link_node ( 120) 0 0 0 0 0.0 K
% 1.19/1.39 ans_lit_node( 24) 0 0 0 0 0.0 K
% 1.19/1.39 formula_box( 168) 0 0 0 0 0.0 K
% 1.19/1.39 formula( 40) 2140 2140 0 1071 41.8 K
% 1.19/1.39 formula_ptr( 16) 121 121 0 121 1.9 K
% 1.19/1.39 cl_attribute( 24) 0 0 0 0 0.0 K
% 1.19/1.39
% 1.19/1.39 ********** is_delete, can't find end.
% 1.19/1.39 0.00
% 1.19/1.39 post_process time 0.00
% 1.19/1.39 back demod time 0.00
% 1.19/1.39 back subsume 0.00
% 1.19/1.39 factor time 0.00
% 1.19/1.39 FINDER time 0.00
% 1.19/1.39 unindex time 0.00
% 1.19/1.39
% 1.19/1.39 Forward subsumption counts, subsumer:number_subsumed.
% 1.19/1.39 1:0 2:0 3:0 4:0 5:0 6:5 7:0 8:0 9:0 10:0
% 1.19/1.39 11:0 12:0 13:4 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 1.19/1.39 21:0 22:0 23:0 24:0 25:0 26:0 27:0 28:0 29:1 30:0
% 1.19/1.39 31:0 32:2 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 1.19/1.39 41:0 42:0 43:0 44:0 45:0 46:0 47:0 48:0 49:0 50:0
% 1.19/1.39 51:0 52:0 53:0 54:0 55:2 56:2 57:0 58:2 59:2 60:0
% 1.19/1.39 61:0 62:0 63:0 64:0 65:0 66:0 67:1 68:0 69:1 70:0
% 1.19/1.39 71:0 72:0 73:0 74:2 75:0 76:0 77:0 78:0 79:0 80:2
% 1.19/1.39 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 1.19/1.39 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 1.19/1.39 All others: 1611.
% 1.19/1.39
% 1.19/1.39 ********** ABNORMAL END **********
% 1.19/1.39
% 1.19/1.39 ********** is_delete, can't find end.
%------------------------------------------------------------------------------