TSTP Solution File: SWV721-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV721-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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:00 EDT 2022
% Result : Unknown 1.51s 1.76s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV721-1 : TPTP v8.1.0. Released v4.1.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 15 01:08:41 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.41 ----- Otter 3.2, August 2001 -----
% 0.13/0.41 The process was started by sandbox on n006.cluster.edu,
% 0.13/0.41 Wed Jun 15 01:08:41 2022
% 0.13/0.41 The command was "./sos". The process ID is 16465.
% 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 list(usable).
% 0.13/0.41
% 0.13/0.41 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 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 25 during input processing: 0 [] {-} -class_Lattices_Oupper__semilattice(A)|c_lessequals(c_Lattices_Oupper__semilattice__class_Osup(B,C,A),D,A)| -c_lessequals(C,D,A)| -c_lessequals(B,D,A).
% 0.13/0.41 Following clause subsumed by 25 during input processing: 0 [] {-} -class_Lattices_Oupper__semilattice(A)|c_lessequals(c_Lattices_Oupper__semilattice__class_Osup(B,C,A),D,A)| -c_lessequals(C,D,A)| -c_lessequals(B,D,A).
% 0.13/0.41 Following clause subsumed by 28 during input processing: 0 [] {-} c_lessequals(c_Lattices_Oupper__semilattice__class_Osup(A,B,tc_fun(C,tc_bool)),D,tc_fun(C,tc_bool))| -c_lessequals(B,D,tc_fun(C,tc_bool))| -c_lessequals(A,D,tc_fun(C,tc_bool)).
% 0.13/0.41 Following clause subsumed by 49 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.13/0.41 Following clause subsumed by 49 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.13/0.41 Following clause subsumed by 74 during input processing: 0 [] {-} c_lessequals(A,B,tc_fun(C,tc_bool))| -c_lessequals(A,c_Set_Oinsert(D,B,C),tc_fun(C,tc_bool))|c_in(D,A,C).
% 0.13/0.41 Following clause subsumed by 89 during input processing: 0 [flip.1] {-} c_List_Olist_OCons(B,A,C)!=A.
% 0.13/0.41 Following clause subsumed by 95 during input processing: 0 [] {-} c_in(A,c_Set_Oinsert(B,C,D),D)| -c_in(A,C,D).
% 0.13/0.41 Following clause subsumed by 96 during input processing: 0 [] {-} c_in(A,B,C)| -c_lessequals(D,B,tc_fun(C,tc_bool))| -c_in(A,D,C).
% 0.13/0.41 Following clause subsumed by 96 during input processing: 0 [] {-} c_in(A,B,C)| -c_in(A,D,C)| -c_lessequals(D,B,tc_fun(C,tc_bool)).
% 0.13/0.41 Following clause subsumed by 96 during input processing: 0 [] {-} c_in(A,B,C)| -c_in(A,D,C)| -c_lessequals(D,B,tc_fun(C,tc_bool)).
% 0.13/0.41 Following clause subsumed by 99 during input processing: 0 [] {-} hBOOL(hAPP(A,B))| -c_in(B,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C).
% 0.13/0.41 Following clause subsumed by 99 during input processing: 0 [] {-} -c_in(A,c_Orderings_Obot__class_Obot(tc_fun(B,tc_bool)),B).
% 0.13/0.41 Following clause subsumed by 99 during input processing: 0 [] {-} -c_in(A,c_Orderings_Obot__class_Obot(tc_fun(B,tc_bool)),B).
% 0.13/0.41 Following clause subsumed by 99 during input processing: 0 [] {-} -hBOOL(hAPP(A,B))| -c_in(B,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C).
% 0.20/0.41 Following clause subsumed by 106 during input processing: 0 [] {-} c_in(c_Message_Omsg_OCrypt(A,B),c_Message_Osynth(C),tc_Message_Omsg)| -c_in(c_Message_Omsg_OCrypt(A,B),C,tc_Message_Omsg)|c_in(c_Message_Omsg_OKey(A),C,tc_Message_Omsg).
% 0.20/0.41 Following clause subsumed by 115 during input processing: 0 [] {-} c_in(c_Message_Omsg_OKey(A),B,tc_Message_Omsg)|c_in(c_Message_Omsg_OCrypt(A,C),B,tc_Message_Omsg)| -c_in(c_Message_Omsg_OCrypt(A,C),c_Message_Osynth(B),tc_Message_Omsg).
% 0.20/0.41 Following clause subsumed by 137 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.20/0.41 Following clause subsumed by 138 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|B=C| -c_lessequals(C,B,A)| -c_lessequals(B,C,A).
% 0.20/0.41 Following clause subsumed by 138 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|B=C| -c_lessequals(B,C,A)| -c_lessequals(C,B,A).
% 0.20/0.41 Following clause subsumed by 160 during input processing: 0 [] {-} -class_Lattices_Oupper__semilattice(A)|c_lessequals(B,C,A)| -c_lessequals(c_Lattices_Oupper__semilattice__class_Osup(D,B,A),C,A).
% 0.20/0.41 Following clause subsumed by 161 during input processing: 0 [] {-} -class_Lattices_Oupper__semilattice(A)|c_lessequals(B,C,A)| -c_lessequals(c_Lattices_Oupper__semilattice__class_Osup(B,D,A),C,A).
% 0.20/0.41 Following clause subsumed by 169 during input processing: 0 [] {-} hBOOL(hAPP(A,B))| -c_lessequals(C,A,tc_fun(D,tc_bool))| -hBOOL(hAPP(C,B)).
% 0.20/0.41 Following clause subsumed by 218 during input processing: 0 [] {-} c_in(A,c_List_Oset(B,C),C)| -c_in(A,c_List_Oset(c_List_Osublist(B,D,C),C),C).
% 0.20/0.41 Following clause subsumed by 244 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.20/0.41 Following clause subsumed by 244 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.20/0.41 Following clause subsumed by 9 during input processing: 0 [copy,3,flip.1] {-} c_Message_OinvKey(c_Public_OpublicKey(A,B))!=c_Public_OpublicKey(C,D).
% 0.20/0.41 Following clause subsumed by 5 during input processing: 0 [copy,4,flip.1] {-} c_Public_OshrK(A)!=c_Message_OinvKey(c_Public_OpublicKey(B,C)).
% 0.20/0.41 Following clause subsumed by 4 during input processing: 0 [copy,5,flip.1] {-} c_Message_OinvKey(c_Public_OpublicKey(A,B))!=c_Public_OshrK(C).
% 0.20/0.41 Following clause subsumed by 7 during input processing: 0 [copy,6,flip.1] {-} c_Public_OpublicKey(A,B)!=c_Public_OshrK(C).
% 0.20/0.41 Following clause subsumed by 6 during input processing: 0 [copy,7,flip.1] {-} c_Public_OshrK(A)!=c_Public_OpublicKey(B,C).
% 0.20/0.41 Following clause subsumed by 3 during input processing: 0 [copy,9,flip.1] {-} c_Public_OpublicKey(A,B)!=c_Message_OinvKey(c_Public_OpublicKey(C,D)).
% 0.20/0.41 Following clause subsumed by 153 during input processing: 0 [copy,58,flip.1] {-} c_Orderings_Obot__class_Obot(tc_fun(A,tc_bool))!=c_Set_Oinsert(B,C,A).
% 0.20/0.41 58 back subsumes 20.
% 0.20/0.41 90 back subsumes 82.
% 0.20/0.41 106 back subsumes 70.
% 0.20/0.41 Following clause subsumed by 114 during input processing: 0 [copy,113,flip.1] {-} c_Message_Omsg_OMPair(A,B)!=c_Message_Omsg_OKey(C).
% 0.20/0.41 Following clause subsumed by 113 during input processing: 0 [copy,114,flip.1] {-} c_Message_Omsg_OKey(A)!=c_Message_Omsg_OMPair(B,C).
% 0.20/0.41 116 back subsumes 13.
% 0.20/0.41 Following clause subsumed by 121 during input processing: 0 [copy,120,flip.1] {-} c_Message_Omsg_OKey(A)!=c_Message_Omsg_OCrypt(B,C).
% 0.20/0.41 Following clause subsumed by 120 during input processing: 0 [copy,121,flip.1] {-} c_Message_Omsg_OCrypt(A,B)!=c_Message_Omsg_OKey(C).
% 0.20/0.41 Following clause subsumed by 126 during input processing: 0 [copy,124,flip.1] {-} c_Event_Oevent_OGets(A,B)!=c_Event_Oevent_OSays(C,D,E).
% 0.20/0.41 Following clause subsumed by 127 during input processing: 0 [copy,125,flip.1] {-} c_Event_Oevent_ONotes(A,B)!=c_Event_Oevent_OSays(C,D,E).
% 0.20/0.41 Following clause subsumed by 124 during input processing: 0 [copy,126,flip.1] {-} c_Event_Oevent_OSays(A,B,C)!=c_Event_Oevent_OGets(D,E).
% 0.20/0.41 Following clause subsumed by 125 during input processing: 0 [copy,127,flip.1] {-} c_Event_Oevent_OSays(A,B,C)!=c_Event_Oevent_ONotes(D,E).
% 0.20/0.41 Following clause subsumed by 158 during input processing: 0 [copy,139,flip.1] {-} c_Event_Oevent_ONotes(A,B)!=c_Event_Oevent_OGets(C,D).
% 0.20/0.42 Following clause subsumed by 58 during input processing: 0 [copy,153,flip.1] {-} c_Set_Oinsert(A,B,C)!=c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)).
% 0.20/0.42 Following clause subsumed by 139 during input processing: 0 [copy,158,flip.1] {-} c_Event_Oevent_OGets(A,B)!=c_Event_Oevent_ONotes(C,D).
% 0.20/0.42 214 back subsumes 197.
% 0.20/0.42 235 back subsumes 110.
% 0.20/0.42 Following clause subsumed by 271 during input processing: 0 [copy,264,flip.1] {-} c_Message_Omsg_OCrypt(A,B)!=c_Message_Omsg_OMPair(C,D).
% 0.20/0.42 Following clause subsumed by 264 during input processing: 0 [copy,271,flip.1] {-} c_Message_Omsg_OMPair(A,B)!=c_Message_Omsg_OCrypt(C,D).
% 0.20/0.42 304 back subsumes 287.
% 0.20/0.42
% 0.20/0.42 ------------> process sos:
% 0.20/0.42 Following clause subsumed by 312 during input processing: 0 [] {-} c_in(c_Message_Omsg_OKey(c_Public_OshrK(A)),c_Event_Oused(B),tc_Message_Omsg).
% 0.20/0.42 Following clause subsumed by 372 during input processing: 0 [demod,370] {-} c_List_Omap(A,c_List_Olist_OCons(B,C,D),D,E)=c_List_Omap(A,c_List_Olist_OCons(B,C,D),D,E).
% 0.20/0.42 Following clause subsumed by 338 during input processing: 0 [] {-} c_Set_Oinsert(c_Message_Omsg_OKey(A),c_Set_Oinsert(c_Message_Omsg_OMPair(B,C),D,tc_Message_Omsg),tc_Message_Omsg)=c_Set_Oinsert(c_Message_Omsg_OMPair(B,C),c_Set_Oinsert(c_Message_Omsg_OKey(A),D,tc_Message_Omsg),tc_Message_Omsg).
% 0.20/0.42 Following clause subsumed by 391 during input processing: 0 [] {-} c_in(A,c_Set_Oinsert(A,B,C),C).
% 0.20/0.42 Following clause subsumed by 391 during input processing: 0 [] {-} c_in(A,c_Set_Oinsert(A,B,C),C).
% 0.20/0.42 Following clause subsumed by 375 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.20/0.42 Following clause subsumed by 338 during input processing: 0 [] {-} c_Set_Oinsert(c_Message_Omsg_OKey(A),c_Set_Oinsert(c_Message_Omsg_OCrypt(B,C),D,tc_Message_Omsg),tc_Message_Omsg)=c_Set_Oinsert(c_Message_Omsg_OCrypt(B,C),c_Set_Oinsert(c_Message_Omsg_OKey(A),D,tc_Message_Omsg),tc_Message_Omsg).
% 0.20/0.42 Following clause subsumed by 351 during input processing: 0 [] {-} c_lessequals(c_Orderings_Obot__class_Obot(tc_fun(A,tc_bool)),c_Orderings_Obot__class_Obot(tc_fun(A,tc_bool)),tc_fun(A,tc_bool)).
% 0.20/0.42 Following clause subsumed by 375 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.20/0.42 Following clause subsumed by 429 during input processing: 0 [] {-} c_lessequals(A,A,tc_fun(B,tc_bool)).
% 0.20/0.42 Following clause subsumed by 429 during input processing: 0 [demod,404] {-} c_lessequals(c_Event_Oknows(c_Message_Oagent_OSpy,A),c_Event_Oknows(c_Message_Oagent_OSpy,A),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.20/0.42 Following clause subsumed by 375 during input processing: 0 [] {-} c_lessequals(c_Event_Oknows(A,B),c_Event_Oknows(A,c_List_Olist_OCons(c_Event_Oevent_ONotes(C,D),B,tc_Event_Oevent)),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.20/0.42 Following clause subsumed by 391 during input processing: 0 [] {-} c_in(A,c_Set_Oinsert(A,c_Orderings_Obot__class_Obot(tc_fun(B,tc_bool)),B),B).
% 0.20/0.42 Following clause subsumed by 361 during input processing: 0 [demod,452] {-} c_lessequals(c_Event_Oknows(c_Message_Oagent_OSpy,A),c_Set_Oinsert(D,c_Event_Oknows(c_Message_Oagent_OSpy,A),tc_Message_Omsg),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.20/0.42 Following clause subsumed by 338 during input processing: 0 [] {-} c_Set_Oinsert(c_Message_Omsg_OCrypt(A,B),c_Set_Oinsert(c_Message_Omsg_OMPair(C,D),E,tc_Message_Omsg),tc_Message_Omsg)=c_Set_Oinsert(c_Message_Omsg_OMPair(C,D),c_Set_Oinsert(c_Message_Omsg_OCrypt(A,B),E,tc_Message_Omsg),tc_Message_Omsg).
% 0.20/0.42 Following clause subsumed by 477 during input processing: 0 [copy,325,flip.1] {-} c_Lattices_Oupper__semilattice__class_Osup(A,c_Lattices_Oupper__semilattice__class_Osup(B,C,tc_fun(D,tc_bool)),tc_fun(D,tc_bool))=c_Lattices_Oupper__semilattice__class_Osup(A,c_Lattices_Oupper__semilattice__class_Osup(B,C,tc_fun(D,tc_bool)),tc_fun(D,tc_bool)).
% 0.20/0.42 Following clause subsumed by 326 during input processing: 0 [copy,326,flip.1] {-} c_Lattices_Oupper__semilattice__class_Osup(A,c_Lattices_Oupper__semilattice__class_Osup(B,C,tc_fun(D,tc_bool)),tc_fun(D,tc_bool))=c_Lattices_Oupper__semilattice__class_Osup(B,c_Lattices_Oupper__semilattice__class_Osup(A,C,tc_fun(D,tc_bool)),tc_fun(D,tc_bool)).
% 0.20/0.42 Following clause subsumed by 338 during input processing: 0 [copy,332,flip.1] {-} c_Set_Oinsert(A,c_Set_Oinsert(B,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C),C)=c_Set_Oinsert(B,c_Set_Oinsert(A,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C),C).
% 0.20/0.42 Following clause subsumed by 338 during input processing: 0 [copy,338,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.20/0.42 338 back subsumes 332.
% 0.20/0.42 Following clause subsumed by 477 during input processing: 0 [copy,372,flip.1] {-} c_List_Omap(A,c_List_Olist_OCons(B,C,D),D,E)=c_List_Omap(A,c_List_Olist_OCons(B,C,D),D,E).
% 0.20/0.42 375 back subsumes 316.
% 0.20/0.42 Following clause subsumed by 477 during input processing: 0 [copy,380,flip.1] {-} c_List_Odrop(A,c_List_Obutlast(B,C),C)=c_List_Odrop(A,c_List_Obutlast(B,C),C).
% 0.20/0.42 Following clause subsumed by 381 during input processing: 0 [copy,381,flip.1] {-} c_Lattices_Oupper__semilattice__class_Osup(A,B,tc_fun(C,tc_bool))=c_Lattices_Oupper__semilattice__class_Osup(B,A,tc_fun(C,tc_bool)).
% 0.20/0.42 413 back subsumes 402.
% 0.20/0.42 427 back subsumes 15.
% 0.20/0.42 430 back subsumes 413.
% 0.20/0.42 Following clause subsumed by 477 during input processing: 0 [copy,444,flip.1] {-} c_Orderings_Obot__class_Obot(tc_fun(A,tc_bool))=c_Orderings_Obot__class_Obot(tc_fun(A,tc_bool)).
% 0.20/0.42 Following clause subsumed by 477 during input processing: 0 [copy,477,flip.1] {-} A=A.
% 0.20/0.42 477 back subsumes 444.
% 0.20/0.42 477 back subsumes 380.
% 0.20/0.42 477 back subsumes 372.
% 0.20/0.42 477 back subsumes 325.
% 0.20/0.42 477 back subsumes 290.
% 0.20/0.42 477 back subsumes 289.
% 0.20/0.42 477 back subsumes 286.
% 0.20/0.42 Following clause subsumed by 335 during input processing: 0 [copy,478,flip.1] {-} c_Message_Oparts(c_Set_Oinsert(A,c_Set_Oinsert(B,C,tc_Message_Omsg),tc_Message_Omsg))=c_Lattices_Oupper__semilattice__class_Osup(c_Message_Oparts(c_Set_Oinsert(A,c_Orderings_Obot__class_Obot(tc_fun(tc_Message_Omsg,tc_bool)),tc_Message_Omsg)),c_Lattices_Oupper__semilattice__class_Osup(c_Message_Oparts(c_Set_Oinsert(B,c_Orderings_Obot__class_Obot(tc_fun(tc_Message_Omsg,tc_bool)),tc_Message_Omsg)),c_Message_Oparts(C),tc_fun(tc_Message_Omsg,tc_bool)),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.20/0.42 Following clause subsumed by 336 during input processing: 0 [copy,479,flip.1] {-} c_Event_Oused(c_List_Olist_OCons(c_Event_Oevent_OSays(A,B,C),D,tc_Event_Oevent))=c_Lattices_Oupper__semilattice__class_Osup(c_Message_Oparts(c_Set_Oinsert(C,c_Orderings_Obot__class_Obot(tc_fun(tc_Message_Omsg,tc_bool)),tc_Message_Omsg)),c_Event_Oused(D),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.20/0.42 Following clause subsumed by 350 during input processing: 0 [copy,480,flip.1] {-} c_Lattices_Oupper__semilattice__class_Osup(A,c_Set_Oinsert(B,C,D),tc_fun(D,tc_bool))=c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(B,A,D),C,tc_fun(D,tc_bool)).
% 0.20/0.42 Following clause subsumed by 354 during input processing: 0 [copy,481,flip.1] {-} c_List_Omap(A,c_List_Oreplicate(B,C,D),D,E)=c_List_Oreplicate(B,hAPP(A,C),E).
% 0.20/0.42 Following clause subsumed by 362 during input processing: 0 [copy,486,flip.1] {-} c_Event_Oused(c_List_Olist_OCons(c_Event_Oevent_ONotes(A,B),C,tc_Event_Oevent))=c_Lattices_Oupper__semilattice__class_Osup(c_Message_Oparts(c_Set_Oinsert(B,c_Orderings_Obot__class_Obot(tc_fun(tc_Message_Omsg,tc_bool)),tc_Message_Omsg)),c_Event_Oused(C),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.20/0.42 Following clause subsumed by 382 during input processing: 0 [copy,487,flip.1] {-} c_Set_Oinsert(A,B,C)=c_Lattices_Oupper__semilattice__class_Osup(c_Set_Oinsert(A,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C),B,tc_fun(C,tc_bool)).
% 0.20/0.42 Following clause subsumed by 430 during input processing: 0 [copy,489,flip.1] {-} c_Message_Oparts(c_Set_Oinsert(A,c_Event_Oknows(c_Message_Oagent_OSpy,B),tc_Message_Omsg))=c_Lattices_Oupper__semilattice__class_Osup(c_Message_Oparts(c_Set_Oinsert(A,c_Orderings_Obot__class_Obot(tc_fun(tc_Message_Omsg,tc_bool)),tc_Message_Omsg)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,B)),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.20/0.42 Following clause subsumed by 430 during input processing: 0 [copy,490,flip.1] {-} c_Message_Oparts(c_Set_Oinsert(A,c_Event_Oknows(B,C),tc_Message_Omsg))=c_Lattices_Oupper__semilattice__class_Osup(c_Message_Oparts(c_Set_Oinsert(A,c_Orderings_Obot__class_Obot(tc_fun(tc_Message_Omsg,tc_bool)),tc_Message_Omsg)),c_Message_Oparts(c_Event_Oknows(B,C)),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.20/0.42 490 back subsumes 489.
% 0.20/0.42 Following clause subsumed by 430 during input processing: 0 [copy,491,flip.1] {-} c_Message_Oparts(c_Set_Oinsert(A,B,tc_Message_Omsg))=c_Lattices_Oupper__semilattice__class_Osup(c_Message_Oparts(c_Set_Oinsert(A,c_Orderings_Obot__class_Obot(tc_fun(tc_Message_Omsg,tc_bool)),tc_Message_Omsg)),c_Message_Oparts(B),tc_fun(tc_Message_Omsg,tc_bool)).
% 0.20/0.42 491 back subsumes 490.
% 0.20/0.42
% 0.20/0.42 ======= end of input processing =======
% 0.41/0.60
% 0.41/0.60
% 0.41/0.60 Failed to model usable list: disabling FINDER
% 0.41/0.60
% 0.41/0.60
% 0.41/0.60
% 0.41/0.60 -------------- Softie stats --------------
% 0.41/0.60
% 0.41/0.60 UPDATE_STOP: 300
% 0.41/0.60 SFINDER_TIME_LIMIT: 2
% 0.41/0.60 SHORT_CLAUSE_CUTOFF: 4
% 0.41/0.60 number of clauses in intial UL: 272
% 0.41/0.60 number of clauses initially in problem: 434
% 0.41/0.60 percentage of clauses intially in UL: 62
% 0.41/0.60 percentage of distinct symbols occuring in initial UL: 82
% 0.41/0.60 percent of all initial clauses that are short: 99
% 0.41/0.60 absolute distinct symbol count: 107
% 0.41/0.60 distinct predicate count: 23
% 0.41/0.60 distinct function count: 62
% 0.41/0.60 distinct constant count: 22
% 0.41/0.60
% 0.41/0.60 ---------- no more Softie stats ----------
% 0.41/0.60
% 0.41/0.60
% 0.41/0.60
% 0.41/0.60 =========== start of search ===========
% 0.81/1.06
% 0.81/1.06
% 0.81/1.06 Changing weight limit from 60 to 32.
% 0.81/1.06
% 0.81/1.06 Resetting weight limit to 32 after 50 givens.
% 0.81/1.06
% 0.99/1.20
% 0.99/1.20
% 0.99/1.20 Changing weight limit from 32 to 28.
% 0.99/1.20
% 0.99/1.20 Resetting weight limit to 28 after 55 givens.
% 0.99/1.20
% 1.04/1.27
% 1.04/1.27
% 1.04/1.27 Changing weight limit from 28 to 27.
% 1.04/1.27
% 1.04/1.27 Resetting weight limit to 27 after 60 givens.
% 1.04/1.27
% 1.13/1.32
% 1.13/1.32
% 1.13/1.32 Changing weight limit from 27 to 26.
% 1.13/1.32
% 1.13/1.32 Resetting weight limit to 26 after 65 givens.
% 1.13/1.32
% 1.13/1.35
% 1.13/1.35
% 1.13/1.35 Changing weight limit from 26 to 24.
% 1.13/1.35
% 1.13/1.35 Resetting weight limit to 24 after 70 givens.
% 1.13/1.35
% 1.13/1.37
% 1.13/1.37
% 1.13/1.37 Changing weight limit from 24 to 23.
% 1.13/1.37
% 1.13/1.37 Resetting weight limit to 23 after 75 givens.
% 1.13/1.37
% 1.20/1.41
% 1.20/1.41
% 1.20/1.41 Changing weight limit from 23 to 22.
% 1.20/1.41
% 1.20/1.41 Resetting weight limit to 22 after 80 givens.
% 1.20/1.41
% 1.20/1.44
% 1.20/1.44
% 1.20/1.44 Changing weight limit from 22 to 21.
% 1.20/1.44
% 1.20/1.44 Resetting weight limit to 21 after 85 givens.
% 1.20/1.44
% 1.29/1.49
% 1.29/1.49
% 1.29/1.49 Changing weight limit from 21 to 20.
% 1.29/1.49
% 1.29/1.49 Resetting weight limit to 20 after 90 givens.
% 1.29/1.49
% 1.34/1.56
% 1.34/1.56
% 1.34/1.56 Changing weight limit from 20 to 19.
% 1.34/1.56
% 1.34/1.56 Resetting weight limit to 19 after 95 givens.
% 1.34/1.56
% 1.43/1.62
% 1.43/1.62
% 1.43/1.62 Changing weight limit from 19 to 18.
% 1.43/1.62
% 1.43/1.62 Resetting weight limit to 18 after 100 givens.
% 1.43/1.62
% 1.43/1.67
% 1.43/1.67
% 1.43/1.67 Changing weight limit from 18 to 17.
% 1.43/1.67
% 1.43/1.67 Resetting weight limit to 17 after 105 givens.
% 1.43/1.67
% 1.51/1.73
% 1.51/1.73
% 1.51/1.73 Changing weight limit from 17 to 16.
% 1.51/1.73
% 1.51/1.73 Resetting weight limit to 16 after 110 givens.
% 1.51/1.73
% 1.51/1.76 c_lessequals(c_Set_Oinsert(c_Message_Osko__Message__Xparts__singleton__1__1(c_Event_Obad,c_Message_Oagent_OSpy),c_Event_Obad,tc_Message_Omsg),c_Event_Obad,tc_fun(tc_Message_Omsg,tc_bool)).
% 1.51/1.76
% 1.51/1.76 ------------- memory usage ------------
% 1.51/1.76 280 mallocs of 32700 bytes each, 8941.4 K.
% 1.51/1.76 type (bytes each) gets frees in use avail bytes
% 1.51/1.76 sym_ent ( 304) 262 0 262 0 77.8 K
% 1.51/1.76 term ( 32) 485109 461314 23795 4155 873.4 K
% 1.51/1.76 rel ( 40) 425591 384559 41032 9303 1966.2 K
% 1.51/1.76 term_ptr ( 16) 412890 301003 111887 57959 2653.8 K
% 1.51/1.76 formula_ptr_2 ( 56) 0 0 0 0 0.0 K
% 1.51/1.76 fpa_head ( 24) 15509 7095 8414 2555 257.1 K
% 1.51/1.76 fpa_tree ( 56) 40542 40542 0 55 3.0 K
% 1.51/1.76 context (1288) 96471 96471 0 5 6.3 K
% 1.51/1.76 trail ( 24) 1874703 1874703 0 8 0.2 K
% 1.51/1.76 imd_tree ( 32) 520 19 501 1 15.7 K
% 1.51/1.76 imd_pos (4024) 39729 39729 0 7 27.5 K
% 1.51/1.76 is_tree ( 24) 37487 24675 12812 13124 607.9 K
% 1.51/1.76 is_pos (2424) 1437747 1437747 0 15 35.5 K
% 1.51/1.76 fsub_pos ( 16) 67003 67003 0 1 0.0 K
% 1.51/1.76 literal ( 32) 53193 37799 15394 1093 515.2 K
% 1.51/1.76 clause ( 88) 20622 13470 7152 51 619.0 K
% 1.51/1.76 list ( 272) 10 3 7 1 2.1 K
% 1.51/1.76 clash_nd ( 80) 1083 1083 0 3 0.2 K
% 1.51/1.76 clause_ptr ( 16) 12436 5673 6763 49 106.4 K
% 1.51/1.76 int_ptr ( 16) 170307 111927 58380 325 917.3 K
% 1.51/1.76 ci_ptr ( 24) 0 0 0 0 0.0 K
% 1.51/1.76 link_node ( 120) 0 0 0 0 0.0 K
% 1.51/1.76 ans_lit_node( 24) 0 0 0 0 0.0 K
% 1.51/1.76 formula_box( 168) 0 0 0 0 0.0 K
% 1.51/1.76 formula( 40) 0 0 0 0 0.0 K
% 1.51/1.76 formula_ptr( 16) 0 0 0 0 0.0 K
% 1.51/1.76 cl_attribute( 24) 0 0 0 0 0.0 K
% 1.51/1.76
% 1.51/1.76 ********** is_delete, can't find end.
% 1.51/1.76 0.00
% 1.51/1.76 conflict time 0.00
% 1.51/1.76 new demod time 0.00
% 1.51/1.76 post_process time 0.00
% 1.51/1.76 back demod time 0.00
% 1.51/1.76 back subsume 0.00
% 1.51/1.76 factor time 0.00
% 1.51/1.76 FINDER time 0.00
% 1.51/1.76 unindex time 0.00
% 1.51/1.76
% 1.51/1.76 Forward subsumption counts, subsumer:number_subsumed.
% 1.51/1.76 1:3 2:4 3:1 4:1 5:1 6:1 7:1 8:0 9:1 10:0
% 1.51/1.76 11:1 12:4 13:0 14:0 15:0 16:1 17:0 18:0 19:1 20:0
% 1.51/1.76 21:0 22:0 23:0 24:0 25:2 26:0 27:0 28:1 29:2 30:0
% 1.51/1.76 31:0 32:0 33:0 34:0 35:0 36:0 37:0 38:2 39:3 40:0
% 1.51/1.76 41:0 42:0 43:0 44:0 45:0 46:0 47:0 48:0 49:4 50:0
% 1.51/1.76 51:0 52:0 53:0 54:0 55:0 56:2 57:0 58:2 59:0 60:0
% 1.51/1.76 61:0 62:3 63:0 64:0 65:0 66:0 67:0 68:0 69:0 70:0
% 1.51/1.76 71:0 72:0 73:2 74:1 75:2 76:0 77:0 78:0 79:0 80:0
% 1.51/1.76 81:0 82:0 83:0 84:0 85:0 86:0 87:0 88:0 89:1 90:2
% 1.51/1.76 91:0 92:2 93:0 94:0 95:2 96:7 97:0 98:4 99:5
% 1.51/1.76 All others: 2324.
% 1.51/1.76
% 1.51/1.76 ********** ABNORMAL END **********
% 1.51/1.76
% 1.51/1.76 ********** is_delete, can't find end.
%------------------------------------------------------------------------------