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