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