TSTP Solution File: SEU338+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU338+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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 : 300s
% DateTime : Wed Jul 27 13:15:44 EDT 2022
% Result : Unknown 12.30s 12.47s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU338+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 07:56:53 EDT 2022
% 0.14/0.34 % CPUTime :
% 2.55/2.73 ----- Otter 3.3f, August 2004 -----
% 2.55/2.73 The process was started by sandbox2 on n020.cluster.edu,
% 2.55/2.73 Wed Jul 27 07:56:53 2022
% 2.55/2.73 The command was "./otter". The process ID is 20542.
% 2.55/2.73
% 2.55/2.73 set(prolog_style_variables).
% 2.55/2.73 set(auto).
% 2.55/2.73 dependent: set(auto1).
% 2.55/2.73 dependent: set(process_input).
% 2.55/2.73 dependent: clear(print_kept).
% 2.55/2.73 dependent: clear(print_new_demod).
% 2.55/2.73 dependent: clear(print_back_demod).
% 2.55/2.73 dependent: clear(print_back_sub).
% 2.55/2.73 dependent: set(control_memory).
% 2.55/2.73 dependent: assign(max_mem, 12000).
% 2.55/2.73 dependent: assign(pick_given_ratio, 4).
% 2.55/2.73 dependent: assign(stats_level, 1).
% 2.55/2.73 dependent: assign(max_seconds, 10800).
% 2.55/2.73 clear(print_given).
% 2.55/2.73
% 2.55/2.73 formula_list(usable).
% 2.55/2.73 all A (A=A).
% 2.55/2.73 all A B (in(A,B)-> -in(B,A)).
% 2.55/2.73 all A (v1_membered(A)-> (all B (element(B,A)->v1_xcmplx_0(B)))).
% 2.55/2.73 all A (v2_membered(A)-> (all B (element(B,A)->v1_xcmplx_0(B)&v1_xreal_0(B)))).
% 2.55/2.73 all A (v3_membered(A)-> (all B (element(B,A)->v1_xcmplx_0(B)&v1_xreal_0(B)&v1_rat_1(B)))).
% 2.55/2.73 all A (v4_membered(A)-> (all B (element(B,A)->v1_xcmplx_0(B)&v1_xreal_0(B)&v1_int_1(B)&v1_rat_1(B)))).
% 2.55/2.73 all A (v5_membered(A)-> (all B (element(B,A)->v1_xcmplx_0(B)&natural(B)&v1_xreal_0(B)&v1_int_1(B)&v1_rat_1(B)))).
% 2.55/2.73 all A (empty(A)->v1_membered(A)&v2_membered(A)&v3_membered(A)&v4_membered(A)&v5_membered(A)).
% 2.55/2.73 all A (v1_membered(A)-> (all B (element(B,powerset(A))->v1_membered(B)))).
% 2.55/2.73 all A (v2_membered(A)-> (all B (element(B,powerset(A))->v1_membered(B)&v2_membered(B)))).
% 2.55/2.73 all A (v3_membered(A)-> (all B (element(B,powerset(A))->v1_membered(B)&v2_membered(B)&v3_membered(B)))).
% 2.55/2.73 all A (v4_membered(A)-> (all B (element(B,powerset(A))->v1_membered(B)&v2_membered(B)&v3_membered(B)&v4_membered(B)))).
% 2.55/2.73 all A (empty(A)->finite(A)).
% 2.55/2.73 all A (v5_membered(A)->v4_membered(A)).
% 2.55/2.73 all A (v5_membered(A)-> (all B (element(B,powerset(A))->v1_membered(B)&v2_membered(B)&v3_membered(B)&v4_membered(B)&v5_membered(B)))).
% 2.55/2.73 all A (finite(A)-> (all B (element(B,powerset(A))->finite(B)))).
% 2.55/2.73 all A (v4_membered(A)->v3_membered(A)).
% 2.55/2.73 all A (v3_membered(A)->v2_membered(A)).
% 2.55/2.73 all A (v2_membered(A)->v1_membered(A)).
% 2.55/2.73 all A (centered(A)<->A!=empty_set& (all B (-(B!=empty_set&subset(B,A)&finite(B)&set_meet(B)=empty_set)))).
% 2.55/2.73 all A (top_str(A)-> (compact_top_space(A)<-> (all B (element(B,powerset(powerset(the_carrier(A))))-> -(is_a_cover_of_carrier(A,B)&open_subsets(B,A)& (all C (element(C,powerset(powerset(the_carrier(A))))-> -(subset(C,B)&is_a_cover_of_carrier(A,C)&finite(C))))))))).
% 2.55/2.73 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 2.55/2.73 all A (one_sorted_str(A)-> (all B (element(B,powerset(powerset(the_carrier(A))))-> (is_a_cover_of_carrier(A,B)<->cast_as_carrier_subset(A)=union_of_subsets(the_carrier(A),B))))).
% 2.55/2.73 all A B (element(B,powerset(powerset(A)))-> (all C (element(C,powerset(powerset(A)))-> (C=complements_of_subsets(A,B)<-> (all D (element(D,powerset(A))-> (in(D,C)<->in(subset_complement(A,D),B)))))))).
% 2.55/2.73 $T.
% 2.55/2.73 $T.
% 2.55/2.73 $T.
% 2.55/2.73 all A (one_sorted_str(A)->element(cast_as_carrier_subset(A),powerset(the_carrier(A)))).
% 2.55/2.73 all A B (element(B,powerset(A))->element(subset_complement(A,B),powerset(A))).
% 2.55/2.73 $T.
% 2.55/2.73 $T.
% 2.55/2.73 all A B (element(B,powerset(powerset(A)))->element(union_of_subsets(A,B),powerset(A))).
% 2.55/2.73 all A B (element(B,powerset(powerset(A)))->element(meet_of_subsets(A,B),powerset(A))).
% 2.55/2.73 all A B C (element(B,powerset(A))&element(C,powerset(A))->element(subset_difference(A,B,C),powerset(A))).
% 2.55/2.73 all A B (element(B,powerset(powerset(A)))->element(complements_of_subsets(A,B),powerset(powerset(A)))).
% 2.55/2.73 all A (top_str(A)->one_sorted_str(A)).
% 2.55/2.73 $T.
% 2.55/2.73 $T.
% 2.55/2.73 $T.
% 2.55/2.73 exists A top_str(A).
% 2.55/2.73 exists A one_sorted_str(A).
% 2.55/2.73 all A exists B element(B,A).
% 2.55/2.73 all A B (finite(A)->finite(set_difference(A,B))).
% 2.55/2.73 all A (-empty_carrier(A)&one_sorted_str(A)-> -empty(the_carrier(A))).
% 2.55/2.73 all A (-empty(powerset(A))).
% 2.55/2.73 all A (-empty_carrier(A)&one_sorted_str(A)-> -empty(cast_as_carrier_subset(A))).
% 2.55/2.73 all A B (v1_membered(A)->v1_membered(set_difference(A,B))).
% 2.55/2.73 all A B (v2_membered(A)->v1_membered(set_difference(A,B))&v2_membered(set_difference(A,B))).
% 2.55/2.73 all A B (v3_membered(A)->v1_membered(set_difference(A,B))&v2_membered(set_difference(A,B))&v3_membered(set_difference(A,B))).
% 2.55/2.73 all A B (v4_membered(A)->v1_membered(set_difference(A,B))&v2_membered(set_difference(A,B))&v3_membered(set_difference(A,B))&v4_membered(set_difference(A,B))).
% 2.55/2.73 all A B (v5_membered(A)->v1_membered(set_difference(A,B))&v2_membered(set_difference(A,B))&v3_membered(set_difference(A,B))&v4_membered(set_difference(A,B))&v5_membered(set_difference(A,B))).
% 2.55/2.73 all A (topological_space(A)&top_str(A)->closed_subset(cast_as_carrier_subset(A),A)).
% 2.55/2.73 empty(empty_set).
% 2.55/2.73 v1_membered(empty_set).
% 2.55/2.73 v2_membered(empty_set).
% 2.55/2.73 v3_membered(empty_set).
% 2.55/2.73 v4_membered(empty_set).
% 2.55/2.73 v5_membered(empty_set).
% 2.55/2.73 all A B (element(B,powerset(A))->subset_complement(A,subset_complement(A,B))=B).
% 2.55/2.73 all A B (element(B,powerset(powerset(A)))->complements_of_subsets(A,complements_of_subsets(A,B))=B).
% 2.55/2.73 exists A (-empty(A)&finite(A)).
% 2.55/2.73 exists A (-empty(A)&v1_membered(A)&v2_membered(A)&v3_membered(A)&v4_membered(A)&v5_membered(A)).
% 2.55/2.73 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.55/2.73 all A exists B (element(B,powerset(A))&empty(B)).
% 2.55/2.73 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 2.55/2.73 exists A (one_sorted_str(A)& -empty_carrier(A)).
% 2.55/2.73 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 2.55/2.73 all A (-empty_carrier(A)&one_sorted_str(A)-> (exists B (element(B,powerset(the_carrier(A)))& -empty(B)))).
% 2.55/2.73 all A (topological_space(A)&top_str(A)-> (exists B (element(B,powerset(the_carrier(A)))&closed_subset(B,A)))).
% 2.55/2.73 all A (-empty_carrier(A)&topological_space(A)&top_str(A)-> (exists B (element(B,powerset(the_carrier(A)))& -empty(B)&closed_subset(B,A)))).
% 2.55/2.73 all A B (element(B,powerset(powerset(A)))->union_of_subsets(A,B)=union(B)).
% 2.55/2.73 all A B (element(B,powerset(powerset(A)))->meet_of_subsets(A,B)=set_meet(B)).
% 2.55/2.73 all A B C (element(B,powerset(A))&element(C,powerset(A))->subset_difference(A,B,C)=set_difference(B,C)).
% 2.55/2.73 all A B subset(A,A).
% 2.55/2.73 all A B (element(B,powerset(powerset(A)))-> -(B!=empty_set&complements_of_subsets(A,B)=empty_set)& -(complements_of_subsets(A,B)!=empty_set&B=empty_set)).
% 2.55/2.73 all A B (element(B,powerset(powerset(A)))-> (B!=empty_set->meet_of_subsets(A,complements_of_subsets(A,B))=subset_complement(A,union_of_subsets(A,B)))).
% 2.55/2.73 all A B (element(B,powerset(powerset(A)))-> (B!=empty_set->union_of_subsets(A,complements_of_subsets(A,B))=subset_complement(A,meet_of_subsets(A,B)))).
% 2.55/2.73 -(all A (-empty_carrier(A)&topological_space(A)&top_str(A)-> (compact_top_space(A)<-> (all B (element(B,powerset(powerset(the_carrier(A))))-> -(centered(B)&closed_subsets(B,A)&meet_of_subsets(the_carrier(A),B)=empty_set)))))).
% 2.55/2.73 all A (one_sorted_str(A)-> (all B (element(B,powerset(powerset(the_carrier(A))))-> (finite(complements_of_subsets(the_carrier(A),B))<->finite(B))))).
% 2.55/2.73 all A (top_str(A)-> (all B (element(B,powerset(powerset(the_carrier(A))))-> (closed_subsets(B,A)<->open_subsets(complements_of_subsets(the_carrier(A),B),A))))).
% 2.55/2.73 all A (one_sorted_str(A)-> (all B (element(B,powerset(the_carrier(A)))->subset_complement(the_carrier(A),B)=subset_difference(the_carrier(A),cast_as_carrier_subset(A),B)))).
% 2.55/2.73 all A (top_str(A)-> (all B (element(B,powerset(powerset(the_carrier(A))))-> (open_subsets(B,A)<->closed_subsets(complements_of_subsets(the_carrier(A),B),A))))).
% 2.55/2.73 all A B (in(A,B)->element(A,B)).
% 2.55/2.73 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 2.55/2.73 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.55/2.73 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 2.55/2.73 all A (set_difference(A,empty_set)=A).
% 2.55/2.73 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.55/2.73 all A (set_difference(empty_set,A)=empty_set).
% 2.55/2.73 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.55/2.73 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.55/2.73 all A (-empty_carrier(A)&one_sorted_str(A)-> (all B (element(B,powerset(powerset(the_carrier(A))))-> -(is_a_cover_of_carrier(A,B)&B=empty_set)))).
% 2.55/2.73 all A (empty(A)->A=empty_set).
% 2.55/2.73 all A B (-(in(A,B)&empty(B))).
% 2.55/2.73 all A B (-(empty(A)&A!=B&empty(B))).
% 2.55/2.73 end_of_list.
% 2.55/2.73
% 2.55/2.73 -------> usable clausifies to:
% 2.55/2.73
% 2.55/2.73 list(usable).
% 2.55/2.73 0 [] A=A.
% 2.55/2.73 0 [] -in(A,B)| -in(B,A).
% 2.55/2.73 0 [] -v1_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.55/2.73 0 [] -v2_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.55/2.73 0 [] -v2_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.55/2.73 0 [] -v3_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.55/2.74 0 [] -v3_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.55/2.74 0 [] -v3_membered(A)| -element(B,A)|v1_rat_1(B).
% 2.55/2.74 0 [] -v4_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.55/2.74 0 [] -v4_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.55/2.74 0 [] -v4_membered(A)| -element(B,A)|v1_int_1(B).
% 2.55/2.74 0 [] -v4_membered(A)| -element(B,A)|v1_rat_1(B).
% 2.55/2.74 0 [] -v5_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.55/2.74 0 [] -v5_membered(A)| -element(B,A)|natural(B).
% 2.55/2.74 0 [] -v5_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.55/2.74 0 [] -v5_membered(A)| -element(B,A)|v1_int_1(B).
% 2.55/2.74 0 [] -v5_membered(A)| -element(B,A)|v1_rat_1(B).
% 2.55/2.74 0 [] -empty(A)|v1_membered(A).
% 2.55/2.74 0 [] -empty(A)|v2_membered(A).
% 2.55/2.74 0 [] -empty(A)|v3_membered(A).
% 2.55/2.74 0 [] -empty(A)|v4_membered(A).
% 2.55/2.74 0 [] -empty(A)|v5_membered(A).
% 2.55/2.74 0 [] -v1_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.55/2.74 0 [] -v2_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.55/2.74 0 [] -v2_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.55/2.74 0 [] -v3_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.55/2.74 0 [] -v3_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.55/2.74 0 [] -v3_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 2.55/2.74 0 [] -v4_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.55/2.74 0 [] -v4_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.55/2.74 0 [] -v4_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 2.55/2.74 0 [] -v4_membered(A)| -element(B,powerset(A))|v4_membered(B).
% 2.55/2.74 0 [] -empty(A)|finite(A).
% 2.55/2.74 0 [] -v5_membered(A)|v4_membered(A).
% 2.55/2.74 0 [] -v5_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.55/2.74 0 [] -v5_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.55/2.74 0 [] -v5_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 2.55/2.74 0 [] -v5_membered(A)| -element(B,powerset(A))|v4_membered(B).
% 2.55/2.74 0 [] -v5_membered(A)| -element(B,powerset(A))|v5_membered(B).
% 2.55/2.74 0 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 2.55/2.74 0 [] -v4_membered(A)|v3_membered(A).
% 2.55/2.74 0 [] -v3_membered(A)|v2_membered(A).
% 2.55/2.74 0 [] -v2_membered(A)|v1_membered(A).
% 2.55/2.74 0 [] -centered(A)|A!=empty_set.
% 2.55/2.74 0 [] -centered(A)|B=empty_set| -subset(B,A)| -finite(B)|set_meet(B)!=empty_set.
% 2.55/2.74 0 [] centered(A)|A=empty_set|$f1(A)!=empty_set.
% 2.55/2.74 0 [] centered(A)|A=empty_set|subset($f1(A),A).
% 2.55/2.74 0 [] centered(A)|A=empty_set|finite($f1(A)).
% 2.55/2.74 0 [] centered(A)|A=empty_set|set_meet($f1(A))=empty_set.
% 2.55/2.74 0 [] -top_str(A)| -compact_top_space(A)| -element(B,powerset(powerset(the_carrier(A))))| -is_a_cover_of_carrier(A,B)| -open_subsets(B,A)|element($f2(A,B),powerset(powerset(the_carrier(A)))).
% 2.55/2.74 0 [] -top_str(A)| -compact_top_space(A)| -element(B,powerset(powerset(the_carrier(A))))| -is_a_cover_of_carrier(A,B)| -open_subsets(B,A)|subset($f2(A,B),B).
% 2.55/2.74 0 [] -top_str(A)| -compact_top_space(A)| -element(B,powerset(powerset(the_carrier(A))))| -is_a_cover_of_carrier(A,B)| -open_subsets(B,A)|is_a_cover_of_carrier(A,$f2(A,B)).
% 2.55/2.74 0 [] -top_str(A)| -compact_top_space(A)| -element(B,powerset(powerset(the_carrier(A))))| -is_a_cover_of_carrier(A,B)| -open_subsets(B,A)|finite($f2(A,B)).
% 2.55/2.74 0 [] -top_str(A)|compact_top_space(A)|element($f3(A),powerset(powerset(the_carrier(A)))).
% 2.55/2.74 0 [] -top_str(A)|compact_top_space(A)|is_a_cover_of_carrier(A,$f3(A)).
% 2.55/2.74 0 [] -top_str(A)|compact_top_space(A)|open_subsets($f3(A),A).
% 2.55/2.74 0 [] -top_str(A)|compact_top_space(A)| -element(C,powerset(powerset(the_carrier(A))))| -subset(C,$f3(A))| -is_a_cover_of_carrier(A,C)| -finite(C).
% 2.55/2.74 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.55/2.74 0 [] subset(A,B)|in($f4(A,B),A).
% 2.55/2.74 0 [] subset(A,B)| -in($f4(A,B),B).
% 2.55/2.74 0 [] -one_sorted_str(A)| -element(B,powerset(powerset(the_carrier(A))))| -is_a_cover_of_carrier(A,B)|cast_as_carrier_subset(A)=union_of_subsets(the_carrier(A),B).
% 2.55/2.74 0 [] -one_sorted_str(A)| -element(B,powerset(powerset(the_carrier(A))))|is_a_cover_of_carrier(A,B)|cast_as_carrier_subset(A)!=union_of_subsets(the_carrier(A),B).
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C!=complements_of_subsets(A,B)| -element(D,powerset(A))| -in(D,C)|in(subset_complement(A,D),B).
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C!=complements_of_subsets(A,B)| -element(D,powerset(A))|in(D,C)| -in(subset_complement(A,D),B).
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C=complements_of_subsets(A,B)|element($f5(A,B,C),powerset(A)).
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C=complements_of_subsets(A,B)|in($f5(A,B,C),C)|in(subset_complement(A,$f5(A,B,C)),B).
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C=complements_of_subsets(A,B)| -in($f5(A,B,C),C)| -in(subset_complement(A,$f5(A,B,C)),B).
% 2.55/2.74 0 [] $T.
% 2.55/2.74 0 [] $T.
% 2.55/2.74 0 [] $T.
% 2.55/2.74 0 [] -one_sorted_str(A)|element(cast_as_carrier_subset(A),powerset(the_carrier(A))).
% 2.55/2.74 0 [] -element(B,powerset(A))|element(subset_complement(A,B),powerset(A)).
% 2.55/2.74 0 [] $T.
% 2.55/2.74 0 [] $T.
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))|element(union_of_subsets(A,B),powerset(A)).
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))|element(meet_of_subsets(A,B),powerset(A)).
% 2.55/2.74 0 [] -element(B,powerset(A))| -element(C,powerset(A))|element(subset_difference(A,B,C),powerset(A)).
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))|element(complements_of_subsets(A,B),powerset(powerset(A))).
% 2.55/2.74 0 [] -top_str(A)|one_sorted_str(A).
% 2.55/2.74 0 [] $T.
% 2.55/2.74 0 [] $T.
% 2.55/2.74 0 [] $T.
% 2.55/2.74 0 [] top_str($c1).
% 2.55/2.74 0 [] one_sorted_str($c2).
% 2.55/2.74 0 [] element($f6(A),A).
% 2.55/2.74 0 [] -finite(A)|finite(set_difference(A,B)).
% 2.55/2.74 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 2.55/2.74 0 [] -empty(powerset(A)).
% 2.55/2.74 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty(cast_as_carrier_subset(A)).
% 2.55/2.74 0 [] -v1_membered(A)|v1_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -v2_membered(A)|v1_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -v2_membered(A)|v2_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -v3_membered(A)|v1_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -v3_membered(A)|v2_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -v3_membered(A)|v3_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -v4_membered(A)|v1_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -v4_membered(A)|v2_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -v4_membered(A)|v3_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -v4_membered(A)|v4_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -v5_membered(A)|v1_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -v5_membered(A)|v2_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -v5_membered(A)|v3_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -v5_membered(A)|v4_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -v5_membered(A)|v5_membered(set_difference(A,B)).
% 2.55/2.74 0 [] -topological_space(A)| -top_str(A)|closed_subset(cast_as_carrier_subset(A),A).
% 2.55/2.74 0 [] empty(empty_set).
% 2.55/2.74 0 [] v1_membered(empty_set).
% 2.55/2.74 0 [] v2_membered(empty_set).
% 2.55/2.74 0 [] v3_membered(empty_set).
% 2.55/2.74 0 [] v4_membered(empty_set).
% 2.55/2.74 0 [] v5_membered(empty_set).
% 2.55/2.74 0 [] -element(B,powerset(A))|subset_complement(A,subset_complement(A,B))=B.
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))|complements_of_subsets(A,complements_of_subsets(A,B))=B.
% 2.55/2.74 0 [] -empty($c3).
% 2.55/2.74 0 [] finite($c3).
% 2.55/2.74 0 [] -empty($c4).
% 2.55/2.74 0 [] v1_membered($c4).
% 2.55/2.74 0 [] v2_membered($c4).
% 2.55/2.74 0 [] v3_membered($c4).
% 2.55/2.74 0 [] v4_membered($c4).
% 2.55/2.74 0 [] v5_membered($c4).
% 2.55/2.74 0 [] empty(A)|element($f7(A),powerset(A)).
% 2.55/2.74 0 [] empty(A)| -empty($f7(A)).
% 2.55/2.74 0 [] element($f8(A),powerset(A)).
% 2.55/2.74 0 [] empty($f8(A)).
% 2.55/2.74 0 [] empty(A)|element($f9(A),powerset(A)).
% 2.55/2.74 0 [] empty(A)| -empty($f9(A)).
% 2.55/2.74 0 [] empty(A)|finite($f9(A)).
% 2.55/2.74 0 [] one_sorted_str($c5).
% 2.55/2.74 0 [] -empty_carrier($c5).
% 2.55/2.74 0 [] empty(A)|element($f10(A),powerset(A)).
% 2.55/2.74 0 [] empty(A)| -empty($f10(A)).
% 2.55/2.74 0 [] empty(A)|finite($f10(A)).
% 2.55/2.74 0 [] empty_carrier(A)| -one_sorted_str(A)|element($f11(A),powerset(the_carrier(A))).
% 2.55/2.74 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f11(A)).
% 2.55/2.74 0 [] -topological_space(A)| -top_str(A)|element($f12(A),powerset(the_carrier(A))).
% 2.55/2.74 0 [] -topological_space(A)| -top_str(A)|closed_subset($f12(A),A).
% 2.55/2.74 0 [] empty_carrier(A)| -topological_space(A)| -top_str(A)|element($f13(A),powerset(the_carrier(A))).
% 2.55/2.74 0 [] empty_carrier(A)| -topological_space(A)| -top_str(A)| -empty($f13(A)).
% 2.55/2.74 0 [] empty_carrier(A)| -topological_space(A)| -top_str(A)|closed_subset($f13(A),A).
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))|union_of_subsets(A,B)=union(B).
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))|meet_of_subsets(A,B)=set_meet(B).
% 2.55/2.74 0 [] -element(B,powerset(A))| -element(C,powerset(A))|subset_difference(A,B,C)=set_difference(B,C).
% 2.55/2.74 0 [] subset(A,A).
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))|B=empty_set|complements_of_subsets(A,B)!=empty_set.
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))|complements_of_subsets(A,B)=empty_set|B!=empty_set.
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))|B=empty_set|meet_of_subsets(A,complements_of_subsets(A,B))=subset_complement(A,union_of_subsets(A,B)).
% 2.55/2.74 0 [] -element(B,powerset(powerset(A)))|B=empty_set|union_of_subsets(A,complements_of_subsets(A,B))=subset_complement(A,meet_of_subsets(A,B)).
% 2.55/2.74 0 [] -empty_carrier($c7).
% 2.55/2.74 0 [] topological_space($c7).
% 2.55/2.74 0 [] top_str($c7).
% 2.55/2.74 0 [] compact_top_space($c7)| -element(B,powerset(powerset(the_carrier($c7))))| -centered(B)| -closed_subsets(B,$c7)|meet_of_subsets(the_carrier($c7),B)!=empty_set.
% 2.55/2.74 0 [] -compact_top_space($c7)|element($c6,powerset(powerset(the_carrier($c7)))).
% 2.55/2.74 0 [] -compact_top_space($c7)|centered($c6).
% 2.55/2.74 0 [] -compact_top_space($c7)|closed_subsets($c6,$c7).
% 2.55/2.74 0 [] -compact_top_space($c7)|meet_of_subsets(the_carrier($c7),$c6)=empty_set.
% 2.55/2.74 0 [] -one_sorted_str(A)| -element(B,powerset(powerset(the_carrier(A))))| -finite(complements_of_subsets(the_carrier(A),B))|finite(B).
% 2.55/2.74 0 [] -one_sorted_str(A)| -element(B,powerset(powerset(the_carrier(A))))|finite(complements_of_subsets(the_carrier(A),B))| -finite(B).
% 2.55/2.74 0 [] -top_str(A)| -element(B,powerset(powerset(the_carrier(A))))| -closed_subsets(B,A)|open_subsets(complements_of_subsets(the_carrier(A),B),A).
% 2.55/2.74 0 [] -top_str(A)| -element(B,powerset(powerset(the_carrier(A))))|closed_subsets(B,A)| -open_subsets(complements_of_subsets(the_carrier(A),B),A).
% 2.55/2.74 0 [] -one_sorted_str(A)| -element(B,powerset(the_carrier(A)))|subset_complement(the_carrier(A),B)=subset_difference(the_carrier(A),cast_as_carrier_subset(A),B).
% 2.55/2.74 0 [] -top_str(A)| -element(B,powerset(powerset(the_carrier(A))))| -open_subsets(B,A)|closed_subsets(complements_of_subsets(the_carrier(A),B),A).
% 2.55/2.74 0 [] -top_str(A)| -element(B,powerset(powerset(the_carrier(A))))|open_subsets(B,A)| -closed_subsets(complements_of_subsets(the_carrier(A),B),A).
% 2.55/2.74 0 [] -in(A,B)|element(A,B).
% 2.55/2.74 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.55/2.74 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.55/2.74 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.55/2.74 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.55/2.74 0 [] set_difference(A,empty_set)=A.
% 2.55/2.74 0 [] -element(A,powerset(B))|subset(A,B).
% 2.55/2.74 0 [] element(A,powerset(B))| -subset(A,B).
% 2.55/2.74 0 [] set_difference(empty_set,A)=empty_set.
% 2.55/2.74 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.55/2.74 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.55/2.74 0 [] empty_carrier(A)| -one_sorted_str(A)| -element(B,powerset(powerset(the_carrier(A))))| -is_a_cover_of_carrier(A,B)|B!=empty_set.
% 2.55/2.74 0 [] -empty(A)|A=empty_set.
% 2.55/2.74 0 [] -in(A,B)| -empty(B).
% 2.55/2.74 0 [] -empty(A)|A=B| -empty(B).
% 2.55/2.74 end_of_list.
% 2.55/2.74
% 2.55/2.74 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 2.55/2.74
% 2.55/2.74 This ia a non-Horn set with equality. The strategy will be
% 2.55/2.74 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.55/2.74 deletion, with positive clauses in sos and nonpositive
% 2.55/2.74 clauses in usable.
% 2.55/2.74
% 2.55/2.74 dependent: set(knuth_bendix).
% 2.55/2.74 dependent: set(anl_eq).
% 2.55/2.74 dependent: set(para_from).
% 2.55/2.74 dependent: set(para_into).
% 2.55/2.74 dependent: clear(para_from_right).
% 2.55/2.74 dependent: clear(para_into_right).
% 2.55/2.74 dependent: set(para_from_vars).
% 2.55/2.74 dependent: set(eq_units_both_ways).
% 2.55/2.74 dependent: set(dynamic_demod_all).
% 2.55/2.74 dependent: set(dynamic_demod).
% 2.55/2.74 dependent: set(order_eq).
% 2.55/2.74 dependent: set(back_demod).
% 2.55/2.74 dependent: set(lrpo).
% 2.55/2.74 dependent: set(hyper_res).
% 2.55/2.74 dependent: set(unit_deletion).
% 2.55/2.74 dependent: set(factor).
% 2.55/2.74
% 2.55/2.74 ------------> process usable:
% 2.55/2.74 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.55/2.74 ** KEPT (pick-wt=7): 2 [] -v1_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 3 [] -v2_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 4 [] -v2_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 5 [] -v3_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 6 [] -v3_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 7 [] -v3_membered(A)| -element(B,A)|v1_rat_1(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 8 [] -v4_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 9 [] -v4_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 10 [] -v4_membered(A)| -element(B,A)|v1_int_1(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 11 [] -v4_membered(A)| -element(B,A)|v1_rat_1(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 12 [] -v5_membered(A)| -element(B,A)|v1_xcmplx_0(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 13 [] -v5_membered(A)| -element(B,A)|natural(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 14 [] -v5_membered(A)| -element(B,A)|v1_xreal_0(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 15 [] -v5_membered(A)| -element(B,A)|v1_int_1(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 16 [] -v5_membered(A)| -element(B,A)|v1_rat_1(B).
% 2.55/2.74 ** KEPT (pick-wt=4): 17 [] -empty(A)|v1_membered(A).
% 2.55/2.74 ** KEPT (pick-wt=4): 18 [] -empty(A)|v2_membered(A).
% 2.55/2.74 ** KEPT (pick-wt=4): 19 [] -empty(A)|v3_membered(A).
% 2.55/2.74 ** KEPT (pick-wt=4): 20 [] -empty(A)|v4_membered(A).
% 2.55/2.74 ** KEPT (pick-wt=4): 21 [] -empty(A)|v5_membered(A).
% 2.55/2.74 ** KEPT (pick-wt=8): 22 [] -v1_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=8): 23 [] -v2_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=8): 24 [] -v2_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=8): 25 [] -v3_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=8): 26 [] -v3_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=8): 27 [] -v3_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=8): 28 [] -v4_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=8): 29 [] -v4_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=8): 30 [] -v4_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=8): 31 [] -v4_membered(A)| -element(B,powerset(A))|v4_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=4): 32 [] -empty(A)|finite(A).
% 2.55/2.74 ** KEPT (pick-wt=4): 33 [] -v5_membered(A)|v4_membered(A).
% 2.55/2.74 ** KEPT (pick-wt=8): 34 [] -v5_membered(A)| -element(B,powerset(A))|v1_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=8): 35 [] -v5_membered(A)| -element(B,powerset(A))|v2_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=8): 36 [] -v5_membered(A)| -element(B,powerset(A))|v3_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=8): 37 [] -v5_membered(A)| -element(B,powerset(A))|v4_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=8): 38 [] -v5_membered(A)| -element(B,powerset(A))|v5_membered(B).
% 2.55/2.74 ** KEPT (pick-wt=8): 39 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 2.55/2.74 ** KEPT (pick-wt=4): 40 [] -v4_membered(A)|v3_membered(A).
% 2.55/2.74 ** KEPT (pick-wt=4): 41 [] -v3_membered(A)|v2_membered(A).
% 2.55/2.74 ** KEPT (pick-wt=4): 42 [] -v2_membered(A)|v1_membered(A).
% 2.55/2.74 ** KEPT (pick-wt=5): 43 [] -centered(A)|A!=empty_set.
% 2.55/2.74 ** KEPT (pick-wt=14): 44 [] -centered(A)|B=empty_set| -subset(B,A)| -finite(B)|set_meet(B)!=empty_set.
% 2.55/2.74 ** KEPT (pick-wt=9): 45 [] centered(A)|A=empty_set|$f1(A)!=empty_set.
% 2.55/2.74 ** KEPT (pick-wt=24): 46 [] -top_str(A)| -compact_top_space(A)| -element(B,powerset(powerset(the_carrier(A))))| -is_a_cover_of_carrier(A,B)| -open_subsets(B,A)|element($f2(A,B),powerset(powerset(the_carrier(A)))).
% 2.55/2.74 ** KEPT (pick-wt=21): 47 [] -top_str(A)| -compact_top_space(A)| -element(B,powerset(powerset(the_carrier(A))))| -is_a_cover_of_carrier(A,B)| -open_subsets(B,A)|subset($f2(A,B),B).
% 2.55/2.74 ** KEPT (pick-wt=21): 48 [] -top_str(A)| -compact_top_space(A)| -element(B,powerset(powerset(the_carrier(A))))| -is_a_cover_of_carrier(A,B)| -open_subsets(B,A)|is_a_cover_of_carrier(A,$f2(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=20): 49 [] -top_str(A)| -compact_top_space(A)| -element(B,powerset(powerset(the_carrier(A))))| -is_a_cover_of_carrier(A,B)| -open_subsets(B,A)|finite($f2(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=11): 50 [] -top_str(A)|compact_top_space(A)|element($f3(A),powerset(powerset(the_carrier(A)))).
% 2.55/2.74 ** KEPT (pick-wt=8): 51 [] -top_str(A)|compact_top_space(A)|is_a_cover_of_carrier(A,$f3(A)).
% 2.55/2.74 ** KEPT (pick-wt=8): 52 [] -top_str(A)|compact_top_space(A)|open_subsets($f3(A),A).
% 2.55/2.74 ** KEPT (pick-wt=19): 53 [] -top_str(A)|compact_top_space(A)| -element(B,powerset(powerset(the_carrier(A))))| -subset(B,$f3(A))| -is_a_cover_of_carrier(A,B)| -finite(B).
% 2.55/2.74 ** KEPT (pick-wt=9): 54 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.55/2.74 ** KEPT (pick-wt=8): 55 [] subset(A,B)| -in($f4(A,B),B).
% 2.55/2.74 ** KEPT (pick-wt=18): 57 [copy,56,flip.4] -one_sorted_str(A)| -element(B,powerset(powerset(the_carrier(A))))| -is_a_cover_of_carrier(A,B)|union_of_subsets(the_carrier(A),B)=cast_as_carrier_subset(A).
% 2.55/2.74 ** KEPT (pick-wt=18): 59 [copy,58,flip.4] -one_sorted_str(A)| -element(B,powerset(powerset(the_carrier(A))))|is_a_cover_of_carrier(A,B)|union_of_subsets(the_carrier(A),B)!=cast_as_carrier_subset(A).
% 2.55/2.74 ** KEPT (pick-wt=27): 60 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C!=complements_of_subsets(B,A)| -element(D,powerset(B))| -in(D,C)|in(subset_complement(B,D),A).
% 2.55/2.74 ** KEPT (pick-wt=27): 61 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C!=complements_of_subsets(B,A)| -element(D,powerset(B))|in(D,C)| -in(subset_complement(B,D),A).
% 2.55/2.74 ** KEPT (pick-wt=22): 62 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C=complements_of_subsets(B,A)|element($f5(B,A,C),powerset(B)).
% 2.55/2.74 ** KEPT (pick-wt=29): 63 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C=complements_of_subsets(B,A)|in($f5(B,A,C),C)|in(subset_complement(B,$f5(B,A,C)),A).
% 2.55/2.74 ** KEPT (pick-wt=29): 64 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C=complements_of_subsets(B,A)| -in($f5(B,A,C),C)| -in(subset_complement(B,$f5(B,A,C)),A).
% 2.55/2.74 ** KEPT (pick-wt=8): 65 [] -one_sorted_str(A)|element(cast_as_carrier_subset(A),powerset(the_carrier(A))).
% 2.55/2.74 ** KEPT (pick-wt=10): 66 [] -element(A,powerset(B))|element(subset_complement(B,A),powerset(B)).
% 2.55/2.74 ** KEPT (pick-wt=11): 67 [] -element(A,powerset(powerset(B)))|element(union_of_subsets(B,A),powerset(B)).
% 2.55/2.74 ** KEPT (pick-wt=11): 68 [] -element(A,powerset(powerset(B)))|element(meet_of_subsets(B,A),powerset(B)).
% 2.55/2.74 ** KEPT (pick-wt=15): 69 [] -element(A,powerset(B))| -element(C,powerset(B))|element(subset_difference(B,A,C),powerset(B)).
% 2.55/2.74 ** KEPT (pick-wt=12): 70 [] -element(A,powerset(powerset(B)))|element(complements_of_subsets(B,A),powerset(powerset(B))).
% 2.55/2.74 ** KEPT (pick-wt=4): 71 [] -top_str(A)|one_sorted_str(A).
% 2.55/2.74 ** KEPT (pick-wt=6): 72 [] -finite(A)|finite(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=7): 73 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 2.55/2.74 ** KEPT (pick-wt=3): 74 [] -empty(powerset(A)).
% 2.55/2.74 ** KEPT (pick-wt=7): 75 [] empty_carrier(A)| -one_sorted_str(A)| -empty(cast_as_carrier_subset(A)).
% 2.55/2.74 ** KEPT (pick-wt=6): 76 [] -v1_membered(A)|v1_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=6): 77 [] -v2_membered(A)|v1_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=6): 78 [] -v2_membered(A)|v2_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=6): 79 [] -v3_membered(A)|v1_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=6): 80 [] -v3_membered(A)|v2_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=6): 81 [] -v3_membered(A)|v3_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=6): 82 [] -v4_membered(A)|v1_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=6): 83 [] -v4_membered(A)|v2_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=6): 84 [] -v4_membered(A)|v3_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=6): 85 [] -v4_membered(A)|v4_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=6): 86 [] -v5_membered(A)|v1_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=6): 87 [] -v5_membered(A)|v2_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=6): 88 [] -v5_membered(A)|v3_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=6): 89 [] -v5_membered(A)|v4_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=6): 90 [] -v5_membered(A)|v5_membered(set_difference(A,B)).
% 2.55/2.74 ** KEPT (pick-wt=8): 91 [] -topological_space(A)| -top_str(A)|closed_subset(cast_as_carrier_subset(A),A).
% 2.55/2.74 ** KEPT (pick-wt=11): 92 [] -element(A,powerset(B))|subset_complement(B,subset_complement(B,A))=A.
% 2.55/2.74 ** KEPT (pick-wt=12): 93 [] -element(A,powerset(powerset(B)))|complements_of_subsets(B,complements_of_subsets(B,A))=A.
% 2.55/2.74 ** KEPT (pick-wt=2): 94 [] -empty($c3).
% 2.55/2.74 ** KEPT (pick-wt=2): 95 [] -empty($c4).
% 2.55/2.74 ** KEPT (pick-wt=5): 96 [] empty(A)| -empty($f7(A)).
% 2.55/2.74 ** KEPT (pick-wt=5): 97 [] empty(A)| -empty($f9(A)).
% 2.55/2.74 ** KEPT (pick-wt=2): 98 [] -empty_carrier($c5).
% 2.55/2.74 ** KEPT (pick-wt=5): 99 [] empty(A)| -empty($f10(A)).
% 2.55/2.74 ** KEPT (pick-wt=10): 100 [] empty_carrier(A)| -one_sorted_str(A)|element($f11(A),powerset(the_carrier(A))).
% 2.55/2.74 ** KEPT (pick-wt=7): 101 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f11(A)).
% 2.55/2.74 ** KEPT (pick-wt=10): 102 [] -topological_space(A)| -top_str(A)|element($f12(A),powerset(the_carrier(A))).
% 2.55/2.74 ** KEPT (pick-wt=8): 103 [] -topological_space(A)| -top_str(A)|closed_subset($f12(A),A).
% 2.55/2.74 ** KEPT (pick-wt=12): 104 [] empty_carrier(A)| -topological_space(A)| -top_str(A)|element($f13(A),powerset(the_carrier(A))).
% 2.55/2.74 ** KEPT (pick-wt=9): 105 [] empty_carrier(A)| -topological_space(A)| -top_str(A)| -empty($f13(A)).
% 2.55/2.74 ** KEPT (pick-wt=10): 106 [] empty_carrier(A)| -topological_space(A)| -top_str(A)|closed_subset($f13(A),A).
% 2.55/2.74 ** KEPT (pick-wt=11): 107 [] -element(A,powerset(powerset(B)))|union_of_subsets(B,A)=union(A).
% 2.55/2.74 ** KEPT (pick-wt=11): 108 [] -element(A,powerset(powerset(B)))|meet_of_subsets(B,A)=set_meet(A).
% 2.55/2.74 ** KEPT (pick-wt=16): 109 [] -element(A,powerset(B))| -element(C,powerset(B))|subset_difference(B,A,C)=set_difference(A,C).
% 2.55/2.74 ** KEPT (pick-wt=13): 110 [] -element(A,powerset(powerset(B)))|A=empty_set|complements_of_subsets(B,A)!=empty_set.
% 2.55/2.74 ** KEPT (pick-wt=13): 111 [] -element(A,powerset(powerset(B)))|complements_of_subsets(B,A)=empty_set|A!=empty_set.
% 2.55/2.74 ** KEPT (pick-wt=19): 113 [copy,112,flip.3] -element(A,powerset(powerset(B)))|A=empty_set|subset_complement(B,union_of_subsets(B,A))=meet_of_subsets(B,complements_of_subsets(B,A)).
% 2.55/2.74 ** KEPT (pick-wt=19): 114 [] -element(A,powerset(powerset(B)))|A=empty_set|union_of_subsets(B,complements_of_subsets(B,A))=subset_complement(B,meet_of_subsets(B,A)).
% 2.55/2.74 ** KEPT (pick-wt=2): 115 [] -empty_carrier($c7).
% 2.55/2.74 ** KEPT (pick-wt=19): 116 [] compact_top_space($c7)| -element(A,powerset(powerset(the_carrier($c7))))| -centered(A)| -closed_subsets(A,$c7)|meet_of_subsets(the_carrier($c7),A)!=empty_set.
% 2.55/2.74 ** KEPT (pick-wt=8): 117 [] -compact_top_space($c7)|element($c6,powerset(powerset(the_carrier($c7)))).
% 2.55/2.74 ** KEPT (pick-wt=4): 118 [] -compact_top_space($c7)|centered($c6).
% 2.55/2.74 ** KEPT (pick-wt=5): 119 [] -compact_top_space($c7)|closed_subsets($c6,$c7).
% 2.55/2.74 ** KEPT (pick-wt=8): 120 [] -compact_top_space($c7)|meet_of_subsets(the_carrier($c7),$c6)=empty_set.
% 2.55/2.74 ** KEPT (pick-wt=15): 121 [] -one_sorted_str(A)| -element(B,powerset(powerset(the_carrier(A))))| -finite(complements_of_subsets(the_carrier(A),B))|finite(B).
% 2.55/2.74 ** KEPT (pick-wt=15): 122 [] -one_sorted_str(A)| -element(B,powerset(powerset(the_carrier(A))))|finite(complements_of_subsets(the_carrier(A),B))| -finite(B).
% 2.55/2.74 ** KEPT (pick-wt=17): 123 [] -top_str(A)| -element(B,powerset(powerset(the_carrier(A))))| -closed_subsets(B,A)|open_subsets(complements_of_subsets(the_carrier(A),B),A).
% 2.55/2.74 ** KEPT (pick-wt=17): 124 [] -top_str(A)| -element(B,powerset(powerset(the_carrier(A))))|closed_subsets(B,A)| -open_subsets(complements_of_subsets(the_carrier(A),B),A).
% 2.55/2.74 ** KEPT (pick-wt=18): 125 [] -one_sorted_str(A)| -element(B,powerset(the_carrier(A)))|subset_complement(the_carrier(A),B)=subset_difference(the_carrier(A),cast_as_carrier_subset(A),B).
% 2.55/2.74 ** KEPT (pick-wt=17): 126 [] -top_str(A)| -element(B,powerset(powerset(the_carrier(A))))| -open_subsets(B,A)|closed_subsets(complements_of_subsets(the_carrier(A),B),A).
% 2.55/2.74 ** KEPT (pick-wt=17): 127 [] -top_str(A)| -element(B,powerset(powerset(the_carrier(A))))|open_subsets(B,A)| -closed_subsets(complements_of_subsets(the_carrier(A),B),A).
% 2.55/2.74 ** KEPT (pick-wt=6): 128 [] -in(A,B)|element(A,B).
% 2.55/2.74 ** KEPT (pick-wt=9): 129 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.55/2.74 ** KEPT (pick-wt=8): 130 [] -element(A,B)|empty(B)|in(A,B).
% 2.55/2.74 ** KEPT (pick-wt=8): 131 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.55/2.74 ** KEPT (pick-wt=8): 132 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.55/2.74 ** KEPT (pick-wt=7): 133 [] -element(A,powerset(B))|subset(A,B).
% 2.55/2.74 ** KEPT (pick-wt=7): 134 [] element(A,powerset(B))| -subset(A,B).
% 2.55/2.74 ** KEPT (pick-wt=10): 135 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.55/2.74 ** KEPT (pick-wt=9): 136 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.55/2.74 ** KEPT (pick-wt=16): 137 [] empty_carrier(A)| -one_sorted_str(A)| -element(B,powerset(powerset(the_carrier(A))))| -is_a_cover_of_carrier(A,B)|B!=empty_set.
% 2.55/2.74 ** KEPT (pick-wt=5): 138 [] -empty(A)|A=empty_set.
% 2.55/2.74 ** KEPT (pick-wt=5): 139 [] -in(A,B)| -empty(B).
% 2.55/2.74 ** KEPT (pick-wt=7): 140 [] -empty(A)|A=B| -empty(B).
% 2.55/2.74
% 2.55/2.74 ------------> process sos:
% 2.55/2.74 ** KEPT (pick-wt=3): 150 [] A=A.
% 2.55/2.74 ** KEPT (pick-wt=9): 151 [] centered(A)|A=empty_set|subset($f1(A),A).
% 12.30/12.47 ** KEPT (pick-wt=8): 152 [] centered(A)|A=empty_set|finite($f1(A)).
% 12.30/12.47 ** KEPT (pick-wt=10): 153 [] centered(A)|A=empty_set|set_meet($f1(A))=empty_set.
% 12.30/12.47 ** KEPT (pick-wt=8): 154 [] subset(A,B)|in($f4(A,B),A).
% 12.30/12.47 ** KEPT (pick-wt=2): 155 [] top_str($c1).
% 12.30/12.47 ** KEPT (pick-wt=2): 156 [] one_sorted_str($c2).
% 12.30/12.47 ** KEPT (pick-wt=4): 157 [] element($f6(A),A).
% 12.30/12.47 ** KEPT (pick-wt=2): 158 [] empty(empty_set).
% 12.30/12.47 ** KEPT (pick-wt=2): 159 [] v1_membered(empty_set).
% 12.30/12.47 ** KEPT (pick-wt=2): 160 [] v2_membered(empty_set).
% 12.30/12.47 ** KEPT (pick-wt=2): 161 [] v3_membered(empty_set).
% 12.30/12.47 ** KEPT (pick-wt=2): 162 [] v4_membered(empty_set).
% 12.30/12.47 ** KEPT (pick-wt=2): 163 [] v5_membered(empty_set).
% 12.30/12.47 ** KEPT (pick-wt=2): 164 [] finite($c3).
% 12.30/12.47 ** KEPT (pick-wt=2): 165 [] v1_membered($c4).
% 12.30/12.47 ** KEPT (pick-wt=2): 166 [] v2_membered($c4).
% 12.30/12.47 ** KEPT (pick-wt=2): 167 [] v3_membered($c4).
% 12.30/12.47 ** KEPT (pick-wt=2): 168 [] v4_membered($c4).
% 12.30/12.47 ** KEPT (pick-wt=2): 169 [] v5_membered($c4).
% 12.30/12.47 ** KEPT (pick-wt=7): 170 [] empty(A)|element($f7(A),powerset(A)).
% 12.30/12.47 ** KEPT (pick-wt=5): 171 [] element($f8(A),powerset(A)).
% 12.30/12.47 ** KEPT (pick-wt=3): 172 [] empty($f8(A)).
% 12.30/12.47 ** KEPT (pick-wt=7): 173 [] empty(A)|element($f9(A),powerset(A)).
% 12.30/12.47 ** KEPT (pick-wt=5): 174 [] empty(A)|finite($f9(A)).
% 12.30/12.47 ** KEPT (pick-wt=2): 175 [] one_sorted_str($c5).
% 12.30/12.47 ** KEPT (pick-wt=7): 176 [] empty(A)|element($f10(A),powerset(A)).
% 12.30/12.47 ** KEPT (pick-wt=5): 177 [] empty(A)|finite($f10(A)).
% 12.30/12.47 ** KEPT (pick-wt=3): 178 [] subset(A,A).
% 12.30/12.47 ** KEPT (pick-wt=2): 179 [] topological_space($c7).
% 12.30/12.47 ** KEPT (pick-wt=2): 180 [] top_str($c7).
% 12.30/12.47 ** KEPT (pick-wt=5): 181 [] set_difference(A,empty_set)=A.
% 12.30/12.47 ---> New Demodulator: 182 [new_demod,181] set_difference(A,empty_set)=A.
% 12.30/12.47 ** KEPT (pick-wt=5): 183 [] set_difference(empty_set,A)=empty_set.
% 12.30/12.47 ---> New Demodulator: 184 [new_demod,183] set_difference(empty_set,A)=empty_set.
% 12.30/12.47 Following clause subsumed by 150 during input processing: 0 [copy,150,flip.1] A=A.
% 12.30/12.47 150 back subsumes 149.
% 12.30/12.47 >>>> Starting back demodulation with 182.
% 12.30/12.47 >>>> Starting back demodulation with 184.
% 12.30/12.47
% 12.30/12.47 ======= end of input processing =======
% 12.30/12.47
% 12.30/12.47 =========== start of search ===========
% 12.30/12.47
% 12.30/12.47
% 12.30/12.47 Resetting weight limit to 6.
% 12.30/12.47
% 12.30/12.47
% 12.30/12.47 Resetting weight limit to 6.
% 12.30/12.47
% 12.30/12.47 sos_size=534
% 12.30/12.47
% 12.30/12.47
% 12.30/12.47 Resetting weight limit to 4.
% 12.30/12.47
% 12.30/12.47
% 12.30/12.47 Resetting weight limit to 4.
% 12.30/12.47
% 12.30/12.47 sos_size=541
% 12.30/12.47
% 12.30/12.47 Search stopped because sos empty.
% 12.30/12.47
% 12.30/12.47
% 12.30/12.47 Search stopped because sos empty.
% 12.30/12.47
% 12.30/12.47 ============ end of search ============
% 12.30/12.47
% 12.30/12.47 -------------- statistics -------------
% 12.30/12.47 clauses given 606
% 12.30/12.47 clauses generated 429494
% 12.30/12.47 clauses kept 1161
% 12.30/12.47 clauses forward subsumed 937
% 12.30/12.47 clauses back subsumed 405
% 12.30/12.47 Kbytes malloced 7812
% 12.30/12.47
% 12.30/12.47 ----------- times (seconds) -----------
% 12.30/12.47 user CPU time 9.74 (0 hr, 0 min, 9 sec)
% 12.30/12.47 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 12.30/12.47 wall-clock time 12 (0 hr, 0 min, 12 sec)
% 12.30/12.47
% 12.30/12.47 Process 20542 finished Wed Jul 27 07:57:05 2022
% 12.30/12.47 Otter interrupted
% 12.30/12.47 PROOF NOT FOUND
%------------------------------------------------------------------------------