TSTP Solution File: SWW470+5 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWW470+5 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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 : Thu Jul 21 01:26:55 EDT 2022
% Result : Unknown 2.74s 3.01s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWW470+5 : TPTP v8.1.0. Released v5.3.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 4 14:12:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.41 ----- Otter 3.2, August 2001 -----
% 0.13/0.41 The process was started by sandbox on n018.cluster.edu,
% 0.13/0.41 Sat Jun 4 14:12:17 2022
% 0.13/0.41 The command was "./sos". The process ID is 11384.
% 0.13/0.41
% 0.13/0.41 set(prolog_style_variables).
% 0.13/0.41 set(auto).
% 0.13/0.41 dependent: set(auto1).
% 0.13/0.41 dependent: set(process_input).
% 0.13/0.41 dependent: clear(print_kept).
% 0.13/0.41 dependent: clear(print_new_demod).
% 0.13/0.41 dependent: clear(print_back_demod).
% 0.13/0.41 dependent: clear(print_back_sub).
% 0.13/0.41 dependent: set(control_memory).
% 0.13/0.41 dependent: assign(max_mem, 12000).
% 0.13/0.41 dependent: assign(pick_given_ratio, 4).
% 0.13/0.41 dependent: assign(stats_level, 1).
% 0.13/0.41 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.41 dependent: assign(sos_limit, 5000).
% 0.13/0.41 dependent: assign(max_weight, 60).
% 0.13/0.41 clear(print_given).
% 0.13/0.41
% 0.13/0.41 formula_list(usable).
% 0.13/0.41
% 0.13/0.41 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.41
% 0.13/0.41 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.41 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.41 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.41 clauses in usable.
% 0.13/0.41
% 0.13/0.41 dependent: set(knuth_bendix).
% 0.13/0.41 dependent: set(para_from).
% 0.13/0.41 dependent: set(para_into).
% 0.13/0.41 dependent: clear(para_from_right).
% 0.13/0.41 dependent: clear(para_into_right).
% 0.13/0.41 dependent: set(para_from_vars).
% 0.13/0.41 dependent: set(eq_units_both_ways).
% 0.13/0.41 dependent: set(dynamic_demod_all).
% 0.13/0.41 dependent: set(dynamic_demod).
% 0.13/0.41 dependent: set(order_eq).
% 0.13/0.41 dependent: set(back_demod).
% 0.13/0.41 dependent: set(lrpo).
% 0.13/0.41 dependent: set(hyper_res).
% 0.13/0.41 dependent: set(unit_deletion).
% 0.13/0.41 dependent: set(factor).
% 0.13/0.41
% 0.13/0.41 ------------> process usable:
% 0.13/0.41 Following clause subsumed by 22 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),bot_bot(fun(A,bool)))).
% 0.13/0.41 Following clause subsumed by 26 during input processing: 0 [flip.1] {-} hAPP(fun(A,bool),fun(A,bool),collect(A),B)!=bot_bot(fun(A,bool))| -hBOOL(hAPP(A,bool,B,C)).
% 0.13/0.41 Following clause subsumed by 25 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),C))|ti(fun(A,bool),C)!=bot_bot(fun(A,bool)).
% 0.13/0.41 Following clause subsumed by 25 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),C))|ti(fun(A,bool),C)!=bot_bot(fun(A,bool)).
% 0.13/0.41 Following clause subsumed by 20 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),C))|hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),D),C))).
% 0.13/0.41 Following clause subsumed by 19 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),C),D)))|ti(A,B)=ti(A,C)|hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),D)).
% 0.13/0.41 Following clause subsumed by 21 during input processing: 0 [] {-} hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),C),D)))|ti(A,B)!=ti(A,C).
% 0.13/0.41 Following clause subsumed by 20 during input processing: 0 [] {-} hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),C),D)))| -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),D)).
% 0.13/0.41 Following clause subsumed by 34 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),C),bot_bot(fun(A,bool)))))|ti(A,B)=ti(A,C).
% 0.13/0.41 Following clause subsumed by 21 during input processing: 0 [] {-} hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),C),bot_bot(fun(A,bool)))))|ti(A,B)!=ti(A,C).
% 0.13/0.41 Following clause subsumed by 41 during input processing: 0 [flip.1] {-} hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),B),C)!=bot_bot(fun(A,bool)).
% 0.20/0.44 Following clause subsumed by 42 during input processing: 0 [] {-} -bot(A)|hAPP(B,A,bot_bot(fun(B,A)),C)=bot_bot(A).
% 0.20/0.44 Following clause subsumed by 46 during input processing: 0 [flip.1] {-} hAPP(com,com,hAPP(com,fun(com,com),semi,A),B)!=skip.
% 0.20/0.44 Following clause subsumed by 22 during input processing: 0 [unit_del,69] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),bot_bot(fun(A,bool)))).
% 0.20/0.44 Following clause subsumed by 83 during input processing: 0 [] {-} -finite_finite(A)|hBOOL(hAPP(fun(A,bool),bool,finite_finite_1(A),B)).
% 0.20/0.44 Following clause subsumed by 76 during input processing: 0 [] {-} hBOOL(hAPP(fun(A,bool),bool,finite_finite_1(A),hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),B),C)))| -hBOOL(hAPP(fun(A,bool),bool,finite_finite_1(A),C)).
% 0.20/0.44
% 0.20/0.44 ------------> process sos:
% 0.20/0.44 Following clause subsumed by 246 during input processing: 0 [] {-} hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),B),C)=hAPP(fun(A,bool),fun(A,bool),collect(A),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,fun(bool,bool)),fun(fun(A,bool),fun(A,bool)),combs(A,bool,bool),hAPP(fun(A,bool),fun(A,fun(bool,bool)),hAPP(fun(bool,fun(bool,bool)),fun(fun(A,bool),fun(A,fun(bool,bool))),combb(bool,fun(bool,bool),A),fdisj),hAPP(A,fun(A,bool),hAPP(fun(A,fun(A,bool)),fun(A,fun(A,bool)),combc(A,A,bool),fequal(A)),B))),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,fun(fun(A,bool),bool)),fun(fun(A,bool),fun(A,bool)),combc(A,fun(A,bool),bool),member(A)),C))).
% 0.20/0.44 Following clause subsumed by 242 during input processing: 0 [copy,242,flip.1] {-} hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),B),hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),C),D))=hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),C),hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),B),D)).
% 0.20/0.44 Following clause subsumed by 284 during input processing: 0 [copy,284,flip.1] {-} A=A.
% 0.20/0.44 Following clause subsumed by 245 during input processing: 0 [copy,291,flip.1] {-} hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),B),hAPP(fun(A,bool),fun(A,bool),collect(A),C))=hAPP(fun(A,bool),fun(A,bool),collect(A),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,fun(bool,bool)),fun(fun(A,bool),fun(A,bool)),combs(A,bool,bool),hAPP(fun(A,bool),fun(A,fun(bool,bool)),hAPP(fun(bool,fun(bool,bool)),fun(fun(A,bool),fun(A,fun(bool,bool))),combb(bool,fun(bool,bool),A),fimplies),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(bool,bool),fun(fun(A,bool),fun(A,bool)),combb(bool,bool,A),fNot),hAPP(A,fun(A,bool),hAPP(fun(A,fun(A,bool)),fun(A,fun(A,bool)),combc(A,A,bool),fequal(A)),B)))),C)).
% 0.20/0.44 Following clause subsumed by 246 during input processing: 0 [copy,292,flip.1] {-} hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),B),C)=hAPP(fun(A,bool),fun(A,bool),collect(A),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,fun(bool,bool)),fun(fun(A,bool),fun(A,bool)),combs(A,bool,bool),hAPP(fun(A,bool),fun(A,fun(bool,bool)),hAPP(fun(bool,fun(bool,bool)),fun(fun(A,bool),fun(A,fun(bool,bool))),combb(bool,fun(bool,bool),A),fdisj),hAPP(A,fun(A,bool),hAPP(fun(A,fun(A,bool)),fun(A,fun(A,bool)),combc(A,A,bool),fequal(A)),B))),hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,fun(fun(A,bool),bool)),fun(fun(A,bool),fun(A,bool)),combc(A,fun(A,bool),bool),member(A)),C))).
% 0.20/0.44 Following clause subsumed by 249 during input processing: 0 [copy,293,flip.1] {-} hAPP(fun(A,bool),A,the_elem(A),hAPP(fun(A,bool),fun(A,bool),collect(A),hAPP(A,fun(A,bool),fequal(A),B)))=ti(A,B).
% 0.20/0.44 Following clause subsumed by 257 during input processing: 0 [copy,294,flip.1] {-} hAPP(fun(A,bool),A,the_elem(A),B)=hAPP(fun(A,bool),A,the(A),hAPP(fun(A,fun(A,bool)),fun(A,bool),hAPP(fun(fun(A,bool),bool),fun(fun(A,fun(A,bool)),fun(A,bool)),combb(fun(A,bool),bool,A),hAPP(fun(A,bool),fun(fun(A,bool),bool),fequal(fun(A,bool)),B)),hAPP(fun(A,bool),fun(A,fun(A,bool)),hAPP(fun(A,fun(fun(A,bool),fun(A,bool))),fun(fun(A,bool),fun(A,fun(A,bool))),combc(A,fun(A,bool),fun(A,bool)),insert(A)),bot_bot(fun(A,bool))))).
% 0.20/0.44 Following clause subsumed by 258 during input processing: 0 [copy,295,flip.1] {-} hAPP(fun(A,bool),A,the(A),hAPP(A,fun(A,bool),fequal(A),B))=ti(A,B).
% 0.20/0.44 Following clause subsumed by 259 during input processing: 0 [copy,296,flip.1] {-} hAPP(fun(A,bool),A,the(A),hAPP(A,fun(A,bool),hAPP(fun(A,fun(A,bool)),fun(A,fun(A,bool)),combc(A,A,bool),fequal(A)),B))=ti(A,B).
% 0.20/0.44 Following clause subsumed by 269 during input processing: 0 [copy,297,flip.1] {-} hAPP(fun(A,bool),fun(A,bool),collect(A),B)=ti(fun(A,bool),B).
% 0.20/0.44 Following clause subsumed by 272 during input processing: 0 [copy,298,flip.1] {-} hAPP(fun(A,bool),A,hAPP(fun(A,fun(A,A)),fun(fun(A,bool),A),finite_fold1(A),B),hAPP(fun(A,bool),fun(A,bool),collect(A),hAPP(A,fun(A,bool),fequal(A),C)))=ti(A,C).
% 0.20/0.44 Following clause subsumed by 278 during input processing: 0 [copy,299,flip.1] {-} hAPP(A,B,hAPP(fun(A,C),fun(A,B),hAPP(fun(C,B),fun(fun(A,C),fun(A,B)),combb(C,B,A),D),E),F)=hAPP(C,B,D,hAPP(A,C,E,F)).
% 0.20/0.44 Following clause subsumed by 279 during input processing: 0 [copy,300,flip.1] {-} hAPP(A,B,hAPP(C,fun(A,B),hAPP(fun(A,fun(C,B)),fun(C,fun(A,B)),combc(A,C,B),D),E),F)=hAPP(C,B,hAPP(A,fun(C,B),D,F),E).
% 0.20/0.44 Following clause subsumed by 280 during input processing: 0 [copy,301,flip.1] {-} hAPP(A,B,hAPP(B,fun(A,B),combk(B,A),C),D)=ti(B,C).
% 0.20/0.44 Following clause subsumed by 281 during input processing: 0 [copy,302,flip.1] {-} hAPP(A,B,hAPP(fun(A,C),fun(A,B),hAPP(fun(A,fun(C,B)),fun(fun(A,C),fun(A,B)),combs(A,C,B),D),E),F)=hAPP(C,B,hAPP(A,fun(C,B),D,F),hAPP(A,C,E,F)).
% 0.20/0.44
% 0.20/0.44 ======= end of input processing =======
% 2.52/2.70
% 2.52/2.70 Stopped by limit on insertions
% 2.52/2.70
% 2.52/2.70
% 2.52/2.70 Failed to model usable list: disabling FINDER
% 2.52/2.70
% 2.52/2.70
% 2.52/2.70
% 2.52/2.70 -------------- Softie stats --------------
% 2.52/2.70
% 2.52/2.70 UPDATE_STOP: 300
% 2.52/2.70 SFINDER_TIME_LIMIT: 2
% 2.52/2.70 SHORT_CLAUSE_CUTOFF: 4
% 2.52/2.70 number of clauses in intial UL: 111
% 2.52/2.70 number of clauses initially in problem: 253
% 2.52/2.70 percentage of clauses intially in UL: 43
% 2.52/2.70 percentage of distinct symbols occuring in initial UL: 54
% 2.52/2.70 percent of all initial clauses that are short: 99
% 2.52/2.70 absolute distinct symbol count: 107
% 2.52/2.70 distinct predicate count: 4
% 2.52/2.70 distinct function count: 87
% 2.52/2.70 distinct constant count: 16
% 2.52/2.70
% 2.52/2.70 ---------- no more Softie stats ----------
% 2.52/2.70
% 2.52/2.70
% 2.52/2.70
% 2.52/2.70 =========== start of search ===========
% 2.52/2.71
% 2.52/2.71
% 2.52/2.71 Changing weight limit from 60 to 101.
% 2.52/2.71
% 2.52/2.71 Resetting weight limit to 101 after 5 givens.
% 2.52/2.71
% 2.74/3.00 hBOOL(hAPP(bool,bool,hAPP(bool,fun(bool,bool),fconj,hAPP(bool,bool,fNot,bot_bot(bool))),hAPP(bool,bool,fNot,fFalse))).
% 2.74/3.00
% 2.74/3.00 ------------- memory usage ------------
% 2.74/3.00 250 mallocs of 32700 bytes each, 7983.4 K.
% 2.74/3.00 type (bytes each) gets frees in use avail bytes
% 2.74/3.00 sym_ent ( 304) 275 0 275 0 81.6 K
% 2.74/3.00 term ( 32) 2396106 2372336 23770 93 745.7 K
% 2.74/3.00 rel ( 40) 2342567 2306389 36178 84 1416.5 K
% 2.74/3.00 term_ptr ( 16) 258071 32115 225956 459 3537.7 K
% 2.74/3.00 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 2.74/3.00 fpa_head ( 24) 16216 3025 13191 13 309.5 K
% 2.74/3.00 fpa_tree ( 56) 25179 25179 0 129 7.1 K
% 2.74/3.00 context (1288) 79946 79946 0 5 6.3 K
% 2.74/3.00 trail ( 24) 198093 198093 0 11 0.3 K
% 2.74/3.00 imd_tree ( 32) 548 0 548 0 17.1 K
% 2.74/3.00 imd_pos (4024) 1183137 1183137 0 13 51.1 K
% 2.74/3.00 is_tree ( 24) 31862 2784 29078 366 690.1 K
% 2.74/3.00 is_pos (2424) 1241061 1241061 0 42 99.4 K
% 2.74/3.00 fsub_pos ( 16) 40979 40979 0 1 0.0 K
% 2.74/3.00 literal ( 32) 33443 28555 4888 2 152.8 K
% 2.74/3.00 clause ( 88) 23308 20995 2313 1 198.9 K
% 2.74/3.00 list ( 272) 174 167 7 2 2.4 K
% 2.74/3.00 clash_nd ( 80) 387 387 0 2 0.2 K
% 2.74/3.00 clause_ptr ( 16) 2334 218 2116 12 33.2 K
% 2.74/3.00 int_ptr ( 16) 193591 176799 16792 5 262.5 K
% 2.74/3.00 ci_ptr ( 24) 0 0 0 0 0.0 K
% 2.74/3.00 link_node ( 120) 0 0 0 0 0.0 K
% 2.74/3.00 ans_lit_node( 24) 0 0 0 0 0.0 K
% 2.74/3.00 formula_box( 168) 0 0 0 0 0.0 K
% 2.74/3.00 formula( 40) 1702 1702 0 1074 42.0 K
% 2.74/3.00 formula_ptr( 16) 164 164 0 164 2.6 K
% 2.74/3.00 cl_attribute( 24) 0 0 0 0 0.0 K
% 2.74/3.00
% 2.74/3.00 ********** is_delete, can't find end.
% 2.74/3.00 ost_process time 0.00
% 2.74/3.00 back demod time 0.00
% 2.74/3.00 back subsume 0.00
% 2.74/3.00 factor time 0.00
% 2.74/3.00 FINDER time 0.00
% 2.74/3.00 unindex time 0.00
% 2.74/3.00
% 2.74/3.00 Forward subsumption counts, subsumer:number_subsumed.
% 2.74/3.00 1:0 2:0 3:0 4:0 5:0 6:0 7:0 8:0 9:0 10:0
% 2.74/3.00 11:0 12:0 13:0 14:0 15:0 16:0 17:0 18:0 19:2 20:2
% 2.74/3.00 21:3 22:2 23:0 24:0 25:3 26:1 27:0 28:1 29:1 30:1
% 2.74/3.00 31:1 32:0 33:0 34:1 35:0 36:0 37:0 38:0 39:0 40:0
% 2.74/3.00 41:1 42:1 43:0 44:0 45:0 46:1 47:0 48:0 49:0 50:0
% 2.74/3.00 51:0 52:0 53:0 54:0 55:0 56:0 57:0 58:0 59:0 60:0
% 2.74/3.00 61:0 62:0 63:0 64:2 65:0 66:0 67:0 68:0 69:0 70:0
% 2.74/3.00 71:1 72:0 73:0 74:0 75:0 76:1 77:0 78:0 79:0 80:0
% 2.74/3.00 81:1 82:0 83:1 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 2.74/3.00 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 2.74/3.00 All others: 19916.
% 2.74/3.00
% 2.74/3.00 ********** ABNORMAL END **********
% 2.74/3.00
% 2.74/3.00 ********** is_delete, can't find end.
%------------------------------------------------------------------------------