TSTP Solution File: SWV771-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV771-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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 : Wed Jul 20 21:40:10 EDT 2022
% Result : Unknown 1.34s 1.55s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV771-1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n004.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 : Wed Jun 15 01:34:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.41 ----- Otter 3.2, August 2001 -----
% 0.19/0.41 The process was started by sandbox2 on n004.cluster.edu,
% 0.19/0.41 Wed Jun 15 01:34:24 2022
% 0.19/0.41 The command was "./sos". The process ID is 4695.
% 0.19/0.41
% 0.19/0.41 set(prolog_style_variables).
% 0.19/0.41 set(auto).
% 0.19/0.41 dependent: set(auto1).
% 0.19/0.41 dependent: set(process_input).
% 0.19/0.41 dependent: clear(print_kept).
% 0.19/0.41 dependent: clear(print_new_demod).
% 0.19/0.41 dependent: clear(print_back_demod).
% 0.19/0.41 dependent: clear(print_back_sub).
% 0.19/0.41 dependent: set(control_memory).
% 0.19/0.41 dependent: assign(max_mem, 12000).
% 0.19/0.41 dependent: assign(pick_given_ratio, 4).
% 0.19/0.41 dependent: assign(stats_level, 1).
% 0.19/0.41 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.41 dependent: assign(sos_limit, 5000).
% 0.19/0.41 dependent: assign(max_weight, 60).
% 0.19/0.41 clear(print_given).
% 0.19/0.41
% 0.19/0.41 list(usable).
% 0.19/0.41
% 0.19/0.41 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.19/0.41
% 0.19/0.41 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.41 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.41 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.41 clauses in usable.
% 0.19/0.41
% 0.19/0.41 dependent: set(knuth_bendix).
% 0.19/0.41 dependent: set(para_from).
% 0.19/0.41 dependent: set(para_into).
% 0.19/0.41 dependent: clear(para_from_right).
% 0.19/0.41 dependent: clear(para_into_right).
% 0.19/0.41 dependent: set(para_from_vars).
% 0.19/0.41 dependent: set(eq_units_both_ways).
% 0.19/0.41 dependent: set(dynamic_demod_all).
% 0.19/0.41 dependent: set(dynamic_demod).
% 0.19/0.41 dependent: set(order_eq).
% 0.19/0.41 dependent: set(back_demod).
% 0.19/0.41 dependent: set(lrpo).
% 0.19/0.41 dependent: set(hyper_res).
% 0.19/0.41 dependent: set(unit_deletion).
% 0.19/0.41 dependent: set(factor).
% 0.19/0.41
% 0.19/0.41 ------------> process usable:
% 0.19/0.41 Following clause subsumed by 10 during input processing: 0 [] {-} c_in(A,c_Message_Oparts(B),tc_Message_Omsg)| -c_in(A,c_Message_Oanalz(B),tc_Message_Omsg).
% 0.19/0.41 Following clause subsumed by 10 during input processing: 0 [] {-} -c_in(A,c_Message_Oanalz(B),tc_Message_Omsg)|c_in(A,c_Message_Oparts(B),tc_Message_Omsg).
% 0.19/0.41 Following clause subsumed by 49 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_lessequals(B,C,A)|c_HOL_Oord__class_Oless(C,B,A).
% 0.19/0.41 Following clause subsumed by 50 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)| -c_HOL_Oord__class_Oless(B,C,A)| -c_lessequals(C,B,A).
% 0.19/0.41 Following clause subsumed by 49 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_HOL_Oord__class_Oless(B,B,A)|c_lessequals(B,B,A).
% 0.19/0.41 Following clause subsumed by 50 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)| -c_lessequals(B,B,A)| -c_HOL_Oord__class_Oless(B,B,A).
% 0.19/0.41 Following clause subsumed by 49 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_HOL_Oord__class_Oless(B,C,A)|c_lessequals(C,B,A).
% 0.19/0.41 Following clause subsumed by 68 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_HOL_Oord__class_Oless(B,C,A)|c_HOL_Oord__class_Oless(C,B,A)|C=B.
% 0.19/0.41 Following clause subsumed by 68 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_HOL_Oord__class_Oless(B,C,A)|C=B|c_HOL_Oord__class_Oless(C,B,A).
% 0.19/0.41 Following clause subsumed by 68 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|B=C|c_HOL_Oord__class_Oless(B,C,A)|c_HOL_Oord__class_Oless(C,B,A).
% 0.19/0.41 Following clause subsumed by 82 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|c_HOL_Oord__class_Oless(B,C,A)| -c_lessequals(B,C,A)|C=B.
% 0.19/0.41 Following clause subsumed by 84 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|c_HOL_Oord__class_Oless(B,C,A)|B=C| -c_lessequals(B,C,A).
% 0.19/0.41 Following clause subsumed by 83 during input processing: 0 [] {-} A=B|c_HOL_Oord__class_Oless(A,B,tc_fun(C,tc_bool))| -c_lessequals(A,B,tc_fun(C,tc_bool)).
% 0.19/0.41 Following clause subsumed by 84 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|c_HOL_Oord__class_Oless(B,C,A)|B=C| -c_lessequals(B,C,A).
% 0.19/0.41 Following clause subsumed by 84 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|c_HOL_Oord__class_Oless(B,C,A)| -c_lessequals(B,C,A)|B=C.
% 0.19/0.41 Following clause subsumed by 85 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|B=C|c_HOL_Oord__class_Oless(B,C,A)| -c_lessequals(B,C,A).
% 0.19/0.42 Following clause subsumed by 90 during input processing: 0 [] {-} -class_Orderings_Opreorder(A)| -c_HOL_Oord__class_Oless(B,C,A)| -c_HOL_Oord__class_Oless(C,B,A).
% 0.19/0.42 Following clause subsumed by 97 during input processing: 0 [] {-} c_in(A,c_List_Oset(B,C),C)| -c_in(A,c_List_Oset(c_List_Oremove1(D,B,C),C),C)|A=D.
% 0.19/0.42 Following clause subsumed by 158 during input processing: 0 [] {-} c_in(A,c_Set_Oinsert(B,C,D),D)| -c_in(A,C,D).
% 0.19/0.42 Following clause subsumed by 161 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,C,A),A)| -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(D,c_List_Olist_OCons(B,C,A),A),A).
% 0.19/0.42 Following clause subsumed by 156 during input processing: 0 [] {-} c_lessequals(A,c_Set_Oinsert(B,C,D),tc_fun(D,tc_bool))| -c_lessequals(A,C,tc_fun(D,tc_bool))|c_in(B,A,D).
% 0.19/0.42 Following clause subsumed by 171 during input processing: 0 [] {-} c_lessequals(A,B,tc_fun(C,tc_bool))|c_in(D,A,C)| -c_lessequals(A,c_Set_Oinsert(D,B,C),tc_fun(C,tc_bool)).
% 0.19/0.42 Following clause subsumed by 156 during input processing: 0 [] {-} c_lessequals(A,c_Set_Oinsert(B,C,D),tc_fun(D,tc_bool))| -c_lessequals(A,C,tc_fun(D,tc_bool))|c_in(B,A,D).
% 0.19/0.42 Following clause subsumed by 192 during input processing: 0 [] {-} A=B| -c_lessequals(B,A,tc_fun(C,tc_bool))| -c_lessequals(A,B,tc_fun(C,tc_bool)).
% 0.19/0.42 Following clause subsumed by 193 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|B=C| -c_lessequals(C,B,A)| -c_lessequals(B,C,A).
% 0.19/0.42 Following clause subsumed by 193 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|B=C| -c_lessequals(B,C,A)| -c_lessequals(C,B,A).
% 0.19/0.42 Following clause subsumed by 210 during input processing: 0 [] {-} c_in(A,B,C)| -c_in(A,D,C)| -c_lessequals(D,B,tc_fun(C,tc_bool)).
% 0.19/0.42 Following clause subsumed by 210 during input processing: 0 [] {-} c_in(A,B,C)| -c_lessequals(D,B,tc_fun(C,tc_bool))| -c_in(A,D,C).
% 0.19/0.42 Following clause subsumed by 210 during input processing: 0 [] {-} c_in(A,B,C)| -c_in(A,D,C)| -c_lessequals(D,B,tc_fun(C,tc_bool)).
% 0.19/0.42 Following clause subsumed by 212 during input processing: 0 [] {-} hBOOL(hAPP(A,B))| -c_lessequals(C,A,tc_fun(D,tc_bool))| -hBOOL(hAPP(C,B)).
% 0.19/0.42 Following clause subsumed by 246 during input processing: 0 [] {-} c_List_Oappend(A,B,C)!=B|A=c_List_Olist_ONil(C).
% 0.19/0.42 Following clause subsumed by 248 during input processing: 0 [] {-} c_List_Oappend(A,B,C)!=A|B=c_List_Olist_ONil(C).
% 0.19/0.42 Following clause subsumed by 261 during input processing: 0 [] {-} c_List_Olist_OCons(A,B,C)!=c_List_Olist_ONil(C).
% 0.19/0.42 Following clause subsumed by 262 during input processing: 0 [flip.1] {-} c_List_Olist_OCons(B,A,C)!=A.
% 0.19/0.42 Following clause subsumed by 120 during input processing: 0 [copy,118,flip.1] {-} c_Event_Oevent_OGets(A,B)!=c_Event_Oevent_OSays(C,D,E).
% 0.19/0.42 Following clause subsumed by 121 during input processing: 0 [copy,119,flip.1] {-} c_Event_Oevent_ONotes(A,B)!=c_Event_Oevent_OSays(C,D,E).
% 0.19/0.42 Following clause subsumed by 118 during input processing: 0 [copy,120,flip.1] {-} c_Event_Oevent_OSays(A,B,C)!=c_Event_Oevent_OGets(D,E).
% 0.19/0.42 Following clause subsumed by 119 during input processing: 0 [copy,121,flip.1] {-} c_Event_Oevent_OSays(A,B,C)!=c_Event_Oevent_ONotes(D,E).
% 0.19/0.42 Following clause subsumed by 206 during input processing: 0 [copy,194,flip.1] {-} c_Event_Oevent_ONotes(A,B)!=c_Event_Oevent_OGets(C,D).
% 0.19/0.42 Following clause subsumed by 194 during input processing: 0 [copy,206,flip.1] {-} c_Event_Oevent_OGets(A,B)!=c_Event_Oevent_ONotes(C,D).
% 0.19/0.42 Following clause subsumed by 261 during input processing: 0 [copy,252,flip.1] {-} c_List_Olist_OCons(A,B,C)!=c_List_Olist_ONil(C).
% 0.19/0.42 Following clause subsumed by 252 during input processing: 0 [copy,261,flip.1] {-} c_List_Olist_ONil(A)!=c_List_Olist_OCons(B,C,A).
% 0.19/0.42
% 0.19/0.42 ------------> process sos:
% 0.19/0.42 Following clause subsumed by 306 during input processing: 0 [demod,314] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.19/0.42 Following clause subsumed by 306 during input processing: 0 [demod,314] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.19/0.42 Following clause subsumed by 306 during input processing: 0 [demod,344] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.19/0.42 Following clause subsumed by 341 during input processing: 0 [] {-} c_in(A,c_Set_Oinsert(A,B,C),C).
% 0.19/0.42 Following clause subsumed by 341 during input processing: 0 [] {-} c_in(A,c_Set_Oinsert(A,B,C),C).
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [demod,391] {-} A=A.
% 0.19/0.42 Following clause subsumed by 404 during input processing: 0 [] {-} c_lessequals(A,A,tc_fun(B,tc_bool)).
% 0.19/0.42 Following clause subsumed by 367 during input processing: 0 [] {-} c_lessequals(c_Event_Oknows(c_Message_Oagent_OSpy,A),c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Olist_OCons(c_Event_Oevent_OGets(B,C),A,tc_Event_Oevent)),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.19/0.42 Following clause subsumed by 366 during input processing: 0 [] {-} c_lessequals(c_Event_Oknows(c_Message_Oagent_OSpy,A),c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Olist_OCons(c_Event_Oevent_ONotes(B,C),A,tc_Event_Oevent)),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [demod,350] {-} c_List_Olist_OCons(A,B,C)=c_List_Olist_OCons(A,B,C).
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [demod,421] {-} c_List_Olist_OCons(A,c_List_Olist_ONil(B),B)=c_List_Olist_OCons(A,c_List_Olist_ONil(B),B).
% 0.19/0.42 Following clause subsumed by 438 during input processing: 0 [] {-} c_lessequals(c_Event_Oknows(A,B),c_Event_Oknows(A,c_List_Olist_OCons(c_Event_Oevent_OSays(C,D,E),B,tc_Event_Oevent)),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.19/0.42 Following clause subsumed by 438 during input processing: 0 [] {-} c_lessequals(c_Event_Oknows(c_Message_Oagent_OSpy,A),c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Olist_OCons(c_Event_Oevent_OSays(B,C,D),A,tc_Event_Oevent)),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [demod,456] {-} c_List_Oappend(A,c_List_Oappend(B,D,C),C)=c_List_Oappend(A,c_List_Oappend(B,D,C),C).
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [demod,456] {-} c_List_Oappend(A,c_List_Oappend(B,C,D),D)=c_List_Oappend(A,c_List_Oappend(B,C,D),D).
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [demod,456] {-} c_List_Oappend(A,c_List_Oappend(B,D,C),C)=c_List_Oappend(A,c_List_Oappend(B,D,C),C).
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [demod,470] {-} B=B.
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [demod,470] {-} A=A.
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [demod,473] {-} A=A.
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [demod,477] {-} c_List_Oappend(c_List_Olist_OCons(A,B,C),D,C)=c_List_Oappend(c_List_Olist_OCons(A,B,C),D,C).
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [demod,477] {-} c_List_Oappend(c_List_Olist_OCons(A,B,D),C,D)=c_List_Oappend(c_List_Olist_OCons(A,B,D),C,D).
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [demod,477] {-} c_List_Oappend(c_List_Olist_OCons(A,B,D),C,D)=c_List_Oappend(c_List_Olist_OCons(A,B,D),C,D).
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [demod,470] {-} c_List_Olist_OCons(A,B,C)=c_List_Olist_OCons(A,B,C).
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [demod,473] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [] {-} A=A.
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [copy,306,flip.1] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.19/0.42 362 back subsumes 361.
% 0.19/0.42 362 back subsumes 360.
% 0.19/0.42 Following clause subsumed by 363 during input processing: 0 [copy,363,flip.1] {-} c_List_Oappend(c_List_Oreplicate(A,B,C),c_List_Oreplicate(D,B,C),C)=c_List_Oappend(c_List_Oreplicate(D,B,C),c_List_Oreplicate(A,B,C),C).
% 0.19/0.42 Following clause subsumed by 393 during input processing: 0 [copy,393,flip.1] {-} A=A.
% 0.19/0.42 393 back subsumes 306.
% 0.19/0.42 393 back subsumes 279.
% 0.19/0.42 393 back subsumes 278.
% 0.19/0.42 393 back subsumes 273.
% 0.19/0.42 393 back subsumes 272.
% 0.19/0.42 393 back subsumes 270.
% 0.19/0.42 393 back subsumes 269.
% 0.19/0.42 393 back subsumes 268.
% 0.19/0.42 404 back subsumes 277.
% 0.19/0.42 438 back subsumes 367.
% 0.19/0.42 438 back subsumes 366.
% 0.19/0.42 Following clause subsumed by 474 during input processing: 0 [copy,474,flip.1] {-} c_Set_Oinsert(A,c_Set_Oinsert(B,C,D),D)=c_Set_Oinsert(B,c_Set_Oinsert(A,C,D),D).
% 0.19/0.42 Following clause subsumed by 355 during input processing: 0 [copy,486,flip.1] {-} c_List_Oconcat__map(A,c_List_Olist_ONil(B),B,C)=c_List_Olist_ONil(C).
% 0.19/0.42 Following clause subsumed by 427 during input processing: 0 [copy,487,flip.1] {-} c_List_Oconcat__map(A,c_List_Olist_OCons(B,C,D),D,E)=c_List_Oappend(hAPP(A,B),c_List_Oconcat__map(A,C,D,E),E).
% 0.19/0.42 Following clause subsumed by 439 during input processing: 0 [copy,488,flip.1] {-} c_Event_Oknows(A,c_List_Olist_ONil(tc_Event_Oevent))=c_Event_OinitState(A).
% 0.19/0.42 Following clause subsumed by 444 during input processing: 0 [copy,489,flip.1] {-} c_List_Orev(c_List_Olist_OCons(A,B,C),C)=c_List_Oappend(c_List_Orev(B,C),c_List_Olist_OCons(A,c_List_Olist_ONil(C),C),C).
% 0.19/0.42 Following clause subsumed by 446 during input processing: 0 [copy,490,flip.1] {-} c_List_Oappend(c_List_Olist_OCons(A,c_List_Olist_ONil(B),B),C,B)=c_List_Olist_OCons(A,C,B).
% 0.19/0.42 Following clause subsumed by 447 during input processing: 0 [copy,491,flip.1] {-} c_List_Orotate1(c_List_Olist_OCons(A,B,C),C)=c_List_Oappend(B,c_List_Olist_OCons(A,c_List_Olist_ONil(C),C),C).
% 0.19/0.42 Following clause subsumed by 448 during input processing: 0 [copy,492,flip.1] {-} c_List_Oappend(c_List_Oreplicate(A,B,C),c_List_Olist_OCons(B,c_List_Olist_ONil(C),C),C)=c_List_Olist_OCons(B,c_List_Oreplicate(A,B,C),C).
% 0.19/0.42 Following clause subsumed by 493 during input processing: 0 [copy,494,flip.1] {-} c_List_Oappend(c_List_Olist_OCons(A,c_List_Oreplicate(B,A,C),C),D,C)=c_List_Oappend(c_List_Oreplicate(B,A,C),c_List_Olist_OCons(A,D,C),C).
% 0.19/0.42
% 0.19/0.42 ======= end of input processing =======
% 0.36/0.57
% 0.36/0.57
% 0.36/0.57 Failed to model usable list: disabling FINDER
% 0.36/0.57
% 0.36/0.57
% 0.36/0.57
% 0.36/0.57 -------------- Softie stats --------------
% 0.36/0.57
% 0.36/0.57 UPDATE_STOP: 300
% 0.36/0.57 SFINDER_TIME_LIMIT: 2
% 0.36/0.57 SHORT_CLAUSE_CUTOFF: 4
% 0.36/0.57 number of clauses in intial UL: 255
% 0.36/0.57 number of clauses initially in problem: 438
% 0.36/0.57 percentage of clauses intially in UL: 58
% 0.36/0.57 percentage of distinct symbols occuring in initial UL: 91
% 0.36/0.57 percent of all initial clauses that are short: 100
% 0.36/0.57 absolute distinct symbol count: 78
% 0.36/0.57 distinct predicate count: 14
% 0.36/0.57 distinct function count: 53
% 0.36/0.57 distinct constant count: 11
% 0.36/0.57
% 0.36/0.57 ---------- no more Softie stats ----------
% 0.36/0.57
% 0.36/0.57
% 0.36/0.57
% 0.36/0.57 =========== start of search ===========
% 0.74/0.94
% 0.74/0.94
% 0.74/0.94 Changing weight limit from 60 to 31.
% 0.74/0.94
% 0.74/0.94 Resetting weight limit to 31 after 45 givens.
% 0.74/0.94
% 0.79/1.00
% 0.79/1.00
% 0.79/1.00 Changing weight limit from 31 to 28.
% 0.79/1.00
% 0.79/1.00 Resetting weight limit to 28 after 50 givens.
% 0.79/1.00
% 0.88/1.11
% 0.88/1.11
% 0.88/1.11 Changing weight limit from 28 to 25.
% 0.88/1.11
% 0.88/1.11 Resetting weight limit to 25 after 55 givens.
% 0.88/1.11
% 0.98/1.23
% 0.98/1.23
% 0.98/1.23 Changing weight limit from 25 to 23.
% 0.98/1.23
% 0.98/1.23 Resetting weight limit to 23 after 60 givens.
% 0.98/1.23
% 1.13/1.35
% 1.13/1.35
% 1.13/1.35 Changing weight limit from 23 to 21.
% 1.13/1.35
% 1.13/1.35 Resetting weight limit to 21 after 65 givens.
% 1.13/1.35
% 1.28/1.50
% 1.28/1.50
% 1.28/1.50 Changing weight limit from 21 to 18.
% 1.28/1.50
% 1.28/1.50 Resetting weight limit to 18 after 70 givens.
% 1.28/1.50
% 1.34/1.55 c_lessequals(c_Set_Oinsert(c_Message_Oagent_OSpy,c_Message_Oparts(c_Message_Osynth(c_Event_Obad)),tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(c_Event_Obad)),tc_fun(tc_Message_Omsg,tc_bool)).
% 1.34/1.55
% 1.34/1.55 ------------- memory usage ------------
% 1.34/1.55 279 mallocs of 32700 bytes each, 8909.5 K.
% 1.34/1.55 type (bytes each) gets frees in use avail bytes
% 1.34/1.55 sym_ent ( 304) 240 0 240 0 71.2 K
% 1.34/1.55 term ( 32) 390189 364808 25381 2069 857.8 K
% 1.34/1.55 rel ( 40) 331484 285701 45783 6594 2046.0 K
% 1.34/1.55 term_ptr ( 16) 343498 225643 117855 38637 2445.2 K
% 1.34/1.55 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 1.34/1.55 fpa_head ( 24) 14957 6452 8505 2799 264.9 K
% 1.34/1.55 fpa_tree ( 56) 37058 37058 0 1083 59.2 K
% 1.34/1.55 context (1288) 82727 82727 0 8 10.1 K
% 1.34/1.55 trail ( 24) 1454450 1454450 0 12 0.3 K
% 1.34/1.55 imd_tree ( 32) 582 37 545 1 17.1 K
% 1.34/1.55 imd_pos (4024) 28575 28575 0 5 19.6 K
% 1.34/1.55 is_tree ( 24) 30525 17832 12693 10009 532.1 K
% 1.34/1.55 is_pos (2424) 1104213 1104213 0 14 33.1 K
% 1.34/1.55 fsub_pos ( 16) 60917 60917 0 1 0.0 K
% 1.34/1.55 literal ( 32) 50982 34074 16908 722 550.9 K
% 1.34/1.55 clause ( 88) 17493 10164 7329 128 640.8 K
% 1.34/1.55 list ( 272) 10 3 7 1 2.1 K
% 1.34/1.55 clash_nd ( 80) 830 830 0 5 0.4 K
% 1.34/1.55 clause_ptr ( 16) 11324 4362 6962 126 110.8 K
% 1.34/1.55 int_ptr ( 16) 132948 70855 62093 754 982.0 K
% 1.34/1.55 ci_ptr ( 24) 0 0 0 0 0.0 K
% 1.34/1.55 link_node ( 120) 0 0 0 0 0.0 K
% 1.34/1.55 ans_lit_node( 24) 0 0 0 0 0.0 K
% 1.34/1.55 formula_box( 168) 0 0 0 0 0.0 K
% 1.34/1.55 formula( 40) 0 0 0 0 0.0 K
% 1.34/1.55 formula_ptr( 16) 0 0 0 0 0.0 K
% 1.34/1.55 cl_attribute( 24) 0 0 0 0 0.0 K
% 1.34/1.55
% 1.34/1.55 ********** is_delete, can't find end.
% 1.34/1.55 t_cl time 0.00
% 1.34/1.55 conflict time 0.00
% 1.34/1.55 new demod time 0.00
% 1.34/1.55 post_process time 0.00
% 1.34/1.55 back demod time 0.00
% 1.34/1.55 back subsume 0.00
% 1.34/1.55 factor time 0.00
% 1.34/1.55 FINDER time 0.00
% 1.34/1.55 unindex time 0.00
% 1.34/1.55
% 1.34/1.55 Forward subsumption counts, subsumer:number_subsumed.
% 1.34/1.55 1:0 2:0 3:4 4:5 5:0 6:0 7:0 8:4 9:0 10:5
% 1.34/1.55 11:2 12:0 13:4 14:0 15:0 16:0 17:0 18:0 19:0 20:0
% 1.34/1.55 21:0 22:0 23:0 24:1 25:0 26:0 27:2 28:0 29:0 30:0
% 1.34/1.55 31:1 32:0 33:0 34:0 35:0 36:0 37:0 38:0 39:0 40:0
% 1.34/1.55 41:0 42:0 43:0 44:0 45:2 46:3 47:0 48:0 49:3 50:2
% 1.34/1.55 51:0 52:0 53:0 54:0 55:0 56:0 57:0 58:0 59:0 60:0
% 1.34/1.55 61:0 62:1 63:0 64:1 65:1 66:1 67:10 68:13 69:2 70:0
% 1.34/1.55 71:0 72:0 73:0 74:1 75:0 76:0 77:0 78:0 79:0 80:0
% 1.34/1.55 81:0 82:11 83:1 84:13 85:1 86:0 87:0 88:0 89:0 90:1
% 1.34/1.55 91:0 92:0 93:0 94:0 95:0 96:0 97:1 98:0 99:0
% 1.34/1.55 All others: 2153.
% 1.34/1.55
% 1.34/1.55 ********** ABNORMAL END **********
% 1.34/1.55
% 1.34/1.55 ********** is_delete, can't find end.
%------------------------------------------------------------------------------