TSTP Solution File: SEU154+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU154+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:57 EDT 2022
% Result : Timeout 299.92s 300.10s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU154+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 07:54:31 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.15/2.35 ----- Otter 3.3f, August 2004 -----
% 2.15/2.35 The process was started by sandbox2 on n006.cluster.edu,
% 2.15/2.35 Wed Jul 27 07:54:32 2022
% 2.15/2.35 The command was "./otter". The process ID is 18695.
% 2.15/2.35
% 2.15/2.35 set(prolog_style_variables).
% 2.15/2.35 set(auto).
% 2.15/2.35 dependent: set(auto1).
% 2.15/2.35 dependent: set(process_input).
% 2.15/2.35 dependent: clear(print_kept).
% 2.15/2.35 dependent: clear(print_new_demod).
% 2.15/2.35 dependent: clear(print_back_demod).
% 2.15/2.35 dependent: clear(print_back_sub).
% 2.15/2.35 dependent: set(control_memory).
% 2.15/2.35 dependent: assign(max_mem, 12000).
% 2.15/2.35 dependent: assign(pick_given_ratio, 4).
% 2.15/2.35 dependent: assign(stats_level, 1).
% 2.15/2.35 dependent: assign(max_seconds, 10800).
% 2.15/2.35 clear(print_given).
% 2.15/2.35
% 2.15/2.35 formula_list(usable).
% 2.15/2.35 all A (A=A).
% 2.15/2.35 all A B (in(A,B)-> -in(B,A)).
% 2.15/2.35 all A B (proper_subset(A,B)-> -proper_subset(B,A)).
% 2.15/2.35 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.15/2.35 all A B (set_union2(A,B)=set_union2(B,A)).
% 2.15/2.35 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.15/2.35 all A B (A=B<->subset(A,B)&subset(B,A)).
% 2.15/2.35 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 2.15/2.35 all A (A=empty_set<-> (all B (-in(B,A)))).
% 2.15/2.35 all A B (B=powerset(A)<-> (all C (in(C,B)<->subset(C,A)))).
% 2.15/2.35 all A B C (C=unordered_pair(A,B)<-> (all D (in(D,C)<->D=A|D=B))).
% 2.15/2.35 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 2.15/2.35 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 2.15/2.35 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 2.15/2.35 all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 2.15/2.35 all A B (disjoint(A,B)<->set_intersection2(A,B)=empty_set).
% 2.15/2.35 all A B (proper_subset(A,B)<->subset(A,B)&A!=B).
% 2.15/2.35 $T.
% 2.15/2.35 $T.
% 2.15/2.35 $T.
% 2.15/2.35 $T.
% 2.15/2.35 $T.
% 2.15/2.35 $T.
% 2.15/2.35 $T.
% 2.15/2.35 empty(empty_set).
% 2.15/2.35 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 2.15/2.35 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 2.15/2.35 all A B (set_union2(A,A)=A).
% 2.15/2.35 all A B (set_intersection2(A,A)=A).
% 2.15/2.35 all A B (-proper_subset(A,A)).
% 2.15/2.35 all A (singleton(A)!=empty_set).
% 2.15/2.35 all A B (in(A,B)->set_union2(singleton(A),B)=B).
% 2.15/2.35 all A B (-(disjoint(singleton(A),B)&in(A,B))).
% 2.15/2.35 -(all A B (-in(A,B)->disjoint(singleton(A),B))).
% 2.15/2.35 all A B (subset(singleton(A),B)<->in(A,B)).
% 2.15/2.35 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 2.15/2.35 all A B C (subset(A,B)->in(C,A)|subset(A,set_difference(B,singleton(C)))).
% 2.15/2.35 all A B (subset(A,singleton(B))<->A=empty_set|A=singleton(B)).
% 2.15/2.35 exists A empty(A).
% 2.15/2.35 exists A (-empty(A)).
% 2.15/2.35 all A B subset(A,A).
% 2.15/2.35 all A B (disjoint(A,B)->disjoint(B,A)).
% 2.15/2.35 all A B C D (-(unordered_pair(A,B)=unordered_pair(C,D)&A!=C&A!=D)).
% 2.15/2.35 all A B (subset(A,B)->set_union2(A,B)=B).
% 2.15/2.35 all A B subset(set_intersection2(A,B),A).
% 2.15/2.35 all A B C (subset(A,B)&subset(A,C)->subset(A,set_intersection2(B,C))).
% 2.15/2.35 all A (set_union2(A,empty_set)=A).
% 2.15/2.35 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 2.15/2.35 powerset(empty_set)=singleton(empty_set).
% 2.15/2.35 all A B C (subset(A,B)->subset(set_intersection2(A,C),set_intersection2(B,C))).
% 2.15/2.35 all A B (subset(A,B)->set_intersection2(A,B)=A).
% 2.15/2.35 all A (set_intersection2(A,empty_set)=empty_set).
% 2.15/2.35 all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 2.15/2.35 all A subset(empty_set,A).
% 2.15/2.35 all A B C (subset(A,B)->subset(set_difference(A,C),set_difference(B,C))).
% 2.15/2.35 all A B subset(set_difference(A,B),A).
% 2.15/2.35 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 2.15/2.35 all A B (set_union2(A,set_difference(B,A))=set_union2(A,B)).
% 2.15/2.35 all A (set_difference(A,empty_set)=A).
% 2.15/2.35 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.15/2.35 all A (subset(A,empty_set)->A=empty_set).
% 2.15/2.35 all A B (set_difference(set_union2(A,B),B)=set_difference(A,B)).
% 2.15/2.35 all A B (subset(A,B)->B=set_union2(A,set_difference(B,A))).
% 2.15/2.35 all A B (set_difference(A,set_difference(A,B))=set_intersection2(A,B)).
% 2.15/2.35 all A (set_difference(empty_set,A)=empty_set).
% 2.15/2.35 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.15/2.35 all A B (-(subset(A,B)&proper_subset(B,A))).
% 2.15/2.35 all A B C (subset(A,B)&disjoint(B,C)->disjoint(A,C)).
% 2.15/2.35 all A (unordered_pair(A,A)=singleton(A)).
% 2.15/2.35 all A (empty(A)->A=empty_set).
% 2.15/2.35 all A B (subset(singleton(A),singleton(B))->A=B).
% 2.15/2.35 all A B (-(in(A,B)&empty(B))).
% 2.15/2.35 all A B subset(A,set_union2(A,B)).
% 2.15/2.35 all A B (disjoint(A,B)<->set_difference(A,B)=A).
% 2.15/2.35 all A B (-(empty(A)&A!=B&empty(B))).
% 2.15/2.35 all A B C (subset(A,B)&subset(C,B)->subset(set_union2(A,C),B)).
% 2.15/2.35 all A B C (singleton(A)=unordered_pair(B,C)->A=B).
% 2.15/2.35 all A B C (singleton(A)=unordered_pair(B,C)->B=C).
% 2.15/2.35 end_of_list.
% 2.15/2.35
% 2.15/2.35 -------> usable clausifies to:
% 2.15/2.35
% 2.15/2.35 list(usable).
% 2.15/2.35 0 [] A=A.
% 2.15/2.35 0 [] -in(A,B)| -in(B,A).
% 2.15/2.35 0 [] -proper_subset(A,B)| -proper_subset(B,A).
% 2.15/2.35 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.15/2.35 0 [] set_union2(A,B)=set_union2(B,A).
% 2.15/2.35 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.15/2.35 0 [] A!=B|subset(A,B).
% 2.15/2.35 0 [] A!=B|subset(B,A).
% 2.15/2.35 0 [] A=B| -subset(A,B)| -subset(B,A).
% 2.15/2.35 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 2.15/2.35 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 2.15/2.35 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 2.15/2.35 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 2.15/2.35 0 [] A!=empty_set| -in(B,A).
% 2.15/2.35 0 [] A=empty_set|in($f2(A),A).
% 2.15/2.35 0 [] B!=powerset(A)| -in(C,B)|subset(C,A).
% 2.15/2.35 0 [] B!=powerset(A)|in(C,B)| -subset(C,A).
% 2.15/2.35 0 [] B=powerset(A)|in($f3(A,B),B)|subset($f3(A,B),A).
% 2.15/2.35 0 [] B=powerset(A)| -in($f3(A,B),B)| -subset($f3(A,B),A).
% 2.15/2.35 0 [] C!=unordered_pair(A,B)| -in(D,C)|D=A|D=B.
% 2.15/2.35 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=A.
% 2.15/2.35 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=B.
% 2.15/2.35 0 [] C=unordered_pair(A,B)|in($f4(A,B,C),C)|$f4(A,B,C)=A|$f4(A,B,C)=B.
% 2.15/2.35 0 [] C=unordered_pair(A,B)| -in($f4(A,B,C),C)|$f4(A,B,C)!=A.
% 2.15/2.35 0 [] C=unordered_pair(A,B)| -in($f4(A,B,C),C)|$f4(A,B,C)!=B.
% 2.15/2.35 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 2.15/2.35 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 2.15/2.35 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 2.15/2.35 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.15/2.35 0 [] C=set_union2(A,B)| -in($f5(A,B,C),C)| -in($f5(A,B,C),A).
% 2.15/2.35 0 [] C=set_union2(A,B)| -in($f5(A,B,C),C)| -in($f5(A,B,C),B).
% 2.15/2.35 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.15/2.35 0 [] subset(A,B)|in($f6(A,B),A).
% 2.15/2.35 0 [] subset(A,B)| -in($f6(A,B),B).
% 2.15/2.35 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 2.15/2.35 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 2.15/2.35 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 2.15/2.35 0 [] C=set_intersection2(A,B)|in($f7(A,B,C),C)|in($f7(A,B,C),A).
% 2.15/2.35 0 [] C=set_intersection2(A,B)|in($f7(A,B,C),C)|in($f7(A,B,C),B).
% 2.15/2.35 0 [] C=set_intersection2(A,B)| -in($f7(A,B,C),C)| -in($f7(A,B,C),A)| -in($f7(A,B,C),B).
% 2.15/2.35 0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 2.15/2.35 0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 2.15/2.35 0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 2.15/2.35 0 [] C=set_difference(A,B)|in($f8(A,B,C),C)|in($f8(A,B,C),A).
% 2.15/2.35 0 [] C=set_difference(A,B)|in($f8(A,B,C),C)| -in($f8(A,B,C),B).
% 2.15/2.35 0 [] C=set_difference(A,B)| -in($f8(A,B,C),C)| -in($f8(A,B,C),A)|in($f8(A,B,C),B).
% 2.15/2.35 0 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 2.15/2.35 0 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 2.15/2.35 0 [] -proper_subset(A,B)|subset(A,B).
% 2.15/2.35 0 [] -proper_subset(A,B)|A!=B.
% 2.15/2.35 0 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 2.15/2.35 0 [] $T.
% 2.15/2.35 0 [] $T.
% 2.15/2.35 0 [] $T.
% 2.15/2.35 0 [] $T.
% 2.15/2.35 0 [] $T.
% 2.15/2.35 0 [] $T.
% 2.15/2.35 0 [] $T.
% 2.15/2.35 0 [] empty(empty_set).
% 2.15/2.35 0 [] empty(A)| -empty(set_union2(A,B)).
% 2.15/2.35 0 [] empty(A)| -empty(set_union2(B,A)).
% 2.15/2.35 0 [] set_union2(A,A)=A.
% 2.15/2.35 0 [] set_intersection2(A,A)=A.
% 2.15/2.35 0 [] -proper_subset(A,A).
% 2.15/2.35 0 [] singleton(A)!=empty_set.
% 2.15/2.35 0 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.15/2.35 0 [] -disjoint(singleton(A),B)| -in(A,B).
% 2.15/2.35 0 [] -in($c2,$c1).
% 2.15/2.35 0 [] -disjoint(singleton($c2),$c1).
% 2.15/2.35 0 [] -subset(singleton(A),B)|in(A,B).
% 2.15/2.35 0 [] subset(singleton(A),B)| -in(A,B).
% 2.15/2.35 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.15/2.35 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.15/2.35 0 [] -subset(A,B)|in(C,A)|subset(A,set_difference(B,singleton(C))).
% 2.15/2.35 0 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.15/2.35 0 [] subset(A,singleton(B))|A!=empty_set.
% 2.15/2.35 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.15/2.35 0 [] empty($c3).
% 2.15/2.35 0 [] -empty($c4).
% 2.15/2.35 0 [] subset(A,A).
% 2.15/2.35 0 [] -disjoint(A,B)|disjoint(B,A).
% 2.15/2.35 0 [] unordered_pair(A,B)!=unordered_pair(C,D)|A=C|A=D.
% 2.15/2.35 0 [] -subset(A,B)|set_union2(A,B)=B.
% 2.15/2.35 0 [] subset(set_intersection2(A,B),A).
% 2.15/2.35 0 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 2.15/2.35 0 [] set_union2(A,empty_set)=A.
% 2.15/2.35 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.15/2.35 0 [] powerset(empty_set)=singleton(empty_set).
% 2.15/2.35 0 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 2.15/2.35 0 [] -subset(A,B)|set_intersection2(A,B)=A.
% 2.15/2.35 0 [] set_intersection2(A,empty_set)=empty_set.
% 2.15/2.35 0 [] in($f9(A,B),A)|in($f9(A,B),B)|A=B.
% 2.15/2.35 0 [] -in($f9(A,B),A)| -in($f9(A,B),B)|A=B.
% 2.15/2.35 0 [] subset(empty_set,A).
% 2.15/2.35 0 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 2.15/2.35 0 [] subset(set_difference(A,B),A).
% 2.15/2.35 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.15/2.35 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.15/2.35 0 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.15/2.35 0 [] set_difference(A,empty_set)=A.
% 2.15/2.35 0 [] disjoint(A,B)|in($f10(A,B),A).
% 2.15/2.35 0 [] disjoint(A,B)|in($f10(A,B),B).
% 2.15/2.35 0 [] -in(C,A)| -in(C,B)| -disjoint(A,B).
% 2.15/2.35 0 [] -subset(A,empty_set)|A=empty_set.
% 2.15/2.35 0 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.15/2.35 0 [] -subset(A,B)|B=set_union2(A,set_difference(B,A)).
% 2.15/2.35 0 [] set_difference(A,set_difference(A,B))=set_intersection2(A,B).
% 2.15/2.35 0 [] set_difference(empty_set,A)=empty_set.
% 2.15/2.35 0 [] disjoint(A,B)|in($f11(A,B),set_intersection2(A,B)).
% 2.15/2.35 0 [] -in(C,set_intersection2(A,B))| -disjoint(A,B).
% 2.15/2.35 0 [] -subset(A,B)| -proper_subset(B,A).
% 2.15/2.35 0 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 2.15/2.35 0 [] unordered_pair(A,A)=singleton(A).
% 2.15/2.35 0 [] -empty(A)|A=empty_set.
% 2.15/2.35 0 [] -subset(singleton(A),singleton(B))|A=B.
% 2.15/2.35 0 [] -in(A,B)| -empty(B).
% 2.15/2.35 0 [] subset(A,set_union2(A,B)).
% 2.15/2.35 0 [] -disjoint(A,B)|set_difference(A,B)=A.
% 2.15/2.35 0 [] disjoint(A,B)|set_difference(A,B)!=A.
% 2.15/2.35 0 [] -empty(A)|A=B| -empty(B).
% 2.15/2.35 0 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 2.15/2.35 0 [] singleton(A)!=unordered_pair(B,C)|A=B.
% 2.15/2.35 0 [] singleton(A)!=unordered_pair(B,C)|B=C.
% 2.15/2.35 end_of_list.
% 2.15/2.35
% 2.15/2.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 2.15/2.35
% 2.15/2.35 This ia a non-Horn set with equality. The strategy will be
% 2.15/2.35 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.15/2.35 deletion, with positive clauses in sos and nonpositive
% 2.15/2.35 clauses in usable.
% 2.15/2.35
% 2.15/2.35 dependent: set(knuth_bendix).
% 2.15/2.35 dependent: set(anl_eq).
% 2.15/2.35 dependent: set(para_from).
% 2.15/2.35 dependent: set(para_into).
% 2.15/2.35 dependent: clear(para_from_right).
% 2.15/2.35 dependent: clear(para_into_right).
% 2.15/2.35 dependent: set(para_from_vars).
% 2.15/2.35 dependent: set(eq_units_both_ways).
% 2.15/2.35 dependent: set(dynamic_demod_all).
% 2.15/2.35 dependent: set(dynamic_demod).
% 2.15/2.35 dependent: set(order_eq).
% 2.15/2.35 dependent: set(back_demod).
% 2.15/2.35 dependent: set(lrpo).
% 2.15/2.35 dependent: set(hyper_res).
% 2.15/2.35 dependent: set(unit_deletion).
% 2.15/2.35 dependent: set(factor).
% 2.15/2.35
% 2.15/2.35 ------------> process usable:
% 2.15/2.35 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.15/2.35 ** KEPT (pick-wt=6): 2 [] -proper_subset(A,B)| -proper_subset(B,A).
% 2.15/2.35 ** KEPT (pick-wt=6): 3 [] A!=B|subset(A,B).
% 2.15/2.35 ** KEPT (pick-wt=6): 4 [] A!=B|subset(B,A).
% 2.15/2.35 ** KEPT (pick-wt=9): 5 [] A=B| -subset(A,B)| -subset(B,A).
% 2.15/2.35 ** KEPT (pick-wt=10): 6 [] A!=singleton(B)| -in(C,A)|C=B.
% 2.15/2.35 ** KEPT (pick-wt=10): 7 [] A!=singleton(B)|in(C,A)|C!=B.
% 2.15/2.35 ** KEPT (pick-wt=14): 8 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 2.15/2.35 ** KEPT (pick-wt=6): 9 [] A!=empty_set| -in(B,A).
% 2.15/2.35 ** KEPT (pick-wt=10): 10 [] A!=powerset(B)| -in(C,A)|subset(C,B).
% 2.15/2.35 ** KEPT (pick-wt=10): 11 [] A!=powerset(B)|in(C,A)| -subset(C,B).
% 2.15/2.35 ** KEPT (pick-wt=14): 12 [] A=powerset(B)| -in($f3(B,A),A)| -subset($f3(B,A),B).
% 2.15/2.35 ** KEPT (pick-wt=14): 13 [] A!=unordered_pair(B,C)| -in(D,A)|D=B|D=C.
% 2.15/2.35 ** KEPT (pick-wt=11): 14 [] A!=unordered_pair(B,C)|in(D,A)|D!=B.
% 2.15/2.35 ** KEPT (pick-wt=11): 15 [] A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 2.15/2.35 ** KEPT (pick-wt=17): 16 [] A=unordered_pair(B,C)| -in($f4(B,C,A),A)|$f4(B,C,A)!=B.
% 2.15/2.35 ** KEPT (pick-wt=17): 17 [] A=unordered_pair(B,C)| -in($f4(B,C,A),A)|$f4(B,C,A)!=C.
% 2.15/2.35 ** KEPT (pick-wt=14): 18 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 2.15/2.35 ** KEPT (pick-wt=11): 19 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 2.15/2.35 ** KEPT (pick-wt=11): 20 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 2.15/2.35 ** KEPT (pick-wt=17): 21 [] A=set_union2(B,C)| -in($f5(B,C,A),A)| -in($f5(B,C,A),B).
% 2.15/2.35 ** KEPT (pick-wt=17): 22 [] A=set_union2(B,C)| -in($f5(B,C,A),A)| -in($f5(B,C,A),C).
% 2.15/2.35 ** KEPT (pick-wt=9): 23 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.15/2.35 ** KEPT (pick-wt=8): 24 [] subset(A,B)| -in($f6(A,B),B).
% 2.15/2.35 ** KEPT (pick-wt=11): 25 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 2.15/2.35 ** KEPT (pick-wt=11): 26 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 2.15/2.35 ** KEPT (pick-wt=14): 27 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 2.15/2.35 ** KEPT (pick-wt=23): 28 [] A=set_intersection2(B,C)| -in($f7(B,C,A),A)| -in($f7(B,C,A),B)| -in($f7(B,C,A),C).
% 2.15/2.35 ** KEPT (pick-wt=11): 29 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 2.15/2.35 ** KEPT (pick-wt=11): 30 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 2.15/2.35 ** KEPT (pick-wt=14): 31 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 2.15/2.35 ** KEPT (pick-wt=17): 32 [] A=set_difference(B,C)|in($f8(B,C,A),A)| -in($f8(B,C,A),C).
% 2.15/2.35 ** KEPT (pick-wt=23): 33 [] A=set_difference(B,C)| -in($f8(B,C,A),A)| -in($f8(B,C,A),B)|in($f8(B,C,A),C).
% 2.15/2.35 ** KEPT (pick-wt=8): 34 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 2.15/2.35 ** KEPT (pick-wt=8): 35 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 2.15/2.35 ** KEPT (pick-wt=6): 36 [] -proper_subset(A,B)|subset(A,B).
% 2.15/2.35 ** KEPT (pick-wt=6): 37 [] -proper_subset(A,B)|A!=B.
% 2.15/2.35 ** KEPT (pick-wt=9): 38 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 2.15/2.35 ** KEPT (pick-wt=6): 39 [] empty(A)| -empty(set_union2(A,B)).
% 2.15/2.35 ** KEPT (pick-wt=6): 40 [] empty(A)| -empty(set_union2(B,A)).
% 2.15/2.35 ** KEPT (pick-wt=3): 41 [] -proper_subset(A,A).
% 2.15/2.35 ** KEPT (pick-wt=4): 42 [] singleton(A)!=empty_set.
% 2.15/2.35 ** KEPT (pick-wt=9): 43 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 2.15/2.35 ** KEPT (pick-wt=7): 44 [] -disjoint(singleton(A),B)| -in(A,B).
% 2.15/2.35 ** KEPT (pick-wt=3): 45 [] -in($c2,$c1).
% 2.15/2.35 ** KEPT (pick-wt=4): 46 [] -disjoint(singleton($c2),$c1).
% 2.15/2.35 ** KEPT (pick-wt=7): 47 [] -subset(singleton(A),B)|in(A,B).
% 2.15/2.35 ** KEPT (pick-wt=7): 48 [] subset(singleton(A),B)| -in(A,B).
% 2.15/2.35 ** KEPT (pick-wt=8): 49 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.15/2.35 ** KEPT (pick-wt=8): 50 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.15/2.35 ** KEPT (pick-wt=12): 51 [] -subset(A,B)|in(C,A)|subset(A,set_difference(B,singleton(C))).
% 2.15/2.35 ** KEPT (pick-wt=11): 52 [] -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 2.15/2.35 ** KEPT (pick-wt=7): 53 [] subset(A,singleton(B))|A!=empty_set.
% 2.15/2.35 Following clause subsumed by 3 during input processing: 0 [] subset(A,singleton(B))|A!=singleton(B).
% 2.15/2.35 ** KEPT (pick-wt=2): 54 [] -empty($c4).
% 2.15/2.35 ** KEPT (pick-wt=6): 55 [] -disjoint(A,B)|disjoint(B,A).
% 2.15/2.35 ** KEPT (pick-wt=13): 56 [] unordered_pair(A,B)!=unordered_pair(C,D)|A=C|A=D.
% 2.15/2.35 ** KEPT (pick-wt=8): 57 [] -subset(A,B)|set_union2(A,B)=B.
% 2.15/2.35 ** KEPT (pick-wt=11): 58 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 2.15/2.35 ** KEPT (pick-wt=9): 59 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 2.15/2.35 ** KEPT (pick-wt=10): 60 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 2.15/2.35 ** KEPT (pick-wt=8): 61 [] -subset(A,B)|set_intersection2(A,B)=A.
% 2.15/2.35 ** KEPT (pick-wt=13): 62 [] -in($f9(A,B),A)| -in($f9(A,B),B)|A=B.
% 2.15/2.35 ** KEPT (pick-wt=10): 63 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 2.15/2.35 Following clause subsumed by 49 during input processing: 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 2.15/2.35 Following clause subsumed by 50 during input processing: 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 2.15/2.35 ** KEPT (pick-wt=9): 64 [] -in(A,B)| -in(A,C)| -disjoint(B,C).
% 2.15/2.35 ** KEPT (pick-wt=6): 65 [] -subset(A,empty_set)|A=empty_set.
% 2.15/2.35 ** KEPT (pick-wt=10): 67 [copy,66,flip.2] -subset(A,B)|set_union2(A,set_difference(B,A))=B.
% 2.15/2.35 ** KEPT (pick-wt=8): 68 [] -in(A,set_intersection2(B,C))| -disjoint(B,C).
% 2.15/2.35 ** KEPT (pick-wt=6): 69 [] -subset(A,B)| -proper_subset(B,A).
% 2.15/2.35 ** KEPT (pick-wt=9): 70 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 2.15/2.35 ** KEPT (pick-wt=5): 71 [] -empty(A)|A=empty_set.
% 2.15/2.35 ** KEPT (pick-wt=8): 72 [] -subset(singleton(A),singleton(B))|A=B.
% 2.15/2.35 ** KEPT (pick-wt=5): 73 [] -in(A,B)| -empty(B).
% 2.15/2.35 ** KEPT (pick-wt=8): 74 [] -disjoint(A,B)|set_difference(A,B)=A.
% 2.15/2.35 ** KEPT (pick-wt=8): 75 [] disjoint(A,B)|set_difference(A,B)!=A.
% 2.15/2.35 ** KEPT (pick-wt=7): 76 [] -empty(A)|A=B| -empty(B).
% 2.15/2.35 ** KEPT (pick-wt=11): 77 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 2.15/2.35 ** KEPT (pick-wt=9): 78 [] singleton(A)!=unordered_pair(B,C)|A=B.
% 2.15/2.35 ** KEPT (pick-wt=9): 79 [] singleton(A)!=unordered_pair(B,C)|B=C.
% 2.15/2.35
% 2.15/2.35 ------------> process sos:
% 2.15/2.35 ** KEPT (pick-wt=3): 100 [] A=A.
% 2.15/2.35 ** KEPT (pick-wt=7): 101 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.15/2.35 ** KEPT (pick-wt=7): 102 [] set_union2(A,B)=set_union2(B,A).
% 2.15/2.35 ** KEPT (pick-wt=7): 103 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.15/2.35 ** KEPT (pick-wt=14): 104 [] A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B.
% 2.15/2.35 ** KEPT (pick-wt=7): 105 [] A=empty_set|in($f2(A),A).
% 2.15/2.35 ** KEPT (pick-wt=14): 106 [] A=powerset(B)|in($f3(B,A),A)|subset($f3(B,A),B).
% 2.15/2.35 ** KEPT (pick-wt=23): 107 [] A=unordered_pair(B,C)|in($f4(B,C,A),A)|$f4(B,C,A)=B|$f4(B,C,A)=C.
% 2.15/2.35 ** KEPT (pick-wt=23): 108 [] A=set_union2(B,C)|in($f5(B,C,A),A)|in($f5(B,C,A),B)|in($f5(B,C,A),C).
% 2.15/2.35 ** KEPT (pick-wt=8): 109 [] subset(A,B)|in($f6(A,B),A).
% 2.15/2.35 ** KEPT (pick-wt=17): 110 [] A=set_intersection2(B,C)|in($f7(B,C,A),A)|in($f7(B,C,A),B).
% 2.15/2.35 ** KEPT (pick-wt=17): 111 [] A=set_intersection2(B,C)|in($f7(B,C,A),A)|in($f7(B,C,A),C).
% 2.15/2.35 ** KEPT (pick-wt=17): 112 [] A=set_difference(B,C)|in($f8(B,C,A),A)|in($f8(B,C,A),B).
% 2.15/2.35 ** KEPT (pick-wt=2): 113 [] empty(empty_set).
% 2.15/2.35 ** KEPT (pick-wt=5): 114 [] set_union2(A,A)=A.
% 2.15/2.35 ---> New Demodulator: 115 [new_demod,114] set_union2(A,A)=A.
% 2.15/2.35 ** KEPT (pick-wt=5): 116 [] set_intersection2(A,A)=A.
% 2.15/2.35 ---> New Demodulator: 117 [new_demod,116] set_intersection2(A,A)=A.
% 2.15/2.35 ** KEPT (pick-wt=2): 118 [] empty($c3).
% 2.15/2.35 ** KEPT (pick-wt=3): 119 [] subset(A,A).
% 2.15/2.35 ** KEPT (pick-wt=5): 120 [] subset(set_intersection2(A,B),A).
% 2.15/2.35 ** KEPT (pick-wt=5): 121 [] set_union2(A,empty_set)=A.
% 2.15/2.35 ---> New Demodulator: 122 [new_demod,121] set_union2(A,empty_set)=A.
% 2.15/2.35 ** KEPT (pick-wt=5): 124 [copy,123,flip.1] singleton(empty_set)=powerset(empty_set).
% 2.15/2.35 ---> New Demodulator: 125 [new_demod,124] singleton(empty_set)=powerset(empty_set).
% 2.15/2.35 ** KEPT (pick-wt=5): 126 [] set_intersection2(A,empty_set)=empty_set.
% 2.15/2.35 ---> New Demodulator: 127 [new_demod,126] set_intersection2(A,empty_set)=empty_set.
% 2.15/2.35 ** KEPT (pick-wt=13): 128 [] in($f9(A,B),A)|in($f9(A,B),B)|A=B.
% 2.15/2.35 ** KEPT (pick-wt=3): 129 [] subset(empty_set,A).
% 2.15/2.35 ** KEPT (pick-wt=5): 130 [] subset(set_difference(A,B),A).
% 2.15/2.35 ** KEPT (pick-wt=9): 131 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.15/2.35 ---> New Demodulator: 132 [new_demod,131] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 2.15/2.35 ** KEPT (pick-wt=5): 133 [] set_difference(A,empty_set)=A.
% 2.15/2.35 ---> New Demodulator: 134 [new_demod,133] set_difference(A,empty_set)=A.
% 2.15/2.35 ** KEPT (pick-wt=8): 135 [] disjoint(A,B)|in($f10(A,B),A).
% 2.15/2.35 ** KEPT (pick-wt=8): 136 [] disjoint(A,B)|in($f10(A,B),B).
% 2.15/2.35 ** KEPT (pick-wt=9): 137 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.15/2.35 ---> New Demodulator: 138 [new_demod,137] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 2.15/2.35 ** KEPT (pick-wt=9): 140 [copy,139,flip.1] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 2.15/2.35 ---> New Demodulator: 141 [new_demod,140] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 2.15/2.35 ** KEPT (pick-wt=5): 142 [] set_difference(empty_set,A)=empty_set.
% 2.15/2.35 ---> New Demodulator: 143 [new_demod,142] set_difference(empty_set,A)=empty_set.
% 2.15/2.35 ** KEPT (pick-wt=12): 145 [copy,144,demod,141] disjoint(A,B)|in($f11(A,B),set_difference(A,set_difference(A,B))).
% 2.15/2.35 ** KEPT (pick-wt=6): 147 [copy,146,flip.1] singleton(A)=unordered_pair(A,A).
% 2.15/2.35 ---> New Demodulator: 148 [new_demod,147] singleton(A)=unordered_pair(A,A).
% 2.15/2.35 ** KEPT (pick-wt=5): 149 [] subset(A,set_union2(A,B)).
% 2.15/2.35 Following clause subsumed by 100 during input processing: 0 [copy,100,flip.1] A=A.
% 2.15/2.35 100 back subsumes 97.
% 2.15/2.35 100 back subsumes 95.
% 2.15/2.35 100 back subsumes 81.
% 2.15/2.35 Following clause subsumed by 101 during input processing: 0 [copy,101,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 2.15/2.35 Following clause subsumed by 102 during input processing: 0 [copy,102,flip.1] set_union2(A,B)=set_union2(B,A).
% 2.15/2.35 ** KEPT (pick-wt=11): 150 [copy,103,flip.1,demod,141,141] set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 2.15/2.35 >>>> Starting back demodulation with 115.
% 2.15/2.35 >> back demodulating 98 with 115.
% 2.15/2.35 >> back demodulating 83 with 115.
% 2.15/2.35 >>>> Starting back demodulation with 117.
% 2.15/2.35 >> back demodulating 99 with 117.
% 2.15/2.35 >> back demodulating 94 with 117.
% 2.15/2.35 >> back demodulating 89 with 117.
% 2.15/2.35 >> back demodulating 86 with 117.
% 2.15/2.35 >>>> Starting back demodulation with 122.
% 2.15/2.35 >>>> Starting back demodulation with 125.
% 2.15/2.35 >>>> Starting back demodulation with 127.
% 2.15/2.35 >>>> Starting back demodulation with 132.
% 2.15/2.35 >> back demodulating 67 with 132.
% 2.15/2.35 >>>> Starting back demodulation with 134.
% 2.15/2.35 >>>> Starting back demodulation with 138.
% 2.15/2.35 >>>> Starting back demodulation with 141.
% 2.15/2.35 >> back demodulating 126 with 141.
% 2.15/2.35 Alarm clock
% 299.92/300.10 Otter interrupted
% 299.92/300.10 PROOF NOT FOUND
%------------------------------------------------------------------------------