TSTP Solution File: SEU196+2 by Otter---3.3

View Problem - Process Solution

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

% Computer : n023.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Jul 27 13:15:07 EDT 2022

% Result   : Unknown 7.15s 7.32s
% Output   : None 
% Verified : 
% SZS Type : -

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