TSTP Solution File: SEU190+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU190+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Jul 27 13:15:06 EDT 2022
% Result : Unknown 5.32s 5.48s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU190+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 07:58:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.72/2.91 ----- Otter 3.3f, August 2004 -----
% 2.72/2.91 The process was started by sandbox2 on n018.cluster.edu,
% 2.72/2.91 Wed Jul 27 07:58:31 2022
% 2.72/2.91 The command was "./otter". The process ID is 471.
% 2.72/2.91
% 2.72/2.91 set(prolog_style_variables).
% 2.72/2.91 set(auto).
% 2.72/2.91 dependent: set(auto1).
% 2.72/2.91 dependent: set(process_input).
% 2.72/2.91 dependent: clear(print_kept).
% 2.72/2.91 dependent: clear(print_new_demod).
% 2.72/2.91 dependent: clear(print_back_demod).
% 2.72/2.91 dependent: clear(print_back_sub).
% 2.72/2.91 dependent: set(control_memory).
% 2.72/2.91 dependent: assign(max_mem, 12000).
% 2.72/2.91 dependent: assign(pick_given_ratio, 4).
% 2.72/2.91 dependent: assign(stats_level, 1).
% 2.72/2.91 dependent: assign(max_seconds, 10800).
% 2.72/2.91 clear(print_given).
% 2.72/2.91
% 2.72/2.91 formula_list(usable).
% 2.72/2.91 all A (A=A).
% 2.72/2.91 all A B (in(A,B)-> -in(B,A)).
% 2.72/2.91 all A B (proper_subset(A,B)-> -proper_subset(B,A)).
% 2.72/2.91 all A (empty(A)->relation(A)).
% 2.72/2.91 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.72/2.91 all A B (set_union2(A,B)=set_union2(B,A)).
% 2.72/2.91 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.72/2.91 all A B (relation(B)-> (B=identity_relation(A)<-> (all C D (in(ordered_pair(C,D),B)<->in(C,A)&C=D)))).
% 2.72/2.91 all A B (A=B<->subset(A,B)&subset(B,A)).
% 2.72/2.91 all A (relation(A)<-> (all B (-(in(B,A)& (all C D (B!=ordered_pair(C,D))))))).
% 2.72/2.91 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.72/2.91 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 2.72/2.91 all A (A=empty_set<-> (all B (-in(B,A)))).
% 2.72/2.91 all A B (B=powerset(A)<-> (all C (in(C,B)<->subset(C,A)))).
% 2.72/2.91 all A B ((-empty(A)-> (element(B,A)<->in(B,A)))& (empty(A)-> (element(B,A)<->empty(B)))).
% 2.72/2.91 all A B C (C=unordered_pair(A,B)<-> (all D (in(D,C)<->D=A|D=B))).
% 2.72/2.91 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 2.72/2.91 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.72/2.91 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 2.72/2.91 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 2.72/2.91 all A (relation(A)-> (all B (B=relation_dom(A)<-> (all C (in(C,B)<-> (exists D in(ordered_pair(C,D),A))))))).
% 2.72/2.91 all A (cast_to_subset(A)=A).
% 2.72/2.91 all A B (B=union(A)<-> (all C (in(C,B)<-> (exists D (in(C,D)&in(D,A)))))).
% 2.72/2.91 all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 2.72/2.91 all A (relation(A)-> (all B (B=relation_rng(A)<-> (all C (in(C,B)<-> (exists D in(ordered_pair(D,C),A))))))).
% 2.72/2.91 all A B (element(B,powerset(A))->subset_complement(A,B)=set_difference(A,B)).
% 2.72/2.91 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.72/2.91 all A (relation(A)->relation_field(A)=set_union2(relation_dom(A),relation_rng(A))).
% 2.72/2.91 all A (relation(A)-> (all B (relation(B)-> (B=relation_inverse(A)<-> (all C D (in(ordered_pair(C,D),B)<->in(ordered_pair(D,C),A))))))).
% 2.72/2.91 all A B (disjoint(A,B)<->set_intersection2(A,B)=empty_set).
% 2.72/2.91 all A (relation(A)-> (all B (relation(B)-> (all C (relation(C)-> (C=relation_composition(A,B)<-> (all D E (in(ordered_pair(D,E),C)<-> (exists F (in(ordered_pair(D,F),A)&in(ordered_pair(F,E),B))))))))))).
% 2.72/2.91 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.72/2.91 all A B (proper_subset(A,B)<->subset(A,B)&A!=B).
% 2.72/2.91 $T.
% 2.72/2.91 $T.
% 2.72/2.91 $T.
% 2.72/2.91 $T.
% 2.72/2.91 $T.
% 2.72/2.91 $T.
% 2.72/2.91 all A element(cast_to_subset(A),powerset(A)).
% 2.72/2.91 $T.
% 2.72/2.91 $T.
% 2.72/2.91 $T.
% 2.72/2.91 $T.
% 2.72/2.91 all A B (element(B,powerset(A))->element(subset_complement(A,B),powerset(A))).
% 2.72/2.91 $T.
% 2.72/2.91 $T.
% 2.72/2.91 all A (relation(A)->relation(relation_inverse(A))).
% 2.72/2.91 $T.
% 2.72/2.91 $T.
% 2.72/2.91 all A B (relation(A)&relation(B)->relation(relation_composition(A,B))).
% 2.72/2.91 all A B (element(B,powerset(powerset(A)))->element(union_of_subsets(A,B),powerset(A))).
% 2.72/2.91 all A relation(identity_relation(A)).
% 2.72/2.91 all A B (element(B,powerset(powerset(A)))->element(meet_of_subsets(A,B),powerset(A))).
% 2.72/2.91 all A B C (element(B,powerset(A))&element(C,powerset(A))->element(subset_difference(A,B,C),powerset(A))).
% 2.72/2.91 all A B (element(B,powerset(powerset(A)))->element(complements_of_subsets(A,B),powerset(powerset(A)))).
% 2.72/2.91 $T.
% 2.72/2.91 all A exists B element(B,A).
% 2.72/2.91 all A (-empty(powerset(A))).
% 2.72/2.91 empty(empty_set).
% 2.72/2.91 all A B (-empty(ordered_pair(A,B))).
% 2.72/2.91 all A B (relation(A)&relation(B)->relation(set_union2(A,B))).
% 2.72/2.91 all A (-empty(singleton(A))).
% 2.72/2.91 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 2.72/2.91 all A B (-empty(unordered_pair(A,B))).
% 2.72/2.91 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 2.72/2.91 empty(empty_set).
% 2.72/2.91 relation(empty_set).
% 2.72/2.91 all A B (-empty(A)& -empty(B)-> -empty(cartesian_product2(A,B))).
% 2.72/2.91 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 2.72/2.91 all A (-empty(A)&relation(A)-> -empty(relation_rng(A))).
% 2.72/2.91 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 2.72/2.91 all A (empty(A)->empty(relation_rng(A))&relation(relation_rng(A))).
% 2.72/2.91 all A B (set_union2(A,A)=A).
% 2.72/2.91 all A B (set_intersection2(A,A)=A).
% 2.72/2.91 all A B (element(B,powerset(A))->subset_complement(A,subset_complement(A,B))=B).
% 2.72/2.91 all A (relation(A)->relation_inverse(relation_inverse(A))=A).
% 2.72/2.91 all A B (element(B,powerset(powerset(A)))->complements_of_subsets(A,complements_of_subsets(A,B))=B).
% 2.72/2.91 all A B (-proper_subset(A,A)).
% 2.72/2.91 all A (singleton(A)!=empty_set).
% 2.72/2.91 all A B (in(A,B)->set_union2(singleton(A),B)=B).
% 2.72/2.91 all A B (-(disjoint(singleton(A),B)&in(A,B))).
% 2.72/2.91 all A B (-in(A,B)->disjoint(singleton(A),B)).
% 2.72/2.91 all A B (subset(singleton(A),B)<->in(A,B)).
% 2.72/2.91 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 2.72/2.91 all A B (element(B,powerset(A))-> (all C (in(C,B)->in(C,A)))).
% 2.72/2.91 all A B C (subset(A,B)->in(C,A)|subset(A,set_difference(B,singleton(C)))).
% 2.72/2.91 all A B (subset(A,singleton(B))<->A=empty_set|A=singleton(B)).
% 2.72/2.91 all A B (in(A,B)->subset(A,union(B))).
% 2.72/2.91 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 2.72/2.91 all A B ((all C (in(C,A)->in(C,B)))->element(A,powerset(B))).
% 2.72/2.91 exists A (empty(A)&relation(A)).
% 2.72/2.91 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.72/2.91 exists A empty(A).
% 2.72/2.91 exists A (-empty(A)&relation(A)).
% 2.72/2.91 all A exists B (element(B,powerset(A))&empty(B)).
% 2.72/2.91 exists A (-empty(A)).
% 2.72/2.91 all A B (element(B,powerset(powerset(A)))->union_of_subsets(A,B)=union(B)).
% 2.72/2.91 all A B (element(B,powerset(powerset(A)))->meet_of_subsets(A,B)=set_meet(B)).
% 2.72/2.91 all A B C (element(B,powerset(A))&element(C,powerset(A))->subset_difference(A,B,C)=set_difference(B,C)).
% 2.72/2.91 all A B subset(A,A).
% 2.72/2.91 all A B (disjoint(A,B)->disjoint(B,A)).
% 2.72/2.91 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 2.72/2.91 all A B C D (-(unordered_pair(A,B)=unordered_pair(C,D)&A!=C&A!=D)).
% 2.72/2.91 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.72/2.91 all A B C D (subset(A,B)&subset(C,D)->subset(cartesian_product2(A,C),cartesian_product2(B,D))).
% 2.72/2.91 all A B (subset(A,B)->set_union2(A,B)=B).
% 2.72/2.91 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.72/2.91 all A B subset(set_intersection2(A,B),A).
% 2.72/2.91 all A B C (subset(A,B)&subset(A,C)->subset(A,set_intersection2(B,C))).
% 2.72/2.91 all A (set_union2(A,empty_set)=A).
% 2.72/2.91 all A B (in(A,B)->element(A,B)).
% 2.72/2.91 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 2.72/2.91 powerset(empty_set)=singleton(empty_set).
% 2.72/2.91 all A B C (relation(C)-> (in(ordered_pair(A,B),C)->in(A,relation_dom(C))&in(B,relation_rng(C)))).
% 2.72/2.91 all A (relation(A)->subset(A,cartesian_product2(relation_dom(A),relation_rng(A)))).
% 2.72/2.91 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.72/2.91 all A B C (subset(A,B)->subset(set_intersection2(A,C),set_intersection2(B,C))).
% 2.72/2.91 all A B (subset(A,B)->set_intersection2(A,B)=A).
% 2.72/2.91 all A (set_intersection2(A,empty_set)=empty_set).
% 2.72/2.91 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.72/2.91 all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 2.72/2.91 all A subset(empty_set,A).
% 2.72/2.91 all A B C (relation(C)-> (in(ordered_pair(A,B),C)->in(A,relation_field(C))&in(B,relation_field(C)))).
% 2.72/2.91 all A B C (subset(A,B)->subset(set_difference(A,C),set_difference(B,C))).
% 2.72/2.91 all A B C D (ordered_pair(A,B)=ordered_pair(C,D)->A=C&B=D).
% 2.72/2.91 all A B subset(set_difference(A,B),A).
% 2.72/2.91 all A (relation(A)->relation_rng(A)=relation_dom(relation_inverse(A))&relation_dom(A)=relation_rng(relation_inverse(A))).
% 2.72/2.91 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 2.72/2.91 all A B (subset(singleton(A),B)<->in(A,B)).
% 2.72/2.91 all A B C (subset(unordered_pair(A,B),C)<->in(A,C)&in(B,C)).
% 2.72/2.91 all A B (set_union2(A,set_difference(B,A))=set_union2(A,B)).
% 2.72/2.91 all A B (subset(A,singleton(B))<->A=empty_set|A=singleton(B)).
% 2.72/2.91 all A (set_difference(A,empty_set)=A).
% 2.72/2.91 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.72/2.91 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.72/2.91 all A (subset(A,empty_set)->A=empty_set).
% 2.72/2.91 all A B (set_difference(set_union2(A,B),B)=set_difference(A,B)).
% 2.72/2.91 all A B (element(B,powerset(A))-> (all C (element(C,powerset(A))-> (disjoint(B,C)<->subset(B,subset_complement(A,C)))))).
% 2.72/2.91 all A (relation(A)-> (all B (relation(B)->subset(relation_dom(relation_composition(A,B)),relation_dom(A))))).
% 2.72/2.91 all A (relation(A)-> (all B (relation(B)->subset(relation_rng(relation_composition(A,B)),relation_rng(B))))).
% 2.72/2.91 all A B (subset(A,B)->B=set_union2(A,set_difference(B,A))).
% 2.72/2.91 all A (relation(A)-> (all B (relation(B)-> (subset(relation_rng(A),relation_dom(B))->relation_dom(relation_composition(A,B))=relation_dom(A))))).
% 2.72/2.91 all A B (element(B,powerset(powerset(A)))-> -(B!=empty_set&complements_of_subsets(A,B)=empty_set)).
% 2.72/2.91 all A B (in(A,B)->set_union2(singleton(A),B)=B).
% 2.72/2.91 all A (relation(A)-> (all B (relation(B)-> (subset(relation_dom(A),relation_rng(B))->relation_rng(relation_composition(B,A))=relation_rng(A))))).
% 2.72/2.91 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.72/2.91 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.72/2.91 all A B (set_difference(A,set_difference(A,B))=set_intersection2(A,B)).
% 2.72/2.91 all A (set_difference(empty_set,A)=empty_set).
% 2.72/2.91 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.72/2.91 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.72/2.91 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.72/2.91 all A B C (element(C,powerset(A))-> -(in(B,subset_complement(A,C))&in(B,C))).
% 2.72/2.91 all A (relation(A)-> ((all B C (-in(ordered_pair(B,C),A)))->A=empty_set)).
% 2.72/2.91 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.72/2.91 relation_dom(empty_set)=empty_set.
% 2.72/2.91 relation_rng(empty_set)=empty_set.
% 2.72/2.91 all A B (-(subset(A,B)&proper_subset(B,A))).
% 2.72/2.91 all A B C (subset(A,B)&disjoint(B,C)->disjoint(A,C)).
% 2.72/2.91 all A (relation(A)-> (relation_dom(A)=empty_set|relation_rng(A)=empty_set->A=empty_set)).
% 2.72/2.91 all A (relation(A)-> (relation_dom(A)=empty_set<->relation_rng(A)=empty_set)).
% 2.72/2.91 all A B (set_difference(A,singleton(B))=A<-> -in(B,A)).
% 2.72/2.91 all A (unordered_pair(A,A)=singleton(A)).
% 2.72/2.91 all A (empty(A)->A=empty_set).
% 2.72/2.91 all A B (subset(singleton(A),singleton(B))->A=B).
% 2.72/2.91 -(all A (relation_dom(identity_relation(A))=A&relation_rng(identity_relation(A))=A)).
% 2.72/2.91 all A B (-(in(A,B)&empty(B))).
% 2.72/2.91 all A B subset(A,set_union2(A,B)).
% 2.72/2.91 all A B (disjoint(A,B)<->set_difference(A,B)=A).
% 2.72/2.91 all A B (-(empty(A)&A!=B&empty(B))).
% 2.72/2.91 all A B C (subset(A,B)&subset(C,B)->subset(set_union2(A,C),B)).
% 2.72/2.91 all A B C (singleton(A)=unordered_pair(B,C)->A=B).
% 2.72/2.91 all A B (in(A,B)->subset(A,union(B))).
% 2.72/2.91 all A (union(powerset(A))=A).
% 2.72/2.91 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.72/2.91 all A B C (singleton(A)=unordered_pair(B,C)->B=C).
% 2.72/2.91 end_of_list.
% 2.72/2.91
% 2.72/2.91 -------> usable clausifies to:
% 2.72/2.91
% 2.72/2.91 list(usable).
% 2.72/2.91 0 [] A=A.
% 2.72/2.91 0 [] -in(A,B)| -in(B,A).
% 2.72/2.91 0 [] -proper_subset(A,B)| -proper_subset(B,A).
% 2.72/2.91 0 [] -empty(A)|relation(A).
% 2.72/2.91 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.72/2.91 0 [] set_union2(A,B)=set_union2(B,A).
% 2.72/2.91 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.72/2.91 0 [] -relation(B)|B!=identity_relation(A)| -in(ordered_pair(C,D),B)|in(C,A).
% 2.72/2.91 0 [] -relation(B)|B!=identity_relation(A)| -in(ordered_pair(C,D),B)|C=D.
% 2.72/2.91 0 [] -relation(B)|B!=identity_relation(A)|in(ordered_pair(C,D),B)| -in(C,A)|C!=D.
% 2.72/2.91 0 [] -relation(B)|B=identity_relation(A)|in(ordered_pair($f2(A,B),$f1(A,B)),B)|in($f2(A,B),A).
% 2.72/2.91 0 [] -relation(B)|B=identity_relation(A)|in(ordered_pair($f2(A,B),$f1(A,B)),B)|$f2(A,B)=$f1(A,B).
% 2.72/2.91 0 [] -relation(B)|B=identity_relation(A)| -in(ordered_pair($f2(A,B),$f1(A,B)),B)| -in($f2(A,B),A)|$f2(A,B)!=$f1(A,B).
% 2.72/2.91 0 [] A!=B|subset(A,B).
% 2.72/2.91 0 [] A!=B|subset(B,A).
% 2.72/2.91 0 [] A=B| -subset(A,B)| -subset(B,A).
% 2.72/2.91 0 [] -relation(A)| -in(B,A)|B=ordered_pair($f4(A,B),$f3(A,B)).
% 2.72/2.91 0 [] relation(A)|in($f5(A),A).
% 2.72/2.91 0 [] relation(A)|$f5(A)!=ordered_pair(C,D).
% 2.72/2.91 0 [] A=empty_set|B!=set_meet(A)| -in(C,B)| -in(D,A)|in(C,D).
% 2.72/2.91 0 [] A=empty_set|B!=set_meet(A)|in(C,B)|in($f6(A,B,C),A).
% 2.72/2.91 0 [] A=empty_set|B!=set_meet(A)|in(C,B)| -in(C,$f6(A,B,C)).
% 2.72/2.91 0 [] A=empty_set|B=set_meet(A)|in($f8(A,B),B)| -in(X1,A)|in($f8(A,B),X1).
% 2.72/2.91 0 [] A=empty_set|B=set_meet(A)| -in($f8(A,B),B)|in($f7(A,B),A).
% 2.72/2.91 0 [] A=empty_set|B=set_meet(A)| -in($f8(A,B),B)| -in($f8(A,B),$f7(A,B)).
% 2.72/2.91 0 [] A!=empty_set|B!=set_meet(A)|B=empty_set.
% 2.72/2.91 0 [] A!=empty_set|B=set_meet(A)|B!=empty_set.
% 2.72/2.91 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 2.72/2.91 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 2.72/2.91 0 [] B=singleton(A)|in($f9(A,B),B)|$f9(A,B)=A.
% 2.72/2.91 0 [] B=singleton(A)| -in($f9(A,B),B)|$f9(A,B)!=A.
% 2.72/2.91 0 [] A!=empty_set| -in(B,A).
% 2.72/2.91 0 [] A=empty_set|in($f10(A),A).
% 2.72/2.91 0 [] B!=powerset(A)| -in(C,B)|subset(C,A).
% 2.72/2.91 0 [] B!=powerset(A)|in(C,B)| -subset(C,A).
% 2.72/2.91 0 [] B=powerset(A)|in($f11(A,B),B)|subset($f11(A,B),A).
% 2.72/2.91 0 [] B=powerset(A)| -in($f11(A,B),B)| -subset($f11(A,B),A).
% 2.72/2.91 0 [] empty(A)| -element(B,A)|in(B,A).
% 2.72/2.91 0 [] empty(A)|element(B,A)| -in(B,A).
% 2.72/2.91 0 [] -empty(A)| -element(B,A)|empty(B).
% 2.72/2.91 0 [] -empty(A)|element(B,A)| -empty(B).
% 2.72/2.91 0 [] C!=unordered_pair(A,B)| -in(D,C)|D=A|D=B.
% 2.72/2.91 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=A.
% 2.72/2.91 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=B.
% 2.72/2.91 0 [] C=unordered_pair(A,B)|in($f12(A,B,C),C)|$f12(A,B,C)=A|$f12(A,B,C)=B.
% 2.72/2.91 0 [] C=unordered_pair(A,B)| -in($f12(A,B,C),C)|$f12(A,B,C)!=A.
% 2.72/2.91 0 [] C=unordered_pair(A,B)| -in($f12(A,B,C),C)|$f12(A,B,C)!=B.
% 2.72/2.91 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 2.72/2.91 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 2.72/2.91 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 2.72/2.91 0 [] C=set_union2(A,B)|in($f13(A,B,C),C)|in($f13(A,B,C),A)|in($f13(A,B,C),B).
% 2.72/2.91 0 [] C=set_union2(A,B)| -in($f13(A,B,C),C)| -in($f13(A,B,C),A).
% 2.72/2.91 0 [] C=set_union2(A,B)| -in($f13(A,B,C),C)| -in($f13(A,B,C),B).
% 2.72/2.91 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f15(A,B,C,D),A).
% 2.72/2.91 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f14(A,B,C,D),B).
% 2.72/2.91 0 [] C!=cartesian_product2(A,B)| -in(D,C)|D=ordered_pair($f15(A,B,C,D),$f14(A,B,C,D)).
% 2.72/2.91 0 [] C!=cartesian_product2(A,B)|in(D,C)| -in(E,A)| -in(F,B)|D!=ordered_pair(E,F).
% 2.72/2.91 0 [] C=cartesian_product2(A,B)|in($f18(A,B,C),C)|in($f17(A,B,C),A).
% 2.72/2.91 0 [] C=cartesian_product2(A,B)|in($f18(A,B,C),C)|in($f16(A,B,C),B).
% 2.72/2.91 0 [] C=cartesian_product2(A,B)|in($f18(A,B,C),C)|$f18(A,B,C)=ordered_pair($f17(A,B,C),$f16(A,B,C)).
% 2.72/2.91 0 [] C=cartesian_product2(A,B)| -in($f18(A,B,C),C)| -in(X2,A)| -in(X3,B)|$f18(A,B,C)!=ordered_pair(X2,X3).
% 2.72/2.91 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.72/2.91 0 [] subset(A,B)|in($f19(A,B),A).
% 2.72/2.91 0 [] subset(A,B)| -in($f19(A,B),B).
% 2.72/2.91 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 2.72/2.91 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 2.72/2.91 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 2.72/2.91 0 [] C=set_intersection2(A,B)|in($f20(A,B,C),C)|in($f20(A,B,C),A).
% 2.72/2.91 0 [] C=set_intersection2(A,B)|in($f20(A,B,C),C)|in($f20(A,B,C),B).
% 2.72/2.91 0 [] C=set_intersection2(A,B)| -in($f20(A,B,C),C)| -in($f20(A,B,C),A)| -in($f20(A,B,C),B).
% 2.72/2.91 0 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f21(A,B,C)),A).
% 2.72/2.91 0 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 2.72/2.91 0 [] -relation(A)|B=relation_dom(A)|in($f23(A,B),B)|in(ordered_pair($f23(A,B),$f22(A,B)),A).
% 2.72/2.91 0 [] -relation(A)|B=relation_dom(A)| -in($f23(A,B),B)| -in(ordered_pair($f23(A,B),X4),A).
% 2.72/2.91 0 [] cast_to_subset(A)=A.
% 2.72/2.91 0 [] B!=union(A)| -in(C,B)|in(C,$f24(A,B,C)).
% 2.72/2.91 0 [] B!=union(A)| -in(C,B)|in($f24(A,B,C),A).
% 2.72/2.91 0 [] B!=union(A)|in(C,B)| -in(C,D)| -in(D,A).
% 2.72/2.91 0 [] B=union(A)|in($f26(A,B),B)|in($f26(A,B),$f25(A,B)).
% 2.72/2.91 0 [] B=union(A)|in($f26(A,B),B)|in($f25(A,B),A).
% 2.72/2.91 0 [] B=union(A)| -in($f26(A,B),B)| -in($f26(A,B),X5)| -in(X5,A).
% 2.72/2.91 0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 2.72/2.91 0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 2.72/2.91 0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 2.72/2.91 0 [] C=set_difference(A,B)|in($f27(A,B,C),C)|in($f27(A,B,C),A).
% 2.72/2.91 0 [] C=set_difference(A,B)|in($f27(A,B,C),C)| -in($f27(A,B,C),B).
% 2.72/2.91 0 [] C=set_difference(A,B)| -in($f27(A,B,C),C)| -in($f27(A,B,C),A)|in($f27(A,B,C),B).
% 2.72/2.91 0 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f28(A,B,C),C),A).
% 2.72/2.91 0 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 2.72/2.91 0 [] -relation(A)|B=relation_rng(A)|in($f30(A,B),B)|in(ordered_pair($f29(A,B),$f30(A,B)),A).
% 2.72/2.91 0 [] -relation(A)|B=relation_rng(A)| -in($f30(A,B),B)| -in(ordered_pair(X6,$f30(A,B)),A).
% 2.72/2.91 0 [] -element(B,powerset(A))|subset_complement(A,B)=set_difference(A,B).
% 2.72/2.91 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.72/2.91 0 [] -relation(A)|relation_field(A)=set_union2(relation_dom(A),relation_rng(A)).
% 2.72/2.91 0 [] -relation(A)| -relation(B)|B!=relation_inverse(A)| -in(ordered_pair(C,D),B)|in(ordered_pair(D,C),A).
% 2.72/2.91 0 [] -relation(A)| -relation(B)|B!=relation_inverse(A)|in(ordered_pair(C,D),B)| -in(ordered_pair(D,C),A).
% 2.72/2.91 0 [] -relation(A)| -relation(B)|B=relation_inverse(A)|in(ordered_pair($f32(A,B),$f31(A,B)),B)|in(ordered_pair($f31(A,B),$f32(A,B)),A).
% 2.72/2.91 0 [] -relation(A)| -relation(B)|B=relation_inverse(A)| -in(ordered_pair($f32(A,B),$f31(A,B)),B)| -in(ordered_pair($f31(A,B),$f32(A,B)),A).
% 2.72/2.91 0 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 2.72/2.91 0 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 2.72/2.91 0 [] -relation(A)| -relation(B)| -relation(C)|C!=relation_composition(A,B)| -in(ordered_pair(D,E),C)|in(ordered_pair(D,$f33(A,B,C,D,E)),A).
% 2.72/2.91 0 [] -relation(A)| -relation(B)| -relation(C)|C!=relation_composition(A,B)| -in(ordered_pair(D,E),C)|in(ordered_pair($f33(A,B,C,D,E),E),B).
% 2.72/2.91 0 [] -relation(A)| -relation(B)| -relation(C)|C!=relation_composition(A,B)|in(ordered_pair(D,E),C)| -in(ordered_pair(D,F),A)| -in(ordered_pair(F,E),B).
% 2.72/2.91 0 [] -relation(A)| -relation(B)| -relation(C)|C=relation_composition(A,B)|in(ordered_pair($f36(A,B,C),$f35(A,B,C)),C)|in(ordered_pair($f36(A,B,C),$f34(A,B,C)),A).
% 2.72/2.91 0 [] -relation(A)| -relation(B)| -relation(C)|C=relation_composition(A,B)|in(ordered_pair($f36(A,B,C),$f35(A,B,C)),C)|in(ordered_pair($f34(A,B,C),$f35(A,B,C)),B).
% 2.72/2.91 0 [] -relation(A)| -relation(B)| -relation(C)|C=relation_composition(A,B)| -in(ordered_pair($f36(A,B,C),$f35(A,B,C)),C)| -in(ordered_pair($f36(A,B,C),X7),A)| -in(ordered_pair(X7,$f35(A,B,C)),B).
% 2.72/2.91 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.72/2.91 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.72/2.91 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C=complements_of_subsets(A,B)|element($f37(A,B,C),powerset(A)).
% 2.72/2.91 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C=complements_of_subsets(A,B)|in($f37(A,B,C),C)|in(subset_complement(A,$f37(A,B,C)),B).
% 2.72/2.91 0 [] -element(B,powerset(powerset(A)))| -element(C,powerset(powerset(A)))|C=complements_of_subsets(A,B)| -in($f37(A,B,C),C)| -in(subset_complement(A,$f37(A,B,C)),B).
% 2.72/2.91 0 [] -proper_subset(A,B)|subset(A,B).
% 2.72/2.91 0 [] -proper_subset(A,B)|A!=B.
% 2.72/2.91 0 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] element(cast_to_subset(A),powerset(A)).
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] -element(B,powerset(A))|element(subset_complement(A,B),powerset(A)).
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] -relation(A)|relation(relation_inverse(A)).
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] -relation(A)| -relation(B)|relation(relation_composition(A,B)).
% 2.72/2.91 0 [] -element(B,powerset(powerset(A)))|element(union_of_subsets(A,B),powerset(A)).
% 2.72/2.91 0 [] relation(identity_relation(A)).
% 2.72/2.91 0 [] -element(B,powerset(powerset(A)))|element(meet_of_subsets(A,B),powerset(A)).
% 2.72/2.91 0 [] -element(B,powerset(A))| -element(C,powerset(A))|element(subset_difference(A,B,C),powerset(A)).
% 2.72/2.91 0 [] -element(B,powerset(powerset(A)))|element(complements_of_subsets(A,B),powerset(powerset(A))).
% 2.72/2.91 0 [] $T.
% 2.72/2.91 0 [] element($f38(A),A).
% 2.72/2.91 0 [] -empty(powerset(A)).
% 2.72/2.91 0 [] empty(empty_set).
% 2.72/2.91 0 [] -empty(ordered_pair(A,B)).
% 2.72/2.91 0 [] -relation(A)| -relation(B)|relation(set_union2(A,B)).
% 2.72/2.91 0 [] -empty(singleton(A)).
% 2.72/2.91 0 [] empty(A)| -empty(set_union2(A,B)).
% 2.72/2.91 0 [] -empty(unordered_pair(A,B)).
% 2.72/2.91 0 [] empty(A)| -empty(set_union2(B,A)).
% 2.72/2.91 0 [] empty(empty_set).
% 2.72/2.91 0 [] relation(empty_set).
% 2.72/2.91 0 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 2.72/2.91 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.72/2.91 0 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 2.72/2.91 0 [] -empty(A)|empty(relation_dom(A)).
% 2.72/2.91 0 [] -empty(A)|relation(relation_dom(A)).
% 2.72/2.91 0 [] -empty(A)|empty(relation_rng(A)).
% 2.72/2.91 0 [] -empty(A)|relation(relation_rng(A)).
% 2.72/2.91 0 [] set_union2(A,A)=A.
% 2.72/2.91 0 [] set_intersection2(A,A)=A.
% 2.72/2.91 0 [] -element(B,powerset(A))|subset_complement(A,subset_complement(A,B))=B.
% 2.72/2.91 0 [] -relation(A)|relation_inverse(relation_inverse(A))=A.
% 2.72/2.91 0 [] -element(B,powerset(powerset(A)))|complements_of_subsets(A,complements_of_subsets(A,B))=B.
% 2.72/2.91 0 [] -proper_subset(A,A).
% 2.72/2.91 0 [] singleton(A)!=empty_set.
% 2.72/2.91 0 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.72/2.91 0 [] -disjoint(singleton(A),B)| -in(A,B).
% 2.72/2.91 0 [] in(A,B)|disjoint(singleton(A),B).
% 2.72/2.91 0 [] -subset(singleton(A),B)|in(A,B).
% 2.72/2.91 0 [] subset(singleton(A),B)| -in(A,B).
% 2.72/2.91 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.72/2.91 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.72/2.91 0 [] -element(B,powerset(A))| -in(C,B)|in(C,A).
% 2.72/2.91 0 [] -subset(A,B)|in(C,A)|subset(A,set_difference(B,singleton(C))).
% 2.72/2.91 0 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.72/2.91 0 [] subset(A,singleton(B))|A!=empty_set.
% 2.72/2.91 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.72/2.91 0 [] -in(A,B)|subset(A,union(B)).
% 2.72/2.91 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.72/2.91 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.72/2.91 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.72/2.91 0 [] in($f39(A,B),A)|element(A,powerset(B)).
% 2.72/2.91 0 [] -in($f39(A,B),B)|element(A,powerset(B)).
% 2.72/2.91 0 [] empty($c1).
% 2.72/2.91 0 [] relation($c1).
% 2.72/2.91 0 [] empty(A)|element($f40(A),powerset(A)).
% 2.72/2.91 0 [] empty(A)| -empty($f40(A)).
% 2.72/2.91 0 [] empty($c2).
% 2.72/2.91 0 [] -empty($c3).
% 2.72/2.91 0 [] relation($c3).
% 2.72/2.91 0 [] element($f41(A),powerset(A)).
% 2.72/2.92 0 [] empty($f41(A)).
% 2.72/2.92 0 [] -empty($c4).
% 2.72/2.92 0 [] -element(B,powerset(powerset(A)))|union_of_subsets(A,B)=union(B).
% 2.72/2.92 0 [] -element(B,powerset(powerset(A)))|meet_of_subsets(A,B)=set_meet(B).
% 2.72/2.92 0 [] -element(B,powerset(A))| -element(C,powerset(A))|subset_difference(A,B,C)=set_difference(B,C).
% 2.72/2.92 0 [] subset(A,A).
% 2.72/2.92 0 [] -disjoint(A,B)|disjoint(B,A).
% 2.72/2.92 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.72/2.92 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.72/2.92 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.72/2.92 0 [] unordered_pair(A,B)!=unordered_pair(C,D)|A=C|A=D.
% 2.72/2.92 0 [] -subset(A,B)|subset(cartesian_product2(A,C),cartesian_product2(B,C)).
% 2.72/2.92 0 [] -subset(A,B)|subset(cartesian_product2(C,A),cartesian_product2(C,B)).
% 2.72/2.92 0 [] -subset(A,B)| -subset(C,D)|subset(cartesian_product2(A,C),cartesian_product2(B,D)).
% 2.72/2.92 0 [] -subset(A,B)|set_union2(A,B)=B.
% 2.72/2.92 0 [] in(A,$f42(A)).
% 2.72/2.92 0 [] -in(C,$f42(A))| -subset(D,C)|in(D,$f42(A)).
% 2.72/2.92 0 [] -in(X8,$f42(A))|in(powerset(X8),$f42(A)).
% 2.72/2.92 0 [] -subset(X9,$f42(A))|are_e_quipotent(X9,$f42(A))|in(X9,$f42(A)).
% 2.72/2.92 0 [] subset(set_intersection2(A,B),A).
% 2.72/2.92 0 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 2.72/2.92 0 [] set_union2(A,empty_set)=A.
% 2.72/2.92 0 [] -in(A,B)|element(A,B).
% 2.72/2.92 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.72/2.92 0 [] powerset(empty_set)=singleton(empty_set).
% 2.72/2.92 0 [] -relation(C)| -in(ordered_pair(A,B),C)|in(A,relation_dom(C)).
% 2.72/2.92 0 [] -relation(C)| -in(ordered_pair(A,B),C)|in(B,relation_rng(C)).
% 2.72/2.92 0 [] -relation(A)|subset(A,cartesian_product2(relation_dom(A),relation_rng(A))).
% 2.72/2.92 0 [] -relation(A)| -relation(B)| -subset(A,B)|subset(relation_dom(A),relation_dom(B)).
% 2.72/2.92 0 [] -relation(A)| -relation(B)| -subset(A,B)|subset(relation_rng(A),relation_rng(B)).
% 2.72/2.92 0 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 2.72/2.92 0 [] -subset(A,B)|set_intersection2(A,B)=A.
% 2.72/2.92 0 [] set_intersection2(A,empty_set)=empty_set.
% 2.72/2.92 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.72/2.92 0 [] in($f43(A,B),A)|in($f43(A,B),B)|A=B.
% 2.72/2.92 0 [] -in($f43(A,B),A)| -in($f43(A,B),B)|A=B.
% 2.72/2.92 0 [] subset(empty_set,A).
% 2.72/2.92 0 [] -relation(C)| -in(ordered_pair(A,B),C)|in(A,relation_field(C)).
% 2.72/2.92 0 [] -relation(C)| -in(ordered_pair(A,B),C)|in(B,relation_field(C)).
% 2.72/2.92 0 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 2.72/2.92 0 [] ordered_pair(A,B)!=ordered_pair(C,D)|A=C.
% 2.72/2.92 0 [] ordered_pair(A,B)!=ordered_pair(C,D)|B=D.
% 2.72/2.92 0 [] subset(set_difference(A,B),A).
% 2.72/2.92 0 [] -relation(A)|relation_rng(A)=relation_dom(relation_inverse(A)).
% 2.72/2.92 0 [] -relation(A)|relation_dom(A)=relation_rng(relation_inverse(A)).
% 2.72/2.92 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.72/2.92 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.72/2.92 0 [] -subset(singleton(A),B)|in(A,B).
% 2.72/2.92 0 [] subset(singleton(A),B)| -in(A,B).
% 2.72/2.92 0 [] -subset(unordered_pair(A,B),C)|in(A,C).
% 2.72/2.92 0 [] -subset(unordered_pair(A,B),C)|in(B,C).
% 2.72/2.92 0 [] subset(unordered_pair(A,B),C)| -in(A,C)| -in(B,C).
% 2.72/2.92 0 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.72/2.92 0 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.72/2.92 0 [] subset(A,singleton(B))|A!=empty_set.
% 2.72/2.92 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.72/2.92 0 [] set_difference(A,empty_set)=A.
% 2.72/2.92 0 [] -element(A,powerset(B))|subset(A,B).
% 2.72/2.92 0 [] element(A,powerset(B))| -subset(A,B).
% 2.72/2.92 0 [] disjoint(A,B)|in($f44(A,B),A).
% 2.72/2.92 0 [] disjoint(A,B)|in($f44(A,B),B).
% 2.72/2.92 0 [] -in(C,A)| -in(C,B)| -disjoint(A,B).
% 2.72/2.92 0 [] -subset(A,empty_set)|A=empty_set.
% 2.72/2.92 0 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.72/2.92 0 [] -element(B,powerset(A))| -element(C,powerset(A))| -disjoint(B,C)|subset(B,subset_complement(A,C)).
% 2.72/2.92 0 [] -element(B,powerset(A))| -element(C,powerset(A))|disjoint(B,C)| -subset(B,subset_complement(A,C)).
% 2.72/2.92 0 [] -relation(A)| -relation(B)|subset(relation_dom(relation_composition(A,B)),relation_dom(A)).
% 2.72/2.92 0 [] -relation(A)| -relation(B)|subset(relation_rng(relation_composition(A,B)),relation_rng(B)).
% 2.72/2.92 0 [] -subset(A,B)|B=set_union2(A,set_difference(B,A)).
% 2.72/2.92 0 [] -relation(A)| -relation(B)| -subset(relation_rng(A),relation_dom(B))|relation_dom(relation_composition(A,B))=relation_dom(A).
% 2.72/2.92 0 [] -element(B,powerset(powerset(A)))|B=empty_set|complements_of_subsets(A,B)!=empty_set.
% 2.72/2.92 0 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.72/2.92 0 [] -relation(A)| -relation(B)| -subset(relation_dom(A),relation_rng(B))|relation_rng(relation_composition(B,A))=relation_rng(A).
% 2.72/2.92 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.72/2.92 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.72/2.92 0 [] set_difference(A,set_difference(A,B))=set_intersection2(A,B).
% 2.72/2.92 0 [] set_difference(empty_set,A)=empty_set.
% 2.72/2.92 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.72/2.92 0 [] disjoint(A,B)|in($f45(A,B),set_intersection2(A,B)).
% 2.72/2.92 0 [] -in(C,set_intersection2(A,B))| -disjoint(A,B).
% 2.72/2.92 0 [] A=empty_set| -element(B,powerset(A))| -element(C,A)|in(C,B)|in(C,subset_complement(A,B)).
% 2.72/2.92 0 [] -element(C,powerset(A))| -in(B,subset_complement(A,C))| -in(B,C).
% 2.72/2.92 0 [] -relation(A)|in(ordered_pair($f47(A),$f46(A)),A)|A=empty_set.
% 2.72/2.92 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.72/2.92 0 [] relation_dom(empty_set)=empty_set.
% 2.72/2.92 0 [] relation_rng(empty_set)=empty_set.
% 2.72/2.92 0 [] -subset(A,B)| -proper_subset(B,A).
% 2.72/2.92 0 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 2.72/2.92 0 [] -relation(A)|relation_dom(A)!=empty_set|A=empty_set.
% 2.72/2.92 0 [] -relation(A)|relation_rng(A)!=empty_set|A=empty_set.
% 2.72/2.92 0 [] -relation(A)|relation_dom(A)!=empty_set|relation_rng(A)=empty_set.
% 2.72/2.92 0 [] -relation(A)|relation_dom(A)=empty_set|relation_rng(A)!=empty_set.
% 2.72/2.92 0 [] set_difference(A,singleton(B))!=A| -in(B,A).
% 2.72/2.92 0 [] set_difference(A,singleton(B))=A|in(B,A).
% 2.72/2.92 0 [] unordered_pair(A,A)=singleton(A).
% 2.72/2.92 0 [] -empty(A)|A=empty_set.
% 2.72/2.92 0 [] -subset(singleton(A),singleton(B))|A=B.
% 2.72/2.92 0 [] relation_dom(identity_relation($c5))!=$c5|relation_rng(identity_relation($c5))!=$c5.
% 2.72/2.92 0 [] -in(A,B)| -empty(B).
% 2.72/2.92 0 [] subset(A,set_union2(A,B)).
% 2.72/2.92 0 [] -disjoint(A,B)|set_difference(A,B)=A.
% 2.72/2.92 0 [] disjoint(A,B)|set_difference(A,B)!=A.
% 2.72/2.92 0 [] -empty(A)|A=B| -empty(B).
% 2.72/2.92 0 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 2.72/2.92 0 [] singleton(A)!=unordered_pair(B,C)|A=B.
% 2.72/2.92 0 [] -in(A,B)|subset(A,union(B)).
% 2.72/2.92 0 [] union(powerset(A))=A.
% 2.72/2.92 0 [] in(A,$f49(A)).
% 2.72/2.92 0 [] -in(C,$f49(A))| -subset(D,C)|in(D,$f49(A)).
% 2.72/2.92 0 [] -in(X10,$f49(A))|in($f48(A,X10),$f49(A)).
% 2.72/2.92 0 [] -in(X10,$f49(A))| -subset(E,X10)|in(E,$f48(A,X10)).
% 2.72/2.92 0 [] -subset(X11,$f49(A))|are_e_quipotent(X11,$f49(A))|in(X11,$f49(A)).
% 2.72/2.92 0 [] singleton(A)!=unordered_pair(B,C)|B=C.
% 2.72/2.92 end_of_list.
% 2.72/2.92
% 2.72/2.92 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 2.72/2.92
% 2.72/2.92 This ia a non-Horn set with equality. The strategy will be
% 2.72/2.92 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.72/2.92 deletion, with positive clauses in sos and nonpositive
% 2.72/2.92 clauses in usable.
% 2.72/2.92
% 2.72/2.92 dependent: set(knuth_bendix).
% 2.72/2.92 dependent: set(anl_eq).
% 2.72/2.92 dependent: set(para_from).
% 2.72/2.92 dependent: set(para_into).
% 2.72/2.92 dependent: clear(para_from_right).
% 2.72/2.92 dependent: clear(para_into_right).
% 2.72/2.92 dependent: set(para_from_vars).
% 2.72/2.92 dependent: set(eq_units_both_ways).
% 2.72/2.92 dependent: set(dynamic_demod_all).
% 2.72/2.92 dependent: set(dynamic_demod).
% 2.72/2.92 dependent: set(order_eq).
% 2.72/2.92 dependent: set(back_demod).
% 2.72/2.92 dependent: set(lrpo).
% 2.72/2.92 dependent: set(hyper_res).
% 2.72/2.92 dependent: set(unit_deletion).
% 2.72/2.92 dependent: set(factor).
% 2.72/2.92
% 2.72/2.92 ------------> process usable:
% 2.72/2.92 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.72/2.92 ** KEPT (pick-wt=6): 2 [] -proper_subset(A,B)| -proper_subset(B,A).
% 2.72/2.92 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 2.72/2.92 ** KEPT (pick-wt=14): 4 [] -relation(A)|A!=identity_relation(B)| -in(ordered_pair(C,D),A)|in(C,B).
% 2.72/2.92 ** KEPT (pick-wt=14): 5 [] -relation(A)|A!=identity_relation(B)| -in(ordered_pair(C,D),A)|C=D.
% 2.72/2.92 ** KEPT (pick-wt=17): 6 [] -relation(A)|A!=identity_relation(B)|in(ordered_pair(C,D),A)| -in(C,B)|C!=D.
% 2.72/2.92 ** KEPT (pick-wt=20): 7 [] -relation(A)|A=identity_relation(B)|in(ordered_pair($f2(B,A),$f1(B,A)),A)|in($f2(B,A),B).
% 2.72/2.92 ** KEPT (pick-wt=22): 8 [] -relation(A)|A=identity_relation(B)|in(ordered_pair($f2(B,A),$f1(B,A)),A)|$f2(B,A)=$f1(B,A).
% 2.72/2.92 ** KEPT (pick-wt=27): 9 [] -relation(A)|A=identity_relation(B)| -in(ordered_pair($f2(B,A),$f1(B,A)),A)| -in($f2(B,A),B)|$f2(B,A)!=$f1(B,A).
% 2.72/2.92 ** KEPT (pick-wt=6): 10 [] A!=B|subset(A,B).
% 2.72/2.92 ** KEPT (pick-wt=6): 11 [] A!=B|subset(B,A).
% 2.72/2.92 ** KEPT (pick-wt=9): 12 [] A=B| -subset(A,B)| -subset(B,A).
% 2.72/2.92 ** KEPT (pick-wt=14): 14 [copy,13,flip.3] -relation(A)| -in(B,A)|ordered_pair($f4(A,B),$f3(A,B))=B.
% 2.72/2.92 ** KEPT (pick-wt=8): 15 [] relation(A)|$f5(A)!=ordered_pair(B,C).
% 2.72/2.92 ** KEPT (pick-wt=16): 16 [] A=empty_set|B!=set_meet(A)| -in(C,B)| -in(D,A)|in(C,D).
% 2.72/2.92 ** KEPT (pick-wt=16): 17 [] A=empty_set|B!=set_meet(A)|in(C,B)|in($f6(A,B,C),A).
% 2.72/2.92 ** KEPT (pick-wt=16): 18 [] A=empty_set|B!=set_meet(A)|in(C,B)| -in(C,$f6(A,B,C)).
% 2.72/2.92 ** KEPT (pick-wt=20): 19 [] A=empty_set|B=set_meet(A)|in($f8(A,B),B)| -in(C,A)|in($f8(A,B),C).
% 2.72/2.92 ** KEPT (pick-wt=17): 20 [] A=empty_set|B=set_meet(A)| -in($f8(A,B),B)|in($f7(A,B),A).
% 2.72/2.92 ** KEPT (pick-wt=19): 21 [] A=empty_set|B=set_meet(A)| -in($f8(A,B),B)| -in($f8(A,B),$f7(A,B)).
% 2.72/2.92 ** KEPT (pick-wt=10): 22 [] A!=empty_set|B!=set_meet(A)|B=empty_set.
% 2.72/2.92 ** KEPT (pick-wt=10): 23 [] A!=empty_set|B=set_meet(A)|B!=empty_set.
% 2.72/2.92 ** KEPT (pick-wt=10): 24 [] A!=singleton(B)| -in(C,A)|C=B.
% 2.72/2.92 ** KEPT (pick-wt=10): 25 [] A!=singleton(B)|in(C,A)|C!=B.
% 2.72/2.92 ** KEPT (pick-wt=14): 26 [] A=singleton(B)| -in($f9(B,A),A)|$f9(B,A)!=B.
% 2.72/2.92 ** KEPT (pick-wt=6): 27 [] A!=empty_set| -in(B,A).
% 2.72/2.92 ** KEPT (pick-wt=10): 28 [] A!=powerset(B)| -in(C,A)|subset(C,B).
% 2.72/2.92 ** KEPT (pick-wt=10): 29 [] A!=powerset(B)|in(C,A)| -subset(C,B).
% 2.72/2.92 ** KEPT (pick-wt=14): 30 [] A=powerset(B)| -in($f11(B,A),A)| -subset($f11(B,A),B).
% 2.72/2.92 ** KEPT (pick-wt=8): 31 [] empty(A)| -element(B,A)|in(B,A).
% 2.72/2.92 ** KEPT (pick-wt=8): 32 [] empty(A)|element(B,A)| -in(B,A).
% 2.72/2.92 ** KEPT (pick-wt=7): 33 [] -empty(A)| -element(B,A)|empty(B).
% 2.72/2.92 ** KEPT (pick-wt=7): 34 [] -empty(A)|element(B,A)| -empty(B).
% 2.72/2.92 ** KEPT (pick-wt=14): 35 [] A!=unordered_pair(B,C)| -in(D,A)|D=B|D=C.
% 2.72/2.92 ** KEPT (pick-wt=11): 36 [] A!=unordered_pair(B,C)|in(D,A)|D!=B.
% 2.72/2.92 ** KEPT (pick-wt=11): 37 [] A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 2.72/2.92 ** KEPT (pick-wt=17): 38 [] A=unordered_pair(B,C)| -in($f12(B,C,A),A)|$f12(B,C,A)!=B.
% 2.72/2.92 ** KEPT (pick-wt=17): 39 [] A=unordered_pair(B,C)| -in($f12(B,C,A),A)|$f12(B,C,A)!=C.
% 2.72/2.92 ** KEPT (pick-wt=14): 40 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 2.72/2.92 ** KEPT (pick-wt=11): 41 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 2.72/2.92 ** KEPT (pick-wt=11): 42 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 2.72/2.92 ** KEPT (pick-wt=17): 43 [] A=set_union2(B,C)| -in($f13(B,C,A),A)| -in($f13(B,C,A),B).
% 2.72/2.92 ** KEPT (pick-wt=17): 44 [] A=set_union2(B,C)| -in($f13(B,C,A),A)| -in($f13(B,C,A),C).
% 2.72/2.92 ** KEPT (pick-wt=15): 45 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f15(B,C,A,D),B).
% 2.72/2.92 ** KEPT (pick-wt=15): 46 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f14(B,C,A,D),C).
% 2.72/2.92 ** KEPT (pick-wt=21): 48 [copy,47,flip.3] A!=cartesian_product2(B,C)| -in(D,A)|ordered_pair($f15(B,C,A,D),$f14(B,C,A,D))=D.
% 2.72/2.92 ** KEPT (pick-wt=19): 49 [] A!=cartesian_product2(B,C)|in(D,A)| -in(E,B)| -in(F,C)|D!=ordered_pair(E,F).
% 2.72/2.92 ** KEPT (pick-wt=25): 50 [] A=cartesian_product2(B,C)| -in($f18(B,C,A),A)| -in(D,B)| -in(E,C)|$f18(B,C,A)!=ordered_pair(D,E).
% 2.72/2.92 ** KEPT (pick-wt=9): 51 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.72/2.92 ** KEPT (pick-wt=8): 52 [] subset(A,B)| -in($f19(A,B),B).
% 2.72/2.92 ** KEPT (pick-wt=11): 53 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 2.72/2.92 ** KEPT (pick-wt=11): 54 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 2.72/2.92 ** KEPT (pick-wt=14): 55 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 2.72/2.92 ** KEPT (pick-wt=23): 56 [] A=set_intersection2(B,C)| -in($f20(B,C,A),A)| -in($f20(B,C,A),B)| -in($f20(B,C,A),C).
% 2.72/2.92 ** KEPT (pick-wt=17): 57 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f21(A,B,C)),A).
% 2.72/2.92 ** KEPT (pick-wt=14): 58 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 2.72/2.92 ** KEPT (pick-wt=20): 59 [] -relation(A)|B=relation_dom(A)|in($f23(A,B),B)|in(ordered_pair($f23(A,B),$f22(A,B)),A).
% 2.72/2.92 ** KEPT (pick-wt=18): 60 [] -relation(A)|B=relation_dom(A)| -in($f23(A,B),B)| -in(ordered_pair($f23(A,B),C),A).
% 2.72/2.92 ** KEPT (pick-wt=13): 61 [] A!=union(B)| -in(C,A)|in(C,$f24(B,A,C)).
% 2.72/2.92 ** KEPT (pick-wt=13): 62 [] A!=union(B)| -in(C,A)|in($f24(B,A,C),B).
% 2.72/2.92 ** KEPT (pick-wt=13): 63 [] A!=union(B)|in(C,A)| -in(C,D)| -in(D,B).
% 2.72/2.92 ** KEPT (pick-wt=17): 64 [] A=union(B)| -in($f26(B,A),A)| -in($f26(B,A),C)| -in(C,B).
% 2.72/2.92 ** KEPT (pick-wt=11): 65 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 2.72/2.92 ** KEPT (pick-wt=11): 66 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 2.72/2.92 ** KEPT (pick-wt=14): 67 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 2.72/2.92 ** KEPT (pick-wt=17): 68 [] A=set_difference(B,C)|in($f27(B,C,A),A)| -in($f27(B,C,A),C).
% 2.72/2.92 ** KEPT (pick-wt=23): 69 [] A=set_difference(B,C)| -in($f27(B,C,A),A)| -in($f27(B,C,A),B)|in($f27(B,C,A),C).
% 2.72/2.92 ** KEPT (pick-wt=17): 70 [] -relation(A)|B!=relation_rng(A)| -in(C,B)|in(ordered_pair($f28(A,B,C),C),A).
% 2.72/2.92 ** KEPT (pick-wt=14): 71 [] -relation(A)|B!=relation_rng(A)|in(C,B)| -in(ordered_pair(D,C),A).
% 2.72/2.92 ** KEPT (pick-wt=20): 72 [] -relation(A)|B=relation_rng(A)|in($f30(A,B),B)|in(ordered_pair($f29(A,B),$f30(A,B)),A).
% 2.72/2.92 ** KEPT (pick-wt=18): 73 [] -relation(A)|B=relation_rng(A)| -in($f30(A,B),B)| -in(ordered_pair(C,$f30(A,B)),A).
% 2.72/2.92 ** KEPT (pick-wt=11): 74 [] -element(A,powerset(B))|subset_complement(B,A)=set_difference(B,A).
% 2.72/2.92 ** KEPT (pick-wt=10): 76 [copy,75,flip.2] -relation(A)|set_union2(relation_dom(A),relation_rng(A))=relation_field(A).
% 2.72/2.92 ** KEPT (pick-wt=18): 77 [] -relation(A)| -relation(B)|B!=relation_inverse(A)| -in(ordered_pair(C,D),B)|in(ordered_pair(D,C),A).
% 2.72/2.92 ** KEPT (pick-wt=18): 78 [] -relation(A)| -relation(B)|B!=relation_inverse(A)|in(ordered_pair(C,D),B)| -in(ordered_pair(D,C),A).
% 2.72/2.92 ** KEPT (pick-wt=26): 79 [] -relation(A)| -relation(B)|B=relation_inverse(A)|in(ordered_pair($f32(A,B),$f31(A,B)),B)|in(ordered_pair($f31(A,B),$f32(A,B)),A).
% 2.72/2.92 ** KEPT (pick-wt=26): 80 [] -relation(A)| -relation(B)|B=relation_inverse(A)| -in(ordered_pair($f32(A,B),$f31(A,B)),B)| -in(ordered_pair($f31(A,B),$f32(A,B)),A).
% 2.72/2.92 ** KEPT (pick-wt=8): 81 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 2.72/2.92 ** KEPT (pick-wt=8): 82 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 2.72/2.92 ** KEPT (pick-wt=26): 83 [] -relation(A)| -relation(B)| -relation(C)|C!=relation_composition(A,B)| -in(ordered_pair(D,E),C)|in(ordered_pair(D,$f33(A,B,C,D,E)),A).
% 2.72/2.92 ** KEPT (pick-wt=26): 84 [] -relation(A)| -relation(B)| -relation(C)|C!=relation_composition(A,B)| -in(ordered_pair(D,E),C)|in(ordered_pair($f33(A,B,C,D,E),E),B).
% 2.72/2.92 ** KEPT (pick-wt=26): 85 [] -relation(A)| -relation(B)| -relation(C)|C!=relation_composition(A,B)|in(ordered_pair(D,E),C)| -in(ordered_pair(D,F),A)| -in(ordered_pair(F,E),B).
% 2.72/2.92 ** KEPT (pick-wt=33): 86 [] -relation(A)| -relation(B)| -relation(C)|C=relation_composition(A,B)|in(ordered_pair($f36(A,B,C),$f35(A,B,C)),C)|in(ordered_pair($f36(A,B,C),$f34(A,B,C)),A).
% 2.72/2.92 ** KEPT (pick-wt=33): 87 [] -relation(A)| -relation(B)| -relation(C)|C=relation_composition(A,B)|in(ordered_pair($f36(A,B,C),$f35(A,B,C)),C)|in(ordered_pair($f34(A,B,C),$f35(A,B,C)),B).
% 2.72/2.92 ** KEPT (pick-wt=38): 88 [] -relation(A)| -relation(B)| -relation(C)|C=relation_composition(A,B)| -in(ordered_pair($f36(A,B,C),$f35(A,B,C)),C)| -in(ordered_pair($f36(A,B,C),D),A)| -in(ordered_pair(D,$f35(A,B,C)),B).
% 2.72/2.92 ** KEPT (pick-wt=27): 89 [] -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.72/2.92 ** KEPT (pick-wt=27): 90 [] -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.72/2.92 ** KEPT (pick-wt=22): 91 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C=complements_of_subsets(B,A)|element($f37(B,A,C),powerset(B)).
% 2.72/2.92 ** KEPT (pick-wt=29): 92 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C=complements_of_subsets(B,A)|in($f37(B,A,C),C)|in(subset_complement(B,$f37(B,A,C)),A).
% 2.72/2.92 ** KEPT (pick-wt=29): 93 [] -element(A,powerset(powerset(B)))| -element(C,powerset(powerset(B)))|C=complements_of_subsets(B,A)| -in($f37(B,A,C),C)| -in(subset_complement(B,$f37(B,A,C)),A).
% 2.72/2.92 ** KEPT (pick-wt=6): 94 [] -proper_subset(A,B)|subset(A,B).
% 2.72/2.92 ** KEPT (pick-wt=6): 95 [] -proper_subset(A,B)|A!=B.
% 2.72/2.92 ** KEPT (pick-wt=9): 96 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 2.72/2.92 ** KEPT (pick-wt=10): 97 [] -element(A,powerset(B))|element(subset_complement(B,A),powerset(B)).
% 2.72/2.92 ** KEPT (pick-wt=5): 98 [] -relation(A)|relation(relation_inverse(A)).
% 2.72/2.92 ** KEPT (pick-wt=8): 99 [] -relation(A)| -relation(B)|relation(relation_composition(A,B)).
% 2.79/2.92 ** KEPT (pick-wt=11): 100 [] -element(A,powerset(powerset(B)))|element(union_of_subsets(B,A),powerset(B)).
% 2.79/2.92 ** KEPT (pick-wt=11): 101 [] -element(A,powerset(powerset(B)))|element(meet_of_subsets(B,A),powerset(B)).
% 2.79/2.92 ** KEPT (pick-wt=15): 102 [] -element(A,powerset(B))| -element(C,powerset(B))|element(subset_difference(B,A,C),powerset(B)).
% 2.79/2.92 ** KEPT (pick-wt=12): 103 [] -element(A,powerset(powerset(B)))|element(complements_of_subsets(B,A),powerset(powerset(B))).
% 2.79/2.92 ** KEPT (pick-wt=3): 104 [] -empty(powerset(A)).
% 2.79/2.92 ** KEPT (pick-wt=4): 105 [] -empty(ordered_pair(A,B)).
% 2.79/2.92 ** KEPT (pick-wt=8): 106 [] -relation(A)| -relation(B)|relation(set_union2(A,B)).
% 2.79/2.92 ** KEPT (pick-wt=3): 107 [] -empty(singleton(A)).
% 2.79/2.92 ** KEPT (pick-wt=6): 108 [] empty(A)| -empty(set_union2(A,B)).
% 2.79/2.92 ** KEPT (pick-wt=4): 109 [] -empty(unordered_pair(A,B)).
% 2.79/2.92 ** KEPT (pick-wt=6): 110 [] empty(A)| -empty(set_union2(B,A)).
% 2.79/2.92 ** KEPT (pick-wt=8): 111 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 2.79/2.92 ** KEPT (pick-wt=7): 112 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.79/2.92 ** KEPT (pick-wt=7): 113 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 2.79/2.92 ** KEPT (pick-wt=5): 114 [] -empty(A)|empty(relation_dom(A)).
% 2.79/2.92 ** KEPT (pick-wt=5): 115 [] -empty(A)|relation(relation_dom(A)).
% 2.79/2.92 ** KEPT (pick-wt=5): 116 [] -empty(A)|empty(relation_rng(A)).
% 2.79/2.92 ** KEPT (pick-wt=5): 117 [] -empty(A)|relation(relation_rng(A)).
% 2.79/2.92 ** KEPT (pick-wt=11): 118 [] -element(A,powerset(B))|subset_complement(B,subset_complement(B,A))=A.
% 2.79/2.92 ** KEPT (pick-wt=7): 119 [] -relation(A)|relation_inverse(relation_inverse(A))=A.
% 2.79/2.92 ** KEPT (pick-wt=12): 120 [] -element(A,powerset(powerset(B)))|complements_of_subsets(B,complements_of_subsets(B,A))=A.
% 2.79/2.92 ** KEPT (pick-wt=3): 121 [] -proper_subset(A,A).
% 2.79/2.92 ** KEPT (pick-wt=4): 122 [] singleton(A)!=empty_set.
% 2.79/2.92 ** KEPT (pick-wt=9): 123 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.79/2.92 ** KEPT (pick-wt=7): 124 [] -disjoint(singleton(A),B)| -in(A,B).
% 2.79/2.92 ** KEPT (pick-wt=7): 125 [] -subset(singleton(A),B)|in(A,B).
% 2.79/2.93 ** KEPT (pick-wt=7): 126 [] subset(singleton(A),B)| -in(A,B).
% 2.79/2.93 ** KEPT (pick-wt=8): 127 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.79/2.93 ** KEPT (pick-wt=8): 128 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.79/2.93 ** KEPT (pick-wt=10): 129 [] -element(A,powerset(B))| -in(C,A)|in(C,B).
% 2.79/2.93 ** KEPT (pick-wt=12): 130 [] -subset(A,B)|in(C,A)|subset(A,set_difference(B,singleton(C))).
% 2.79/2.93 ** KEPT (pick-wt=11): 131 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.79/2.93 ** KEPT (pick-wt=7): 132 [] subset(A,singleton(B))|A!=empty_set.
% 2.79/2.93 Following clause subsumed by 10 during input processing: 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.79/2.93 ** KEPT (pick-wt=7): 133 [] -in(A,B)|subset(A,union(B)).
% 2.79/2.93 ** KEPT (pick-wt=10): 134 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.79/2.93 ** KEPT (pick-wt=10): 135 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.79/2.93 ** KEPT (pick-wt=13): 136 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.79/2.93 ** KEPT (pick-wt=9): 137 [] -in($f39(A,B),B)|element(A,powerset(B)).
% 2.79/2.93 ** KEPT (pick-wt=5): 138 [] empty(A)| -empty($f40(A)).
% 2.79/2.93 ** KEPT (pick-wt=2): 139 [] -empty($c3).
% 2.79/2.93 ** KEPT (pick-wt=2): 140 [] -empty($c4).
% 2.79/2.93 ** KEPT (pick-wt=11): 141 [] -element(A,powerset(powerset(B)))|union_of_subsets(B,A)=union(A).
% 2.79/2.93 ** KEPT (pick-wt=11): 142 [] -element(A,powerset(powerset(B)))|meet_of_subsets(B,A)=set_meet(A).
% 2.79/2.93 ** KEPT (pick-wt=16): 143 [] -element(A,powerset(B))| -element(C,powerset(B))|subset_difference(B,A,C)=set_difference(A,C).
% 2.79/2.93 ** KEPT (pick-wt=6): 144 [] -disjoint(A,B)|disjoint(B,A).
% 2.79/2.93 Following clause subsumed by 134 during input processing: 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.79/2.93 Following clause subsumed by 135 during input processing: 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.79/2.93 Following clause subsumed by 136 during input processing: 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.79/2.93 ** KEPT (pick-wt=13): 145 [] unordered_pair(A,B)!=unordered_pair(C,D)|A=C|A=D.
% 2.79/2.93 ** KEPT (pick-wt=10): 146 [] -subset(A,B)|subset(cartesian_product2(A,C),cartesian_product2(B,C)).
% 2.79/2.93 ** KEPT (pick-wt=10): 147 [] -subset(A,B)|subset(cartesian_product2(C,A),cartesian_product2(C,B)).
% 2.79/2.93 ** KEPT (pick-wt=13): 148 [] -subset(A,B)| -subset(C,D)|subset(cartesian_product2(A,C),cartesian_product2(B,D)).
% 2.79/2.93 ** KEPT (pick-wt=8): 149 [] -subset(A,B)|set_union2(A,B)=B.
% 2.79/2.93 ** KEPT (pick-wt=11): 150 [] -in(A,$f42(B))| -subset(C,A)|in(C,$f42(B)).
% 2.79/2.93 ** KEPT (pick-wt=9): 151 [] -in(A,$f42(B))|in(powerset(A),$f42(B)).
% 2.79/2.93 ** KEPT (pick-wt=12): 152 [] -subset(A,$f42(B))|are_e_quipotent(A,$f42(B))|in(A,$f42(B)).
% 2.79/2.93 ** KEPT (pick-wt=11): 153 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 2.79/2.93 ** KEPT (pick-wt=6): 154 [] -in(A,B)|element(A,B).
% 2.79/2.93 ** KEPT (pick-wt=9): 155 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.79/2.93 ** KEPT (pick-wt=11): 156 [] -relation(A)| -in(ordered_pair(B,C),A)|in(B,relation_dom(A)).
% 2.79/2.93 ** KEPT (pick-wt=11): 157 [] -relation(A)| -in(ordered_pair(B,C),A)|in(C,relation_rng(A)).
% 2.79/2.93 ** KEPT (pick-wt=9): 158 [] -relation(A)|subset(A,cartesian_product2(relation_dom(A),relation_rng(A))).
% 2.79/2.93 ** KEPT (pick-wt=12): 159 [] -relation(A)| -relation(B)| -subset(A,B)|subset(relation_dom(A),relation_dom(B)).
% 2.79/2.93 ** KEPT (pick-wt=12): 160 [] -relation(A)| -relation(B)| -subset(A,B)|subset(relation_rng(A),relation_rng(B)).
% 2.79/2.93 ** KEPT (pick-wt=10): 161 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 2.79/2.93 ** KEPT (pick-wt=8): 162 [] -subset(A,B)|set_intersection2(A,B)=A.
% 2.79/2.93 Following clause subsumed by 31 during input processing: 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.79/2.93 ** KEPT (pick-wt=13): 163 [] -in($f43(A,B),A)| -in($f43(A,B),B)|A=B.
% 2.79/2.93 ** KEPT (pick-wt=11): 164 [] -relation(A)| -in(ordered_pair(B,C),A)|in(B,relation_field(A)).
% 2.79/2.93 ** KEPT (pick-wt=11): 165 [] -relation(A)| -in(ordered_pair(B,C),A)|in(C,relation_field(A)).
% 2.79/2.93 ** KEPT (pick-wt=10): 166 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 2.79/2.93 ** KEPT (pick-wt=10): 167 [] ordered_pair(A,B)!=ordered_pair(C,D)|A=C.
% 2.79/2.93 ** KEPT (pick-wt=10): 168 [] ordered_pair(A,B)!=ordered_pair(C,D)|B=D.
% 2.79/2.93 ** KEPT (pick-wt=8): 169 [] -relation(A)|relation_rng(A)=relation_dom(relation_inverse(A)).
% 2.79/2.94 ** KEPT (pick-wt=8): 171 [copy,170,flip.2] -relation(A)|relation_rng(relation_inverse(A))=relation_dom(A).
% 2.79/2.94 Following clause subsumed by 127 during input processing: 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.79/2.94 Following clause subsumed by 128 during input processing: 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.79/2.94 Following clause subsumed by 125 during input processing: 0 [] -subset(singleton(A),B)|in(A,B).
% 2.79/2.94 Following clause subsumed by 126 during input processing: 0 [] subset(singleton(A),B)| -in(A,B).
% 2.79/2.94 ** KEPT (pick-wt=8): 172 [] -subset(unordered_pair(A,B),C)|in(A,C).
% 2.79/2.94 ** KEPT (pick-wt=8): 173 [] -subset(unordered_pair(A,B),C)|in(B,C).
% 2.79/2.94 ** KEPT (pick-wt=11): 174 [] subset(unordered_pair(A,B),C)| -in(A,C)| -in(B,C).
% 2.79/2.94 Following clause subsumed by 131 during input processing: 0 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.79/2.94 Following clause subsumed by 132 during input processing: 0 [] subset(A,singleton(B))|A!=empty_set.
% 2.79/2.94 Following clause subsumed by 10 during input processing: 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.79/2.94 ** KEPT (pick-wt=7): 175 [] -element(A,powerset(B))|subset(A,B).
% 2.79/2.94 ** KEPT (pick-wt=7): 176 [] element(A,powerset(B))| -subset(A,B).
% 2.79/2.94 ** KEPT (pick-wt=9): 177 [] -in(A,B)| -in(A,C)| -disjoint(B,C).
% 2.79/2.94 ** KEPT (pick-wt=6): 178 [] -subset(A,empty_set)|A=empty_set.
% 2.79/2.94 ** KEPT (pick-wt=16): 179 [] -element(A,powerset(B))| -element(C,powerset(B))| -disjoint(A,C)|subset(A,subset_complement(B,C)).
% 2.79/2.94 ** KEPT (pick-wt=16): 180 [] -element(A,powerset(B))| -element(C,powerset(B))|disjoint(A,C)| -subset(A,subset_complement(B,C)).
% 2.79/2.94 ** KEPT (pick-wt=11): 181 [] -relation(A)| -relation(B)|subset(relation_dom(relation_composition(A,B)),relation_dom(A)).
% 2.79/2.94 ** KEPT (pick-wt=11): 182 [] -relation(A)| -relation(B)|subset(relation_rng(relation_composition(A,B)),relation_rng(B)).
% 2.79/2.94 ** KEPT (pick-wt=10): 184 [copy,183,flip.2] -subset(A,B)|set_union2(A,set_difference(B,A))=B.
% 2.79/2.94 ** KEPT (pick-wt=16): 185 [] -relation(A)| -relation(B)| -subset(relation_rng(A),relation_dom(B))|relation_dom(relation_composition(A,B))=relation_dom(A).
% 2.79/2.94 ** KEPT (pick-wt=13): 186 [] -element(A,powerset(powerset(B)))|A=empty_set|complements_of_subsets(B,A)!=empty_set.
% 2.79/2.94 Following clause subsumed by 123 during input processing: 0 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.79/2.94 ** KEPT (pick-wt=16): 187 [] -relation(A)| -relation(B)| -subset(relation_dom(A),relation_rng(B))|relation_rng(relation_composition(B,A))=relation_rng(A).
% 2.79/2.94 ** KEPT (pick-wt=21): 188 [] -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.79/2.94 ** KEPT (pick-wt=21): 189 [] -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.79/2.94 ** KEPT (pick-wt=10): 190 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.79/2.94 ** KEPT (pick-wt=8): 191 [] -in(A,set_intersection2(B,C))| -disjoint(B,C).
% 2.79/2.94 ** KEPT (pick-wt=18): 192 [] A=empty_set| -element(B,powerset(A))| -element(C,A)|in(C,B)|in(C,subset_complement(A,B)).
% 2.79/2.94 ** KEPT (pick-wt=12): 193 [] -element(A,powerset(B))| -in(C,subset_complement(B,A))| -in(C,A).
% 2.79/2.94 ** KEPT (pick-wt=12): 194 [] -relation(A)|in(ordered_pair($f47(A),$f46(A)),A)|A=empty_set.
% 2.79/2.94 ** KEPT (pick-wt=9): 195 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.79/2.94 ** KEPT (pick-wt=6): 196 [] -subset(A,B)| -proper_subset(B,A).
% 2.79/2.94 ** KEPT (pick-wt=9): 197 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 2.79/2.94 ** KEPT (pick-wt=9): 198 [] -relation(A)|relation_dom(A)!=empty_set|A=empty_set.
% 2.79/2.94 ** KEPT (pick-wt=9): 199 [] -relation(A)|relation_rng(A)!=empty_set|A=empty_set.
% 2.79/2.94 ** KEPT (pick-wt=10): 200 [] -relation(A)|relation_dom(A)!=empty_set|relation_rng(A)=empty_set.
% 2.79/2.94 ** KEPT (pick-wt=10): 201 [] -relation(A)|relation_dom(A)=empty_set|relation_rng(A)!=empty_set.
% 2.79/2.94 ** KEPT (pick-wt=9): 202 [] set_difference(A,singleton(B))!=A| -in(B,A).
% 2.79/2.94 ** KEPT (pick-wt=5): 203 [] -empty(A)|A=empty_set.
% 2.79/2.94 ** KEPT (pick-wt=8): 204 [] -subset(singleton(A),singleton(B))|A=B.
% 2.79/2.94 ** KEPT (pick-wt=10): 205 [] relation_dom(identity_relation($c5))!=$c5|relation_rng(identity_relation($c5))!=$c5.
% 2.79/2.94 ** KEPT (pick-wt=5): 206 [] -in(A,B)| -empty(B).
% 2.79/2.94 ** KEPT (pick-wt=8): 207 [] -disjoint(A,B)|set_difference(A,B)=A.
% 2.79/2.94 ** KEPT (pick-wt=8): 208 [] disjoint(A,B)|set_difference(A,B)!=A.
% 2.79/2.94 ** KEPT (pick-wt=7): 209 [] -empty(A)|A=B| -empty(B).
% 2.79/2.94 ** KEPT (pick-wt=11): 210 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 2.79/2.94 ** KEPT (pick-wt=9): 211 [] singleton(A)!=unordered_pair(B,C)|A=B.
% 2.79/2.94 Following clause subsumed by 133 during input processing: 0 [] -in(A,B)|subset(A,union(B)).
% 2.79/2.94 ** KEPT (pick-wt=11): 212 [] -in(A,$f49(B))| -subset(C,A)|in(C,$f49(B)).
% 2.79/2.94 ** KEPT (pick-wt=10): 213 [] -in(A,$f49(B))|in($f48(B,A),$f49(B)).
% 2.79/2.94 ** KEPT (pick-wt=12): 214 [] -in(A,$f49(B))| -subset(C,A)|in(C,$f48(B,A)).
% 2.79/2.94 ** KEPT (pick-wt=12): 215 [] -subset(A,$f49(B))|are_e_quipotent(A,$f49(B))|in(A,$f49(B)).
% 2.79/2.94 ** KEPT (pick-wt=9): 216 [] singleton(A)!=unordered_pair(B,C)|B=C.
% 2.79/2.94 154 back subsumes 32.
% 2.79/2.94
% 2.79/2.94 ------------> process sos:
% 2.79/2.94 ** KEPT (pick-wt=3): 301 [] A=A.
% 2.79/2.94 ** KEPT (pick-wt=7): 302 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.79/2.94 ** KEPT (pick-wt=7): 303 [] set_union2(A,B)=set_union2(B,A).
% 2.79/2.94 ** KEPT (pick-wt=7): 304 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.79/2.94 ** KEPT (pick-wt=6): 305 [] relation(A)|in($f5(A),A).
% 2.79/2.94 ** KEPT (pick-wt=14): 306 [] A=singleton(B)|in($f9(B,A),A)|$f9(B,A)=B.
% 2.79/2.94 ** KEPT (pick-wt=7): 307 [] A=empty_set|in($f10(A),A).
% 2.79/2.94 ** KEPT (pick-wt=14): 308 [] A=powerset(B)|in($f11(B,A),A)|subset($f11(B,A),B).
% 2.79/2.94 ** KEPT (pick-wt=23): 309 [] A=unordered_pair(B,C)|in($f12(B,C,A),A)|$f12(B,C,A)=B|$f12(B,C,A)=C.
% 2.79/2.94 ** KEPT (pick-wt=23): 310 [] A=set_union2(B,C)|in($f13(B,C,A),A)|in($f13(B,C,A),B)|in($f13(B,C,A),C).
% 2.79/2.94 ** KEPT (pick-wt=17): 311 [] A=cartesian_product2(B,C)|in($f18(B,C,A),A)|in($f17(B,C,A),B).
% 2.79/2.94 ** KEPT (pick-wt=17): 312 [] A=cartesian_product2(B,C)|in($f18(B,C,A),A)|in($f16(B,C,A),C).
% 2.79/2.94 ** KEPT (pick-wt=25): 314 [copy,313,flip.3] A=cartesian_product2(B,C)|in($f18(B,C,A),A)|ordered_pair($f17(B,C,A),$f16(B,C,A))=$f18(B,C,A).
% 2.79/2.94 ** KEPT (pick-wt=8): 315 [] subset(A,B)|in($f19(A,B),A).
% 2.79/2.94 ** KEPT (pick-wt=17): 316 [] A=set_intersection2(B,C)|in($f20(B,C,A),A)|in($f20(B,C,A),B).
% 2.79/2.94 ** KEPT (pick-wt=17): 317 [] A=set_intersection2(B,C)|in($f20(B,C,A),A)|in($f20(B,C,A),C).
% 2.79/2.94 ** KEPT (pick-wt=4): 318 [] cast_to_subset(A)=A.
% 2.79/2.94 ---> New Demodulator: 319 [new_demod,318] cast_to_subset(A)=A.
% 2.79/2.94 ** KEPT (pick-wt=16): 320 [] A=union(B)|in($f26(B,A),A)|in($f26(B,A),$f25(B,A)).
% 2.79/2.94 ** KEPT (pick-wt=14): 321 [] A=union(B)|in($f26(B,A),A)|in($f25(B,A),B).
% 2.79/2.94 ** KEPT (pick-wt=17): 322 [] A=set_difference(B,C)|in($f27(B,C,A),A)|in($f27(B,C,A),B).
% 2.79/2.94 ** KEPT (pick-wt=10): 324 [copy,323,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.79/2.94 ---> New Demodulator: 325 [new_demod,324] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.79/2.94 ** KEPT (pick-wt=4): 327 [copy,326,demod,319] element(A,powerset(A)).
% 2.79/2.94 ** KEPT (pick-wt=3): 328 [] relation(identity_relation(A)).
% 2.79/2.94 ** KEPT (pick-wt=4): 329 [] element($f38(A),A).
% 2.79/2.94 ** KEPT (pick-wt=2): 330 [] empty(empty_set).
% 2.79/2.94 Following clause subsumed by 330 during input processing: 0 [] empty(empty_set).
% 2.79/2.94 ** KEPT (pick-wt=2): 331 [] relation(empty_set).
% 2.79/2.94 ** KEPT (pick-wt=5): 332 [] set_union2(A,A)=A.
% 2.79/2.94 ---> New Demodulator: 333 [new_demod,332] set_union2(A,A)=A.
% 2.79/2.94 ** KEPT (pick-wt=5): 334 [] set_intersection2(A,A)=A.
% 2.79/2.94 ---> New Demodulator: 335 [new_demod,334] set_intersection2(A,A)=A.
% 2.79/2.94 ** KEPT (pick-wt=7): 336 [] in(A,B)|disjoint(singleton(A),B).
% 2.79/2.94 ** KEPT (pick-wt=9): 337 [] in($f39(A,B),A)|element(A,powerset(B)).
% 2.79/2.94 ** KEPT (pick-wt=2): 338 [] empty($c1).
% 2.79/2.94 ** KEPT (pick-wt=2): 339 [] relation($c1).
% 2.79/2.94 ** KEPT (pick-wt=7): 340 [] empty(A)|element($f40(A),powerset(A)).
% 2.79/2.94 ** KEPT (pick-wt=2): 341 [] empty($c2).
% 2.79/2.94 ** KEPT (pick-wt=2): 342 [] relation($c3).
% 2.79/2.94 ** KEPT (pick-wt=5): 343 [] element($f41(A),powerset(A)).
% 2.79/2.94 ** KEPT (pick-wt=3): 344 [] empty($f41(A)).
% 2.79/2.94 ** KEPT (pick-wt=3): 345 [] subset(A,A).
% 2.79/2.94 ** KEPT (pick-wt=4): 346 [] in(A,$f42(A)).
% 2.79/2.94 ** KEPT (pick-wt=5): 347 [] subset(set_intersection2(A,B),A).
% 2.79/2.94 ** KEPT (pick-wt=5): 348 [] set_union2(A,empty_set)=A.
% 2.79/2.94 ---> New Demodulator: 349 [new_demod,348] set_union2(A,empty_set)=A.
% 2.79/2.94 ** KEPT (pick-wt=5): 351 [copy,350,flip.1] singleton(empty_set)=powerset(empty_set).
% 2.79/2.94 ---> New Demodulator: 352 [new_demod,351] singleton(empty_set)=powerset(empty_set).
% 2.79/2.94 ** KEPT (pick-wt=5): 353 [] set_intersection2(A,empty_set)=empty_set.
% 2.79/2.94 ---> New Demodulator: 354 [new_demod,353] set_intersection2(A,empty_set)=empty_set.
% 2.79/2.94 ** KEPT (pick-wt=13): 355 [] in($f43(A,B),A)|in($f43(A,B),B)|A=B.
% 2.79/2.94 ** KEPT (pick-wt=3): 356 [] subset(empty_set,A).
% 2.79/2.94 ** KEPT (pick-wt=5): 357 [] subset(set_difference(A,B),A).
% 2.79/2.94 ** KEPT (pick-wt=9): 358 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.79/2.94 ---> New Demodulator: 359 [new_demod,358] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.79/2.94 ** KEPT (pick-wt=5): 360 [] set_difference(A,empty_set)=A.
% 2.79/2.94 ---> New Demodulator: 361 [new_demod,360] set_difference(A,empty_set)=A.
% 2.79/2.94 ** KEPT (pick-wt=8): 362 [] disjoint(A,B)|in($f44(A,B),A).
% 2.79/2.94 ** KEPT (pick-wt=8): 363 [] disjoint(A,B)|in($f44(A,B),B).
% 2.79/2.94 ** KEPT (pick-wt=9): 364 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.79/2.94 ---> New Demodulator: 365 [new_demod,364] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.79/2.94 ** KEPT (pick-wt=9): 367 [copy,366,flip.1] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 2.79/2.94 ---> New Demodulator: 368 [new_demod,367] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 2.79/2.94 ** KEPT (pick-wt=5): 369 [] set_difference(empty_set,A)=empty_set.
% 2.79/2.94 ---> New Demodulator: 370 [new_demod,369] set_difference(empty_set,A)=empty_set.
% 2.79/2.94 ** KEPT (pick-wt=12): 372 [copy,371,demod,368] disjoint(A,B)|in($f45(A,B),set_difference(A,set_difference(A,B))).
% 2.79/2.94 ** KEPT (pick-wt=4): 373 [] relation_dom(empty_set)=empty_set.
% 2.79/2.94 ---> New Demodulator: 374 [new_demod,373] relation_dom(empty_set)=empty_set.
% 2.79/2.94 ** KEPT (pick-wt=4): 375 [] relation_rng(empty_set)=empty_set.
% 2.79/2.94 ---> New Demodulator: 376 [new_demod,375] relation_rng(empty_set)=empty_set.
% 2.79/2.94 ** KEPT (pick-wt=9): 377 [] set_difference(A,singleton(B))=A|in(B,A).
% 2.79/2.94 ** KEPT (pick-wt=6): 379 [copy,378,flip.1] singleton(A)=unordered_pair(A,A).
% 2.79/2.94 ---> New Demodulator: 380 [new_demod,379] singleton(A)=unordered_pair(A,A).
% 2.79/2.94 ** KEPT (pick-wt=5): 381 [] subset(A,set_union2(A,B)).
% 2.79/2.94 ** KEPT (pick-wt=5): 382 [] union(powerset(A))=A.
% 2.79/2.94 ---> New Demodulator: 383 [new_demod,382] union(powerset(A))=A.
% 2.79/2.94 ** KEPT (pick-wt=4): 384 [] in(A,$f49(A)).
% 2.79/2.94 Following clause subsumed by 301 during input processing: 0 [copy,301,flip.1] A=A.
% 2.79/2.94 301 back subsumes 289.
% 2.79/2.94 301 back subsumes 280.
% 2.79/2.94 301 back subsumes 219.
% 2.79/2.94 Following clause subsumed by 302 during input processing: 0 [copy,302,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 2.79/2.94 Following clause subsumed by 303 during input processing: 0 [copy,303,flip.1] set_union2(A,B)=set_union2(B,A).
% 2.79/2.94 ** KEPT (pick-wt=11): 385 [copy,304,flip.1,demod,368,368] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 2.79/2.94 >>>> Starting back demodulation with 319.
% 2.79/2.94 >> back demodulating 189 with 319.
% 2.79/2.94 >> back demodulating 188 with 319.
% 2.79/2.94 >>>> Starting back demodulation with 325.
% 2.79/2.94 >>>> Starting back demodulation with 333.
% 2.79/2.94 >> back demodulating 290 with 333.
% 2.79/2.94 >> back demodulating 271 with 333.
% 2.79/2.94 >> back demodulating 225 with 333.
% 2.79/2.94 >>>> Starting back demodulation with 335.
% 2.79/2.94 >> back demodulating 292 with 335.
% 2.79/2.94 >> back demodulating 277 with 335.
% 2.79/2.94 >> back demodulating 235 with 335.
% 2.79/2.94 >> back demodulating 232 with 335.
% 2.79/2.94 345 back subsumes 279.
% 2.79/2.94 345 back subsumes 278.
% 2.79/2.94 >>>> Starting back demodulation with 349.
% 2.79/2.94 >>>> Starting back demodulation with 352.
% 2.79/2.94 >>>> Starting back demodulation with 354.
% 2.79/2.94 >>>> Starting back demodulation with 359.
% 2.79/2.94 >> back demodulating 184 with 359.
% 2.79/2.94 >>>> Starting back demodulation with 361.
% 2.79/2.94 >>>> Starting back demodulation with 365.
% 2.79/2.94 >>>> Starting back demodulation with 368.
% 2.79/2.94 >> back demodulating 353 with 368.
% 2.79/2.94 >> back demodulating 347 with 368.
% 2.79/2.94 >> back demodulating 334 with 368.
% 2.79/2.94 >> back demodulating 317 with 368.
% 2.79/2.94 >> back demodulating 316 with 368.
% 2.79/2.94 >> back demodulating 304 with 368.
% 2.79/2.94 >> back demodulating 234 with 368.
% 2.79/2.94 >> back demodulating 233 with 368.
% 2.79/2.94 >> back demodulating 191 with 368.
% 5.32/5.48 >> back demodulating 162 with 368.
% 5.32/5.48 >> back demodulating 161 with 368.
% 5.32/5.48 >> back demodulating 153 with 368.
% 5.32/5.48 >> back demodulating 82 with 368.
% 5.32/5.48 >> back demodulating 81 with 368.
% 5.32/5.48 >> back demodulating 56 with 368.
% 5.32/5.48 >> back demodulating 55 with 368.
% 5.32/5.48 >> back demodulating 54 with 368.
% 5.32/5.48 >> back demodulating 53 with 368.
% 5.32/5.48 >>>> Starting back demodulation with 370.
% 5.32/5.48 >>>> Starting back demodulation with 374.
% 5.32/5.48 >>>> Starting back demodulation with 376.
% 5.32/5.48 >>>> Starting back demodulation with 380.
% 5.32/5.48 >> back demodulating 377 with 380.
% 5.32/5.48 >> back demodulating 351 with 380.
% 5.32/5.48 >> back demodulating 336 with 380.
% 5.32/5.48 >> back demodulating 324 with 380.
% 5.32/5.48 >> back demodulating 306 with 380.
% 5.32/5.48 >> back demodulating 216 with 380.
% 5.32/5.48 >> back demodulating 211 with 380.
% 5.32/5.48 >> back demodulating 204 with 380.
% 5.32/5.48 >> back demodulating 202 with 380.
% 5.32/5.48 >> back demodulating 132 with 380.
% 5.32/5.48 >> back demodulating 131 with 380.
% 5.32/5.48 >> back demodulating 130 with 380.
% 5.32/5.48 >> back demodulating 126 with 380.
% 5.32/5.48 >> back demodulating 125 with 380.
% 5.32/5.48 >> back demodulating 124 with 380.
% 5.32/5.48 >> back demodulating 123 with 380.
% 5.32/5.48 >> back demodulating 122 with 380.
% 5.32/5.48 >> back demodulating 107 with 380.
% 5.32/5.48 >> back demodulating 26 with 380.
% 5.32/5.48 >> back demodulating 25 with 380.
% 5.32/5.48 >> back demodulating 24 with 380.
% 5.32/5.48 >>>> Starting back demodulation with 383.
% 5.32/5.48 Following clause subsumed by 385 during input processing: 0 [copy,385,flip.1] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 5.32/5.48 >>>> Starting back demodulation with 399.
% 5.32/5.48 >> back demodulating 274 with 399.
% 5.32/5.48 >>>> Starting back demodulation with 415.
% 5.32/5.48 >>>> Starting back demodulation with 418.
% 5.32/5.48
% 5.32/5.48 ======= end of input processing =======
% 5.32/5.48
% 5.32/5.48 =========== start of search ===========
% 5.32/5.48
% 5.32/5.48
% 5.32/5.48 Resetting weight limit to 2.
% 5.32/5.48
% 5.32/5.48
% 5.32/5.48 Resetting weight limit to 2.
% 5.32/5.48
% 5.32/5.48 sos_size=93
% 5.32/5.48
% 5.32/5.48 Search stopped because sos empty.
% 5.32/5.48
% 5.32/5.48
% 5.32/5.48 Search stopped because sos empty.
% 5.32/5.48
% 5.32/5.48 ============ end of search ============
% 5.32/5.48
% 5.32/5.48 -------------- statistics -------------
% 5.32/5.48 clauses given 95
% 5.32/5.48 clauses generated 161662
% 5.32/5.48 clauses kept 401
% 5.32/5.48 clauses forward subsumed 110
% 5.32/5.48 clauses back subsumed 6
% 5.32/5.48 Kbytes malloced 4882
% 5.32/5.48
% 5.32/5.48 ----------- times (seconds) -----------
% 5.32/5.48 user CPU time 2.57 (0 hr, 0 min, 2 sec)
% 5.32/5.48 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 5.32/5.48 wall-clock time 5 (0 hr, 0 min, 5 sec)
% 5.32/5.48
% 5.32/5.48 Process 471 finished Wed Jul 27 07:58:36 2022
% 5.32/5.48 Otter interrupted
% 5.32/5.48 PROOF NOT FOUND
%------------------------------------------------------------------------------