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