TSTP Solution File: SWW474+5 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWW474+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:27:00 EDT 2022
% Result : Unknown 1.58s 1.79s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SWW474+5 : TPTP v8.1.0. Released v5.3.0.
% 0.06/0.16 % Command : sos-script %s
% 0.11/0.35 % Computer : n018.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8042.1875MB
% 0.11/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 600
% 0.11/0.35 % DateTime : Mon Jun 6 07:40:04 EDT 2022
% 0.11/0.35 % CPUTime :
% 0.11/0.40 ----- Otter 3.2, August 2001 -----
% 0.11/0.40 The process was started by sandbox2 on n018.cluster.edu,
% 0.11/0.40 Mon Jun 6 07:40:04 2022
% 0.11/0.40 The command was "./sos". The process ID is 28168.
% 0.11/0.40
% 0.11/0.40 set(prolog_style_variables).
% 0.11/0.40 set(auto).
% 0.11/0.40 dependent: set(auto1).
% 0.11/0.40 dependent: set(process_input).
% 0.11/0.40 dependent: clear(print_kept).
% 0.11/0.40 dependent: clear(print_new_demod).
% 0.11/0.40 dependent: clear(print_back_demod).
% 0.11/0.40 dependent: clear(print_back_sub).
% 0.11/0.40 dependent: set(control_memory).
% 0.11/0.40 dependent: assign(max_mem, 12000).
% 0.11/0.40 dependent: assign(pick_given_ratio, 4).
% 0.11/0.40 dependent: assign(stats_level, 1).
% 0.11/0.40 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.40 dependent: assign(sos_limit, 5000).
% 0.11/0.40 dependent: assign(max_weight, 60).
% 0.11/0.40 clear(print_given).
% 0.11/0.40
% 0.11/0.40 formula_list(usable).
% 0.11/0.40
% 0.11/0.40 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.11/0.40
% 0.11/0.40 This ia a non-Horn set with equality. The strategy will be
% 0.11/0.40 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.11/0.40 unit deletion, with positive clauses in sos and nonpositive
% 0.11/0.40 clauses in usable.
% 0.11/0.40
% 0.11/0.40 dependent: set(knuth_bendix).
% 0.11/0.40 dependent: set(para_from).
% 0.11/0.40 dependent: set(para_into).
% 0.11/0.40 dependent: clear(para_from_right).
% 0.11/0.40 dependent: clear(para_into_right).
% 0.11/0.40 dependent: set(para_from_vars).
% 0.11/0.40 dependent: set(eq_units_both_ways).
% 0.11/0.40 dependent: set(dynamic_demod_all).
% 0.11/0.40 dependent: set(dynamic_demod).
% 0.11/0.40 dependent: set(order_eq).
% 0.11/0.40 dependent: set(back_demod).
% 0.11/0.40 dependent: set(lrpo).
% 0.11/0.40 dependent: set(hyper_res).
% 0.11/0.40 dependent: set(unit_deletion).
% 0.11/0.40 dependent: set(factor).
% 0.11/0.40
% 0.11/0.40 ------------> process usable:
% 0.11/0.40 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.11/0.40 Following clause subsumed by 30 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.11/0.40 Following clause subsumed by 29 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.11/0.40 Following clause subsumed by 29 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.11/0.40 Following clause subsumed by 31 during input processing: 0 [] {-} -finite_finite_1(A)|hBOOL(hAPP(fun(A,bool),bool,finite_finite(A),B)).
% 0.11/0.40 Following clause subsumed by 23 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.11/0.40 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),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.11/0.40 Following clause subsumed by 24 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.11/0.40 Following clause subsumed by 23 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.11/0.40 Following clause subsumed by 27 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(fun(A,bool),fun(fun(A,bool),bool),ord_less_eq(fun(A,bool)),B),C))| -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),D),B))|hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),D),C)).
% 0.17/0.41 Following clause subsumed by 27 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(fun(A,bool),fun(fun(A,bool),bool),ord_less_eq(fun(A,bool)),C),D))|hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),D)).
% 0.17/0.41 Following clause subsumed by 27 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(fun(A,bool),fun(fun(A,bool),bool),ord_less_eq(fun(A,bool)),B),C))| -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),D),B))|hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),D),C)).
% 0.17/0.41 Following clause subsumed by 39 during input processing: 0 [] {-} ti(fun(A,bool),B)!=ti(fun(A,bool),C)|hBOOL(hAPP(fun(A,bool),bool,hAPP(fun(A,bool),fun(fun(A,bool),bool),ord_less_eq(fun(A,bool)),C),B)).
% 0.17/0.41 Following clause subsumed by 38 during input processing: 0 [] {-} ti(fun(A,bool),B)!=ti(fun(A,bool),C)|hBOOL(hAPP(fun(A,bool),bool,hAPP(fun(A,bool),fun(fun(A,bool),bool),ord_less_eq(fun(A,bool)),B),C)).
% 0.17/0.41 Following clause subsumed by 38 during input processing: 0 [] {-} ti(fun(A,bool),B)!=ti(fun(A,bool),C)|hBOOL(hAPP(fun(A,bool),bool,hAPP(fun(A,bool),fun(fun(A,bool),bool),ord_less_eq(fun(A,bool)),B),C)).
% 0.17/0.41 Following clause subsumed by 39 during input processing: 0 [] {-} ti(fun(A,bool),B)!=ti(fun(A,bool),C)|hBOOL(hAPP(fun(A,bool),bool,hAPP(fun(A,bool),fun(fun(A,bool),bool),ord_less_eq(fun(A,bool)),C),B)).
% 0.17/0.41 Following clause subsumed by 26 during input processing: 0 [] {-} ti(fun(A,bool),B)=ti(fun(A,bool),C)| -hBOOL(hAPP(fun(A,bool),bool,hAPP(fun(A,bool),fun(fun(A,bool),bool),ord_less_eq(fun(A,bool)),B),C))| -hBOOL(hAPP(fun(A,bool),bool,hAPP(fun(A,bool),fun(fun(A,bool),bool),ord_less_eq(fun(A,bool)),C),B)).
% 0.17/0.41 Following clause subsumed by 28 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),C))|ti(D,E)!=hAPP(A,D,F,B)|hBOOL(hAPP(fun(D,bool),bool,hAPP(D,fun(fun(D,bool),bool),member(D),E),hAPP(fun(A,bool),fun(D,bool),hAPP(fun(A,D),fun(fun(A,bool),fun(D,bool)),image(A,D),F),C))).
% 0.17/0.41 Following clause subsumed by 28 during input processing: 0 [] {-} hBOOL(hAPP(fun(A,bool),bool,hAPP(A,fun(fun(A,bool),bool),member(A),B),hAPP(fun(C,bool),fun(A,bool),hAPP(fun(C,A),fun(fun(C,bool),fun(A,bool)),image(C,A),D),E)))| -hBOOL(hAPP(fun(C,bool),bool,hAPP(C,fun(fun(C,bool),bool),member(C),F),E))|ti(A,B)!=hAPP(C,A,D,F).
% 0.17/0.41 Following clause subsumed by 48 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.17/0.41 Following clause subsumed by 24 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.17/0.41 Following clause subsumed by 55 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.17/0.41 Following clause subsumed by 13 during input processing: 0 [] {-} hBOOL(hAPP(fun(A,bool),bool,finite_finite(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(A),C)).
% 0.17/0.41 Following clause subsumed by 63 during input processing: 0 [] {-} -hBOOL(hAPP(fun(A,bool),bool,finite_finite(A),B))| -hBOOL(hAPP(fun(A,bool),bool,hAPP(fun(A,bool),fun(fun(A,bool),bool),ord_less_eq(fun(A,bool)),C),B))|hBOOL(hAPP(fun(A,bool),bool,finite_finite(A),C)).
% 0.17/0.41 Following clause subsumed by 68 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(fun(A,bool),fun(fun(A,bool),bool),ord_less_eq(fun(A,bool)),C),hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),B),D)))| -hBOOL(hAPP(fun(A,bool),bool,hAPP(fun(A,bool),fun(fun(A,bool),bool),ord_less_eq(fun(A,bool)),C),D)).
% 0.17/0.41 60 back subsumes 16.
% 0.17/0.41
% 0.17/0.41 ------------> process sos:
% 0.17/0.41 Following clause subsumed by 207 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.17/0.41 Following clause subsumed by 203 during input processing: 0 [copy,203,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.17/0.41 209 back subsumes 115.
% 0.17/0.41 Following clause subsumed by 245 during input processing: 0 [copy,245,flip.1] {-} A=A.
% 0.17/0.41 245 back subsumes 114.
% 0.17/0.41 Following clause subsumed by 206 during input processing: 0 [copy,246,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.17/0.41 Following clause subsumed by 207 during input processing: 0 [copy,247,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.17/0.41 Following clause subsumed by 210 during input processing: 0 [copy,248,flip.1] {-} hAPP(fun(A,bool),fun(A,bool),hAPP(fun(A,A),fun(fun(A,bool),fun(A,bool)),image(A,A),combi(A)),B)=ti(fun(A,bool),B).
% 0.17/0.41 Following clause subsumed by 211 during input processing: 0 [copy,249,flip.1] {-} hAPP(fun(A,bool),fun(B,bool),hAPP(fun(A,B),fun(fun(A,bool),fun(B,bool)),image(A,B),C),hAPP(fun(D,bool),fun(A,bool),hAPP(fun(D,A),fun(fun(D,bool),fun(A,bool)),image(D,A),E),F))=hAPP(fun(D,bool),fun(B,bool),hAPP(fun(D,B),fun(fun(D,bool),fun(B,bool)),image(D,B),hAPP(fun(D,A),fun(D,B),hAPP(fun(A,B),fun(fun(D,A),fun(D,B)),combb(A,B,D),C),E)),F).
% 0.17/0.41 Following clause subsumed by 212 during input processing: 0 [copy,250,flip.1] {-} hAPP(fun(A,bool),fun(B,bool),hAPP(fun(A,B),fun(fun(A,bool),fun(B,bool)),image(A,B),C),bot_bot(fun(A,bool)))=bot_bot(fun(B,bool)).
% 0.17/0.41 Following clause subsumed by 213 during input processing: 0 [copy,251,flip.1] {-} hAPP(fun(A,bool),fun(A,bool),collect(A),B)=ti(fun(A,bool),B).
% 0.17/0.41 Following clause subsumed by 215 during input processing: 0 [copy,252,flip.1] {-} hAPP(fun(A,bool),fun(B,bool),hAPP(fun(A,B),fun(fun(A,bool),fun(B,bool)),image(A,B),C),hAPP(fun(A,bool),fun(A,bool),hAPP(A,fun(fun(A,bool),fun(A,bool)),insert(A),D),E))=hAPP(fun(B,bool),fun(B,bool),hAPP(B,fun(fun(B,bool),fun(B,bool)),insert(B),hAPP(A,B,C,D)),hAPP(fun(A,bool),fun(B,bool),hAPP(fun(A,B),fun(fun(A,bool),fun(B,bool)),image(A,B),C),E)).
% 0.17/0.41 Following clause subsumed by 230 during input processing: 0 [copy,259,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.17/0.41 Following clause subsumed by 231 during input processing: 0 [copy,260,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.17/0.41 Following clause subsumed by 232 during input processing: 0 [copy,261,flip.1] {-} hAPP(A,A,combi(A),B)=ti(A,B).
% 0.17/0.41 Following clause subsumed by 233 during input processing: 0 [copy,262,flip.1] {-} hAPP(A,B,hAPP(B,fun(A,B),combk(B,A),C),D)=ti(B,C).
% 0.17/0.41 Following clause subsumed by 234 during input processing: 0 [copy,263,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.17/0.41
% 0.17/0.41 ======= end of input processing =======
% 1.11/1.37
% 1.11/1.37 Stopped by limit on insertions
% 1.11/1.37
% 1.11/1.37
% 1.11/1.37 Failed to model usable list: disabling FINDER
% 1.11/1.37
% 1.11/1.37
% 1.11/1.37
% 1.11/1.37 -------------- Softie stats --------------
% 1.11/1.37
% 1.11/1.37 UPDATE_STOP: 300
% 1.11/1.37 SFINDER_TIME_LIMIT: 2
% 1.11/1.37 SHORT_CLAUSE_CUTOFF: 4
% 1.11/1.37 number of clauses in intial UL: 96
% 1.11/1.37 number of clauses initially in problem: 233
% 1.11/1.37 percentage of clauses intially in UL: 41
% 1.11/1.37 percentage of distinct symbols occuring in initial UL: 81
% 1.11/1.37 percent of all initial clauses that are short: 99
% 1.11/1.37 absolute distinct symbol count: 58
% 1.11/1.37 distinct predicate count: 3
% 1.11/1.37 distinct function count: 36
% 1.11/1.37 distinct constant count: 19
% 1.11/1.37
% 1.11/1.37 ---------- no more Softie stats ----------
% 1.11/1.37
% 1.11/1.37
% 1.11/1.37
% 1.11/1.37 =========== start of search ===========
% 1.11/1.37
% 1.11/1.37
% 1.11/1.37 Changing weight limit from 60 to 101.
% 1.11/1.37
% 1.11/1.37 Resetting weight limit to 101 after 5 givens.
% 1.11/1.37
% 1.27/1.50
% 1.27/1.50
% 1.27/1.50 Changing weight limit from 101 to 51.
% 1.27/1.50
% 1.27/1.50 Resetting weight limit to 51 after 105 givens.
% 1.27/1.50
% 1.31/1.53
% 1.31/1.53
% 1.31/1.53 Changing weight limit from 51 to 16.
% 1.31/1.53
% 1.31/1.53 Resetting weight limit to 16 after 110 givens.
% 1.31/1.53
% 1.50/1.76
% 1.50/1.76
% 1.50/1.76 Changing weight limit from 16 to 15.
% 1.50/1.76
% 1.50/1.76 Resetting weight limit to 15 after 130 givens.
% 1.50/1.76
% 1.50/1.79 hBOOL(hAPP(bool,bool,hAPP(bool,fun(bool,bool),fconj,wT_bodies),hoare_1883395792gleton)).
% 1.50/1.79
% 1.50/1.79 ------------- memory usage ------------
% 1.50/1.79 251 mallocs of 32700 bytes each, 8015.3 K.
% 1.50/1.79 type (bytes each) gets frees in use avail bytes
% 1.50/1.79 sym_ent ( 304) 220 0 220 0 65.3 K
% 1.50/1.79 term ( 32) 419999 399887 20112 2217 697.8 K
% 1.50/1.79 rel ( 40) 394296 368579 25717 5791 1230.8 K
% 1.50/1.79 term_ptr ( 16) 414942 247160 167782 52954 3449.0 K
% 1.50/1.79 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 1.50/1.79 fpa_head ( 24) 12295 6659 5636 5241 254.9 K
% 1.50/1.79 fpa_tree ( 56) 105838 105838 0 143 7.8 K
% 1.50/1.79 context (1288) 72623 72623 0 6 7.5 K
% 1.50/1.79 trail ( 24) 31215 31215 0 8 0.2 K
% 1.50/1.79 imd_tree ( 32) 312 5 307 0 9.6 K
% 1.50/1.79 imd_pos (4024) 62481 62481 0 14 55.0 K
% 1.50/1.79 is_tree ( 24) 37475 21678 15797 11381 637.0 K
% 1.50/1.79 is_pos (2424) 165230 165230 0 43 101.8 K
% 1.50/1.79 fsub_pos ( 16) 15667 15667 0 1 0.0 K
% 1.50/1.79 literal ( 32) 18812 12940 5872 786 208.1 K
% 1.50/1.79 clause ( 88) 12831 7321 5510 667 530.8 K
% 1.50/1.79 list ( 272) 180 173 7 2 2.4 K
% 1.50/1.79 clash_nd ( 80) 459 459 0 3 0.2 K
% 1.50/1.79 clause_ptr ( 16) 9125 3793 5332 656 93.6 K
% 1.50/1.79 int_ptr ( 16) 57830 37375 20455 2984 366.2 K
% 1.50/1.79 ci_ptr ( 24) 0 0 0 0 0.0 K
% 1.50/1.79 link_node ( 120) 0 0 0 0 0.0 K
% 1.50/1.79 ans_lit_node( 24) 0 0 0 0 0.0 K
% 1.50/1.79 formula_box( 168) 0 0 0 0 0.0 K
% 1.50/1.79 formula( 40) 1375 1375 0 958 37.4 K
% 1.50/1.79 formula_ptr( 16) 170 170 0 170 2.7 K
% 1.50/1.79 cl_attribute( 24) 0 0 0 0 0.0 K
% 1.50/1.79
% 1.50/1.79 ********** is_delete, can't find end.
% 1.58/1.79 ack demod time 0.00
% 1.58/1.79 back subsume 0.00
% 1.58/1.79 factor time 0.00
% 1.58/1.79 FINDER time 0.00
% 1.58/1.79 unindex time 0.00
% 1.58/1.79
% 1.58/1.79 Forward subsumption counts, subsumer:number_subsumed.
% 1.58/1.79 1:0 2:0 3:0 4:0 5:0 6:0 7:0 8:0 9:0 10:0
% 1.58/1.79 11:0 12:0 13:1 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 1.58/1.79 21:0 22:2 23:2 24:2 25:1 26:1 27:3 28:2 29:2 30:1
% 1.58/1.79 31:2 32:0 33:0 34:0 35:0 36:0 37:0 38:2 39:2 40:0
% 1.58/1.79 41:0 42:0 43:0 44:0 45:0 46:0 47:0 48:1 49:0 50:0
% 1.58/1.79 51:0 52:0 53:0 54:0 55:1 56:0 57:1 58:0 59:0 60:1
% 1.58/1.79 61:0 62:0 63:1 64:0 65:0 66:0 67:0 68:1 69:0 70:0
% 1.58/1.79 71:0 72:0 73:0 74:0 75:0 76:0 77:0 78:0 79:0 80:0
% 1.58/1.79 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:0 90:0
% 1.58/1.79 91:0 92:0 93:0 94:0 95:0 96:0 97:0 98:0 99:0
% 1.58/1.79 All others: 714.
% 1.58/1.79
% 1.58/1.79 ********** ABNORMAL END **********
% 1.58/1.79
% 1.58/1.79 ********** is_delete, can't find end.
%------------------------------------------------------------------------------