%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SEU206+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n017.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.74s 7.90s
% Output   : None 
% Verified : 
% SZS Type : -

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