TSTP Solution File: SEU179+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU179+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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:04 EDT 2022
% Result : Unknown 6.55s 6.69s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU179+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 08:01:15 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.50/2.67 ----- Otter 3.3f, August 2004 -----
% 2.50/2.67 The process was started by sandbox on n013.cluster.edu,
% 2.50/2.67 Wed Jul 27 08:01:15 2022
% 2.50/2.67 The command was "./otter". The process ID is 7252.
% 2.50/2.67
% 2.50/2.67 set(prolog_style_variables).
% 2.50/2.67 set(auto).
% 2.50/2.67 dependent: set(auto1).
% 2.50/2.67 dependent: set(process_input).
% 2.50/2.67 dependent: clear(print_kept).
% 2.50/2.67 dependent: clear(print_new_demod).
% 2.50/2.67 dependent: clear(print_back_demod).
% 2.50/2.67 dependent: clear(print_back_sub).
% 2.50/2.67 dependent: set(control_memory).
% 2.50/2.67 dependent: assign(max_mem, 12000).
% 2.50/2.67 dependent: assign(pick_given_ratio, 4).
% 2.50/2.67 dependent: assign(stats_level, 1).
% 2.50/2.67 dependent: assign(max_seconds, 10800).
% 2.50/2.67 clear(print_given).
% 2.50/2.67
% 2.50/2.67 formula_list(usable).
% 2.50/2.67 all A (A=A).
% 2.50/2.67 all A B (in(A,B)-> -in(B,A)).
% 2.50/2.67 all A B (proper_subset(A,B)-> -proper_subset(B,A)).
% 2.50/2.67 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.50/2.67 all A B (set_union2(A,B)=set_union2(B,A)).
% 2.50/2.67 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.50/2.67 all A B (A=B<->subset(A,B)&subset(B,A)).
% 2.50/2.67 all A (relation(A)<-> (all B (-(in(B,A)& (all C D (B!=ordered_pair(C,D))))))).
% 2.50/2.67 all A B ((A!=empty_set-> (B=set_meet(A)<-> (all C (in(C,B)<-> (all D (in(D,A)->in(C,D)))))))& (A=empty_set-> (B=set_meet(A)<->B=empty_set))).
% 2.50/2.67 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 2.50/2.67 all A (A=empty_set<-> (all B (-in(B,A)))).
% 2.50/2.67 all A B (B=powerset(A)<-> (all C (in(C,B)<->subset(C,A)))).
% 2.50/2.67 all A B ((-empty(A)-> (element(B,A)<->in(B,A)))& (empty(A)-> (element(B,A)<->empty(B)))).
% 2.50/2.67 all A B C (C=unordered_pair(A,B)<-> (all D (in(D,C)<->D=A|D=B))).
% 2.50/2.67 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 2.50/2.67 all A B C (C=cartesian_product2(A,B)<-> (all D (in(D,C)<-> (exists E F (in(E,A)&in(F,B)&D=ordered_pair(E,F)))))).
% 2.50/2.67 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 2.50/2.67 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 2.50/2.67 all A (relation(A)-> (all B (B=relation_dom(A)<-> (all C (in(C,B)<-> (exists D in(ordered_pair(C,D),A))))))).
% 2.50/2.67 all A (cast_to_subset(A)=A).
% 2.50/2.67 all A B (B=union(A)<-> (all C (in(C,B)<-> (exists D (in(C,D)&in(D,A)))))).
% 2.50/2.67 all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 2.50/2.67 all A (relation(A)-> (all B (B=relation_rng(A)<-> (all C (in(C,B)<-> (exists D in(ordered_pair(D,C),A))))))).
% 2.50/2.67 all A B (element(B,powerset(A))->subset_complement(A,B)=set_difference(A,B)).
% 2.50/2.67 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.50/2.67 all A B (disjoint(A,B)<->set_intersection2(A,B)=empty_set).
% 2.50/2.67 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.50/2.67 all A B (proper_subset(A,B)<->subset(A,B)&A!=B).
% 2.50/2.67 $T.
% 2.50/2.67 $T.
% 2.50/2.67 $T.
% 2.50/2.67 $T.
% 2.50/2.67 $T.
% 2.50/2.67 $T.
% 2.50/2.67 all A element(cast_to_subset(A),powerset(A)).
% 2.50/2.67 $T.
% 2.50/2.67 $T.
% 2.50/2.67 $T.
% 2.50/2.67 all A B (element(B,powerset(A))->element(subset_complement(A,B),powerset(A))).
% 2.50/2.67 $T.
% 2.50/2.67 $T.
% 2.50/2.67 $T.
% 2.50/2.67 $T.
% 2.50/2.67 all A B (element(B,powerset(powerset(A)))->element(union_of_subsets(A,B),powerset(A))).
% 2.50/2.67 all A B (element(B,powerset(powerset(A)))->element(meet_of_subsets(A,B),powerset(A))).
% 2.50/2.67 all A B C (element(B,powerset(A))&element(C,powerset(A))->element(subset_difference(A,B,C),powerset(A))).
% 2.50/2.67 all A B (element(B,powerset(powerset(A)))->element(complements_of_subsets(A,B),powerset(powerset(A)))).
% 2.50/2.67 $T.
% 2.50/2.67 all A exists B element(B,A).
% 2.50/2.67 all A (-empty(powerset(A))).
% 2.50/2.67 empty(empty_set).
% 2.50/2.67 all A B (-empty(ordered_pair(A,B))).
% 2.50/2.67 all A (-empty(singleton(A))).
% 2.50/2.67 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 2.50/2.67 all A B (-empty(unordered_pair(A,B))).
% 2.50/2.67 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 2.50/2.67 all A B (-empty(A)& -empty(B)-> -empty(cartesian_product2(A,B))).
% 2.50/2.67 all A B (set_union2(A,A)=A).
% 2.50/2.67 all A B (set_intersection2(A,A)=A).
% 2.50/2.67 all A B (element(B,powerset(A))->subset_complement(A,subset_complement(A,B))=B).
% 2.50/2.67 all A B (element(B,powerset(powerset(A)))->complements_of_subsets(A,complements_of_subsets(A,B))=B).
% 2.50/2.67 all A B (-proper_subset(A,A)).
% 2.50/2.67 all A (singleton(A)!=empty_set).
% 2.50/2.67 all A B (in(A,B)->set_union2(singleton(A),B)=B).
% 2.50/2.67 all A B (-(disjoint(singleton(A),B)&in(A,B))).
% 2.50/2.67 all A B (-in(A,B)->disjoint(singleton(A),B)).
% 2.50/2.67 all A B (subset(singleton(A),B)<->in(A,B)).
% 2.50/2.67 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 2.50/2.67 all A B (element(B,powerset(A))-> (all C (in(C,B)->in(C,A)))).
% 2.50/2.67 all A B C (subset(A,B)->in(C,A)|subset(A,set_difference(B,singleton(C)))).
% 2.50/2.67 all A B (subset(A,singleton(B))<->A=empty_set|A=singleton(B)).
% 2.50/2.67 all A B (in(A,B)->subset(A,union(B))).
% 2.50/2.67 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 2.50/2.67 all A B ((all C (in(C,A)->in(C,B)))->element(A,powerset(B))).
% 2.50/2.67 exists A (empty(A)&relation(A)).
% 2.50/2.67 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.50/2.67 exists A empty(A).
% 2.50/2.67 all A exists B (element(B,powerset(A))&empty(B)).
% 2.50/2.67 exists A (-empty(A)).
% 2.50/2.67 all A B (element(B,powerset(powerset(A)))->union_of_subsets(A,B)=union(B)).
% 2.50/2.67 all A B (element(B,powerset(powerset(A)))->meet_of_subsets(A,B)=set_meet(B)).
% 2.50/2.67 all A B C (element(B,powerset(A))&element(C,powerset(A))->subset_difference(A,B,C)=set_difference(B,C)).
% 2.50/2.67 all A B subset(A,A).
% 2.50/2.67 all A B (disjoint(A,B)->disjoint(B,A)).
% 2.50/2.67 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 2.50/2.67 all A B C D (-(unordered_pair(A,B)=unordered_pair(C,D)&A!=C&A!=D)).
% 2.50/2.67 all A B C (subset(A,B)->subset(cartesian_product2(A,C),cartesian_product2(B,C))&subset(cartesian_product2(C,A),cartesian_product2(C,B))).
% 2.50/2.67 all A B C D (subset(A,B)&subset(C,D)->subset(cartesian_product2(A,C),cartesian_product2(B,D))).
% 2.50/2.67 all A B (subset(A,B)->set_union2(A,B)=B).
% 2.50/2.67 all A exists B (in(A,B)& (all C D (in(C,B)&subset(D,C)->in(D,B)))& (all C (in(C,B)->in(powerset(C),B)))& (all C (-(subset(C,B)& -are_e_quipotent(C,B)& -in(C,B))))).
% 2.50/2.67 all A B subset(set_intersection2(A,B),A).
% 2.50/2.67 all A B C (subset(A,B)&subset(A,C)->subset(A,set_intersection2(B,C))).
% 2.50/2.67 all A (set_union2(A,empty_set)=A).
% 2.50/2.67 all A B (in(A,B)->element(A,B)).
% 2.50/2.67 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 2.50/2.67 powerset(empty_set)=singleton(empty_set).
% 2.50/2.67 all A B C (relation(C)-> (in(ordered_pair(A,B),C)->in(A,relation_dom(C))&in(B,relation_rng(C)))).
% 2.50/2.67 all A (relation(A)->subset(A,cartesian_product2(relation_dom(A),relation_rng(A)))).
% 2.50/2.67 -(all A (relation(A)-> (all B (relation(B)-> (subset(A,B)->subset(relation_dom(A),relation_dom(B))&subset(relation_rng(A),relation_rng(B))))))).
% 2.50/2.67 all A B C (subset(A,B)->subset(set_intersection2(A,C),set_intersection2(B,C))).
% 2.50/2.67 all A B (subset(A,B)->set_intersection2(A,B)=A).
% 2.50/2.67 all A (set_intersection2(A,empty_set)=empty_set).
% 2.50/2.67 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.50/2.67 all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 2.50/2.67 all A subset(empty_set,A).
% 2.50/2.67 all A B C (subset(A,B)->subset(set_difference(A,C),set_difference(B,C))).
% 2.50/2.67 all A B C D (ordered_pair(A,B)=ordered_pair(C,D)->A=C&B=D).
% 2.50/2.67 all A B subset(set_difference(A,B),A).
% 2.50/2.67 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 2.50/2.67 all A B (subset(singleton(A),B)<->in(A,B)).
% 2.50/2.67 all A B C (subset(unordered_pair(A,B),C)<->in(A,C)&in(B,C)).
% 2.50/2.67 all A B (set_union2(A,set_difference(B,A))=set_union2(A,B)).
% 2.50/2.67 all A B (subset(A,singleton(B))<->A=empty_set|A=singleton(B)).
% 2.50/2.67 all A (set_difference(A,empty_set)=A).
% 2.50/2.67 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.50/2.67 all A B (-(-disjoint(A,B)& (all C (-(in(C,A)&in(C,B)))))& -((exists C (in(C,A)&in(C,B)))&disjoint(A,B))).
% 2.50/2.67 all A (subset(A,empty_set)->A=empty_set).
% 2.50/2.67 all A B (set_difference(set_union2(A,B),B)=set_difference(A,B)).
% 2.50/2.67 all A B (element(B,powerset(A))-> (all C (element(C,powerset(A))-> (disjoint(B,C)<->subset(B,subset_complement(A,C)))))).
% 2.50/2.67 all A B (subset(A,B)->B=set_union2(A,set_difference(B,A))).
% 2.50/2.67 all A B (element(B,powerset(powerset(A)))-> -(B!=empty_set&complements_of_subsets(A,B)=empty_set)).
% 2.50/2.67 all A B (in(A,B)->set_union2(singleton(A),B)=B).
% 2.50/2.67 all A B (element(B,powerset(powerset(A)))-> (B!=empty_set->subset_difference(A,cast_to_subset(A),union_of_subsets(A,B))=meet_of_subsets(A,complements_of_subsets(A,B)))).
% 2.50/2.67 all A B (element(B,powerset(powerset(A)))-> (B!=empty_set->union_of_subsets(A,complements_of_subsets(A,B))=subset_difference(A,cast_to_subset(A),meet_of_subsets(A,B)))).
% 2.50/2.67 all A B (set_difference(A,set_difference(A,B))=set_intersection2(A,B)).
% 2.50/2.67 all A (set_difference(empty_set,A)=empty_set).
% 2.50/2.67 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.50/2.67 all A B (-(-disjoint(A,B)& (all C (-in(C,set_intersection2(A,B)))))& -((exists C in(C,set_intersection2(A,B)))&disjoint(A,B))).
% 2.50/2.67 all A (A!=empty_set-> (all B (element(B,powerset(A))-> (all C (element(C,A)-> (-in(C,B)->in(C,subset_complement(A,B)))))))).
% 2.50/2.67 all A B C (element(C,powerset(A))-> -(in(B,subset_complement(A,C))&in(B,C))).
% 2.50/2.67 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.50/2.67 all A B (-(subset(A,B)&proper_subset(B,A))).
% 2.50/2.67 all A B C (subset(A,B)&disjoint(B,C)->disjoint(A,C)).
% 2.50/2.67 all A B (set_difference(A,singleton(B))=A<-> -in(B,A)).
% 2.50/2.67 all A (unordered_pair(A,A)=singleton(A)).
% 2.50/2.67 all A (empty(A)->A=empty_set).
% 2.50/2.67 all A B (subset(singleton(A),singleton(B))->A=B).
% 2.50/2.67 all A B (-(in(A,B)&empty(B))).
% 2.50/2.67 all A B subset(A,set_union2(A,B)).
% 2.50/2.67 all A B (disjoint(A,B)<->set_difference(A,B)=A).
% 2.50/2.67 all A B (-(empty(A)&A!=B&empty(B))).
% 2.50/2.67 all A B C (subset(A,B)&subset(C,B)->subset(set_union2(A,C),B)).
% 2.50/2.67 all A B C (singleton(A)=unordered_pair(B,C)->A=B).
% 2.50/2.67 all A B (in(A,B)->subset(A,union(B))).
% 2.50/2.67 all A (union(powerset(A))=A).
% 2.50/2.67 all A exists B (in(A,B)& (all C D (in(C,B)&subset(D,C)->in(D,B)))& (all C (-(in(C,B)& (all D (-(in(D,B)& (all E (subset(E,C)->in(E,D)))))))))& (all C (-(subset(C,B)& -are_e_quipotent(C,B)& -in(C,B))))).
% 2.50/2.67 all A B C (singleton(A)=unordered_pair(B,C)->B=C).
% 2.50/2.67 end_of_list.
% 2.50/2.67
% 2.50/2.67 -------> usable clausifies to:
% 2.50/2.67
% 2.50/2.67 list(usable).
% 2.50/2.67 0 [] A=A.
% 2.50/2.67 0 [] -in(A,B)| -in(B,A).
% 2.50/2.67 0 [] -proper_subset(A,B)| -proper_subset(B,A).
% 2.50/2.67 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.50/2.67 0 [] set_union2(A,B)=set_union2(B,A).
% 2.50/2.67 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.50/2.67 0 [] A!=B|subset(A,B).
% 2.50/2.67 0 [] A!=B|subset(B,A).
% 2.50/2.67 0 [] A=B| -subset(A,B)| -subset(B,A).
% 2.50/2.67 0 [] -relation(A)| -in(B,A)|B=ordered_pair($f2(A,B),$f1(A,B)).
% 2.50/2.67 0 [] relation(A)|in($f3(A),A).
% 2.50/2.67 0 [] relation(A)|$f3(A)!=ordered_pair(C,D).
% 2.50/2.67 0 [] A=empty_set|B!=set_meet(A)| -in(C,B)| -in(D,A)|in(C,D).
% 2.50/2.67 0 [] A=empty_set|B!=set_meet(A)|in(C,B)|in($f4(A,B,C),A).
% 2.50/2.67 0 [] A=empty_set|B!=set_meet(A)|in(C,B)| -in(C,$f4(A,B,C)).
% 2.50/2.67 0 [] A=empty_set|B=set_meet(A)|in($f6(A,B),B)| -in(X1,A)|in($f6(A,B),X1).
% 2.50/2.67 0 [] A=empty_set|B=set_meet(A)| -in($f6(A,B),B)|in($f5(A,B),A).
% 2.50/2.67 0 [] A=empty_set|B=set_meet(A)| -in($f6(A,B),B)| -in($f6(A,B),$f5(A,B)).
% 2.50/2.67 0 [] A!=empty_set|B!=set_meet(A)|B=empty_set.
% 2.50/2.67 0 [] A!=empty_set|B=set_meet(A)|B!=empty_set.
% 2.50/2.67 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 2.50/2.67 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 2.50/2.67 0 [] B=singleton(A)|in($f7(A,B),B)|$f7(A,B)=A.
% 2.50/2.67 0 [] B=singleton(A)| -in($f7(A,B),B)|$f7(A,B)!=A.
% 2.50/2.67 0 [] A!=empty_set| -in(B,A).
% 2.50/2.67 0 [] A=empty_set|in($f8(A),A).
% 2.50/2.67 0 [] B!=powerset(A)| -in(C,B)|subset(C,A).
% 2.50/2.67 0 [] B!=powerset(A)|in(C,B)| -subset(C,A).
% 2.50/2.67 0 [] B=powerset(A)|in($f9(A,B),B)|subset($f9(A,B),A).
% 2.50/2.67 0 [] B=powerset(A)| -in($f9(A,B),B)| -subset($f9(A,B),A).
% 2.50/2.67 0 [] empty(A)| -element(B,A)|in(B,A).
% 2.50/2.67 0 [] empty(A)|element(B,A)| -in(B,A).
% 2.50/2.67 0 [] -empty(A)| -element(B,A)|empty(B).
% 2.50/2.67 0 [] -empty(A)|element(B,A)| -empty(B).
% 2.50/2.67 0 [] C!=unordered_pair(A,B)| -in(D,C)|D=A|D=B.
% 2.50/2.67 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=A.
% 2.50/2.67 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=B.
% 2.50/2.67 0 [] C=unordered_pair(A,B)|in($f10(A,B,C),C)|$f10(A,B,C)=A|$f10(A,B,C)=B.
% 2.50/2.67 0 [] C=unordered_pair(A,B)| -in($f10(A,B,C),C)|$f10(A,B,C)!=A.
% 2.50/2.67 0 [] C=unordered_pair(A,B)| -in($f10(A,B,C),C)|$f10(A,B,C)!=B.
% 2.50/2.67 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 2.50/2.67 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 2.50/2.67 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 2.50/2.67 0 [] C=set_union2(A,B)|in($f11(A,B,C),C)|in($f11(A,B,C),A)|in($f11(A,B,C),B).
% 2.50/2.67 0 [] C=set_union2(A,B)| -in($f11(A,B,C),C)| -in($f11(A,B,C),A).
% 2.50/2.67 0 [] C=set_union2(A,B)| -in($f11(A,B,C),C)| -in($f11(A,B,C),B).
% 2.50/2.67 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f13(A,B,C,D),A).
% 2.50/2.67 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f12(A,B,C,D),B).
% 2.50/2.67 0 [] C!=cartesian_product2(A,B)| -in(D,C)|D=ordered_pair($f13(A,B,C,D),$f12(A,B,C,D)).
% 2.50/2.67 0 [] C!=cartesian_product2(A,B)|in(D,C)| -in(E,A)| -in(F,B)|D!=ordered_pair(E,F).
% 2.50/2.67 0 [] C=cartesian_product2(A,B)|in($f16(A,B,C),C)|in($f15(A,B,C),A).
% 2.50/2.67 0 [] C=cartesian_product2(A,B)|in($f16(A,B,C),C)|in($f14(A,B,C),B).
% 2.50/2.67 0 [] C=cartesian_product2(A,B)|in($f16(A,B,C),C)|$f16(A,B,C)=ordered_pair($f15(A,B,C),$f14(A,B,C)).
% 2.50/2.67 0 [] C=cartesian_product2(A,B)| -in($f16(A,B,C),C)| -in(X2,A)| -in(X3,B)|$f16(A,B,C)!=ordered_pair(X2,X3).
% 2.50/2.67 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.50/2.67 0 [] subset(A,B)|in($f17(A,B),A).
% 2.50/2.67 0 [] subset(A,B)| -in($f17(A,B),B).
% 2.50/2.67 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 2.50/2.67 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 2.50/2.67 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 2.50/2.67 0 [] C=set_intersection2(A,B)|in($f18(A,B,C),C)|in($f18(A,B,C),A).
% 2.50/2.67 0 [] C=set_intersection2(A,B)|in($f18(A,B,C),C)|in($f18(A,B,C),B).
% 2.50/2.67 0 [] C=set_intersection2(A,B)| -in($f18(A,B,C),C)| -in($f18(A,B,C),A)| -in($f18(A,B,C),B).
% 2.50/2.67 0 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f19(A,B,C)),A).
% 2.50/2.67 0 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 2.50/2.67 0 [] -relation(A)|B=relation_dom(A)|in($f21(A,B),B)|in(ordered_pair($f21(A,B),$f20(A,B)),A).
% 2.50/2.67 0 [] -relation(A)|B=relation_dom(A)| -in($f21(A,B),B)| -in(ordered_pair($f21(A,B),X4),A).
% 2.50/2.67 0 [] cast_to_subset(A)=A.
% 2.50/2.67 0 [] B!=union(A)| -in(C,B)|in(C,$f22(A,B,C)).
% 2.50/2.67 0 [] B!=union(A)| -in(C,B)|in($f22(A,B,C),A).
% 2.50/2.67 0 [] B!=union(A)|in(C,B)| -in(C,D)| -in(D,A).
% 2.50/2.67 0 [] B=union(A)|in($f24(A,B),B)|in($f24(A,B),$f23(A,B)).
% 2.50/2.67 0 [] B=union(A)|in($f24(A,B),B)|in($f23(A,B),A).
% 2.50/2.67 0 [] B=union(A)| -in($f24(A,B),B)| -in($f24(A,B),X5)| -in(X5,A).
% 2.50/2.67 0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 2.50/2.67 0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 2.50/2.67 0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 2.50/2.67 0 [] C=set_difference(A,B)|in($f25(A,B,C),C)|in($f25(A,B,C),A).
% 2.50/2.67 0 [] C=set_difference(A,B)|in($f25(A,B,C),C)| -in($f25(A,B,C),B).
% 2.50/2.67 0 [] C=set_difference(A,B)| -in($f25(A,B,C),C)| -in($f25(A,B,C),A)|in($f25(A,B,C),B).
% 2.50/2.67 0 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f26(A,B,C),C),A).
% 2.50/2.67 0 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 2.50/2.67 0 [] -relation(A)|B=relation_rng(A)|in($f28(A,B),B)|in(ordered_pair($f27(A,B),$f28(A,B)),A).
% 2.50/2.67 0 [] -relation(A)|B=relation_rng(A)| -in($f28(A,B),B)| -in(ordered_pair(X6,$f28(A,B)),A).
% 2.50/2.67 0 [] -element(B,powerset(A))|subset_complement(A,B)=set_difference(A,B).
% 2.50/2.67 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.50/2.67 0 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 2.50/2.67 0 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 2.50/2.67 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.50/2.67 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.50/2.67 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C=complements_of_subsets(A,B)|element($f29(A,B,C),powerset(A)).
% 2.50/2.67 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C=complements_of_subsets(A,B)|in($f29(A,B,C),C)|in(subset_complement(A,$f29(A,B,C)),B).
% 2.50/2.67 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C=complements_of_subsets(A,B)| -in($f29(A,B,C),C)| -in(subset_complement(A,$f29(A,B,C)),B).
% 2.50/2.67 0 [] -proper_subset(A,B)|subset(A,B).
% 2.50/2.67 0 [] -proper_subset(A,B)|A!=B.
% 2.50/2.67 0 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 2.50/2.67 0 [] $T.
% 2.50/2.67 0 [] $T.
% 2.50/2.67 0 [] $T.
% 2.50/2.67 0 [] $T.
% 2.50/2.67 0 [] $T.
% 2.50/2.67 0 [] $T.
% 2.50/2.67 0 [] element(cast_to_subset(A),powerset(A)).
% 2.50/2.67 0 [] $T.
% 2.50/2.67 0 [] $T.
% 2.50/2.67 0 [] $T.
% 2.50/2.67 0 [] -element(B,powerset(A))|element(subset_complement(A,B),powerset(A)).
% 2.50/2.67 0 [] $T.
% 2.50/2.67 0 [] $T.
% 2.50/2.67 0 [] $T.
% 2.50/2.67 0 [] $T.
% 2.50/2.67 0 [] -element(B,powerset(powerset(A)))|element(union_of_subsets(A,B),powerset(A)).
% 2.50/2.67 0 [] -element(B,powerset(powerset(A)))|element(meet_of_subsets(A,B),powerset(A)).
% 2.50/2.67 0 [] -element(B,powerset(A))| -element(C,powerset(A))|element(subset_difference(A,B,C),powerset(A)).
% 2.50/2.67 0 [] -element(B,powerset(powerset(A)))|element(complements_of_subsets(A,B),powerset(powerset(A))).
% 2.50/2.67 0 [] $T.
% 2.50/2.67 0 [] element($f30(A),A).
% 2.50/2.67 0 [] -empty(powerset(A)).
% 2.50/2.67 0 [] empty(empty_set).
% 2.50/2.67 0 [] -empty(ordered_pair(A,B)).
% 2.50/2.67 0 [] -empty(singleton(A)).
% 2.50/2.67 0 [] empty(A)| -empty(set_union2(A,B)).
% 2.50/2.67 0 [] -empty(unordered_pair(A,B)).
% 2.50/2.67 0 [] empty(A)| -empty(set_union2(B,A)).
% 2.50/2.67 0 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 2.50/2.67 0 [] set_union2(A,A)=A.
% 2.50/2.67 0 [] set_intersection2(A,A)=A.
% 2.50/2.67 0 [] -element(B,powerset(A))|subset_complement(A,subset_complement(A,B))=B.
% 2.50/2.67 0 [] -element(B,powerset(powerset(A)))|complements_of_subsets(A,complements_of_subsets(A,B))=B.
% 2.50/2.67 0 [] -proper_subset(A,A).
% 2.50/2.67 0 [] singleton(A)!=empty_set.
% 2.50/2.67 0 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.50/2.67 0 [] -disjoint(singleton(A),B)| -in(A,B).
% 2.50/2.67 0 [] in(A,B)|disjoint(singleton(A),B).
% 2.50/2.67 0 [] -subset(singleton(A),B)|in(A,B).
% 2.50/2.67 0 [] subset(singleton(A),B)| -in(A,B).
% 2.50/2.67 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.50/2.67 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.50/2.67 0 [] -element(B,powerset(A))| -in(C,B)|in(C,A).
% 2.50/2.67 0 [] -subset(A,B)|in(C,A)|subset(A,set_difference(B,singleton(C))).
% 2.50/2.67 0 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.50/2.67 0 [] subset(A,singleton(B))|A!=empty_set.
% 2.50/2.67 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.50/2.67 0 [] -in(A,B)|subset(A,union(B)).
% 2.50/2.67 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.50/2.67 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.50/2.67 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.50/2.67 0 [] in($f31(A,B),A)|element(A,powerset(B)).
% 2.50/2.67 0 [] -in($f31(A,B),B)|element(A,powerset(B)).
% 2.50/2.67 0 [] empty($c1).
% 2.50/2.67 0 [] relation($c1).
% 2.50/2.67 0 [] empty(A)|element($f32(A),powerset(A)).
% 2.50/2.67 0 [] empty(A)| -empty($f32(A)).
% 2.50/2.67 0 [] empty($c2).
% 2.50/2.67 0 [] element($f33(A),powerset(A)).
% 2.50/2.67 0 [] empty($f33(A)).
% 2.50/2.67 0 [] -empty($c3).
% 2.50/2.67 0 [] -element(B,powerset(powerset(A)))|union_of_subsets(A,B)=union(B).
% 2.50/2.67 0 [] -element(B,powerset(powerset(A)))|meet_of_subsets(A,B)=set_meet(B).
% 2.50/2.67 0 [] -element(B,powerset(A))| -element(C,powerset(A))|subset_difference(A,B,C)=set_difference(B,C).
% 2.50/2.67 0 [] subset(A,A).
% 2.50/2.67 0 [] -disjoint(A,B)|disjoint(B,A).
% 2.50/2.67 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.50/2.67 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.50/2.67 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.50/2.67 0 [] unordered_pair(A,B)!=unordered_pair(C,D)|A=C|A=D.
% 2.50/2.67 0 [] -subset(A,B)|subset(cartesian_product2(A,C),cartesian_product2(B,C)).
% 2.50/2.67 0 [] -subset(A,B)|subset(cartesian_product2(C,A),cartesian_product2(C,B)).
% 2.50/2.67 0 [] -subset(A,B)| -subset(C,D)|subset(cartesian_product2(A,C),cartesian_product2(B,D)).
% 2.50/2.67 0 [] -subset(A,B)|set_union2(A,B)=B.
% 2.50/2.67 0 [] in(A,$f34(A)).
% 2.50/2.67 0 [] -in(C,$f34(A))| -subset(D,C)|in(D,$f34(A)).
% 2.50/2.67 0 [] -in(X7,$f34(A))|in(powerset(X7),$f34(A)).
% 2.50/2.67 0 [] -subset(X8,$f34(A))|are_e_quipotent(X8,$f34(A))|in(X8,$f34(A)).
% 2.50/2.67 0 [] subset(set_intersection2(A,B),A).
% 2.50/2.67 0 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 2.50/2.67 0 [] set_union2(A,empty_set)=A.
% 2.50/2.67 0 [] -in(A,B)|element(A,B).
% 2.50/2.67 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.50/2.67 0 [] powerset(empty_set)=singleton(empty_set).
% 2.50/2.67 0 [] -relation(C)| -in(ordered_pair(A,B),C)|in(A,relation_dom(C)).
% 2.50/2.67 0 [] -relation(C)| -in(ordered_pair(A,B),C)|in(B,relation_rng(C)).
% 2.50/2.67 0 [] -relation(A)|subset(A,cartesian_product2(relation_dom(A),relation_rng(A))).
% 2.50/2.67 0 [] relation($c5).
% 2.50/2.67 0 [] relation($c4).
% 2.50/2.67 0 [] subset($c5,$c4).
% 2.50/2.67 0 [] -subset(relation_dom($c5),relation_dom($c4))| -subset(relation_rng($c5),relation_rng($c4)).
% 2.50/2.67 0 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 2.50/2.67 0 [] -subset(A,B)|set_intersection2(A,B)=A.
% 2.50/2.67 0 [] set_intersection2(A,empty_set)=empty_set.
% 2.50/2.67 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.50/2.67 0 [] in($f35(A,B),A)|in($f35(A,B),B)|A=B.
% 2.50/2.67 0 [] -in($f35(A,B),A)| -in($f35(A,B),B)|A=B.
% 2.50/2.67 0 [] subset(empty_set,A).
% 2.50/2.67 0 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 2.50/2.67 0 [] ordered_pair(A,B)!=ordered_pair(C,D)|A=C.
% 2.50/2.67 0 [] ordered_pair(A,B)!=ordered_pair(C,D)|B=D.
% 2.50/2.67 0 [] subset(set_difference(A,B),A).
% 2.50/2.67 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.50/2.67 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.50/2.67 0 [] -subset(singleton(A),B)|in(A,B).
% 2.50/2.67 0 [] subset(singleton(A),B)| -in(A,B).
% 2.50/2.67 0 [] -subset(unordered_pair(A,B),C)|in(A,C).
% 2.50/2.67 0 [] -subset(unordered_pair(A,B),C)|in(B,C).
% 2.50/2.67 0 [] subset(unordered_pair(A,B),C)| -in(A,C)| -in(B,C).
% 2.50/2.67 0 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.50/2.67 0 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.50/2.67 0 [] subset(A,singleton(B))|A!=empty_set.
% 2.50/2.67 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.50/2.67 0 [] set_difference(A,empty_set)=A.
% 2.50/2.67 0 [] -element(A,powerset(B))|subset(A,B).
% 2.50/2.67 0 [] element(A,powerset(B))| -subset(A,B).
% 2.50/2.67 0 [] disjoint(A,B)|in($f36(A,B),A).
% 2.50/2.67 0 [] disjoint(A,B)|in($f36(A,B),B).
% 2.50/2.67 0 [] -in(C,A)| -in(C,B)| -disjoint(A,B).
% 2.50/2.67 0 [] -subset(A,empty_set)|A=empty_set.
% 2.50/2.67 0 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.50/2.67 0 [] -element(B,powerset(A))| -element(C,powerset(A))| -disjoint(B,C)|subset(B,subset_complement(A,C)).
% 2.50/2.67 0 [] -element(B,powerset(A))| -element(C,powerset(A))|disjoint(B,C)| -subset(B,subset_complement(A,C)).
% 2.50/2.67 0 [] -subset(A,B)|B=set_union2(A,set_difference(B,A)).
% 2.50/2.67 0 [] -element(B,powerset(powerset(A)))|B=empty_set|complements_of_subsets(A,B)!=empty_set.
% 2.50/2.67 0 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.50/2.67 0 [] -element(B,powerset(powerset(A)))|B=empty_set|subset_difference(A,cast_to_subset(A),union_of_subsets(A,B))=meet_of_subsets(A,complements_of_subsets(A,B)).
% 2.50/2.67 0 [] -element(B,powerset(powerset(A)))|B=empty_set|union_of_subsets(A,complements_of_subsets(A,B))=subset_difference(A,cast_to_subset(A),meet_of_subsets(A,B)).
% 2.50/2.67 0 [] set_difference(A,set_difference(A,B))=set_intersection2(A,B).
% 2.50/2.67 0 [] set_difference(empty_set,A)=empty_set.
% 2.50/2.67 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.50/2.67 0 [] disjoint(A,B)|in($f37(A,B),set_intersection2(A,B)).
% 2.50/2.67 0 [] -in(C,set_intersection2(A,B))| -disjoint(A,B).
% 2.50/2.67 0 [] A=empty_set| -element(B,powerset(A))| -element(C,A)|in(C,B)|in(C,subset_complement(A,B)).
% 2.50/2.67 0 [] -element(C,powerset(A))| -in(B,subset_complement(A,C))| -in(B,C).
% 2.50/2.67 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.50/2.67 0 [] -subset(A,B)| -proper_subset(B,A).
% 2.50/2.67 0 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 2.50/2.67 0 [] set_difference(A,singleton(B))!=A| -in(B,A).
% 2.50/2.67 0 [] set_difference(A,singleton(B))=A|in(B,A).
% 2.50/2.67 0 [] unordered_pair(A,A)=singleton(A).
% 2.50/2.67 0 [] -empty(A)|A=empty_set.
% 2.50/2.67 0 [] -subset(singleton(A),singleton(B))|A=B.
% 2.50/2.67 0 [] -in(A,B)| -empty(B).
% 2.50/2.67 0 [] subset(A,set_union2(A,B)).
% 2.50/2.67 0 [] -disjoint(A,B)|set_difference(A,B)=A.
% 2.50/2.67 0 [] disjoint(A,B)|set_difference(A,B)!=A.
% 2.50/2.67 0 [] -empty(A)|A=B| -empty(B).
% 2.50/2.67 0 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 2.50/2.67 0 [] singleton(A)!=unordered_pair(B,C)|A=B.
% 2.50/2.67 0 [] -in(A,B)|subset(A,union(B)).
% 2.50/2.67 0 [] union(powerset(A))=A.
% 2.50/2.67 0 [] in(A,$f39(A)).
% 2.50/2.67 0 [] -in(C,$f39(A))| -subset(D,C)|in(D,$f39(A)).
% 2.50/2.67 0 [] -in(X9,$f39(A))|in($f38(A,X9),$f39(A)).
% 2.50/2.67 0 [] -in(X9,$f39(A))| -subset(E,X9)|in(E,$f38(A,X9)).
% 2.50/2.67 0 [] -subset(X10,$f39(A))|are_e_quipotent(X10,$f39(A))|in(X10,$f39(A)).
% 2.50/2.67 0 [] singleton(A)!=unordered_pair(B,C)|B=C.
% 2.50/2.67 end_of_list.
% 2.50/2.67
% 2.50/2.67 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 2.50/2.67
% 2.50/2.67 This ia a non-Horn set with equality. The strategy will be
% 2.50/2.67 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.50/2.67 deletion, with positive clauses in sos and nonpositive
% 2.50/2.67 clauses in usable.
% 2.50/2.67
% 2.50/2.67 dependent: set(knuth_bendix).
% 2.50/2.67 dependent: set(anl_eq).
% 2.50/2.67 dependent: set(para_from).
% 2.50/2.67 dependent: set(para_into).
% 2.50/2.67 dependent: clear(para_from_right).
% 2.50/2.67 dependent: clear(para_into_right).
% 2.50/2.67 dependent: set(para_from_vars).
% 2.50/2.67 dependent: set(eq_units_both_ways).
% 2.50/2.67 dependent: set(dynamic_demod_all).
% 2.50/2.67 dependent: set(dynamic_demod).
% 2.50/2.67 dependent: set(order_eq).
% 2.50/2.67 dependent: set(back_demod).
% 2.50/2.67 dependent: set(lrpo).
% 2.50/2.67 dependent: set(hyper_res).
% 2.50/2.67 dependent: set(unit_deletion).
% 2.50/2.67 dependent: set(factor).
% 2.50/2.67
% 2.50/2.67 ------------> process usable:
% 2.50/2.67 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.50/2.67 ** KEPT (pick-wt=6): 2 [] -proper_subset(A,B)| -proper_subset(B,A).
% 2.50/2.67 ** KEPT (pick-wt=6): 3 [] A!=B|subset(A,B).
% 2.50/2.67 ** KEPT (pick-wt=6): 4 [] A!=B|subset(B,A).
% 2.50/2.67 ** KEPT (pick-wt=9): 5 [] A=B| -subset(A,B)| -subset(B,A).
% 2.50/2.67 ** KEPT (pick-wt=14): 7 [copy,6,flip.3] -relation(A)| -in(B,A)|ordered_pair($f2(A,B),$f1(A,B))=B.
% 2.50/2.67 ** KEPT (pick-wt=8): 8 [] relation(A)|$f3(A)!=ordered_pair(B,C).
% 2.50/2.67 ** KEPT (pick-wt=16): 9 [] A=empty_set|B!=set_meet(A)| -in(C,B)| -in(D,A)|in(C,D).
% 2.50/2.67 ** KEPT (pick-wt=16): 10 [] A=empty_set|B!=set_meet(A)|in(C,B)|in($f4(A,B,C),A).
% 2.50/2.67 ** KEPT (pick-wt=16): 11 [] A=empty_set|B!=set_meet(A)|in(C,B)| -in(C,$f4(A,B,C)).
% 2.50/2.67 ** KEPT (pick-wt=20): 12 [] A=empty_set|B=set_meet(A)|in($f6(A,B),B)| -in(C,A)|in($f6(A,B),C).
% 2.50/2.67 ** KEPT (pick-wt=17): 13 [] A=empty_set|B=set_meet(A)| -in($f6(A,B),B)|in($f5(A,B),A).
% 2.50/2.67 ** KEPT (pick-wt=19): 14 [] A=empty_set|B=set_meet(A)| -in($f6(A,B),B)| -in($f6(A,B),$f5(A,B)).
% 2.50/2.67 ** KEPT (pick-wt=10): 15 [] A!=empty_set|B!=set_meet(A)|B=empty_set.
% 2.50/2.67 ** KEPT (pick-wt=10): 16 [] A!=empty_set|B=set_meet(A)|B!=empty_set.
% 2.50/2.67 ** KEPT (pick-wt=10): 17 [] A!=singleton(B)| -in(C,A)|C=B.
% 2.50/2.67 ** KEPT (pick-wt=10): 18 [] A!=singleton(B)|in(C,A)|C!=B.
% 2.50/2.67 ** KEPT (pick-wt=14): 19 [] A=singleton(B)| -in($f7(B,A),A)|$f7(B,A)!=B.
% 2.50/2.67 ** KEPT (pick-wt=6): 20 [] A!=empty_set| -in(B,A).
% 2.50/2.67 ** KEPT (pick-wt=10): 21 [] A!=powerset(B)| -in(C,A)|subset(C,B).
% 2.50/2.67 ** KEPT (pick-wt=10): 22 [] A!=powerset(B)|in(C,A)| -subset(C,B).
% 2.50/2.67 ** KEPT (pick-wt=14): 23 [] A=powerset(B)| -in($f9(B,A),A)| -subset($f9(B,A),B).
% 2.50/2.67 ** KEPT (pick-wt=8): 24 [] empty(A)| -element(B,A)|in(B,A).
% 2.50/2.67 ** KEPT (pick-wt=8): 25 [] empty(A)|element(B,A)| -in(B,A).
% 2.50/2.67 ** KEPT (pick-wt=7): 26 [] -empty(A)| -element(B,A)|empty(B).
% 2.50/2.67 ** KEPT (pick-wt=7): 27 [] -empty(A)|element(B,A)| -empty(B).
% 2.50/2.67 ** KEPT (pick-wt=14): 28 [] A!=unordered_pair(B,C)| -in(D,A)|D=B|D=C.
% 2.50/2.67 ** KEPT (pick-wt=11): 29 [] A!=unordered_pair(B,C)|in(D,A)|D!=B.
% 2.50/2.67 ** KEPT (pick-wt=11): 30 [] A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 2.50/2.67 ** KEPT (pick-wt=17): 31 [] A=unordered_pair(B,C)| -in($f10(B,C,A),A)|$f10(B,C,A)!=B.
% 2.50/2.67 ** KEPT (pick-wt=17): 32 [] A=unordered_pair(B,C)| -in($f10(B,C,A),A)|$f10(B,C,A)!=C.
% 2.50/2.67 ** KEPT (pick-wt=14): 33 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 2.50/2.67 ** KEPT (pick-wt=11): 34 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 2.50/2.67 ** KEPT (pick-wt=11): 35 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 2.50/2.67 ** KEPT (pick-wt=17): 36 [] A=set_union2(B,C)| -in($f11(B,C,A),A)| -in($f11(B,C,A),B).
% 2.50/2.67 ** KEPT (pick-wt=17): 37 [] A=set_union2(B,C)| -in($f11(B,C,A),A)| -in($f11(B,C,A),C).
% 2.50/2.67 ** KEPT (pick-wt=15): 38 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f13(B,C,A,D),B).
% 2.50/2.67 ** KEPT (pick-wt=15): 39 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f12(B,C,A,D),C).
% 2.50/2.67 ** KEPT (pick-wt=21): 41 [copy,40,flip.3] A!=cartesian_product2(B,C)| -in(D,A)|ordered_pair($f13(B,C,A,D),$f12(B,C,A,D))=D.
% 2.50/2.67 ** KEPT (pick-wt=19): 42 [] A!=cartesian_product2(B,C)|in(D,A)| -in(E,B)| -in(F,C)|D!=ordered_pair(E,F).
% 2.50/2.67 ** KEPT (pick-wt=25): 43 [] A=cartesian_product2(B,C)| -in($f16(B,C,A),A)| -in(D,B)| -in(E,C)|$f16(B,C,A)!=ordered_pair(D,E).
% 2.50/2.67 ** KEPT (pick-wt=9): 44 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.50/2.67 ** KEPT (pick-wt=8): 45 [] subset(A,B)| -in($f17(A,B),B).
% 2.50/2.67 ** KEPT (pick-wt=11): 46 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 2.50/2.67 ** KEPT (pick-wt=11): 47 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 2.50/2.67 ** KEPT (pick-wt=14): 48 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 2.50/2.67 ** KEPT (pick-wt=23): 49 [] A=set_intersection2(B,C)| -in($f18(B,C,A),A)| -in($f18(B,C,A),B)| -in($f18(B,C,A),C).
% 2.50/2.67 ** KEPT (pick-wt=17): 50 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f19(A,B,C)),A).
% 2.50/2.67 ** KEPT (pick-wt=14): 51 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 2.50/2.67 ** KEPT (pick-wt=20): 52 [] -relation(A)|B=relation_dom(A)|in($f21(A,B),B)|in(ordered_pair($f21(A,B),$f20(A,B)),A).
% 2.50/2.67 ** KEPT (pick-wt=18): 53 [] -relation(A)|B=relation_dom(A)| -in($f21(A,B),B)| -in(ordered_pair($f21(A,B),C),A).
% 2.50/2.67 ** KEPT (pick-wt=13): 54 [] A!=union(B)| -in(C,A)|in(C,$f22(B,A,C)).
% 2.50/2.67 ** KEPT (pick-wt=13): 55 [] A!=union(B)| -in(C,A)|in($f22(B,A,C),B).
% 2.50/2.67 ** KEPT (pick-wt=13): 56 [] A!=union(B)|in(C,A)| -in(C,D)| -in(D,B).
% 2.50/2.67 ** KEPT (pick-wt=17): 57 [] A=union(B)| -in($f24(B,A),A)| -in($f24(B,A),C)| -in(C,B).
% 2.50/2.67 ** KEPT (pick-wt=11): 58 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 2.50/2.67 ** KEPT (pick-wt=11): 59 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 2.50/2.67 ** KEPT (pick-wt=14): 60 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 2.50/2.67 ** KEPT (pick-wt=17): 61 [] A=set_difference(B,C)|in($f25(B,C,A),A)| -in($f25(B,C,A),C).
% 2.50/2.67 ** KEPT (pick-wt=23): 62 [] A=set_difference(B,C)| -in($f25(B,C,A),A)| -in($f25(B,C,A),B)|in($f25(B,C,A),C).
% 2.50/2.67 ** KEPT (pick-wt=17): 63 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f26(A,B,C),C),A).
% 2.50/2.67 ** KEPT (pick-wt=14): 64 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 2.50/2.67 ** KEPT (pick-wt=20): 65 [] -relation(A)|B=relation_rng(A)|in($f28(A,B),B)|in(ordered_pair($f27(A,B),$f28(A,B)),A).
% 2.50/2.67 ** KEPT (pick-wt=18): 66 [] -relation(A)|B=relation_rng(A)| -in($f28(A,B),B)| -in(ordered_pair(C,$f28(A,B)),A).
% 2.50/2.67 ** KEPT (pick-wt=11): 67 [] -element(A,powerset(B))|subset_complement(B,A)=set_difference(B,A).
% 2.50/2.68 ** KEPT (pick-wt=8): 68 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 2.50/2.68 ** KEPT (pick-wt=8): 69 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 2.50/2.68 ** KEPT (pick-wt=27): 70 [] -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.50/2.68 ** KEPT (pick-wt=27): 71 [] -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.50/2.68 ** KEPT (pick-wt=22): 72 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C=complements_of_subsets(B,A)|element($f29(B,A,C),powerset(B)).
% 2.50/2.68 ** KEPT (pick-wt=29): 73 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C=complements_of_subsets(B,A)|in($f29(B,A,C),C)|in(subset_complement(B,$f29(B,A,C)),A).
% 2.50/2.68 ** KEPT (pick-wt=29): 74 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C=complements_of_subsets(B,A)| -in($f29(B,A,C),C)| -in(subset_complement(B,$f29(B,A,C)),A).
% 2.50/2.68 ** KEPT (pick-wt=6): 75 [] -proper_subset(A,B)|subset(A,B).
% 2.50/2.68 ** KEPT (pick-wt=6): 76 [] -proper_subset(A,B)|A!=B.
% 2.50/2.68 ** KEPT (pick-wt=9): 77 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 2.50/2.68 ** KEPT (pick-wt=10): 78 [] -element(A,powerset(B))|element(subset_complement(B,A),powerset(B)).
% 2.50/2.68 ** KEPT (pick-wt=11): 79 [] -element(A,powerset(powerset(B)))|element(union_of_subsets(B,A),powerset(B)).
% 2.50/2.68 ** KEPT (pick-wt=11): 80 [] -element(A,powerset(powerset(B)))|element(meet_of_subsets(B,A),powerset(B)).
% 2.50/2.68 ** KEPT (pick-wt=15): 81 [] -element(A,powerset(B))| -element(C,powerset(B))|element(subset_difference(B,A,C),powerset(B)).
% 2.50/2.68 ** KEPT (pick-wt=12): 82 [] -element(A,powerset(powerset(B)))|element(complements_of_subsets(B,A),powerset(powerset(B))).
% 2.50/2.68 ** KEPT (pick-wt=3): 83 [] -empty(powerset(A)).
% 2.50/2.68 ** KEPT (pick-wt=4): 84 [] -empty(ordered_pair(A,B)).
% 2.50/2.68 ** KEPT (pick-wt=3): 85 [] -empty(singleton(A)).
% 2.50/2.68 ** KEPT (pick-wt=6): 86 [] empty(A)| -empty(set_union2(A,B)).
% 2.50/2.68 ** KEPT (pick-wt=4): 87 [] -empty(unordered_pair(A,B)).
% 2.50/2.68 ** KEPT (pick-wt=6): 88 [] empty(A)| -empty(set_union2(B,A)).
% 2.50/2.68 ** KEPT (pick-wt=8): 89 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 2.50/2.68 ** KEPT (pick-wt=11): 90 [] -element(A,powerset(B))|subset_complement(B,subset_complement(B,A))=A.
% 2.50/2.68 ** KEPT (pick-wt=12): 91 [] -element(A,powerset(powerset(B)))|complements_of_subsets(B,complements_of_subsets(B,A))=A.
% 2.50/2.68 ** KEPT (pick-wt=3): 92 [] -proper_subset(A,A).
% 2.50/2.68 ** KEPT (pick-wt=4): 93 [] singleton(A)!=empty_set.
% 2.50/2.68 ** KEPT (pick-wt=9): 94 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.50/2.68 ** KEPT (pick-wt=7): 95 [] -disjoint(singleton(A),B)| -in(A,B).
% 2.50/2.68 ** KEPT (pick-wt=7): 96 [] -subset(singleton(A),B)|in(A,B).
% 2.50/2.68 ** KEPT (pick-wt=7): 97 [] subset(singleton(A),B)| -in(A,B).
% 2.50/2.68 ** KEPT (pick-wt=8): 98 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.50/2.68 ** KEPT (pick-wt=8): 99 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.50/2.68 ** KEPT (pick-wt=10): 100 [] -element(A,powerset(B))| -in(C,A)|in(C,B).
% 2.50/2.68 ** KEPT (pick-wt=12): 101 [] -subset(A,B)|in(C,A)|subset(A,set_difference(B,singleton(C))).
% 2.50/2.68 ** KEPT (pick-wt=11): 102 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.50/2.68 ** KEPT (pick-wt=7): 103 [] subset(A,singleton(B))|A!=empty_set.
% 2.50/2.68 Following clause subsumed by 3 during input processing: 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.50/2.68 ** KEPT (pick-wt=7): 104 [] -in(A,B)|subset(A,union(B)).
% 2.50/2.68 ** KEPT (pick-wt=10): 105 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.50/2.68 ** KEPT (pick-wt=10): 106 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.50/2.68 ** KEPT (pick-wt=13): 107 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.50/2.68 ** KEPT (pick-wt=9): 108 [] -in($f31(A,B),B)|element(A,powerset(B)).
% 2.50/2.68 ** KEPT (pick-wt=5): 109 [] empty(A)| -empty($f32(A)).
% 2.50/2.68 ** KEPT (pick-wt=2): 110 [] -empty($c3).
% 2.50/2.68 ** KEPT (pick-wt=11): 111 [] -element(A,powerset(powerset(B)))|union_of_subsets(B,A)=union(A).
% 2.50/2.68 ** KEPT (pick-wt=11): 112 [] -element(A,powerset(powerset(B)))|meet_of_subsets(B,A)=set_meet(A).
% 2.50/2.68 ** KEPT (pick-wt=16): 113 [] -element(A,powerset(B))| -element(C,powerset(B))|subset_difference(B,A,C)=set_difference(A,C).
% 2.50/2.68 ** KEPT (pick-wt=6): 114 [] -disjoint(A,B)|disjoint(B,A).
% 2.50/2.68 Following clause subsumed by 105 during input processing: 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.50/2.68 Following clause subsumed by 106 during input processing: 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.50/2.68 Following clause subsumed by 107 during input processing: 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.50/2.68 ** KEPT (pick-wt=13): 115 [] unordered_pair(A,B)!=unordered_pair(C,D)|A=C|A=D.
% 2.50/2.68 ** KEPT (pick-wt=10): 116 [] -subset(A,B)|subset(cartesian_product2(A,C),cartesian_product2(B,C)).
% 2.50/2.68 ** KEPT (pick-wt=10): 117 [] -subset(A,B)|subset(cartesian_product2(C,A),cartesian_product2(C,B)).
% 2.50/2.68 ** KEPT (pick-wt=13): 118 [] -subset(A,B)| -subset(C,D)|subset(cartesian_product2(A,C),cartesian_product2(B,D)).
% 2.50/2.68 ** KEPT (pick-wt=8): 119 [] -subset(A,B)|set_union2(A,B)=B.
% 2.50/2.68 ** KEPT (pick-wt=11): 120 [] -in(A,$f34(B))| -subset(C,A)|in(C,$f34(B)).
% 2.50/2.68 ** KEPT (pick-wt=9): 121 [] -in(A,$f34(B))|in(powerset(A),$f34(B)).
% 2.50/2.68 ** KEPT (pick-wt=12): 122 [] -subset(A,$f34(B))|are_e_quipotent(A,$f34(B))|in(A,$f34(B)).
% 2.50/2.68 ** KEPT (pick-wt=11): 123 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 2.50/2.68 ** KEPT (pick-wt=6): 124 [] -in(A,B)|element(A,B).
% 2.50/2.68 ** KEPT (pick-wt=9): 125 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.50/2.68 ** KEPT (pick-wt=11): 126 [] -relation(A)| -in(ordered_pair(B,C),A)|in(B,relation_dom(A)).
% 2.50/2.68 ** KEPT (pick-wt=11): 127 [] -relation(A)| -in(ordered_pair(B,C),A)|in(C,relation_rng(A)).
% 2.50/2.68 ** KEPT (pick-wt=9): 128 [] -relation(A)|subset(A,cartesian_product2(relation_dom(A),relation_rng(A))).
% 2.50/2.68 ** KEPT (pick-wt=10): 129 [] -subset(relation_dom($c5),relation_dom($c4))| -subset(relation_rng($c5),relation_rng($c4)).
% 2.50/2.68 ** KEPT (pick-wt=10): 130 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 2.50/2.68 ** KEPT (pick-wt=8): 131 [] -subset(A,B)|set_intersection2(A,B)=A.
% 2.50/2.68 Following clause subsumed by 24 during input processing: 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.50/2.68 ** KEPT (pick-wt=13): 132 [] -in($f35(A,B),A)| -in($f35(A,B),B)|A=B.
% 2.50/2.68 ** KEPT (pick-wt=10): 133 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 2.50/2.68 ** KEPT (pick-wt=10): 134 [] ordered_pair(A,B)!=ordered_pair(C,D)|A=C.
% 2.50/2.68 ** KEPT (pick-wt=10): 135 [] ordered_pair(A,B)!=ordered_pair(C,D)|B=D.
% 2.50/2.68 Following clause subsumed by 98 during input processing: 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.50/2.68 Following clause subsumed by 99 during input processing: 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.50/2.68 Following clause subsumed by 96 during input processing: 0 [] -subset(singleton(A),B)|in(A,B).
% 2.50/2.68 Following clause subsumed by 97 during input processing: 0 [] subset(singleton(A),B)| -in(A,B).
% 2.50/2.68 ** KEPT (pick-wt=8): 136 [] -subset(unordered_pair(A,B),C)|in(A,C).
% 2.50/2.68 ** KEPT (pick-wt=8): 137 [] -subset(unordered_pair(A,B),C)|in(B,C).
% 2.50/2.68 ** KEPT (pick-wt=11): 138 [] subset(unordered_pair(A,B),C)| -in(A,C)| -in(B,C).
% 2.50/2.68 Following clause subsumed by 102 during input processing: 0 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.50/2.68 Following clause subsumed by 103 during input processing: 0 [] subset(A,singleton(B))|A!=empty_set.
% 2.50/2.68 Following clause subsumed by 3 during input processing: 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.50/2.68 ** KEPT (pick-wt=7): 139 [] -element(A,powerset(B))|subset(A,B).
% 2.50/2.68 ** KEPT (pick-wt=7): 140 [] element(A,powerset(B))| -subset(A,B).
% 2.50/2.68 ** KEPT (pick-wt=9): 141 [] -in(A,B)| -in(A,C)| -disjoint(B,C).
% 2.50/2.68 ** KEPT (pick-wt=6): 142 [] -subset(A,empty_set)|A=empty_set.
% 2.50/2.68 ** KEPT (pick-wt=16): 143 [] -element(A,powerset(B))| -element(C,powerset(B))| -disjoint(A,C)|subset(A,subset_complement(B,C)).
% 2.50/2.68 ** KEPT (pick-wt=16): 144 [] -element(A,powerset(B))| -element(C,powerset(B))|disjoint(A,C)| -subset(A,subset_complement(B,C)).
% 2.50/2.68 ** KEPT (pick-wt=10): 146 [copy,145,flip.2] -subset(A,B)|set_union2(A,set_difference(B,A))=B.
% 2.50/2.68 ** KEPT (pick-wt=13): 147 [] -element(A,powerset(powerset(B)))|A=empty_set|complements_of_subsets(B,A)!=empty_set.
% 2.50/2.68 Following clause subsumed by 94 during input processing: 0 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.50/2.68 ** KEPT (pick-wt=21): 148 [] -element(A,powerset(powerset(B)))|A=empty_set|subset_difference(B,cast_to_subset(B),union_of_subsets(B,A))=meet_of_subsets(B,complements_of_subsets(B,A)).
% 2.50/2.68 ** KEPT (pick-wt=21): 149 [] -element(A,powerset(powerset(B)))|A=empty_set|union_of_subsets(B,complements_of_subsets(B,A))=subset_difference(B,cast_to_subset(B),meet_of_subsets(B,A)).
% 2.50/2.68 ** KEPT (pick-wt=10): 150 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.50/2.68 ** KEPT (pick-wt=8): 151 [] -in(A,set_intersection2(B,C))| -disjoint(B,C).
% 2.50/2.68 ** KEPT (pick-wt=18): 152 [] A=empty_set| -element(B,powerset(A))| -element(C,A)|in(C,B)|in(C,subset_complement(A,B)).
% 2.50/2.68 ** KEPT (pick-wt=12): 153 [] -element(A,powerset(B))| -in(C,subset_complement(B,A))| -in(C,A).
% 2.50/2.68 ** KEPT (pick-wt=9): 154 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.50/2.68 ** KEPT (pick-wt=6): 155 [] -subset(A,B)| -proper_subset(B,A).
% 2.50/2.68 ** KEPT (pick-wt=9): 156 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 2.50/2.68 ** KEPT (pick-wt=9): 157 [] set_difference(A,singleton(B))!=A| -in(B,A).
% 2.50/2.68 ** KEPT (pick-wt=5): 158 [] -empty(A)|A=empty_set.
% 2.50/2.68 ** KEPT (pick-wt=8): 159 [] -subset(singleton(A),singleton(B))|A=B.
% 2.50/2.68 ** KEPT (pick-wt=5): 160 [] -in(A,B)| -empty(B).
% 2.50/2.68 ** KEPT (pick-wt=8): 161 [] -disjoint(A,B)|set_difference(A,B)=A.
% 2.50/2.68 ** KEPT (pick-wt=8): 162 [] disjoint(A,B)|set_difference(A,B)!=A.
% 2.50/2.68 ** KEPT (pick-wt=7): 163 [] -empty(A)|A=B| -empty(B).
% 2.50/2.68 ** KEPT (pick-wt=11): 164 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 2.50/2.68 ** KEPT (pick-wt=9): 165 [] singleton(A)!=unordered_pair(B,C)|A=B.
% 2.50/2.68 Following clause subsumed by 104 during input processing: 0 [] -in(A,B)|subset(A,union(B)).
% 2.50/2.68 ** KEPT (pick-wt=11): 166 [] -in(A,$f39(B))| -subset(C,A)|in(C,$f39(B)).
% 2.50/2.68 ** KEPT (pick-wt=10): 167 [] -in(A,$f39(B))|in($f38(B,A),$f39(B)).
% 2.50/2.68 ** KEPT (pick-wt=12): 168 [] -in(A,$f39(B))| -subset(C,A)|in(C,$f38(B,A)).
% 2.50/2.68 ** KEPT (pick-wt=12): 169 [] -subset(A,$f39(B))|are_e_quipotent(A,$f39(B))|in(A,$f39(B)).
% 2.50/2.68 ** KEPT (pick-wt=9): 170 [] singleton(A)!=unordered_pair(B,C)|B=C.
% 2.50/2.68 124 back subsumes 25.
% 2.50/2.68
% 2.50/2.68 ------------> process sos:
% 2.50/2.68 ** KEPT (pick-wt=3): 214 [] A=A.
% 2.50/2.68 ** KEPT (pick-wt=7): 215 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.50/2.68 ** KEPT (pick-wt=7): 216 [] set_union2(A,B)=set_union2(B,A).
% 2.50/2.68 ** KEPT (pick-wt=7): 217 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.50/2.68 ** KEPT (pick-wt=6): 218 [] relation(A)|in($f3(A),A).
% 2.50/2.68 ** KEPT (pick-wt=14): 219 [] A=singleton(B)|in($f7(B,A),A)|$f7(B,A)=B.
% 2.50/2.68 ** KEPT (pick-wt=7): 220 [] A=empty_set|in($f8(A),A).
% 2.50/2.68 ** KEPT (pick-wt=14): 221 [] A=powerset(B)|in($f9(B,A),A)|subset($f9(B,A),B).
% 2.50/2.68 ** KEPT (pick-wt=23): 222 [] A=unordered_pair(B,C)|in($f10(B,C,A),A)|$f10(B,C,A)=B|$f10(B,C,A)=C.
% 2.50/2.68 ** KEPT (pick-wt=23): 223 [] A=set_union2(B,C)|in($f11(B,C,A),A)|in($f11(B,C,A),B)|in($f11(B,C,A),C).
% 2.50/2.68 ** KEPT (pick-wt=17): 224 [] A=cartesian_product2(B,C)|in($f16(B,C,A),A)|in($f15(B,C,A),B).
% 2.50/2.68 ** KEPT (pick-wt=17): 225 [] A=cartesian_product2(B,C)|in($f16(B,C,A),A)|in($f14(B,C,A),C).
% 2.50/2.68 ** KEPT (pick-wt=25): 227 [copy,226,flip.3] A=cartesian_product2(B,C)|in($f16(B,C,A),A)|ordered_pair($f15(B,C,A),$f14(B,C,A))=$f16(B,C,A).
% 2.50/2.68 ** KEPT (pick-wt=8): 228 [] subset(A,B)|in($f17(A,B),A).
% 2.50/2.68 ** KEPT (pick-wt=17): 229 [] A=set_intersection2(B,C)|in($f18(B,C,A),A)|in($f18(B,C,A),B).
% 2.50/2.68 ** KEPT (pick-wt=17): 230 [] A=set_intersection2(B,C)|in($f18(B,C,A),A)|in($f18(B,C,A),C).
% 2.50/2.68 ** KEPT (pick-wt=4): 231 [] cast_to_subset(A)=A.
% 2.50/2.68 ---> New Demodulator: 232 [new_demod,231] cast_to_subset(A)=A.
% 2.50/2.68 ** KEPT (pick-wt=16): 233 [] A=union(B)|in($f24(B,A),A)|in($f24(B,A),$f23(B,A)).
% 2.50/2.68 ** KEPT (pick-wt=14): 234 [] A=union(B)|in($f24(B,A),A)|in($f23(B,A),B).
% 2.50/2.68 ** KEPT (pick-wt=17): 235 [] A=set_difference(B,C)|in($f25(B,C,A),A)|in($f25(B,C,A),B).
% 2.50/2.68 ** KEPT (pick-wt=10): 237 [copy,236,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.50/2.68 ---> New Demodulator: 238 [new_demod,237] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.50/2.68 ** KEPT (pick-wt=4): 240 [copy,239,demod,232] element(A,powerset(A)).
% 2.50/2.68 ** KEPT (pick-wt=4): 241 [] element($f30(A),A).
% 2.50/2.68 ** KEPT (pick-wt=2): 242 [] empty(empty_set).
% 2.50/2.68 ** KEPT (pick-wt=5): 243 [] set_union2(A,A)=A.
% 2.50/2.69 ---> New Demodulator: 244 [new_demod,243] set_union2(A,A)=A.
% 2.50/2.69 ** KEPT (pick-wt=5): 245 [] set_intersection2(A,A)=A.
% 2.50/2.69 ---> New Demodulator: 246 [new_demod,245] set_intersection2(A,A)=A.
% 2.50/2.69 ** KEPT (pick-wt=7): 247 [] in(A,B)|disjoint(singleton(A),B).
% 2.50/2.69 ** KEPT (pick-wt=9): 248 [] in($f31(A,B),A)|element(A,powerset(B)).
% 2.50/2.69 ** KEPT (pick-wt=2): 249 [] empty($c1).
% 2.50/2.69 ** KEPT (pick-wt=2): 250 [] relation($c1).
% 2.50/2.69 ** KEPT (pick-wt=7): 251 [] empty(A)|element($f32(A),powerset(A)).
% 2.50/2.69 ** KEPT (pick-wt=2): 252 [] empty($c2).
% 2.50/2.69 ** KEPT (pick-wt=5): 253 [] element($f33(A),powerset(A)).
% 2.50/2.69 ** KEPT (pick-wt=3): 254 [] empty($f33(A)).
% 2.50/2.69 ** KEPT (pick-wt=3): 255 [] subset(A,A).
% 2.50/2.69 ** KEPT (pick-wt=4): 256 [] in(A,$f34(A)).
% 2.50/2.69 ** KEPT (pick-wt=5): 257 [] subset(set_intersection2(A,B),A).
% 2.50/2.69 ** KEPT (pick-wt=5): 258 [] set_union2(A,empty_set)=A.
% 2.50/2.69 ---> New Demodulator: 259 [new_demod,258] set_union2(A,empty_set)=A.
% 2.50/2.69 ** KEPT (pick-wt=5): 261 [copy,260,flip.1] singleton(empty_set)=powerset(empty_set).
% 2.50/2.69 ---> New Demodulator: 262 [new_demod,261] singleton(empty_set)=powerset(empty_set).
% 2.50/2.69 ** KEPT (pick-wt=2): 263 [] relation($c5).
% 2.50/2.69 ** KEPT (pick-wt=2): 264 [] relation($c4).
% 2.50/2.69 ** KEPT (pick-wt=3): 265 [] subset($c5,$c4).
% 2.50/2.69 ** KEPT (pick-wt=5): 266 [] set_intersection2(A,empty_set)=empty_set.
% 2.50/2.69 ---> New Demodulator: 267 [new_demod,266] set_intersection2(A,empty_set)=empty_set.
% 2.50/2.69 ** KEPT (pick-wt=13): 268 [] in($f35(A,B),A)|in($f35(A,B),B)|A=B.
% 2.50/2.69 ** KEPT (pick-wt=3): 269 [] subset(empty_set,A).
% 2.50/2.69 ** KEPT (pick-wt=5): 270 [] subset(set_difference(A,B),A).
% 2.50/2.69 ** KEPT (pick-wt=9): 271 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.50/2.69 ---> New Demodulator: 272 [new_demod,271] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.50/2.69 ** KEPT (pick-wt=5): 273 [] set_difference(A,empty_set)=A.
% 2.50/2.69 ---> New Demodulator: 274 [new_demod,273] set_difference(A,empty_set)=A.
% 2.50/2.69 ** KEPT (pick-wt=8): 275 [] disjoint(A,B)|in($f36(A,B),A).
% 2.50/2.69 ** KEPT (pick-wt=8): 276 [] disjoint(A,B)|in($f36(A,B),B).
% 2.50/2.69 ** KEPT (pick-wt=9): 277 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.50/2.69 ---> New Demodulator: 278 [new_demod,277] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.50/2.69 ** KEPT (pick-wt=9): 280 [copy,279,flip.1] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 2.50/2.69 ---> New Demodulator: 281 [new_demod,280] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 2.50/2.69 ** KEPT (pick-wt=5): 282 [] set_difference(empty_set,A)=empty_set.
% 2.50/2.69 ---> New Demodulator: 283 [new_demod,282] set_difference(empty_set,A)=empty_set.
% 2.50/2.69 ** KEPT (pick-wt=12): 285 [copy,284,demod,281] disjoint(A,B)|in($f37(A,B),set_difference(A,set_difference(A,B))).
% 2.50/2.69 ** KEPT (pick-wt=9): 286 [] set_difference(A,singleton(B))=A|in(B,A).
% 2.50/2.69 ** KEPT (pick-wt=6): 288 [copy,287,flip.1] singleton(A)=unordered_pair(A,A).
% 2.50/2.69 ---> New Demodulator: 289 [new_demod,288] singleton(A)=unordered_pair(A,A).
% 2.50/2.69 ** KEPT (pick-wt=5): 290 [] subset(A,set_union2(A,B)).
% 2.50/2.69 ** KEPT (pick-wt=5): 291 [] union(powerset(A))=A.
% 2.50/2.69 ---> New Demodulator: 292 [new_demod,291] union(powerset(A))=A.
% 2.50/2.69 ** KEPT (pick-wt=4): 293 [] in(A,$f39(A)).
% 2.50/2.69 Following clause subsumed by 214 during input processing: 0 [copy,214,flip.1] A=A.
% 2.50/2.69 214 back subsumes 210.
% 2.50/2.69 214 back subsumes 205.
% 2.50/2.69 214 back subsumes 172.
% 2.50/2.69 Following clause subsumed by 215 during input processing: 0 [copy,215,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 2.50/2.69 Following clause subsumed by 216 during input processing: 0 [copy,216,flip.1] set_union2(A,B)=set_union2(B,A).
% 2.50/2.69 ** KEPT (pick-wt=11): 294 [copy,217,flip.1,demod,281,281] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 2.50/2.69 >>>> Starting back demodulation with 232.
% 2.50/2.69 >> back demodulating 149 with 232.
% 2.50/2.69 >> back demodulating 148 with 232.
% 2.50/2.69 >>>> Starting back demodulation with 238.
% 2.50/2.69 >>>> Starting back demodulation with 244.
% 2.50/2.69 >> back demodulating 211 with 244.
% 2.50/2.69 >> back demodulating 178 with 244.
% 2.50/2.69 >>>> Starting back demodulation with 246.
% 2.50/2.69 >> back demodulating 213 with 246.
% 2.50/2.69 >> back demodulating 204 with 246.
% 2.50/2.69 >> back demodulating 188 with 246.
% 2.50/2.69 >> back demodulating 185 with 246.
% 2.50/2.69 >>>> Starting back demodulation with 259.
% 2.50/2.69 >>>> Starting back demodulation with 262.
% 6.55/6.68 >>>> Starting back demodulation with 267.
% 6.55/6.68 >>>> Starting back demodulation with 272.
% 6.55/6.68 >> back demodulating 146 with 272.
% 6.55/6.68 >>>> Starting back demodulation with 274.
% 6.55/6.68 >>>> Starting back demodulation with 278.
% 6.55/6.68 >>>> Starting back demodulation with 281.
% 6.55/6.68 >> back demodulating 266 with 281.
% 6.55/6.68 >> back demodulating 257 with 281.
% 6.55/6.68 >> back demodulating 245 with 281.
% 6.55/6.68 >> back demodulating 230 with 281.
% 6.55/6.68 >> back demodulating 229 with 281.
% 6.55/6.68 >> back demodulating 217 with 281.
% 6.55/6.68 >> back demodulating 187 with 281.
% 6.55/6.68 >> back demodulating 186 with 281.
% 6.55/6.68 >> back demodulating 151 with 281.
% 6.55/6.68 >> back demodulating 131 with 281.
% 6.55/6.68 >> back demodulating 130 with 281.
% 6.55/6.68 >> back demodulating 123 with 281.
% 6.55/6.68 >> back demodulating 69 with 281.
% 6.55/6.68 >> back demodulating 68 with 281.
% 6.55/6.68 >> back demodulating 49 with 281.
% 6.55/6.68 >> back demodulating 48 with 281.
% 6.55/6.68 >> back demodulating 47 with 281.
% 6.55/6.68 >> back demodulating 46 with 281.
% 6.55/6.68 >>>> Starting back demodulation with 283.
% 6.55/6.68 >>>> Starting back demodulation with 289.
% 6.55/6.68 >> back demodulating 286 with 289.
% 6.55/6.68 >> back demodulating 261 with 289.
% 6.55/6.68 >> back demodulating 247 with 289.
% 6.55/6.68 >> back demodulating 237 with 289.
% 6.55/6.68 >> back demodulating 219 with 289.
% 6.55/6.68 >> back demodulating 170 with 289.
% 6.55/6.68 >> back demodulating 165 with 289.
% 6.55/6.68 >> back demodulating 159 with 289.
% 6.55/6.68 >> back demodulating 157 with 289.
% 6.55/6.68 >> back demodulating 103 with 289.
% 6.55/6.68 >> back demodulating 102 with 289.
% 6.55/6.68 >> back demodulating 101 with 289.
% 6.55/6.68 >> back demodulating 97 with 289.
% 6.55/6.68 >> back demodulating 96 with 289.
% 6.55/6.68 >> back demodulating 95 with 289.
% 6.55/6.68 >> back demodulating 94 with 289.
% 6.55/6.68 >> back demodulating 93 with 289.
% 6.55/6.68 >> back demodulating 85 with 289.
% 6.55/6.68 >> back demodulating 19 with 289.
% 6.55/6.68 >> back demodulating 18 with 289.
% 6.55/6.68 >> back demodulating 17 with 289.
% 6.55/6.68 >>>> Starting back demodulation with 292.
% 6.55/6.68 Following clause subsumed by 294 during input processing: 0 [copy,294,flip.1] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 6.55/6.68 >>>> Starting back demodulation with 308.
% 6.55/6.68 >> back demodulating 201 with 308.
% 6.55/6.68 >>>> Starting back demodulation with 324.
% 6.55/6.68 >>>> Starting back demodulation with 327.
% 6.55/6.68
% 6.55/6.68 ======= end of input processing =======
% 6.55/6.68
% 6.55/6.68 =========== start of search ===========
% 6.55/6.68
% 6.55/6.68
% 6.55/6.68 Resetting weight limit to 4.
% 6.55/6.68
% 6.55/6.68
% 6.55/6.68 Resetting weight limit to 4.
% 6.55/6.68
% 6.55/6.68 sos_size=232
% 6.55/6.68
% 6.55/6.68 Search stopped because sos empty.
% 6.55/6.68
% 6.55/6.68
% 6.55/6.68 Search stopped because sos empty.
% 6.55/6.68
% 6.55/6.68 ============ end of search ============
% 6.55/6.68
% 6.55/6.68 -------------- statistics -------------
% 6.55/6.68 clauses given 245
% 6.55/6.68 clauses generated 298175
% 6.55/6.68 clauses kept 573
% 6.55/6.68 clauses forward subsumed 2056
% 6.55/6.68 clauses back subsumed 53
% 6.55/6.68 Kbytes malloced 5859
% 6.55/6.68
% 6.55/6.68 ----------- times (seconds) -----------
% 6.55/6.68 user CPU time 4.02 (0 hr, 0 min, 4 sec)
% 6.55/6.68 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 6.55/6.68 wall-clock time 6 (0 hr, 0 min, 6 sec)
% 6.55/6.68
% 6.55/6.68 Process 7252 finished Wed Jul 27 08:01:21 2022
% 6.55/6.68 Otter interrupted
% 6.55/6.68 PROOF NOT FOUND
%------------------------------------------------------------------------------