TSTP Solution File: SEU161+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU161+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:14:59 EDT 2022
% Result : Theorem 6.30s 6.45s
% Output : Refutation 6.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 8 RR)
% Number of literals : 15 ( 6 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(70,axiom,
( ~ subset(A,B)
| set_union2(A,B) = B ),
file('SEU161+2.p',unknown),
[] ).
cnf(81,axiom,
( subset(unordered_pair(A,B),C)
| ~ in(A,C)
| ~ in(B,C) ),
file('SEU161+2.p',unknown),
[] ).
cnf(86,axiom,
set_union2(singleton(dollar_c4),dollar_c3) != dollar_c3,
file('SEU161+2.p',unknown),
[] ).
cnf(121,plain,
( subset(unordered_pair(A,A),B)
| ~ in(A,B) ),
inference(factor,[status(thm)],[81]),
[iquote('factor,81.2.3')] ).
cnf(127,axiom,
A = A,
file('SEU161+2.p',unknown),
[] ).
cnf(176,axiom,
in(dollar_c4,dollar_c3),
file('SEU161+2.p',unknown),
[] ).
cnf(184,axiom,
unordered_pair(A,A) = singleton(A),
file('SEU161+2.p',unknown),
[] ).
cnf(186,plain,
singleton(A) = unordered_pair(A,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[184])]),
[iquote('copy,184,flip.1')] ).
cnf(223,plain,
set_union2(unordered_pair(dollar_c4,dollar_c4),dollar_c3) != dollar_c3,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[86]),186]),
[iquote('back_demod,86,demod,186')] ).
cnf(312,plain,
subset(unordered_pair(dollar_c4,dollar_c4),dollar_c3),
inference(hyper,[status(thm)],[176,121]),
[iquote('hyper,176,121')] ).
cnf(952,plain,
$false,
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[223,70]),127,312]),
[iquote('para_into,223.1.1,70.2.1,unit_del,127,312')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU161+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n019.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 07:58:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.01/2.20 ----- Otter 3.3f, August 2004 -----
% 2.01/2.20 The process was started by sandbox2 on n019.cluster.edu,
% 2.01/2.20 Wed Jul 27 07:58:07 2022
% 2.01/2.20 The command was "./otter". The process ID is 29363.
% 2.01/2.20
% 2.01/2.20 set(prolog_style_variables).
% 2.01/2.20 set(auto).
% 2.01/2.20 dependent: set(auto1).
% 2.01/2.20 dependent: set(process_input).
% 2.01/2.20 dependent: clear(print_kept).
% 2.01/2.20 dependent: clear(print_new_demod).
% 2.01/2.20 dependent: clear(print_back_demod).
% 2.01/2.20 dependent: clear(print_back_sub).
% 2.01/2.20 dependent: set(control_memory).
% 2.01/2.20 dependent: assign(max_mem, 12000).
% 2.01/2.20 dependent: assign(pick_given_ratio, 4).
% 2.01/2.20 dependent: assign(stats_level, 1).
% 2.01/2.20 dependent: assign(max_seconds, 10800).
% 2.01/2.20 clear(print_given).
% 2.01/2.20
% 2.01/2.20 formula_list(usable).
% 2.01/2.20 all A (A=A).
% 2.01/2.20 all A B (in(A,B)-> -in(B,A)).
% 2.01/2.20 all A B (proper_subset(A,B)-> -proper_subset(B,A)).
% 2.01/2.20 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.01/2.20 all A B (set_union2(A,B)=set_union2(B,A)).
% 2.01/2.20 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.01/2.20 all A B (A=B<->subset(A,B)&subset(B,A)).
% 2.01/2.20 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 2.01/2.20 all A (A=empty_set<-> (all B (-in(B,A)))).
% 2.01/2.20 all A B (B=powerset(A)<-> (all C (in(C,B)<->subset(C,A)))).
% 2.01/2.20 all A B C (C=unordered_pair(A,B)<-> (all D (in(D,C)<->D=A|D=B))).
% 2.01/2.20 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 2.01/2.20 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.01/2.20 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 2.01/2.20 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 2.01/2.20 all A B (B=union(A)<-> (all C (in(C,B)<-> (exists D (in(C,D)&in(D,A)))))).
% 2.01/2.20 all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 2.01/2.20 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.01/2.20 all A B (disjoint(A,B)<->set_intersection2(A,B)=empty_set).
% 2.01/2.20 all A B (proper_subset(A,B)<->subset(A,B)&A!=B).
% 2.01/2.20 $T.
% 2.01/2.20 $T.
% 2.01/2.20 $T.
% 2.01/2.20 $T.
% 2.01/2.20 $T.
% 2.01/2.20 $T.
% 2.01/2.20 $T.
% 2.01/2.20 $T.
% 2.01/2.20 $T.
% 2.01/2.20 $T.
% 2.01/2.20 empty(empty_set).
% 2.01/2.20 all A B (-empty(ordered_pair(A,B))).
% 2.01/2.20 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 2.01/2.20 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 2.01/2.20 all A B (set_union2(A,A)=A).
% 2.01/2.20 all A B (set_intersection2(A,A)=A).
% 2.01/2.20 all A B (-proper_subset(A,A)).
% 2.01/2.20 all A (singleton(A)!=empty_set).
% 2.01/2.20 all A B (in(A,B)->set_union2(singleton(A),B)=B).
% 2.01/2.20 all A B (-(disjoint(singleton(A),B)&in(A,B))).
% 2.01/2.20 all A B (-in(A,B)->disjoint(singleton(A),B)).
% 2.01/2.20 all A B (subset(singleton(A),B)<->in(A,B)).
% 2.01/2.20 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 2.01/2.20 all A B C (subset(A,B)->in(C,A)|subset(A,set_difference(B,singleton(C)))).
% 2.01/2.20 all A B (subset(A,singleton(B))<->A=empty_set|A=singleton(B)).
% 2.01/2.20 all A B (in(A,B)->subset(A,union(B))).
% 2.01/2.20 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 2.01/2.20 exists A empty(A).
% 2.01/2.20 exists A (-empty(A)).
% 2.01/2.20 all A B subset(A,A).
% 2.01/2.20 all A B (disjoint(A,B)->disjoint(B,A)).
% 2.01/2.20 all A B C D (-(unordered_pair(A,B)=unordered_pair(C,D)&A!=C&A!=D)).
% 2.01/2.20 all A B (subset(A,B)->set_union2(A,B)=B).
% 2.01/2.20 all A B subset(set_intersection2(A,B),A).
% 2.01/2.20 all A B C (subset(A,B)&subset(A,C)->subset(A,set_intersection2(B,C))).
% 2.01/2.20 all A (set_union2(A,empty_set)=A).
% 2.01/2.20 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 2.01/2.20 powerset(empty_set)=singleton(empty_set).
% 2.01/2.20 all A B C (subset(A,B)->subset(set_intersection2(A,C),set_intersection2(B,C))).
% 2.01/2.20 all A B (subset(A,B)->set_intersection2(A,B)=A).
% 2.01/2.20 all A (set_intersection2(A,empty_set)=empty_set).
% 2.01/2.20 all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 2.01/2.20 all A subset(empty_set,A).
% 2.01/2.20 all A B C (subset(A,B)->subset(set_difference(A,C),set_difference(B,C))).
% 2.01/2.20 all A B C D (ordered_pair(A,B)=ordered_pair(C,D)->A=C&B=D).
% 2.01/2.20 all A B subset(set_difference(A,B),A).
% 2.01/2.20 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 2.01/2.20 all A B (subset(singleton(A),B)<->in(A,B)).
% 2.01/2.20 all A B C (subset(unordered_pair(A,B),C)<->in(A,C)&in(B,C)).
% 2.01/2.20 all A B (set_union2(A,set_difference(B,A))=set_union2(A,B)).
% 2.01/2.20 all A B (subset(A,singleton(B))<->A=empty_set|A=singleton(B)).
% 2.01/2.20 all A (set_difference(A,empty_set)=A).
% 2.01/2.20 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.01/2.20 all A (subset(A,empty_set)->A=empty_set).
% 2.01/2.20 all A B (set_difference(set_union2(A,B),B)=set_difference(A,B)).
% 2.01/2.20 all A B (subset(A,B)->B=set_union2(A,set_difference(B,A))).
% 2.01/2.20 -(all A B (in(A,B)->set_union2(singleton(A),B)=B)).
% 2.01/2.20 all A B (set_difference(A,set_difference(A,B))=set_intersection2(A,B)).
% 2.01/2.20 all A (set_difference(empty_set,A)=empty_set).
% 2.01/2.20 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.01/2.20 all A B (-(subset(A,B)&proper_subset(B,A))).
% 2.01/2.20 all A B C (subset(A,B)&disjoint(B,C)->disjoint(A,C)).
% 2.01/2.20 all A (unordered_pair(A,A)=singleton(A)).
% 2.01/2.20 all A (empty(A)->A=empty_set).
% 2.01/2.20 all A B (subset(singleton(A),singleton(B))->A=B).
% 2.01/2.20 all A B (-(in(A,B)&empty(B))).
% 2.01/2.20 all A B subset(A,set_union2(A,B)).
% 2.01/2.20 all A B (disjoint(A,B)<->set_difference(A,B)=A).
% 2.01/2.20 all A B (-(empty(A)&A!=B&empty(B))).
% 2.01/2.20 all A B C (subset(A,B)&subset(C,B)->subset(set_union2(A,C),B)).
% 2.01/2.20 all A B C (singleton(A)=unordered_pair(B,C)->A=B).
% 2.01/2.20 all A B C (singleton(A)=unordered_pair(B,C)->B=C).
% 2.01/2.20 end_of_list.
% 2.01/2.20
% 2.01/2.20 -------> usable clausifies to:
% 2.01/2.20
% 2.01/2.20 list(usable).
% 2.01/2.20 0 [] A=A.
% 2.01/2.20 0 [] -in(A,B)| -in(B,A).
% 2.01/2.20 0 [] -proper_subset(A,B)| -proper_subset(B,A).
% 2.01/2.20 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.01/2.20 0 [] set_union2(A,B)=set_union2(B,A).
% 2.01/2.20 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.01/2.20 0 [] A!=B|subset(A,B).
% 2.01/2.20 0 [] A!=B|subset(B,A).
% 2.01/2.20 0 [] A=B| -subset(A,B)| -subset(B,A).
% 2.01/2.20 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 2.01/2.20 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 2.01/2.20 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 2.01/2.20 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 2.01/2.20 0 [] A!=empty_set| -in(B,A).
% 2.01/2.20 0 [] A=empty_set|in($f2(A),A).
% 2.01/2.20 0 [] B!=powerset(A)| -in(C,B)|subset(C,A).
% 2.01/2.20 0 [] B!=powerset(A)|in(C,B)| -subset(C,A).
% 2.01/2.20 0 [] B=powerset(A)|in($f3(A,B),B)|subset($f3(A,B),A).
% 2.01/2.20 0 [] B=powerset(A)| -in($f3(A,B),B)| -subset($f3(A,B),A).
% 2.01/2.20 0 [] C!=unordered_pair(A,B)| -in(D,C)|D=A|D=B.
% 2.01/2.20 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=A.
% 2.01/2.20 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=B.
% 2.01/2.20 0 [] C=unordered_pair(A,B)|in($f4(A,B,C),C)|$f4(A,B,C)=A|$f4(A,B,C)=B.
% 2.01/2.20 0 [] C=unordered_pair(A,B)| -in($f4(A,B,C),C)|$f4(A,B,C)!=A.
% 2.01/2.20 0 [] C=unordered_pair(A,B)| -in($f4(A,B,C),C)|$f4(A,B,C)!=B.
% 2.01/2.20 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 2.01/2.20 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 2.01/2.20 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 2.01/2.20 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.01/2.20 0 [] C=set_union2(A,B)| -in($f5(A,B,C),C)| -in($f5(A,B,C),A).
% 2.01/2.20 0 [] C=set_union2(A,B)| -in($f5(A,B,C),C)| -in($f5(A,B,C),B).
% 2.01/2.20 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f7(A,B,C,D),A).
% 2.01/2.20 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f6(A,B,C,D),B).
% 2.01/2.20 0 [] C!=cartesian_product2(A,B)| -in(D,C)|D=ordered_pair($f7(A,B,C,D),$f6(A,B,C,D)).
% 2.01/2.20 0 [] C!=cartesian_product2(A,B)|in(D,C)| -in(E,A)| -in(F,B)|D!=ordered_pair(E,F).
% 2.01/2.20 0 [] C=cartesian_product2(A,B)|in($f10(A,B,C),C)|in($f9(A,B,C),A).
% 2.01/2.20 0 [] C=cartesian_product2(A,B)|in($f10(A,B,C),C)|in($f8(A,B,C),B).
% 2.01/2.20 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.01/2.20 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.01/2.20 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.01/2.20 0 [] subset(A,B)|in($f11(A,B),A).
% 2.01/2.20 0 [] subset(A,B)| -in($f11(A,B),B).
% 2.01/2.20 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 2.01/2.20 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 2.01/2.20 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 2.01/2.20 0 [] C=set_intersection2(A,B)|in($f12(A,B,C),C)|in($f12(A,B,C),A).
% 2.01/2.20 0 [] C=set_intersection2(A,B)|in($f12(A,B,C),C)|in($f12(A,B,C),B).
% 2.01/2.20 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.01/2.20 0 [] B!=union(A)| -in(C,B)|in(C,$f13(A,B,C)).
% 2.01/2.20 0 [] B!=union(A)| -in(C,B)|in($f13(A,B,C),A).
% 2.01/2.20 0 [] B!=union(A)|in(C,B)| -in(C,D)| -in(D,A).
% 2.01/2.20 0 [] B=union(A)|in($f15(A,B),B)|in($f15(A,B),$f14(A,B)).
% 2.01/2.20 0 [] B=union(A)|in($f15(A,B),B)|in($f14(A,B),A).
% 2.01/2.20 0 [] B=union(A)| -in($f15(A,B),B)| -in($f15(A,B),X3)| -in(X3,A).
% 2.01/2.20 0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 2.01/2.20 0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 2.01/2.20 0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 2.01/2.20 0 [] C=set_difference(A,B)|in($f16(A,B,C),C)|in($f16(A,B,C),A).
% 2.01/2.20 0 [] C=set_difference(A,B)|in($f16(A,B,C),C)| -in($f16(A,B,C),B).
% 2.01/2.20 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.01/2.20 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.01/2.20 0 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 2.01/2.20 0 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 2.01/2.20 0 [] -proper_subset(A,B)|subset(A,B).
% 2.01/2.20 0 [] -proper_subset(A,B)|A!=B.
% 2.01/2.20 0 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 2.01/2.20 0 [] $T.
% 2.01/2.20 0 [] $T.
% 2.01/2.20 0 [] $T.
% 2.01/2.20 0 [] $T.
% 2.01/2.20 0 [] $T.
% 2.01/2.20 0 [] $T.
% 2.01/2.20 0 [] $T.
% 2.01/2.20 0 [] $T.
% 2.01/2.20 0 [] $T.
% 2.01/2.20 0 [] $T.
% 2.01/2.20 0 [] empty(empty_set).
% 2.01/2.20 0 [] -empty(ordered_pair(A,B)).
% 2.01/2.20 0 [] empty(A)| -empty(set_union2(A,B)).
% 2.01/2.20 0 [] empty(A)| -empty(set_union2(B,A)).
% 2.01/2.20 0 [] set_union2(A,A)=A.
% 2.01/2.20 0 [] set_intersection2(A,A)=A.
% 2.01/2.20 0 [] -proper_subset(A,A).
% 2.01/2.20 0 [] singleton(A)!=empty_set.
% 2.01/2.20 0 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.01/2.20 0 [] -disjoint(singleton(A),B)| -in(A,B).
% 2.01/2.20 0 [] in(A,B)|disjoint(singleton(A),B).
% 2.01/2.20 0 [] -subset(singleton(A),B)|in(A,B).
% 2.01/2.20 0 [] subset(singleton(A),B)| -in(A,B).
% 2.01/2.20 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.01/2.20 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.01/2.20 0 [] -subset(A,B)|in(C,A)|subset(A,set_difference(B,singleton(C))).
% 2.01/2.20 0 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.01/2.20 0 [] subset(A,singleton(B))|A!=empty_set.
% 2.01/2.20 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.01/2.20 0 [] -in(A,B)|subset(A,union(B)).
% 2.01/2.20 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.01/2.20 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.01/2.20 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.01/2.20 0 [] empty($c1).
% 2.01/2.20 0 [] -empty($c2).
% 2.01/2.20 0 [] subset(A,A).
% 2.01/2.20 0 [] -disjoint(A,B)|disjoint(B,A).
% 2.01/2.20 0 [] unordered_pair(A,B)!=unordered_pair(C,D)|A=C|A=D.
% 2.01/2.20 0 [] -subset(A,B)|set_union2(A,B)=B.
% 2.01/2.20 0 [] subset(set_intersection2(A,B),A).
% 2.01/2.20 0 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 2.01/2.20 0 [] set_union2(A,empty_set)=A.
% 2.01/2.20 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.01/2.20 0 [] powerset(empty_set)=singleton(empty_set).
% 2.01/2.20 0 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 2.01/2.20 0 [] -subset(A,B)|set_intersection2(A,B)=A.
% 2.01/2.20 0 [] set_intersection2(A,empty_set)=empty_set.
% 2.01/2.20 0 [] in($f17(A,B),A)|in($f17(A,B),B)|A=B.
% 2.01/2.20 0 [] -in($f17(A,B),A)| -in($f17(A,B),B)|A=B.
% 2.01/2.20 0 [] subset(empty_set,A).
% 2.01/2.20 0 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 2.01/2.20 0 [] ordered_pair(A,B)!=ordered_pair(C,D)|A=C.
% 2.01/2.20 0 [] ordered_pair(A,B)!=ordered_pair(C,D)|B=D.
% 2.01/2.20 0 [] subset(set_difference(A,B),A).
% 2.01/2.20 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.01/2.20 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.01/2.20 0 [] -subset(singleton(A),B)|in(A,B).
% 2.01/2.20 0 [] subset(singleton(A),B)| -in(A,B).
% 2.01/2.20 0 [] -subset(unordered_pair(A,B),C)|in(A,C).
% 2.01/2.20 0 [] -subset(unordered_pair(A,B),C)|in(B,C).
% 2.01/2.20 0 [] subset(unordered_pair(A,B),C)| -in(A,C)| -in(B,C).
% 2.01/2.20 0 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.01/2.20 0 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.01/2.20 0 [] subset(A,singleton(B))|A!=empty_set.
% 2.01/2.20 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.01/2.20 0 [] set_difference(A,empty_set)=A.
% 2.01/2.20 0 [] disjoint(A,B)|in($f18(A,B),A).
% 2.01/2.20 0 [] disjoint(A,B)|in($f18(A,B),B).
% 2.01/2.20 0 [] -in(C,A)| -in(C,B)| -disjoint(A,B).
% 2.01/2.20 0 [] -subset(A,empty_set)|A=empty_set.
% 2.01/2.20 0 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.01/2.20 0 [] -subset(A,B)|B=set_union2(A,set_difference(B,A)).
% 2.01/2.20 0 [] in($c4,$c3).
% 2.01/2.20 0 [] set_union2(singleton($c4),$c3)!=$c3.
% 2.01/2.20 0 [] set_difference(A,set_difference(A,B))=set_intersection2(A,B).
% 2.01/2.20 0 [] set_difference(empty_set,A)=empty_set.
% 2.01/2.20 0 [] disjoint(A,B)|in($f19(A,B),set_intersection2(A,B)).
% 2.01/2.20 0 [] -in(C,set_intersection2(A,B))| -disjoint(A,B).
% 2.01/2.20 0 [] -subset(A,B)| -proper_subset(B,A).
% 2.01/2.20 0 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 2.01/2.20 0 [] unordered_pair(A,A)=singleton(A).
% 2.01/2.20 0 [] -empty(A)|A=empty_set.
% 2.01/2.20 0 [] -subset(singleton(A),singleton(B))|A=B.
% 2.01/2.20 0 [] -in(A,B)| -empty(B).
% 2.01/2.20 0 [] subset(A,set_union2(A,B)).
% 2.01/2.20 0 [] -disjoint(A,B)|set_difference(A,B)=A.
% 2.01/2.20 0 [] disjoint(A,B)|set_difference(A,B)!=A.
% 2.01/2.20 0 [] -empty(A)|A=B| -empty(B).
% 2.01/2.20 0 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 2.01/2.20 0 [] singleton(A)!=unordered_pair(B,C)|A=B.
% 2.01/2.20 0 [] singleton(A)!=unordered_pair(B,C)|B=C.
% 2.01/2.20 end_of_list.
% 2.01/2.20
% 2.01/2.20 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 2.01/2.20
% 2.01/2.20 This ia a non-Horn set with equality. The strategy will be
% 2.01/2.20 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.01/2.20 deletion, with positive clauses in sos and nonpositive
% 2.01/2.20 clauses in usable.
% 2.01/2.20
% 2.01/2.20 dependent: set(knuth_bendix).
% 2.01/2.20 dependent: set(anl_eq).
% 2.01/2.20 dependent: set(para_from).
% 2.01/2.20 dependent: set(para_into).
% 2.01/2.20 dependent: clear(para_from_right).
% 2.01/2.20 dependent: clear(para_into_right).
% 2.01/2.20 dependent: set(para_from_vars).
% 2.01/2.20 dependent: set(eq_units_both_ways).
% 2.01/2.20 dependent: set(dynamic_demod_all).
% 2.01/2.20 dependent: set(dynamic_demod).
% 2.01/2.20 dependent: set(order_eq).
% 2.01/2.20 dependent: set(back_demod).
% 2.01/2.20 dependent: set(lrpo).
% 2.01/2.20 dependent: set(hyper_res).
% 2.01/2.20 dependent: set(unit_deletion).
% 2.01/2.20 dependent: set(factor).
% 2.01/2.20
% 2.01/2.20 ------------> process usable:
% 2.01/2.20 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.01/2.20 ** KEPT (pick-wt=6): 2 [] -proper_subset(A,B)| -proper_subset(B,A).
% 2.01/2.20 ** KEPT (pick-wt=6): 3 [] A!=B|subset(A,B).
% 2.01/2.20 ** KEPT (pick-wt=6): 4 [] A!=B|subset(B,A).
% 2.01/2.20 ** KEPT (pick-wt=9): 5 [] A=B| -subset(A,B)| -subset(B,A).
% 2.01/2.20 ** KEPT (pick-wt=10): 6 [] A!=singleton(B)| -in(C,A)|C=B.
% 2.01/2.20 ** KEPT (pick-wt=10): 7 [] A!=singleton(B)|in(C,A)|C!=B.
% 2.01/2.20 ** KEPT (pick-wt=14): 8 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 2.01/2.20 ** KEPT (pick-wt=6): 9 [] A!=empty_set| -in(B,A).
% 2.01/2.20 ** KEPT (pick-wt=10): 10 [] A!=powerset(B)| -in(C,A)|subset(C,B).
% 2.01/2.20 ** KEPT (pick-wt=10): 11 [] A!=powerset(B)|in(C,A)| -subset(C,B).
% 2.01/2.20 ** KEPT (pick-wt=14): 12 [] A=powerset(B)| -in($f3(B,A),A)| -subset($f3(B,A),B).
% 2.01/2.20 ** KEPT (pick-wt=14): 13 [] A!=unordered_pair(B,C)| -in(D,A)|D=B|D=C.
% 2.01/2.20 ** KEPT (pick-wt=11): 14 [] A!=unordered_pair(B,C)|in(D,A)|D!=B.
% 2.01/2.20 ** KEPT (pick-wt=11): 15 [] A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 2.01/2.20 ** KEPT (pick-wt=17): 16 [] A=unordered_pair(B,C)| -in($f4(B,C,A),A)|$f4(B,C,A)!=B.
% 2.01/2.20 ** KEPT (pick-wt=17): 17 [] A=unordered_pair(B,C)| -in($f4(B,C,A),A)|$f4(B,C,A)!=C.
% 2.01/2.20 ** KEPT (pick-wt=14): 18 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 2.01/2.20 ** KEPT (pick-wt=11): 19 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 2.01/2.20 ** KEPT (pick-wt=11): 20 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 2.01/2.20 ** KEPT (pick-wt=17): 21 [] A=set_union2(B,C)| -in($f5(B,C,A),A)| -in($f5(B,C,A),B).
% 2.01/2.20 ** KEPT (pick-wt=17): 22 [] A=set_union2(B,C)| -in($f5(B,C,A),A)| -in($f5(B,C,A),C).
% 2.01/2.20 ** KEPT (pick-wt=15): 23 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f7(B,C,A,D),B).
% 2.01/2.20 ** KEPT (pick-wt=15): 24 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f6(B,C,A,D),C).
% 2.01/2.20 ** KEPT (pick-wt=21): 26 [copy,25,flip.3] A!=cartesian_product2(B,C)| -in(D,A)|ordered_pair($f7(B,C,A,D),$f6(B,C,A,D))=D.
% 2.01/2.20 ** KEPT (pick-wt=19): 27 [] A!=cartesian_product2(B,C)|in(D,A)| -in(E,B)| -in(F,C)|D!=ordered_pair(E,F).
% 2.01/2.20 ** KEPT (pick-wt=25): 28 [] 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.01/2.20 ** KEPT (pick-wt=9): 29 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.01/2.20 ** KEPT (pick-wt=8): 30 [] subset(A,B)| -in($f11(A,B),B).
% 2.01/2.20 ** KEPT (pick-wt=11): 31 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 2.01/2.20 ** KEPT (pick-wt=11): 32 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 2.01/2.20 ** KEPT (pick-wt=14): 33 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 2.01/2.20 ** KEPT (pick-wt=23): 34 [] A=set_intersection2(B,C)| -in($f12(B,C,A),A)| -in($f12(B,C,A),B)| -in($f12(B,C,A),C).
% 2.01/2.20 ** KEPT (pick-wt=13): 35 [] A!=union(B)| -in(C,A)|in(C,$f13(B,A,C)).
% 2.01/2.20 ** KEPT (pick-wt=13): 36 [] A!=union(B)| -in(C,A)|in($f13(B,A,C),B).
% 2.01/2.20 ** KEPT (pick-wt=13): 37 [] A!=union(B)|in(C,A)| -in(C,D)| -in(D,B).
% 2.01/2.20 ** KEPT (pick-wt=17): 38 [] A=union(B)| -in($f15(B,A),A)| -in($f15(B,A),C)| -in(C,B).
% 2.01/2.20 ** KEPT (pick-wt=11): 39 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 2.01/2.20 ** KEPT (pick-wt=11): 40 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 2.01/2.20 ** KEPT (pick-wt=14): 41 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 2.01/2.20 ** KEPT (pick-wt=17): 42 [] A=set_difference(B,C)|in($f16(B,C,A),A)| -in($f16(B,C,A),C).
% 2.01/2.20 ** KEPT (pick-wt=23): 43 [] A=set_difference(B,C)| -in($f16(B,C,A),A)| -in($f16(B,C,A),B)|in($f16(B,C,A),C).
% 2.01/2.20 ** KEPT (pick-wt=8): 44 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 2.01/2.20 ** KEPT (pick-wt=8): 45 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 2.01/2.20 ** KEPT (pick-wt=6): 46 [] -proper_subset(A,B)|subset(A,B).
% 2.01/2.20 ** KEPT (pick-wt=6): 47 [] -proper_subset(A,B)|A!=B.
% 2.01/2.20 ** KEPT (pick-wt=9): 48 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 2.01/2.20 ** KEPT (pick-wt=4): 49 [] -empty(ordered_pair(A,B)).
% 2.01/2.21 ** KEPT (pick-wt=6): 50 [] empty(A)| -empty(set_union2(A,B)).
% 2.01/2.21 ** KEPT (pick-wt=6): 51 [] empty(A)| -empty(set_union2(B,A)).
% 2.01/2.21 ** KEPT (pick-wt=3): 52 [] -proper_subset(A,A).
% 2.01/2.21 ** KEPT (pick-wt=4): 53 [] singleton(A)!=empty_set.
% 2.01/2.21 ** KEPT (pick-wt=9): 54 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.01/2.21 ** KEPT (pick-wt=7): 55 [] -disjoint(singleton(A),B)| -in(A,B).
% 2.01/2.21 ** KEPT (pick-wt=7): 56 [] -subset(singleton(A),B)|in(A,B).
% 2.01/2.21 ** KEPT (pick-wt=7): 57 [] subset(singleton(A),B)| -in(A,B).
% 2.01/2.21 ** KEPT (pick-wt=8): 58 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.01/2.21 ** KEPT (pick-wt=8): 59 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.01/2.21 ** KEPT (pick-wt=12): 60 [] -subset(A,B)|in(C,A)|subset(A,set_difference(B,singleton(C))).
% 2.01/2.21 ** KEPT (pick-wt=11): 61 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.01/2.21 ** KEPT (pick-wt=7): 62 [] subset(A,singleton(B))|A!=empty_set.
% 2.01/2.21 Following clause subsumed by 3 during input processing: 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.01/2.21 ** KEPT (pick-wt=7): 63 [] -in(A,B)|subset(A,union(B)).
% 2.01/2.21 ** KEPT (pick-wt=10): 64 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 2.01/2.21 ** KEPT (pick-wt=10): 65 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 2.01/2.21 ** KEPT (pick-wt=13): 66 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 2.01/2.21 ** KEPT (pick-wt=2): 67 [] -empty($c2).
% 2.01/2.21 ** KEPT (pick-wt=6): 68 [] -disjoint(A,B)|disjoint(B,A).
% 2.01/2.21 ** KEPT (pick-wt=13): 69 [] unordered_pair(A,B)!=unordered_pair(C,D)|A=C|A=D.
% 2.01/2.21 ** KEPT (pick-wt=8): 70 [] -subset(A,B)|set_union2(A,B)=B.
% 2.01/2.21 ** KEPT (pick-wt=11): 71 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 2.01/2.21 ** KEPT (pick-wt=9): 72 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.01/2.21 ** KEPT (pick-wt=10): 73 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 2.01/2.21 ** KEPT (pick-wt=8): 74 [] -subset(A,B)|set_intersection2(A,B)=A.
% 2.01/2.21 ** KEPT (pick-wt=13): 75 [] -in($f17(A,B),A)| -in($f17(A,B),B)|A=B.
% 2.01/2.21 ** KEPT (pick-wt=10): 76 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 2.01/2.21 ** KEPT (pick-wt=10): 77 [] ordered_pair(A,B)!=ordered_pair(C,D)|A=C.
% 2.01/2.21 ** KEPT (pick-wt=10): 78 [] ordered_pair(A,B)!=ordered_pair(C,D)|B=D.
% 2.01/2.21 Following clause subsumed by 58 during input processing: 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.01/2.21 Following clause subsumed by 59 during input processing: 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.01/2.21 Following clause subsumed by 56 during input processing: 0 [] -subset(singleton(A),B)|in(A,B).
% 2.01/2.21 Following clause subsumed by 57 during input processing: 0 [] subset(singleton(A),B)| -in(A,B).
% 2.01/2.21 ** KEPT (pick-wt=8): 79 [] -subset(unordered_pair(A,B),C)|in(A,C).
% 2.01/2.21 ** KEPT (pick-wt=8): 80 [] -subset(unordered_pair(A,B),C)|in(B,C).
% 2.01/2.21 ** KEPT (pick-wt=11): 81 [] subset(unordered_pair(A,B),C)| -in(A,C)| -in(B,C).
% 2.01/2.21 Following clause subsumed by 61 during input processing: 0 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.01/2.21 Following clause subsumed by 62 during input processing: 0 [] subset(A,singleton(B))|A!=empty_set.
% 2.01/2.21 Following clause subsumed by 3 during input processing: 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.01/2.21 ** KEPT (pick-wt=9): 82 [] -in(A,B)| -in(A,C)| -disjoint(B,C).
% 2.01/2.21 ** KEPT (pick-wt=6): 83 [] -subset(A,empty_set)|A=empty_set.
% 2.01/2.21 ** KEPT (pick-wt=10): 85 [copy,84,flip.2] -subset(A,B)|set_union2(A,set_difference(B,A))=B.
% 2.01/2.21 ** KEPT (pick-wt=6): 86 [] set_union2(singleton($c4),$c3)!=$c3.
% 2.01/2.21 ** KEPT (pick-wt=8): 87 [] -in(A,set_intersection2(B,C))| -disjoint(B,C).
% 2.01/2.21 ** KEPT (pick-wt=6): 88 [] -subset(A,B)| -proper_subset(B,A).
% 2.01/2.21 ** KEPT (pick-wt=9): 89 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 2.01/2.21 ** KEPT (pick-wt=5): 90 [] -empty(A)|A=empty_set.
% 2.01/2.21 ** KEPT (pick-wt=8): 91 [] -subset(singleton(A),singleton(B))|A=B.
% 2.01/2.21 ** KEPT (pick-wt=5): 92 [] -in(A,B)| -empty(B).
% 2.01/2.21 ** KEPT (pick-wt=8): 93 [] -disjoint(A,B)|set_difference(A,B)=A.
% 2.01/2.21 ** KEPT (pick-wt=8): 94 [] disjoint(A,B)|set_difference(A,B)!=A.
% 2.01/2.21 ** KEPT (pick-wt=7): 95 [] -empty(A)|A=B| -empty(B).
% 2.01/2.21 ** KEPT (pick-wt=11): 96 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 2.01/2.21 ** KEPT (pick-wt=9): 97 [] singleton(A)!=unordered_pair(B,C)|A=B.
% 2.01/2.21 ** KEPT (pick-wt=9): 98 [] singleton(A)!=unordered_pair(B,C)|B=C.
% 2.01/2.21
% 2.01/2.21 ------------> process sos:
% 2.01/2.21 ** KEPT (pick-wt=3): 127 [] A=A.
% 2.01/2.21 ** KEPT (pick-wt=7): 128 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.01/2.21 ** KEPT (pick-wt=7): 129 [] set_union2(A,B)=set_union2(B,A).
% 2.01/2.21 ** KEPT (pick-wt=7): 130 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.01/2.21 ** KEPT (pick-wt=14): 131 [] A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B.
% 2.01/2.21 ** KEPT (pick-wt=7): 132 [] A=empty_set|in($f2(A),A).
% 2.01/2.21 ** KEPT (pick-wt=14): 133 [] A=powerset(B)|in($f3(B,A),A)|subset($f3(B,A),B).
% 2.01/2.21 ** KEPT (pick-wt=23): 134 [] A=unordered_pair(B,C)|in($f4(B,C,A),A)|$f4(B,C,A)=B|$f4(B,C,A)=C.
% 2.01/2.21 ** KEPT (pick-wt=23): 135 [] A=set_union2(B,C)|in($f5(B,C,A),A)|in($f5(B,C,A),B)|in($f5(B,C,A),C).
% 2.01/2.21 ** KEPT (pick-wt=17): 136 [] A=cartesian_product2(B,C)|in($f10(B,C,A),A)|in($f9(B,C,A),B).
% 2.01/2.21 ** KEPT (pick-wt=17): 137 [] A=cartesian_product2(B,C)|in($f10(B,C,A),A)|in($f8(B,C,A),C).
% 2.01/2.21 ** KEPT (pick-wt=25): 139 [copy,138,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.01/2.21 ** KEPT (pick-wt=8): 140 [] subset(A,B)|in($f11(A,B),A).
% 2.01/2.21 ** KEPT (pick-wt=17): 141 [] A=set_intersection2(B,C)|in($f12(B,C,A),A)|in($f12(B,C,A),B).
% 2.01/2.21 ** KEPT (pick-wt=17): 142 [] A=set_intersection2(B,C)|in($f12(B,C,A),A)|in($f12(B,C,A),C).
% 2.01/2.21 ** KEPT (pick-wt=16): 143 [] A=union(B)|in($f15(B,A),A)|in($f15(B,A),$f14(B,A)).
% 2.01/2.21 ** KEPT (pick-wt=14): 144 [] A=union(B)|in($f15(B,A),A)|in($f14(B,A),B).
% 2.01/2.21 ** KEPT (pick-wt=17): 145 [] A=set_difference(B,C)|in($f16(B,C,A),A)|in($f16(B,C,A),B).
% 2.01/2.21 ** KEPT (pick-wt=10): 147 [copy,146,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.01/2.21 ---> New Demodulator: 148 [new_demod,147] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.01/2.21 ** KEPT (pick-wt=2): 149 [] empty(empty_set).
% 2.01/2.21 ** KEPT (pick-wt=5): 150 [] set_union2(A,A)=A.
% 2.01/2.21 ---> New Demodulator: 151 [new_demod,150] set_union2(A,A)=A.
% 2.01/2.21 ** KEPT (pick-wt=5): 152 [] set_intersection2(A,A)=A.
% 2.01/2.21 ---> New Demodulator: 153 [new_demod,152] set_intersection2(A,A)=A.
% 2.01/2.21 ** KEPT (pick-wt=7): 154 [] in(A,B)|disjoint(singleton(A),B).
% 2.01/2.21 ** KEPT (pick-wt=2): 155 [] empty($c1).
% 2.01/2.21 ** KEPT (pick-wt=3): 156 [] subset(A,A).
% 2.01/2.21 ** KEPT (pick-wt=5): 157 [] subset(set_intersection2(A,B),A).
% 2.01/2.21 ** KEPT (pick-wt=5): 158 [] set_union2(A,empty_set)=A.
% 2.01/2.21 ---> New Demodulator: 159 [new_demod,158] set_union2(A,empty_set)=A.
% 2.01/2.21 ** KEPT (pick-wt=5): 161 [copy,160,flip.1] singleton(empty_set)=powerset(empty_set).
% 2.01/2.21 ---> New Demodulator: 162 [new_demod,161] singleton(empty_set)=powerset(empty_set).
% 2.01/2.21 ** KEPT (pick-wt=5): 163 [] set_intersection2(A,empty_set)=empty_set.
% 2.01/2.21 ---> New Demodulator: 164 [new_demod,163] set_intersection2(A,empty_set)=empty_set.
% 2.01/2.21 ** KEPT (pick-wt=13): 165 [] in($f17(A,B),A)|in($f17(A,B),B)|A=B.
% 2.01/2.21 ** KEPT (pick-wt=3): 166 [] subset(empty_set,A).
% 2.01/2.21 ** KEPT (pick-wt=5): 167 [] subset(set_difference(A,B),A).
% 2.01/2.21 ** KEPT (pick-wt=9): 168 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.01/2.21 ---> New Demodulator: 169 [new_demod,168] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.01/2.21 ** KEPT (pick-wt=5): 170 [] set_difference(A,empty_set)=A.
% 2.01/2.21 ---> New Demodulator: 171 [new_demod,170] set_difference(A,empty_set)=A.
% 2.01/2.21 ** KEPT (pick-wt=8): 172 [] disjoint(A,B)|in($f18(A,B),A).
% 2.01/2.21 ** KEPT (pick-wt=8): 173 [] disjoint(A,B)|in($f18(A,B),B).
% 2.01/2.21 ** KEPT (pick-wt=9): 174 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.01/2.21 ---> New Demodulator: 175 [new_demod,174] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.01/2.21 ** KEPT (pick-wt=3): 176 [] in($c4,$c3).
% 2.01/2.21 ** KEPT (pick-wt=9): 178 [copy,177,flip.1] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 2.01/2.21 ---> New Demodulator: 179 [new_demod,178] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 2.01/2.21 ** KEPT (pick-wt=5): 180 [] set_difference(empty_set,A)=empty_set.
% 2.01/2.21 ---> New Demodulator: 181 [new_demod,180] set_difference(empty_set,A)=empty_set.
% 2.01/2.21 ** KEPT (pick-wt=12): 183 [copy,182,demod,179] disjoint(A,B)|in($f19(A,B),set_difference(A,set_difference(A,B))).
% 2.01/2.21 ** KEPT (pick-wt=6): 185 [copy,184,flip.1] singleton(A)=unordered_pair(A,A).
% 2.01/2.21 ---> New Demodulator: 186 [new_demod,185] singleton(A)=unordered_pair(A,A).
% 6.30/6.45 ** KEPT (pick-wt=5): 187 [] subset(A,set_union2(A,B)).
% 6.30/6.45 Following clause subsumed by 127 during input processing: 0 [copy,127,flip.1] A=A.
% 6.30/6.45 127 back subsumes 123.
% 6.30/6.45 127 back subsumes 120.
% 6.30/6.45 127 back subsumes 100.
% 6.30/6.45 Following clause subsumed by 128 during input processing: 0 [copy,128,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 6.30/6.45 Following clause subsumed by 129 during input processing: 0 [copy,129,flip.1] set_union2(A,B)=set_union2(B,A).
% 6.30/6.45 ** KEPT (pick-wt=11): 188 [copy,130,flip.1,demod,179,179] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 6.30/6.45 >>>> Starting back demodulation with 148.
% 6.30/6.45 >>>> Starting back demodulation with 151.
% 6.30/6.45 >> back demodulating 124 with 151.
% 6.30/6.45 >> back demodulating 102 with 151.
% 6.30/6.45 >>>> Starting back demodulation with 153.
% 6.30/6.45 >> back demodulating 126 with 153.
% 6.30/6.45 >> back demodulating 119 with 153.
% 6.30/6.45 >> back demodulating 112 with 153.
% 6.30/6.45 >> back demodulating 109 with 153.
% 6.30/6.45 >>>> Starting back demodulation with 159.
% 6.30/6.45 >>>> Starting back demodulation with 162.
% 6.30/6.45 >>>> Starting back demodulation with 164.
% 6.30/6.45 >>>> Starting back demodulation with 169.
% 6.30/6.45 >> back demodulating 85 with 169.
% 6.30/6.45 >>>> Starting back demodulation with 171.
% 6.30/6.45 >>>> Starting back demodulation with 175.
% 6.30/6.45 >>>> Starting back demodulation with 179.
% 6.30/6.45 >> back demodulating 163 with 179.
% 6.30/6.45 >> back demodulating 157 with 179.
% 6.30/6.45 >> back demodulating 152 with 179.
% 6.30/6.45 >> back demodulating 142 with 179.
% 6.30/6.45 >> back demodulating 141 with 179.
% 6.30/6.45 >> back demodulating 130 with 179.
% 6.30/6.45 >> back demodulating 111 with 179.
% 6.30/6.45 >> back demodulating 110 with 179.
% 6.30/6.45 >> back demodulating 87 with 179.
% 6.30/6.45 >> back demodulating 74 with 179.
% 6.30/6.45 >> back demodulating 73 with 179.
% 6.30/6.45 >> back demodulating 71 with 179.
% 6.30/6.45 >> back demodulating 45 with 179.
% 6.30/6.45 >> back demodulating 44 with 179.
% 6.30/6.45 >> back demodulating 34 with 179.
% 6.30/6.45 >> back demodulating 33 with 179.
% 6.30/6.45 >> back demodulating 32 with 179.
% 6.30/6.45 >> back demodulating 31 with 179.
% 6.30/6.45 >>>> Starting back demodulation with 181.
% 6.30/6.45 >>>> Starting back demodulation with 186.
% 6.30/6.45 >> back demodulating 161 with 186.
% 6.30/6.45 >> back demodulating 154 with 186.
% 6.30/6.45 >> back demodulating 147 with 186.
% 6.30/6.45 >> back demodulating 131 with 186.
% 6.30/6.45 >> back demodulating 98 with 186.
% 6.30/6.45 >> back demodulating 97 with 186.
% 6.30/6.45 >> back demodulating 91 with 186.
% 6.30/6.45 >> back demodulating 86 with 186.
% 6.30/6.45 >> back demodulating 62 with 186.
% 6.30/6.45 >> back demodulating 61 with 186.
% 6.30/6.45 >> back demodulating 60 with 186.
% 6.30/6.45 >> back demodulating 57 with 186.
% 6.30/6.45 >> back demodulating 56 with 186.
% 6.30/6.45 >> back demodulating 55 with 186.
% 6.30/6.45 >> back demodulating 54 with 186.
% 6.30/6.45 >> back demodulating 53 with 186.
% 6.30/6.45 >> back demodulating 8 with 186.
% 6.30/6.45 >> back demodulating 7 with 186.
% 6.30/6.45 >> back demodulating 6 with 186.
% 6.30/6.45 Following clause subsumed by 188 during input processing: 0 [copy,188,flip.1] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 6.30/6.45 >>>> Starting back demodulation with 200.
% 6.30/6.45 >>>> Starting back demodulation with 215.
% 6.30/6.45 >>>> Starting back demodulation with 218.
% 6.30/6.45
% 6.30/6.45 ======= end of input processing =======
% 6.30/6.45
% 6.30/6.45 =========== start of search ===========
% 6.30/6.45
% 6.30/6.45
% 6.30/6.45 Resetting weight limit to 6.
% 6.30/6.45
% 6.30/6.45
% 6.30/6.45 Resetting weight limit to 6.
% 6.30/6.45
% 6.30/6.45 sos_size=549
% 6.30/6.45
% 6.30/6.45 -------- PROOF --------
% 6.30/6.45
% 6.30/6.45 -----> EMPTY CLAUSE at 4.25 sec ----> 952 [para_into,223.1.1,70.2.1,unit_del,127,312] $F.
% 6.30/6.45
% 6.30/6.45 Length of proof is 4. Level of proof is 2.
% 6.30/6.45
% 6.30/6.45 ---------------- PROOF ----------------
% 6.30/6.45 % SZS status Theorem
% 6.30/6.45 % SZS output start Refutation
% See solution above
% 6.30/6.45 ------------ end of proof -------------
% 6.30/6.45
% 6.30/6.45
% 6.30/6.45 Search stopped by max_proofs option.
% 6.30/6.45
% 6.30/6.45
% 6.30/6.45 Search stopped by max_proofs option.
% 6.30/6.45
% 6.30/6.45 ============ end of search ============
% 6.30/6.45
% 6.30/6.45 -------------- statistics -------------
% 6.30/6.45 clauses given 239
% 6.30/6.45 clauses generated 297226
% 6.30/6.45 clauses kept 916
% 6.30/6.45 clauses forward subsumed 3608
% 6.30/6.45 clauses back subsumed 103
% 6.30/6.45 Kbytes malloced 5859
% 6.30/6.45
% 6.30/6.45 ----------- times (seconds) -----------
% 6.30/6.45 user CPU time 4.26 (0 hr, 0 min, 4 sec)
% 6.30/6.45 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 6.30/6.45 wall-clock time 6 (0 hr, 0 min, 6 sec)
% 6.30/6.45
% 6.30/6.45 That finishes the proof of the theorem.
% 6.30/6.45
% 6.30/6.45 Process 29363 finished Wed Jul 27 07:58:13 2022
% 6.30/6.45 Otter interrupted
% 6.30/6.45 PROOF FOUND
%------------------------------------------------------------------------------