TSTP Solution File: SEU169+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU169+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:02 EDT 2022
% Result : Theorem 2.40s 2.58s
% Output : Refutation 2.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of clauses : 11 ( 9 unt; 1 nHn; 9 RR)
% Number of literals : 16 ( 3 equ; 6 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 9 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(13,axiom,
( empty(A)
| ~ element(B,A)
| in(B,A) ),
file('SEU169+2.p',unknown),
[] ).
cnf(41,axiom,
( A != union(B)
| in(C,A)
| ~ in(C,D)
| ~ in(D,B) ),
file('SEU169+2.p',unknown),
[] ).
cnf(53,axiom,
~ empty(powerset(A)),
file('SEU169+2.p',unknown),
[] ).
cnf(65,axiom,
~ in(dollar_c1,dollar_c3),
file('SEU169+2.p',unknown),
[] ).
cnf(146,axiom,
A = A,
file('SEU169+2.p',unknown),
[] ).
cnf(175,axiom,
element(dollar_c2,powerset(dollar_c3)),
file('SEU169+2.p',unknown),
[] ).
cnf(176,axiom,
in(dollar_c1,dollar_c2),
file('SEU169+2.p',unknown),
[] ).
cnf(213,axiom,
union(powerset(A)) = A,
file('SEU169+2.p',unknown),
[] ).
cnf(626,plain,
in(dollar_c2,powerset(dollar_c3)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[175,13]),53]),
[iquote('hyper,175,13,unit_del,53')] ).
cnf(765,plain,
in(dollar_c1,dollar_c3),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[626,41,146,176]),213]),
[iquote('hyper,626,41,146,176,demod,213')] ).
cnf(766,plain,
$false,
inference(binary,[status(thm)],[765,65]),
[iquote('binary,765.1,65.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU169+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 07:39:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.32/2.51 ----- Otter 3.3f, August 2004 -----
% 2.32/2.51 The process was started by sandbox on n020.cluster.edu,
% 2.32/2.51 Wed Jul 27 07:39:53 2022
% 2.32/2.51 The command was "./otter". The process ID is 22731.
% 2.32/2.51
% 2.32/2.51 set(prolog_style_variables).
% 2.32/2.51 set(auto).
% 2.32/2.51 dependent: set(auto1).
% 2.32/2.51 dependent: set(process_input).
% 2.32/2.51 dependent: clear(print_kept).
% 2.32/2.51 dependent: clear(print_new_demod).
% 2.32/2.51 dependent: clear(print_back_demod).
% 2.32/2.51 dependent: clear(print_back_sub).
% 2.32/2.51 dependent: set(control_memory).
% 2.32/2.51 dependent: assign(max_mem, 12000).
% 2.32/2.51 dependent: assign(pick_given_ratio, 4).
% 2.32/2.51 dependent: assign(stats_level, 1).
% 2.32/2.51 dependent: assign(max_seconds, 10800).
% 2.32/2.51 clear(print_given).
% 2.32/2.51
% 2.32/2.51 formula_list(usable).
% 2.32/2.51 all A (A=A).
% 2.32/2.51 all A B (in(A,B)-> -in(B,A)).
% 2.32/2.51 all A B (proper_subset(A,B)-> -proper_subset(B,A)).
% 2.32/2.51 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.32/2.51 all A B (set_union2(A,B)=set_union2(B,A)).
% 2.32/2.51 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.32/2.51 all A B (A=B<->subset(A,B)&subset(B,A)).
% 2.32/2.51 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 2.32/2.51 all A (A=empty_set<-> (all B (-in(B,A)))).
% 2.32/2.51 all A B (B=powerset(A)<-> (all C (in(C,B)<->subset(C,A)))).
% 2.32/2.51 all A B ((-empty(A)-> (element(B,A)<->in(B,A)))& (empty(A)-> (element(B,A)<->empty(B)))).
% 2.32/2.51 all A B C (C=unordered_pair(A,B)<-> (all D (in(D,C)<->D=A|D=B))).
% 2.32/2.51 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 2.32/2.51 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.32/2.51 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 2.32/2.51 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 2.32/2.51 all A B (B=union(A)<-> (all C (in(C,B)<-> (exists D (in(C,D)&in(D,A)))))).
% 2.32/2.51 all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 2.32/2.51 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.32/2.51 all A B (disjoint(A,B)<->set_intersection2(A,B)=empty_set).
% 2.32/2.51 all A B (proper_subset(A,B)<->subset(A,B)&A!=B).
% 2.32/2.51 $T.
% 2.32/2.51 $T.
% 2.32/2.51 $T.
% 2.32/2.51 $T.
% 2.32/2.51 $T.
% 2.32/2.51 $T.
% 2.32/2.51 $T.
% 2.32/2.51 $T.
% 2.32/2.51 $T.
% 2.32/2.51 $T.
% 2.32/2.51 $T.
% 2.32/2.51 all A exists B element(B,A).
% 2.32/2.51 all A (-empty(powerset(A))).
% 2.32/2.51 empty(empty_set).
% 2.32/2.51 all A B (-empty(ordered_pair(A,B))).
% 2.32/2.51 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 2.32/2.51 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 2.32/2.51 all A B (set_union2(A,A)=A).
% 2.32/2.51 all A B (set_intersection2(A,A)=A).
% 2.32/2.51 all A B (-proper_subset(A,A)).
% 2.32/2.51 all A (singleton(A)!=empty_set).
% 2.32/2.51 all A B (in(A,B)->set_union2(singleton(A),B)=B).
% 2.32/2.51 all A B (-(disjoint(singleton(A),B)&in(A,B))).
% 2.32/2.51 all A B (-in(A,B)->disjoint(singleton(A),B)).
% 2.32/2.51 all A B (subset(singleton(A),B)<->in(A,B)).
% 2.32/2.51 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 2.32/2.51 -(all A B (element(B,powerset(A))-> (all C (in(C,B)->in(C,A))))).
% 2.32/2.51 all A B C (subset(A,B)->in(C,A)|subset(A,set_difference(B,singleton(C)))).
% 2.32/2.51 all A B (subset(A,singleton(B))<->A=empty_set|A=singleton(B)).
% 2.32/2.51 all A B (in(A,B)->subset(A,union(B))).
% 2.32/2.51 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 2.32/2.51 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.32/2.51 exists A empty(A).
% 2.32/2.51 exists A (-empty(A)).
% 2.32/2.51 all A B subset(A,A).
% 2.32/2.51 all A B (disjoint(A,B)->disjoint(B,A)).
% 2.32/2.51 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 2.32/2.51 all A B C D (-(unordered_pair(A,B)=unordered_pair(C,D)&A!=C&A!=D)).
% 2.32/2.51 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.32/2.51 all A B C D (subset(A,B)&subset(C,D)->subset(cartesian_product2(A,C),cartesian_product2(B,D))).
% 2.32/2.51 all A B (subset(A,B)->set_union2(A,B)=B).
% 2.32/2.51 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.32/2.51 all A B subset(set_intersection2(A,B),A).
% 2.32/2.51 all A B C (subset(A,B)&subset(A,C)->subset(A,set_intersection2(B,C))).
% 2.32/2.51 all A (set_union2(A,empty_set)=A).
% 2.32/2.51 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 2.32/2.51 powerset(empty_set)=singleton(empty_set).
% 2.32/2.51 all A B C (subset(A,B)->subset(set_intersection2(A,C),set_intersection2(B,C))).
% 2.32/2.51 all A B (subset(A,B)->set_intersection2(A,B)=A).
% 2.32/2.51 all A (set_intersection2(A,empty_set)=empty_set).
% 2.32/2.51 all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 2.32/2.51 all A subset(empty_set,A).
% 2.32/2.51 all A B C (subset(A,B)->subset(set_difference(A,C),set_difference(B,C))).
% 2.32/2.51 all A B C D (ordered_pair(A,B)=ordered_pair(C,D)->A=C&B=D).
% 2.32/2.51 all A B subset(set_difference(A,B),A).
% 2.32/2.51 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 2.32/2.51 all A B (subset(singleton(A),B)<->in(A,B)).
% 2.32/2.51 all A B C (subset(unordered_pair(A,B),C)<->in(A,C)&in(B,C)).
% 2.32/2.51 all A B (set_union2(A,set_difference(B,A))=set_union2(A,B)).
% 2.32/2.51 all A B (subset(A,singleton(B))<->A=empty_set|A=singleton(B)).
% 2.32/2.51 all A (set_difference(A,empty_set)=A).
% 2.32/2.51 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.32/2.51 all A (subset(A,empty_set)->A=empty_set).
% 2.32/2.51 all A B (set_difference(set_union2(A,B),B)=set_difference(A,B)).
% 2.32/2.51 all A B (subset(A,B)->B=set_union2(A,set_difference(B,A))).
% 2.32/2.51 all A B (in(A,B)->set_union2(singleton(A),B)=B).
% 2.32/2.51 all A B (set_difference(A,set_difference(A,B))=set_intersection2(A,B)).
% 2.32/2.51 all A (set_difference(empty_set,A)=empty_set).
% 2.32/2.51 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.32/2.51 all A B (-(subset(A,B)&proper_subset(B,A))).
% 2.32/2.51 all A B C (subset(A,B)&disjoint(B,C)->disjoint(A,C)).
% 2.32/2.51 all A B (set_difference(A,singleton(B))=A<-> -in(B,A)).
% 2.32/2.51 all A (unordered_pair(A,A)=singleton(A)).
% 2.32/2.51 all A (empty(A)->A=empty_set).
% 2.32/2.51 all A B (subset(singleton(A),singleton(B))->A=B).
% 2.32/2.51 all A B (-(in(A,B)&empty(B))).
% 2.32/2.51 all A B subset(A,set_union2(A,B)).
% 2.32/2.51 all A B (disjoint(A,B)<->set_difference(A,B)=A).
% 2.32/2.51 all A B (-(empty(A)&A!=B&empty(B))).
% 2.32/2.51 all A B C (subset(A,B)&subset(C,B)->subset(set_union2(A,C),B)).
% 2.32/2.51 all A B C (singleton(A)=unordered_pair(B,C)->A=B).
% 2.32/2.51 all A B (in(A,B)->subset(A,union(B))).
% 2.32/2.51 all A (union(powerset(A))=A).
% 2.32/2.51 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.32/2.51 all A B C (singleton(A)=unordered_pair(B,C)->B=C).
% 2.32/2.51 end_of_list.
% 2.32/2.51
% 2.32/2.51 -------> usable clausifies to:
% 2.32/2.51
% 2.32/2.51 list(usable).
% 2.32/2.51 0 [] A=A.
% 2.32/2.51 0 [] -in(A,B)| -in(B,A).
% 2.32/2.51 0 [] -proper_subset(A,B)| -proper_subset(B,A).
% 2.32/2.51 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.32/2.51 0 [] set_union2(A,B)=set_union2(B,A).
% 2.32/2.51 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.32/2.51 0 [] A!=B|subset(A,B).
% 2.32/2.51 0 [] A!=B|subset(B,A).
% 2.32/2.51 0 [] A=B| -subset(A,B)| -subset(B,A).
% 2.32/2.51 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 2.32/2.51 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 2.32/2.51 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 2.32/2.51 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 2.32/2.51 0 [] A!=empty_set| -in(B,A).
% 2.32/2.51 0 [] A=empty_set|in($f2(A),A).
% 2.32/2.51 0 [] B!=powerset(A)| -in(C,B)|subset(C,A).
% 2.32/2.51 0 [] B!=powerset(A)|in(C,B)| -subset(C,A).
% 2.32/2.51 0 [] B=powerset(A)|in($f3(A,B),B)|subset($f3(A,B),A).
% 2.32/2.51 0 [] B=powerset(A)| -in($f3(A,B),B)| -subset($f3(A,B),A).
% 2.32/2.51 0 [] empty(A)| -element(B,A)|in(B,A).
% 2.32/2.51 0 [] empty(A)|element(B,A)| -in(B,A).
% 2.32/2.51 0 [] -empty(A)| -element(B,A)|empty(B).
% 2.32/2.51 0 [] -empty(A)|element(B,A)| -empty(B).
% 2.32/2.51 0 [] C!=unordered_pair(A,B)| -in(D,C)|D=A|D=B.
% 2.32/2.51 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=A.
% 2.32/2.51 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=B.
% 2.32/2.51 0 [] C=unordered_pair(A,B)|in($f4(A,B,C),C)|$f4(A,B,C)=A|$f4(A,B,C)=B.
% 2.32/2.51 0 [] C=unordered_pair(A,B)| -in($f4(A,B,C),C)|$f4(A,B,C)!=A.
% 2.32/2.51 0 [] C=unordered_pair(A,B)| -in($f4(A,B,C),C)|$f4(A,B,C)!=B.
% 2.32/2.51 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 2.32/2.51 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 2.32/2.51 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 2.32/2.51 0 [] C=set_union2(A,B)|in($f5(A,B,C),C)|in($f5(A,B,C),A)|in($f5(A,B,C),B).
% 2.32/2.51 0 [] C=set_union2(A,B)| -in($f5(A,B,C),C)| -in($f5(A,B,C),A).
% 2.32/2.51 0 [] C=set_union2(A,B)| -in($f5(A,B,C),C)| -in($f5(A,B,C),B).
% 2.32/2.51 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f7(A,B,C,D),A).
% 2.32/2.51 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f6(A,B,C,D),B).
% 2.32/2.51 0 [] C!=cartesian_product2(A,B)| -in(D,C)|D=ordered_pair($f7(A,B,C,D),$f6(A,B,C,D)).
% 2.32/2.51 0 [] C!=cartesian_product2(A,B)|in(D,C)| -in(E,A)| -in(F,B)|D!=ordered_pair(E,F).
% 2.32/2.51 0 [] C=cartesian_product2(A,B)|in($f10(A,B,C),C)|in($f9(A,B,C),A).
% 2.32/2.51 0 [] C=cartesian_product2(A,B)|in($f10(A,B,C),C)|in($f8(A,B,C),B).
% 2.32/2.51 0 [] C=cartesian_product2(A,B)|in($f10(A,B,C),C)|$f10(A,B,C)=ordered_pair($f9(A,B,C),$f8(A,B,C)).
% 2.32/2.51 0 [] C=cartesian_product2(A,B)| -in($f10(A,B,C),C)| -in(X1,A)| -in(X2,B)|$f10(A,B,C)!=ordered_pair(X1,X2).
% 2.32/2.51 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.32/2.51 0 [] subset(A,B)|in($f11(A,B),A).
% 2.32/2.51 0 [] subset(A,B)| -in($f11(A,B),B).
% 2.32/2.51 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 2.32/2.51 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 2.32/2.51 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 2.32/2.51 0 [] C=set_intersection2(A,B)|in($f12(A,B,C),C)|in($f12(A,B,C),A).
% 2.32/2.51 0 [] C=set_intersection2(A,B)|in($f12(A,B,C),C)|in($f12(A,B,C),B).
% 2.32/2.51 0 [] C=set_intersection2(A,B)| -in($f12(A,B,C),C)| -in($f12(A,B,C),A)| -in($f12(A,B,C),B).
% 2.32/2.51 0 [] B!=union(A)| -in(C,B)|in(C,$f13(A,B,C)).
% 2.32/2.51 0 [] B!=union(A)| -in(C,B)|in($f13(A,B,C),A).
% 2.32/2.51 0 [] B!=union(A)|in(C,B)| -in(C,D)| -in(D,A).
% 2.32/2.51 0 [] B=union(A)|in($f15(A,B),B)|in($f15(A,B),$f14(A,B)).
% 2.32/2.51 0 [] B=union(A)|in($f15(A,B),B)|in($f14(A,B),A).
% 2.32/2.51 0 [] B=union(A)| -in($f15(A,B),B)| -in($f15(A,B),X3)| -in(X3,A).
% 2.32/2.51 0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 2.32/2.51 0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 2.32/2.51 0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 2.32/2.51 0 [] C=set_difference(A,B)|in($f16(A,B,C),C)|in($f16(A,B,C),A).
% 2.32/2.51 0 [] C=set_difference(A,B)|in($f16(A,B,C),C)| -in($f16(A,B,C),B).
% 2.32/2.51 0 [] C=set_difference(A,B)| -in($f16(A,B,C),C)| -in($f16(A,B,C),A)|in($f16(A,B,C),B).
% 2.32/2.51 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.32/2.51 0 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 2.32/2.51 0 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 2.32/2.51 0 [] -proper_subset(A,B)|subset(A,B).
% 2.32/2.51 0 [] -proper_subset(A,B)|A!=B.
% 2.32/2.51 0 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 2.32/2.51 0 [] $T.
% 2.32/2.51 0 [] $T.
% 2.32/2.51 0 [] $T.
% 2.32/2.51 0 [] $T.
% 2.32/2.51 0 [] $T.
% 2.32/2.51 0 [] $T.
% 2.32/2.51 0 [] $T.
% 2.32/2.51 0 [] $T.
% 2.32/2.51 0 [] $T.
% 2.32/2.51 0 [] $T.
% 2.32/2.51 0 [] $T.
% 2.32/2.51 0 [] element($f17(A),A).
% 2.32/2.51 0 [] -empty(powerset(A)).
% 2.32/2.51 0 [] empty(empty_set).
% 2.32/2.51 0 [] -empty(ordered_pair(A,B)).
% 2.32/2.51 0 [] empty(A)| -empty(set_union2(A,B)).
% 2.32/2.51 0 [] empty(A)| -empty(set_union2(B,A)).
% 2.32/2.51 0 [] set_union2(A,A)=A.
% 2.32/2.51 0 [] set_intersection2(A,A)=A.
% 2.32/2.51 0 [] -proper_subset(A,A).
% 2.32/2.51 0 [] singleton(A)!=empty_set.
% 2.32/2.51 0 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.32/2.51 0 [] -disjoint(singleton(A),B)| -in(A,B).
% 2.32/2.51 0 [] in(A,B)|disjoint(singleton(A),B).
% 2.32/2.51 0 [] -subset(singleton(A),B)|in(A,B).
% 2.32/2.51 0 [] subset(singleton(A),B)| -in(A,B).
% 2.32/2.51 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.32/2.51 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.32/2.51 0 [] element($c2,powerset($c3)).
% 2.32/2.51 0 [] in($c1,$c2).
% 2.32/2.51 0 [] -in($c1,$c3).
% 2.32/2.51 0 [] -subset(A,B)|in(C,A)|subset(A,set_difference(B,singleton(C))).
% 2.32/2.51 0 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.32/2.51 0 [] subset(A,singleton(B))|A!=empty_set.
% 2.32/2.51 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.32/2.51 0 [] -in(A,B)|subset(A,union(B)).
% 2.32/2.51 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.32/2.51 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.32/2.51 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.32/2.51 0 [] empty(A)|element($f18(A),powerset(A)).
% 2.32/2.51 0 [] empty(A)| -empty($f18(A)).
% 2.32/2.51 0 [] empty($c4).
% 2.32/2.51 0 [] -empty($c5).
% 2.32/2.51 0 [] subset(A,A).
% 2.32/2.51 0 [] -disjoint(A,B)|disjoint(B,A).
% 2.32/2.51 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.32/2.51 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.32/2.51 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.32/2.51 0 [] unordered_pair(A,B)!=unordered_pair(C,D)|A=C|A=D.
% 2.32/2.51 0 [] -subset(A,B)|subset(cartesian_product2(A,C),cartesian_product2(B,C)).
% 2.32/2.51 0 [] -subset(A,B)|subset(cartesian_product2(C,A),cartesian_product2(C,B)).
% 2.32/2.51 0 [] -subset(A,B)| -subset(C,D)|subset(cartesian_product2(A,C),cartesian_product2(B,D)).
% 2.32/2.51 0 [] -subset(A,B)|set_union2(A,B)=B.
% 2.32/2.51 0 [] in(A,$f19(A)).
% 2.32/2.51 0 [] -in(C,$f19(A))| -subset(D,C)|in(D,$f19(A)).
% 2.32/2.51 0 [] -in(X4,$f19(A))|in(powerset(X4),$f19(A)).
% 2.32/2.51 0 [] -subset(X5,$f19(A))|are_e_quipotent(X5,$f19(A))|in(X5,$f19(A)).
% 2.32/2.51 0 [] subset(set_intersection2(A,B),A).
% 2.32/2.51 0 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 2.32/2.51 0 [] set_union2(A,empty_set)=A.
% 2.32/2.51 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.32/2.51 0 [] powerset(empty_set)=singleton(empty_set).
% 2.32/2.51 0 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 2.32/2.51 0 [] -subset(A,B)|set_intersection2(A,B)=A.
% 2.32/2.51 0 [] set_intersection2(A,empty_set)=empty_set.
% 2.32/2.51 0 [] in($f20(A,B),A)|in($f20(A,B),B)|A=B.
% 2.32/2.51 0 [] -in($f20(A,B),A)| -in($f20(A,B),B)|A=B.
% 2.32/2.51 0 [] subset(empty_set,A).
% 2.32/2.51 0 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 2.32/2.51 0 [] ordered_pair(A,B)!=ordered_pair(C,D)|A=C.
% 2.32/2.51 0 [] ordered_pair(A,B)!=ordered_pair(C,D)|B=D.
% 2.32/2.51 0 [] subset(set_difference(A,B),A).
% 2.32/2.51 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.32/2.51 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.32/2.51 0 [] -subset(singleton(A),B)|in(A,B).
% 2.32/2.51 0 [] subset(singleton(A),B)| -in(A,B).
% 2.32/2.51 0 [] -subset(unordered_pair(A,B),C)|in(A,C).
% 2.32/2.51 0 [] -subset(unordered_pair(A,B),C)|in(B,C).
% 2.32/2.51 0 [] subset(unordered_pair(A,B),C)| -in(A,C)| -in(B,C).
% 2.32/2.51 0 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.32/2.51 0 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.32/2.51 0 [] subset(A,singleton(B))|A!=empty_set.
% 2.32/2.51 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.32/2.51 0 [] set_difference(A,empty_set)=A.
% 2.32/2.51 0 [] disjoint(A,B)|in($f21(A,B),A).
% 2.32/2.51 0 [] disjoint(A,B)|in($f21(A,B),B).
% 2.32/2.51 0 [] -in(C,A)| -in(C,B)| -disjoint(A,B).
% 2.32/2.51 0 [] -subset(A,empty_set)|A=empty_set.
% 2.32/2.51 0 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.32/2.51 0 [] -subset(A,B)|B=set_union2(A,set_difference(B,A)).
% 2.32/2.51 0 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.32/2.51 0 [] set_difference(A,set_difference(A,B))=set_intersection2(A,B).
% 2.32/2.51 0 [] set_difference(empty_set,A)=empty_set.
% 2.32/2.51 0 [] disjoint(A,B)|in($f22(A,B),set_intersection2(A,B)).
% 2.32/2.51 0 [] -in(C,set_intersection2(A,B))| -disjoint(A,B).
% 2.32/2.51 0 [] -subset(A,B)| -proper_subset(B,A).
% 2.32/2.51 0 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 2.32/2.51 0 [] set_difference(A,singleton(B))!=A| -in(B,A).
% 2.32/2.51 0 [] set_difference(A,singleton(B))=A|in(B,A).
% 2.32/2.51 0 [] unordered_pair(A,A)=singleton(A).
% 2.32/2.51 0 [] -empty(A)|A=empty_set.
% 2.32/2.51 0 [] -subset(singleton(A),singleton(B))|A=B.
% 2.32/2.51 0 [] -in(A,B)| -empty(B).
% 2.32/2.51 0 [] subset(A,set_union2(A,B)).
% 2.32/2.51 0 [] -disjoint(A,B)|set_difference(A,B)=A.
% 2.32/2.51 0 [] disjoint(A,B)|set_difference(A,B)!=A.
% 2.32/2.51 0 [] -empty(A)|A=B| -empty(B).
% 2.32/2.51 0 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 2.32/2.51 0 [] singleton(A)!=unordered_pair(B,C)|A=B.
% 2.32/2.51 0 [] -in(A,B)|subset(A,union(B)).
% 2.32/2.51 0 [] union(powerset(A))=A.
% 2.32/2.51 0 [] in(A,$f24(A)).
% 2.32/2.51 0 [] -in(C,$f24(A))| -subset(D,C)|in(D,$f24(A)).
% 2.32/2.51 0 [] -in(X6,$f24(A))|in($f23(A,X6),$f24(A)).
% 2.32/2.51 0 [] -in(X6,$f24(A))| -subset(E,X6)|in(E,$f23(A,X6)).
% 2.32/2.51 0 [] -subset(X7,$f24(A))|are_e_quipotent(X7,$f24(A))|in(X7,$f24(A)).
% 2.32/2.51 0 [] singleton(A)!=unordered_pair(B,C)|B=C.
% 2.32/2.51 end_of_list.
% 2.32/2.51
% 2.32/2.51 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 2.32/2.51
% 2.32/2.51 This ia a non-Horn set with equality. The strategy will be
% 2.32/2.51 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.32/2.51 deletion, with positive clauses in sos and nonpositive
% 2.32/2.51 clauses in usable.
% 2.32/2.51
% 2.32/2.51 dependent: set(knuth_bendix).
% 2.32/2.51 dependent: set(anl_eq).
% 2.32/2.51 dependent: set(para_from).
% 2.32/2.51 dependent: set(para_into).
% 2.32/2.51 dependent: clear(para_from_right).
% 2.32/2.51 dependent: clear(para_into_right).
% 2.32/2.51 dependent: set(para_from_vars).
% 2.32/2.51 dependent: set(eq_units_both_ways).
% 2.32/2.51 dependent: set(dynamic_demod_all).
% 2.32/2.51 dependent: set(dynamic_demod).
% 2.32/2.51 dependent: set(order_eq).
% 2.32/2.51 dependent: set(back_demod).
% 2.32/2.51 dependent: set(lrpo).
% 2.32/2.51 dependent: set(hyper_res).
% 2.32/2.51 dependent: set(unit_deletion).
% 2.32/2.51 dependent: set(factor).
% 2.32/2.51
% 2.32/2.51 ------------> process usable:
% 2.32/2.51 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.32/2.51 ** KEPT (pick-wt=6): 2 [] -proper_subset(A,B)| -proper_subset(B,A).
% 2.32/2.51 ** KEPT (pick-wt=6): 3 [] A!=B|subset(A,B).
% 2.32/2.51 ** KEPT (pick-wt=6): 4 [] A!=B|subset(B,A).
% 2.32/2.51 ** KEPT (pick-wt=9): 5 [] A=B| -subset(A,B)| -subset(B,A).
% 2.32/2.51 ** KEPT (pick-wt=10): 6 [] A!=singleton(B)| -in(C,A)|C=B.
% 2.32/2.51 ** KEPT (pick-wt=10): 7 [] A!=singleton(B)|in(C,A)|C!=B.
% 2.32/2.51 ** KEPT (pick-wt=14): 8 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 2.32/2.51 ** KEPT (pick-wt=6): 9 [] A!=empty_set| -in(B,A).
% 2.32/2.51 ** KEPT (pick-wt=10): 10 [] A!=powerset(B)| -in(C,A)|subset(C,B).
% 2.32/2.51 ** KEPT (pick-wt=10): 11 [] A!=powerset(B)|in(C,A)| -subset(C,B).
% 2.32/2.51 ** KEPT (pick-wt=14): 12 [] A=powerset(B)| -in($f3(B,A),A)| -subset($f3(B,A),B).
% 2.32/2.51 ** KEPT (pick-wt=8): 13 [] empty(A)| -element(B,A)|in(B,A).
% 2.32/2.51 ** KEPT (pick-wt=8): 14 [] empty(A)|element(B,A)| -in(B,A).
% 2.32/2.51 ** KEPT (pick-wt=7): 15 [] -empty(A)| -element(B,A)|empty(B).
% 2.32/2.51 ** KEPT (pick-wt=7): 16 [] -empty(A)|element(B,A)| -empty(B).
% 2.32/2.51 ** KEPT (pick-wt=14): 17 [] A!=unordered_pair(B,C)| -in(D,A)|D=B|D=C.
% 2.32/2.51 ** KEPT (pick-wt=11): 18 [] A!=unordered_pair(B,C)|in(D,A)|D!=B.
% 2.32/2.51 ** KEPT (pick-wt=11): 19 [] A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 2.32/2.51 ** KEPT (pick-wt=17): 20 [] A=unordered_pair(B,C)| -in($f4(B,C,A),A)|$f4(B,C,A)!=B.
% 2.32/2.51 ** KEPT (pick-wt=17): 21 [] A=unordered_pair(B,C)| -in($f4(B,C,A),A)|$f4(B,C,A)!=C.
% 2.32/2.51 ** KEPT (pick-wt=14): 22 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 2.32/2.51 ** KEPT (pick-wt=11): 23 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 2.32/2.51 ** KEPT (pick-wt=11): 24 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 2.32/2.51 ** KEPT (pick-wt=17): 25 [] A=set_union2(B,C)| -in($f5(B,C,A),A)| -in($f5(B,C,A),B).
% 2.32/2.51 ** KEPT (pick-wt=17): 26 [] A=set_union2(B,C)| -in($f5(B,C,A),A)| -in($f5(B,C,A),C).
% 2.32/2.51 ** KEPT (pick-wt=15): 27 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f7(B,C,A,D),B).
% 2.32/2.51 ** KEPT (pick-wt=15): 28 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f6(B,C,A,D),C).
% 2.32/2.51 ** KEPT (pick-wt=21): 30 [copy,29,flip.3] A!=cartesian_product2(B,C)| -in(D,A)|ordered_pair($f7(B,C,A,D),$f6(B,C,A,D))=D.
% 2.32/2.51 ** KEPT (pick-wt=19): 31 [] A!=cartesian_product2(B,C)|in(D,A)| -in(E,B)| -in(F,C)|D!=ordered_pair(E,F).
% 2.32/2.51 ** KEPT (pick-wt=25): 32 [] A=cartesian_product2(B,C)| -in($f10(B,C,A),A)| -in(D,B)| -in(E,C)|$f10(B,C,A)!=ordered_pair(D,E).
% 2.32/2.51 ** KEPT (pick-wt=9): 33 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.32/2.51 ** KEPT (pick-wt=8): 34 [] subset(A,B)| -in($f11(A,B),B).
% 2.32/2.51 ** KEPT (pick-wt=11): 35 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 2.32/2.51 ** KEPT (pick-wt=11): 36 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 2.32/2.51 ** KEPT (pick-wt=14): 37 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 2.32/2.51 ** KEPT (pick-wt=23): 38 [] A=set_intersection2(B,C)| -in($f12(B,C,A),A)| -in($f12(B,C,A),B)| -in($f12(B,C,A),C).
% 2.32/2.51 ** KEPT (pick-wt=13): 39 [] A!=union(B)| -in(C,A)|in(C,$f13(B,A,C)).
% 2.32/2.51 ** KEPT (pick-wt=13): 40 [] A!=union(B)| -in(C,A)|in($f13(B,A,C),B).
% 2.32/2.51 ** KEPT (pick-wt=13): 41 [] A!=union(B)|in(C,A)| -in(C,D)| -in(D,B).
% 2.32/2.51 ** KEPT (pick-wt=17): 42 [] A=union(B)| -in($f15(B,A),A)| -in($f15(B,A),C)| -in(C,B).
% 2.32/2.51 ** KEPT (pick-wt=11): 43 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 2.32/2.51 ** KEPT (pick-wt=11): 44 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 2.32/2.51 ** KEPT (pick-wt=14): 45 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 2.32/2.51 ** KEPT (pick-wt=17): 46 [] A=set_difference(B,C)|in($f16(B,C,A),A)| -in($f16(B,C,A),C).
% 2.32/2.51 ** KEPT (pick-wt=23): 47 [] A=set_difference(B,C)| -in($f16(B,C,A),A)| -in($f16(B,C,A),B)|in($f16(B,C,A),C).
% 2.32/2.51 ** KEPT (pick-wt=8): 48 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 2.32/2.51 ** KEPT (pick-wt=8): 49 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 2.32/2.51 ** KEPT (pick-wt=6): 50 [] -proper_subset(A,B)|subset(A,B).
% 2.32/2.51 ** KEPT (pick-wt=6): 51 [] -proper_subset(A,B)|A!=B.
% 2.32/2.51 ** KEPT (pick-wt=9): 52 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 2.32/2.51 ** KEPT (pick-wt=3): 53 [] -empty(powerset(A)).
% 2.32/2.51 ** KEPT (pick-wt=4): 54 [] -empty(ordered_pair(A,B)).
% 2.32/2.51 ** KEPT (pick-wt=6): 55 [] empty(A)| -empty(set_union2(A,B)).
% 2.32/2.51 ** KEPT (pick-wt=6): 56 [] empty(A)| -empty(set_union2(B,A)).
% 2.32/2.51 ** KEPT (pick-wt=3): 57 [] -proper_subset(A,A).
% 2.32/2.51 ** KEPT (pick-wt=4): 58 [] singleton(A)!=empty_set.
% 2.32/2.51 ** KEPT (pick-wt=9): 59 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.32/2.51 ** KEPT (pick-wt=7): 60 [] -disjoint(singleton(A),B)| -in(A,B).
% 2.32/2.51 ** KEPT (pick-wt=7): 61 [] -subset(singleton(A),B)|in(A,B).
% 2.32/2.51 ** KEPT (pick-wt=7): 62 [] subset(singleton(A),B)| -in(A,B).
% 2.32/2.51 ** KEPT (pick-wt=8): 63 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.32/2.51 ** KEPT (pick-wt=8): 64 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.32/2.51 ** KEPT (pick-wt=3): 65 [] -in($c1,$c3).
% 2.32/2.51 ** KEPT (pick-wt=12): 66 [] -subset(A,B)|in(C,A)|subset(A,set_difference(B,singleton(C))).
% 2.32/2.51 ** KEPT (pick-wt=11): 67 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.32/2.51 ** KEPT (pick-wt=7): 68 [] subset(A,singleton(B))|A!=empty_set.
% 2.32/2.51 Following clause subsumed by 3 during input processing: 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.32/2.51 ** KEPT (pick-wt=7): 69 [] -in(A,B)|subset(A,union(B)).
% 2.32/2.51 ** KEPT (pick-wt=10): 70 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.32/2.51 ** KEPT (pick-wt=10): 71 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.32/2.51 ** KEPT (pick-wt=13): 72 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.32/2.51 ** KEPT (pick-wt=5): 73 [] empty(A)| -empty($f18(A)).
% 2.32/2.52 ** KEPT (pick-wt=2): 74 [] -empty($c5).
% 2.32/2.52 ** KEPT (pick-wt=6): 75 [] -disjoint(A,B)|disjoint(B,A).
% 2.32/2.52 Following clause subsumed by 70 during input processing: 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.32/2.52 Following clause subsumed by 71 during input processing: 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.32/2.52 Following clause subsumed by 72 during input processing: 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.32/2.52 ** KEPT (pick-wt=13): 76 [] unordered_pair(A,B)!=unordered_pair(C,D)|A=C|A=D.
% 2.32/2.52 ** KEPT (pick-wt=10): 77 [] -subset(A,B)|subset(cartesian_product2(A,C),cartesian_product2(B,C)).
% 2.32/2.52 ** KEPT (pick-wt=10): 78 [] -subset(A,B)|subset(cartesian_product2(C,A),cartesian_product2(C,B)).
% 2.32/2.52 ** KEPT (pick-wt=13): 79 [] -subset(A,B)| -subset(C,D)|subset(cartesian_product2(A,C),cartesian_product2(B,D)).
% 2.32/2.52 ** KEPT (pick-wt=8): 80 [] -subset(A,B)|set_union2(A,B)=B.
% 2.32/2.52 ** KEPT (pick-wt=11): 81 [] -in(A,$f19(B))| -subset(C,A)|in(C,$f19(B)).
% 2.32/2.52 ** KEPT (pick-wt=9): 82 [] -in(A,$f19(B))|in(powerset(A),$f19(B)).
% 2.32/2.52 ** KEPT (pick-wt=12): 83 [] -subset(A,$f19(B))|are_e_quipotent(A,$f19(B))|in(A,$f19(B)).
% 2.32/2.52 ** KEPT (pick-wt=11): 84 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 2.32/2.52 ** KEPT (pick-wt=9): 85 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.32/2.52 ** KEPT (pick-wt=10): 86 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 2.32/2.52 ** KEPT (pick-wt=8): 87 [] -subset(A,B)|set_intersection2(A,B)=A.
% 2.32/2.52 ** KEPT (pick-wt=13): 88 [] -in($f20(A,B),A)| -in($f20(A,B),B)|A=B.
% 2.32/2.52 ** KEPT (pick-wt=10): 89 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 2.32/2.52 ** KEPT (pick-wt=10): 90 [] ordered_pair(A,B)!=ordered_pair(C,D)|A=C.
% 2.32/2.52 ** KEPT (pick-wt=10): 91 [] ordered_pair(A,B)!=ordered_pair(C,D)|B=D.
% 2.32/2.52 Following clause subsumed by 63 during input processing: 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.32/2.52 Following clause subsumed by 64 during input processing: 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.32/2.52 Following clause subsumed by 61 during input processing: 0 [] -subset(singleton(A),B)|in(A,B).
% 2.32/2.52 Following clause subsumed by 62 during input processing: 0 [] subset(singleton(A),B)| -in(A,B).
% 2.32/2.52 ** KEPT (pick-wt=8): 92 [] -subset(unordered_pair(A,B),C)|in(A,C).
% 2.32/2.52 ** KEPT (pick-wt=8): 93 [] -subset(unordered_pair(A,B),C)|in(B,C).
% 2.32/2.52 ** KEPT (pick-wt=11): 94 [] subset(unordered_pair(A,B),C)| -in(A,C)| -in(B,C).
% 2.32/2.52 Following clause subsumed by 67 during input processing: 0 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.32/2.52 Following clause subsumed by 68 during input processing: 0 [] subset(A,singleton(B))|A!=empty_set.
% 2.32/2.52 Following clause subsumed by 3 during input processing: 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.32/2.52 ** KEPT (pick-wt=9): 95 [] -in(A,B)| -in(A,C)| -disjoint(B,C).
% 2.32/2.52 ** KEPT (pick-wt=6): 96 [] -subset(A,empty_set)|A=empty_set.
% 2.32/2.52 ** KEPT (pick-wt=10): 98 [copy,97,flip.2] -subset(A,B)|set_union2(A,set_difference(B,A))=B.
% 2.32/2.52 Following clause subsumed by 59 during input processing: 0 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.32/2.52 ** KEPT (pick-wt=8): 99 [] -in(A,set_intersection2(B,C))| -disjoint(B,C).
% 2.32/2.52 ** KEPT (pick-wt=6): 100 [] -subset(A,B)| -proper_subset(B,A).
% 2.32/2.52 ** KEPT (pick-wt=9): 101 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 2.32/2.52 ** KEPT (pick-wt=9): 102 [] set_difference(A,singleton(B))!=A| -in(B,A).
% 2.32/2.52 ** KEPT (pick-wt=5): 103 [] -empty(A)|A=empty_set.
% 2.32/2.52 ** KEPT (pick-wt=8): 104 [] -subset(singleton(A),singleton(B))|A=B.
% 2.32/2.52 ** KEPT (pick-wt=5): 105 [] -in(A,B)| -empty(B).
% 2.32/2.52 ** KEPT (pick-wt=8): 106 [] -disjoint(A,B)|set_difference(A,B)=A.
% 2.32/2.52 ** KEPT (pick-wt=8): 107 [] disjoint(A,B)|set_difference(A,B)!=A.
% 2.32/2.52 ** KEPT (pick-wt=7): 108 [] -empty(A)|A=B| -empty(B).
% 2.32/2.52 ** KEPT (pick-wt=11): 109 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 2.32/2.52 ** KEPT (pick-wt=9): 110 [] singleton(A)!=unordered_pair(B,C)|A=B.
% 2.32/2.52 Following clause subsumed by 69 during input processing: 0 [] -in(A,B)|subset(A,union(B)).
% 2.32/2.52 ** KEPT (pick-wt=11): 111 [] -in(A,$f24(B))| -subset(C,A)|in(C,$f24(B)).
% 2.32/2.52 ** KEPT (pick-wt=10): 112 [] -in(A,$f24(B))|in($f23(B,A),$f24(B)).
% 2.32/2.52 ** KEPT (pick-wt=12): 113 [] -in(A,$f24(B))| -subset(C,A)|in(C,$f23(B,A)).
% 2.32/2.52 ** KEPT (pick-wt=12): 114 [] -subset(A,$f24(B))|are_e_quipotent(A,$f24(B))|in(A,$f24(B)).
% 2.32/2.52 ** KEPT (pick-wt=9): 115 [] singleton(A)!=unordered_pair(B,C)|B=C.
% 2.32/2.52
% 2.32/2.52 ------------> process sos:
% 2.32/2.52 ** KEPT (pick-wt=3): 146 [] A=A.
% 2.32/2.52 ** KEPT (pick-wt=7): 147 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.32/2.52 ** KEPT (pick-wt=7): 148 [] set_union2(A,B)=set_union2(B,A).
% 2.32/2.52 ** KEPT (pick-wt=7): 149 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.32/2.52 ** KEPT (pick-wt=14): 150 [] A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B.
% 2.32/2.52 ** KEPT (pick-wt=7): 151 [] A=empty_set|in($f2(A),A).
% 2.32/2.52 ** KEPT (pick-wt=14): 152 [] A=powerset(B)|in($f3(B,A),A)|subset($f3(B,A),B).
% 2.32/2.52 ** KEPT (pick-wt=23): 153 [] A=unordered_pair(B,C)|in($f4(B,C,A),A)|$f4(B,C,A)=B|$f4(B,C,A)=C.
% 2.32/2.52 ** KEPT (pick-wt=23): 154 [] A=set_union2(B,C)|in($f5(B,C,A),A)|in($f5(B,C,A),B)|in($f5(B,C,A),C).
% 2.32/2.52 ** KEPT (pick-wt=17): 155 [] A=cartesian_product2(B,C)|in($f10(B,C,A),A)|in($f9(B,C,A),B).
% 2.32/2.52 ** KEPT (pick-wt=17): 156 [] A=cartesian_product2(B,C)|in($f10(B,C,A),A)|in($f8(B,C,A),C).
% 2.32/2.52 ** KEPT (pick-wt=25): 158 [copy,157,flip.3] A=cartesian_product2(B,C)|in($f10(B,C,A),A)|ordered_pair($f9(B,C,A),$f8(B,C,A))=$f10(B,C,A).
% 2.32/2.52 ** KEPT (pick-wt=8): 159 [] subset(A,B)|in($f11(A,B),A).
% 2.32/2.52 ** KEPT (pick-wt=17): 160 [] A=set_intersection2(B,C)|in($f12(B,C,A),A)|in($f12(B,C,A),B).
% 2.32/2.52 ** KEPT (pick-wt=17): 161 [] A=set_intersection2(B,C)|in($f12(B,C,A),A)|in($f12(B,C,A),C).
% 2.32/2.52 ** KEPT (pick-wt=16): 162 [] A=union(B)|in($f15(B,A),A)|in($f15(B,A),$f14(B,A)).
% 2.32/2.52 ** KEPT (pick-wt=14): 163 [] A=union(B)|in($f15(B,A),A)|in($f14(B,A),B).
% 2.32/2.52 ** KEPT (pick-wt=17): 164 [] A=set_difference(B,C)|in($f16(B,C,A),A)|in($f16(B,C,A),B).
% 2.32/2.52 ** KEPT (pick-wt=10): 166 [copy,165,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.32/2.52 ---> New Demodulator: 167 [new_demod,166] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.32/2.52 ** KEPT (pick-wt=4): 168 [] element($f17(A),A).
% 2.32/2.52 ** KEPT (pick-wt=2): 169 [] empty(empty_set).
% 2.32/2.52 ** KEPT (pick-wt=5): 170 [] set_union2(A,A)=A.
% 2.32/2.52 ---> New Demodulator: 171 [new_demod,170] set_union2(A,A)=A.
% 2.32/2.52 ** KEPT (pick-wt=5): 172 [] set_intersection2(A,A)=A.
% 2.32/2.52 ---> New Demodulator: 173 [new_demod,172] set_intersection2(A,A)=A.
% 2.32/2.52 ** KEPT (pick-wt=7): 174 [] in(A,B)|disjoint(singleton(A),B).
% 2.32/2.52 ** KEPT (pick-wt=4): 175 [] element($c2,powerset($c3)).
% 2.32/2.52 ** KEPT (pick-wt=3): 176 [] in($c1,$c2).
% 2.32/2.52 ** KEPT (pick-wt=7): 177 [] empty(A)|element($f18(A),powerset(A)).
% 2.32/2.52 ** KEPT (pick-wt=2): 178 [] empty($c4).
% 2.32/2.52 ** KEPT (pick-wt=3): 179 [] subset(A,A).
% 2.32/2.52 ** KEPT (pick-wt=4): 180 [] in(A,$f19(A)).
% 2.32/2.52 ** KEPT (pick-wt=5): 181 [] subset(set_intersection2(A,B),A).
% 2.32/2.52 ** KEPT (pick-wt=5): 182 [] set_union2(A,empty_set)=A.
% 2.32/2.52 ---> New Demodulator: 183 [new_demod,182] set_union2(A,empty_set)=A.
% 2.32/2.52 ** KEPT (pick-wt=5): 185 [copy,184,flip.1] singleton(empty_set)=powerset(empty_set).
% 2.32/2.52 ---> New Demodulator: 186 [new_demod,185] singleton(empty_set)=powerset(empty_set).
% 2.32/2.52 ** KEPT (pick-wt=5): 187 [] set_intersection2(A,empty_set)=empty_set.
% 2.32/2.52 ---> New Demodulator: 188 [new_demod,187] set_intersection2(A,empty_set)=empty_set.
% 2.32/2.52 ** KEPT (pick-wt=13): 189 [] in($f20(A,B),A)|in($f20(A,B),B)|A=B.
% 2.32/2.52 ** KEPT (pick-wt=3): 190 [] subset(empty_set,A).
% 2.32/2.52 ** KEPT (pick-wt=5): 191 [] subset(set_difference(A,B),A).
% 2.32/2.52 ** KEPT (pick-wt=9): 192 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.32/2.52 ---> New Demodulator: 193 [new_demod,192] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.32/2.52 ** KEPT (pick-wt=5): 194 [] set_difference(A,empty_set)=A.
% 2.32/2.52 ---> New Demodulator: 195 [new_demod,194] set_difference(A,empty_set)=A.
% 2.32/2.52 ** KEPT (pick-wt=8): 196 [] disjoint(A,B)|in($f21(A,B),A).
% 2.32/2.52 ** KEPT (pick-wt=8): 197 [] disjoint(A,B)|in($f21(A,B),B).
% 2.32/2.52 ** KEPT (pick-wt=9): 198 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.32/2.52 ---> New Demodulator: 199 [new_demod,198] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.32/2.52 ** KEPT (pick-wt=9): 201 [copy,200,flip.1] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 2.32/2.52 ---> New Demodulator: 202 [new_demod,201] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 2.32/2.52 ** KEPT (pick-wt=5): 203 [] set_difference(empty_set,A)=empty_set.
% 2.40/2.58 ---> New Demodulator: 204 [new_demod,203] set_difference(empty_set,A)=empty_set.
% 2.40/2.58 ** KEPT (pick-wt=12): 206 [copy,205,demod,202] disjoint(A,B)|in($f22(A,B),set_difference(A,set_difference(A,B))).
% 2.40/2.58 ** KEPT (pick-wt=9): 207 [] set_difference(A,singleton(B))=A|in(B,A).
% 2.40/2.58 ** KEPT (pick-wt=6): 209 [copy,208,flip.1] singleton(A)=unordered_pair(A,A).
% 2.40/2.58 ---> New Demodulator: 210 [new_demod,209] singleton(A)=unordered_pair(A,A).
% 2.40/2.58 ** KEPT (pick-wt=5): 211 [] subset(A,set_union2(A,B)).
% 2.40/2.58 ** KEPT (pick-wt=5): 212 [] union(powerset(A))=A.
% 2.40/2.58 ---> New Demodulator: 213 [new_demod,212] union(powerset(A))=A.
% 2.40/2.58 ** KEPT (pick-wt=4): 214 [] in(A,$f24(A)).
% 2.40/2.58 Following clause subsumed by 146 during input processing: 0 [copy,146,flip.1] A=A.
% 2.40/2.58 146 back subsumes 142.
% 2.40/2.58 146 back subsumes 139.
% 2.40/2.58 146 back subsumes 117.
% 2.40/2.58 Following clause subsumed by 147 during input processing: 0 [copy,147,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 2.40/2.58 Following clause subsumed by 148 during input processing: 0 [copy,148,flip.1] set_union2(A,B)=set_union2(B,A).
% 2.40/2.58 ** KEPT (pick-wt=11): 215 [copy,149,flip.1,demod,202,202] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 2.40/2.58 >>>> Starting back demodulation with 167.
% 2.40/2.58 >>>> Starting back demodulation with 171.
% 2.40/2.58 >> back demodulating 143 with 171.
% 2.40/2.58 >> back demodulating 120 with 171.
% 2.40/2.58 >>>> Starting back demodulation with 173.
% 2.40/2.58 >> back demodulating 145 with 173.
% 2.40/2.58 >> back demodulating 138 with 173.
% 2.40/2.58 >> back demodulating 130 with 173.
% 2.40/2.58 >> back demodulating 127 with 173.
% 2.40/2.58 >>>> Starting back demodulation with 183.
% 2.40/2.58 >>>> Starting back demodulation with 186.
% 2.40/2.58 >>>> Starting back demodulation with 188.
% 2.40/2.58 >>>> Starting back demodulation with 193.
% 2.40/2.58 >> back demodulating 98 with 193.
% 2.40/2.58 >>>> Starting back demodulation with 195.
% 2.40/2.58 >>>> Starting back demodulation with 199.
% 2.40/2.58 >>>> Starting back demodulation with 202.
% 2.40/2.58 >> back demodulating 187 with 202.
% 2.40/2.58 >> back demodulating 181 with 202.
% 2.40/2.58 >> back demodulating 172 with 202.
% 2.40/2.58 >> back demodulating 161 with 202.
% 2.40/2.58 >> back demodulating 160 with 202.
% 2.40/2.58 >> back demodulating 149 with 202.
% 2.40/2.58 >> back demodulating 129 with 202.
% 2.40/2.58 >> back demodulating 128 with 202.
% 2.40/2.58 >> back demodulating 99 with 202.
% 2.40/2.58 >> back demodulating 87 with 202.
% 2.40/2.58 >> back demodulating 86 with 202.
% 2.40/2.58 >> back demodulating 84 with 202.
% 2.40/2.58 >> back demodulating 49 with 202.
% 2.40/2.58 >> back demodulating 48 with 202.
% 2.40/2.58 >> back demodulating 38 with 202.
% 2.40/2.58 >> back demodulating 37 with 202.
% 2.40/2.58 >> back demodulating 36 with 202.
% 2.40/2.58 >> back demodulating 35 with 202.
% 2.40/2.58 >>>> Starting back demodulation with 204.
% 2.40/2.58 >>>> Starting back demodulation with 210.
% 2.40/2.58 >> back demodulating 207 with 210.
% 2.40/2.58 >> back demodulating 185 with 210.
% 2.40/2.58 >> back demodulating 174 with 210.
% 2.40/2.58 >> back demodulating 166 with 210.
% 2.40/2.58 >> back demodulating 150 with 210.
% 2.40/2.58 >> back demodulating 115 with 210.
% 2.40/2.58 >> back demodulating 110 with 210.
% 2.40/2.58 >> back demodulating 104 with 210.
% 2.40/2.58 >> back demodulating 102 with 210.
% 2.40/2.58 >> back demodulating 68 with 210.
% 2.40/2.58 >> back demodulating 67 with 210.
% 2.40/2.58 >> back demodulating 66 with 210.
% 2.40/2.58 >> back demodulating 62 with 210.
% 2.40/2.58 >> back demodulating 61 with 210.
% 2.40/2.58 >> back demodulating 60 with 210.
% 2.40/2.58 >> back demodulating 59 with 210.
% 2.40/2.58 >> back demodulating 58 with 210.
% 2.40/2.58 >> back demodulating 8 with 210.
% 2.40/2.58 >> back demodulating 7 with 210.
% 2.40/2.58 >> back demodulating 6 with 210.
% 2.40/2.58 >>>> Starting back demodulation with 213.
% 2.40/2.58 Following clause subsumed by 215 during input processing: 0 [copy,215,flip.1] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 2.40/2.58 >>>> Starting back demodulation with 227.
% 2.40/2.58 >>>> Starting back demodulation with 243.
% 2.40/2.58 >>>> Starting back demodulation with 246.
% 2.40/2.58
% 2.40/2.58 ======= end of input processing =======
% 2.40/2.58
% 2.40/2.58 =========== start of search ===========
% 2.40/2.58
% 2.40/2.58
% 2.40/2.58 Resetting weight limit to 5.
% 2.40/2.58
% 2.40/2.58
% 2.40/2.58 Resetting weight limit to 5.
% 2.40/2.58
% 2.40/2.58 sos_size=504
% 2.40/2.58
% 2.40/2.58 -------- PROOF --------
% 2.40/2.58
% 2.40/2.58 ----> UNIT CONFLICT at 0.08 sec ----> 766 [binary,765.1,65.1] $F.
% 2.40/2.58
% 2.40/2.58 Length of proof is 2. Level of proof is 2.
% 2.40/2.58
% 2.40/2.58 ---------------- PROOF ----------------
% 2.40/2.58 % SZS status Theorem
% 2.40/2.58 % SZS output start Refutation
% See solution above
% 2.40/2.58 ------------ end of proof -------------
% 2.40/2.58
% 2.40/2.58
% 2.40/2.58 Search stopped by max_proofs option.
% 2.40/2.58
% 2.40/2.58
% 2.40/2.58 Search stopped by max_proofs option.
% 2.40/2.58
% 2.40/2.58 ============ end of search ============
% 2.40/2.58
% 2.40/2.58 -------------- statistics -------------
% 2.40/2.58 clauses given 22
% 2.40/2.58 clauses generated 1705
% 2.40/2.58 clauses kept 733
% 2.40/2.58 clauses forward subsumed 370
% 2.40/2.58 clauses back subsumed 7
% 2.40/2.58 Kbytes malloced 4882
% 2.40/2.58
% 2.40/2.58 ----------- times (seconds) -----------
% 2.40/2.58 user CPU time 0.08 (0 hr, 0 min, 0 sec)
% 2.40/2.58 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.40/2.58 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.40/2.58
% 2.40/2.58 That finishes the proof of the theorem.
% 2.40/2.58
% 2.40/2.58 Process 22731 finished Wed Jul 27 07:39:55 2022
% 2.40/2.58 Otter interrupted
% 2.40/2.58 PROOF FOUND
%------------------------------------------------------------------------------