TSTP Solution File: SEU144+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU144+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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:54 EDT 2022
% Result : Timeout 299.94s 300.09s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU144+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n027.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 08:01:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.86/2.07 ----- Otter 3.3f, August 2004 -----
% 1.86/2.07 The process was started by sandbox2 on n027.cluster.edu,
% 1.86/2.07 Wed Jul 27 08:01:21 2022
% 1.86/2.07 The command was "./otter". The process ID is 32346.
% 1.86/2.07
% 1.86/2.07 set(prolog_style_variables).
% 1.86/2.07 set(auto).
% 1.86/2.07 dependent: set(auto1).
% 1.86/2.07 dependent: set(process_input).
% 1.86/2.07 dependent: clear(print_kept).
% 1.86/2.07 dependent: clear(print_new_demod).
% 1.86/2.07 dependent: clear(print_back_demod).
% 1.86/2.07 dependent: clear(print_back_sub).
% 1.86/2.07 dependent: set(control_memory).
% 1.86/2.07 dependent: assign(max_mem, 12000).
% 1.86/2.07 dependent: assign(pick_given_ratio, 4).
% 1.86/2.07 dependent: assign(stats_level, 1).
% 1.86/2.07 dependent: assign(max_seconds, 10800).
% 1.86/2.07 clear(print_given).
% 1.86/2.07
% 1.86/2.07 formula_list(usable).
% 1.86/2.07 all A (A=A).
% 1.86/2.07 all A B (in(A,B)-> -in(B,A)).
% 1.86/2.07 all A B (proper_subset(A,B)-> -proper_subset(B,A)).
% 1.86/2.07 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.86/2.07 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.86/2.07 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.86/2.07 all A B (A=B<->subset(A,B)&subset(B,A)).
% 1.86/2.07 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 1.86/2.07 all A (A=empty_set<-> (all B (-in(B,A)))).
% 1.86/2.07 all A B C (C=unordered_pair(A,B)<-> (all D (in(D,C)<->D=A|D=B))).
% 1.86/2.07 all A B C (C=set_union2(A,B)<-> (all D (in(D,C)<->in(D,A)|in(D,B)))).
% 1.86/2.07 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.86/2.07 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 1.86/2.07 all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 1.86/2.07 all A B (disjoint(A,B)<->set_intersection2(A,B)=empty_set).
% 1.86/2.07 all A B (proper_subset(A,B)<->subset(A,B)&A!=B).
% 1.86/2.07 $T.
% 1.86/2.07 $T.
% 1.86/2.07 $T.
% 1.86/2.07 $T.
% 1.86/2.07 $T.
% 1.86/2.07 $T.
% 1.86/2.07 empty(empty_set).
% 1.86/2.07 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.86/2.07 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.86/2.07 all A B (set_union2(A,A)=A).
% 1.86/2.07 all A B (set_intersection2(A,A)=A).
% 1.86/2.07 all A B (-proper_subset(A,A)).
% 1.86/2.07 all A (singleton(A)!=empty_set).
% 1.86/2.07 -(all A B (subset(singleton(A),B)<->in(A,B))).
% 1.86/2.07 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 1.86/2.07 exists A empty(A).
% 1.86/2.07 exists A (-empty(A)).
% 1.86/2.07 all A B subset(A,A).
% 1.86/2.07 all A B (disjoint(A,B)->disjoint(B,A)).
% 1.86/2.07 all A B (subset(A,B)->set_union2(A,B)=B).
% 1.86/2.07 all A B subset(set_intersection2(A,B),A).
% 1.86/2.07 all A B C (subset(A,B)&subset(A,C)->subset(A,set_intersection2(B,C))).
% 1.86/2.07 all A (set_union2(A,empty_set)=A).
% 1.86/2.07 all A B C (subset(A,B)&subset(B,C)->subset(A,C)).
% 1.86/2.07 all A B C (subset(A,B)->subset(set_intersection2(A,C),set_intersection2(B,C))).
% 1.86/2.07 all A B (subset(A,B)->set_intersection2(A,B)=A).
% 1.86/2.07 all A (set_intersection2(A,empty_set)=empty_set).
% 1.86/2.07 all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 1.86/2.07 all A subset(empty_set,A).
% 1.86/2.07 all A B C (subset(A,B)->subset(set_difference(A,C),set_difference(B,C))).
% 1.86/2.07 all A B subset(set_difference(A,B),A).
% 1.86/2.07 all A B (set_difference(A,B)=empty_set<->subset(A,B)).
% 1.86/2.07 all A B (set_union2(A,set_difference(B,A))=set_union2(A,B)).
% 1.86/2.07 all A (set_difference(A,empty_set)=A).
% 1.86/2.07 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))).
% 1.86/2.07 all A (subset(A,empty_set)->A=empty_set).
% 1.86/2.07 all A B (set_difference(set_union2(A,B),B)=set_difference(A,B)).
% 1.86/2.07 all A B (subset(A,B)->B=set_union2(A,set_difference(B,A))).
% 1.86/2.07 all A B (set_difference(A,set_difference(A,B))=set_intersection2(A,B)).
% 1.86/2.07 all A (set_difference(empty_set,A)=empty_set).
% 1.86/2.07 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))).
% 1.86/2.07 all A B (-(subset(A,B)&proper_subset(B,A))).
% 1.86/2.07 all A B C (subset(A,B)&disjoint(B,C)->disjoint(A,C)).
% 1.86/2.07 all A (unordered_pair(A,A)=singleton(A)).
% 1.86/2.07 all A (empty(A)->A=empty_set).
% 1.86/2.07 all A B (-(in(A,B)&empty(B))).
% 1.86/2.07 all A B subset(A,set_union2(A,B)).
% 1.86/2.07 all A B (disjoint(A,B)<->set_difference(A,B)=A).
% 1.86/2.07 all A B (-(empty(A)&A!=B&empty(B))).
% 1.86/2.07 all A B C (subset(A,B)&subset(C,B)->subset(set_union2(A,C),B)).
% 1.86/2.07 end_of_list.
% 1.86/2.07
% 1.86/2.07 -------> usable clausifies to:
% 1.86/2.07
% 1.86/2.07 list(usable).
% 1.86/2.07 0 [] A=A.
% 1.86/2.07 0 [] -in(A,B)| -in(B,A).
% 1.86/2.07 0 [] -proper_subset(A,B)| -proper_subset(B,A).
% 1.86/2.07 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.86/2.07 0 [] set_union2(A,B)=set_union2(B,A).
% 1.86/2.07 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.86/2.07 0 [] A!=B|subset(A,B).
% 1.86/2.07 0 [] A!=B|subset(B,A).
% 1.86/2.07 0 [] A=B| -subset(A,B)| -subset(B,A).
% 1.86/2.07 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 1.86/2.07 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 1.86/2.07 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 1.86/2.07 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 1.86/2.07 0 [] A!=empty_set| -in(B,A).
% 1.86/2.07 0 [] A=empty_set|in($f2(A),A).
% 1.86/2.07 0 [] C!=unordered_pair(A,B)| -in(D,C)|D=A|D=B.
% 1.86/2.07 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=A.
% 1.86/2.07 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=B.
% 1.86/2.07 0 [] C=unordered_pair(A,B)|in($f3(A,B,C),C)|$f3(A,B,C)=A|$f3(A,B,C)=B.
% 1.86/2.07 0 [] C=unordered_pair(A,B)| -in($f3(A,B,C),C)|$f3(A,B,C)!=A.
% 1.86/2.07 0 [] C=unordered_pair(A,B)| -in($f3(A,B,C),C)|$f3(A,B,C)!=B.
% 1.86/2.07 0 [] C!=set_union2(A,B)| -in(D,C)|in(D,A)|in(D,B).
% 1.86/2.07 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,A).
% 1.86/2.07 0 [] C!=set_union2(A,B)|in(D,C)| -in(D,B).
% 1.86/2.07 0 [] C=set_union2(A,B)|in($f4(A,B,C),C)|in($f4(A,B,C),A)|in($f4(A,B,C),B).
% 1.86/2.07 0 [] C=set_union2(A,B)| -in($f4(A,B,C),C)| -in($f4(A,B,C),A).
% 1.86/2.07 0 [] C=set_union2(A,B)| -in($f4(A,B,C),C)| -in($f4(A,B,C),B).
% 1.86/2.07 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.86/2.07 0 [] subset(A,B)|in($f5(A,B),A).
% 1.86/2.07 0 [] subset(A,B)| -in($f5(A,B),B).
% 1.86/2.07 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 1.86/2.07 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 1.86/2.07 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 1.86/2.07 0 [] C=set_intersection2(A,B)|in($f6(A,B,C),C)|in($f6(A,B,C),A).
% 1.86/2.07 0 [] C=set_intersection2(A,B)|in($f6(A,B,C),C)|in($f6(A,B,C),B).
% 1.86/2.07 0 [] C=set_intersection2(A,B)| -in($f6(A,B,C),C)| -in($f6(A,B,C),A)| -in($f6(A,B,C),B).
% 1.86/2.07 0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 1.86/2.07 0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 1.86/2.07 0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 1.86/2.07 0 [] C=set_difference(A,B)|in($f7(A,B,C),C)|in($f7(A,B,C),A).
% 1.86/2.07 0 [] C=set_difference(A,B)|in($f7(A,B,C),C)| -in($f7(A,B,C),B).
% 1.86/2.07 0 [] C=set_difference(A,B)| -in($f7(A,B,C),C)| -in($f7(A,B,C),A)|in($f7(A,B,C),B).
% 1.86/2.07 0 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.86/2.07 0 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.86/2.07 0 [] -proper_subset(A,B)|subset(A,B).
% 1.86/2.07 0 [] -proper_subset(A,B)|A!=B.
% 1.86/2.07 0 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 1.86/2.07 0 [] $T.
% 1.86/2.07 0 [] $T.
% 1.86/2.07 0 [] $T.
% 1.86/2.07 0 [] $T.
% 1.86/2.07 0 [] $T.
% 1.86/2.07 0 [] $T.
% 1.86/2.07 0 [] empty(empty_set).
% 1.86/2.07 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.86/2.07 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.86/2.07 0 [] set_union2(A,A)=A.
% 1.86/2.07 0 [] set_intersection2(A,A)=A.
% 1.86/2.07 0 [] -proper_subset(A,A).
% 1.86/2.07 0 [] singleton(A)!=empty_set.
% 1.86/2.07 0 [] subset(singleton($c2),$c1)|in($c2,$c1).
% 1.86/2.07 0 [] -subset(singleton($c2),$c1)| -in($c2,$c1).
% 1.86/2.07 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.86/2.07 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.86/2.07 0 [] empty($c3).
% 1.86/2.07 0 [] -empty($c4).
% 1.86/2.07 0 [] subset(A,A).
% 1.86/2.07 0 [] -disjoint(A,B)|disjoint(B,A).
% 1.86/2.07 0 [] -subset(A,B)|set_union2(A,B)=B.
% 1.86/2.07 0 [] subset(set_intersection2(A,B),A).
% 1.86/2.07 0 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 1.86/2.07 0 [] set_union2(A,empty_set)=A.
% 1.86/2.07 0 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.86/2.07 0 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 1.86/2.07 0 [] -subset(A,B)|set_intersection2(A,B)=A.
% 1.86/2.07 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.86/2.07 0 [] in($f8(A,B),A)|in($f8(A,B),B)|A=B.
% 1.86/2.07 0 [] -in($f8(A,B),A)| -in($f8(A,B),B)|A=B.
% 1.86/2.07 0 [] subset(empty_set,A).
% 1.86/2.07 0 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 1.86/2.07 0 [] subset(set_difference(A,B),A).
% 1.86/2.07 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.86/2.07 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.86/2.07 0 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 1.86/2.07 0 [] set_difference(A,empty_set)=A.
% 1.86/2.07 0 [] disjoint(A,B)|in($f9(A,B),A).
% 1.86/2.07 0 [] disjoint(A,B)|in($f9(A,B),B).
% 1.86/2.07 0 [] -in(C,A)| -in(C,B)| -disjoint(A,B).
% 1.86/2.07 0 [] -subset(A,empty_set)|A=empty_set.
% 1.86/2.07 0 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 1.86/2.07 0 [] -subset(A,B)|B=set_union2(A,set_difference(B,A)).
% 1.86/2.07 0 [] set_difference(A,set_difference(A,B))=set_intersection2(A,B).
% 1.86/2.07 0 [] set_difference(empty_set,A)=empty_set.
% 1.86/2.07 0 [] disjoint(A,B)|in($f10(A,B),set_intersection2(A,B)).
% 1.86/2.07 0 [] -in(C,set_intersection2(A,B))| -disjoint(A,B).
% 1.86/2.07 0 [] -subset(A,B)| -proper_subset(B,A).
% 1.86/2.07 0 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 1.86/2.07 0 [] unordered_pair(A,A)=singleton(A).
% 1.86/2.07 0 [] -empty(A)|A=empty_set.
% 1.86/2.07 0 [] -in(A,B)| -empty(B).
% 1.86/2.07 0 [] subset(A,set_union2(A,B)).
% 1.86/2.07 0 [] -disjoint(A,B)|set_difference(A,B)=A.
% 1.86/2.07 0 [] disjoint(A,B)|set_difference(A,B)!=A.
% 1.86/2.07 0 [] -empty(A)|A=B| -empty(B).
% 1.86/2.07 0 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 1.86/2.07 end_of_list.
% 1.86/2.07
% 1.86/2.07 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.86/2.08
% 1.86/2.08 This ia a non-Horn set with equality. The strategy will be
% 1.86/2.08 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.86/2.08 deletion, with positive clauses in sos and nonpositive
% 1.86/2.08 clauses in usable.
% 1.86/2.08
% 1.86/2.08 dependent: set(knuth_bendix).
% 1.86/2.08 dependent: set(anl_eq).
% 1.86/2.08 dependent: set(para_from).
% 1.86/2.08 dependent: set(para_into).
% 1.86/2.08 dependent: clear(para_from_right).
% 1.86/2.08 dependent: clear(para_into_right).
% 1.86/2.08 dependent: set(para_from_vars).
% 1.86/2.08 dependent: set(eq_units_both_ways).
% 1.86/2.08 dependent: set(dynamic_demod_all).
% 1.86/2.08 dependent: set(dynamic_demod).
% 1.86/2.08 dependent: set(order_eq).
% 1.86/2.08 dependent: set(back_demod).
% 1.86/2.08 dependent: set(lrpo).
% 1.86/2.08 dependent: set(hyper_res).
% 1.86/2.08 dependent: set(unit_deletion).
% 1.86/2.08 dependent: set(factor).
% 1.86/2.08
% 1.86/2.08 ------------> process usable:
% 1.86/2.08 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.86/2.08 ** KEPT (pick-wt=6): 2 [] -proper_subset(A,B)| -proper_subset(B,A).
% 1.86/2.08 ** KEPT (pick-wt=6): 3 [] A!=B|subset(A,B).
% 1.86/2.08 ** KEPT (pick-wt=6): 4 [] A!=B|subset(B,A).
% 1.86/2.08 ** KEPT (pick-wt=9): 5 [] A=B| -subset(A,B)| -subset(B,A).
% 1.86/2.08 ** KEPT (pick-wt=10): 6 [] A!=singleton(B)| -in(C,A)|C=B.
% 1.86/2.08 ** KEPT (pick-wt=10): 7 [] A!=singleton(B)|in(C,A)|C!=B.
% 1.86/2.08 ** KEPT (pick-wt=14): 8 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 1.86/2.08 ** KEPT (pick-wt=6): 9 [] A!=empty_set| -in(B,A).
% 1.86/2.08 ** KEPT (pick-wt=14): 10 [] A!=unordered_pair(B,C)| -in(D,A)|D=B|D=C.
% 1.86/2.08 ** KEPT (pick-wt=11): 11 [] A!=unordered_pair(B,C)|in(D,A)|D!=B.
% 1.86/2.08 ** KEPT (pick-wt=11): 12 [] A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 1.86/2.08 ** KEPT (pick-wt=17): 13 [] A=unordered_pair(B,C)| -in($f3(B,C,A),A)|$f3(B,C,A)!=B.
% 1.86/2.08 ** KEPT (pick-wt=17): 14 [] A=unordered_pair(B,C)| -in($f3(B,C,A),A)|$f3(B,C,A)!=C.
% 1.86/2.08 ** KEPT (pick-wt=14): 15 [] A!=set_union2(B,C)| -in(D,A)|in(D,B)|in(D,C).
% 1.86/2.08 ** KEPT (pick-wt=11): 16 [] A!=set_union2(B,C)|in(D,A)| -in(D,B).
% 1.86/2.08 ** KEPT (pick-wt=11): 17 [] A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 1.86/2.08 ** KEPT (pick-wt=17): 18 [] A=set_union2(B,C)| -in($f4(B,C,A),A)| -in($f4(B,C,A),B).
% 1.86/2.08 ** KEPT (pick-wt=17): 19 [] A=set_union2(B,C)| -in($f4(B,C,A),A)| -in($f4(B,C,A),C).
% 1.86/2.08 ** KEPT (pick-wt=9): 20 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.86/2.08 ** KEPT (pick-wt=8): 21 [] subset(A,B)| -in($f5(A,B),B).
% 1.86/2.08 ** KEPT (pick-wt=11): 22 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 1.86/2.08 ** KEPT (pick-wt=11): 23 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 1.86/2.08 ** KEPT (pick-wt=14): 24 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 1.86/2.08 ** KEPT (pick-wt=23): 25 [] A=set_intersection2(B,C)| -in($f6(B,C,A),A)| -in($f6(B,C,A),B)| -in($f6(B,C,A),C).
% 1.86/2.08 ** KEPT (pick-wt=11): 26 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 1.86/2.08 ** KEPT (pick-wt=11): 27 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 1.86/2.08 ** KEPT (pick-wt=14): 28 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 1.86/2.08 ** KEPT (pick-wt=17): 29 [] A=set_difference(B,C)|in($f7(B,C,A),A)| -in($f7(B,C,A),C).
% 1.86/2.08 ** KEPT (pick-wt=23): 30 [] A=set_difference(B,C)| -in($f7(B,C,A),A)| -in($f7(B,C,A),B)|in($f7(B,C,A),C).
% 1.86/2.08 ** KEPT (pick-wt=8): 31 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.86/2.08 ** KEPT (pick-wt=8): 32 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.86/2.08 ** KEPT (pick-wt=6): 33 [] -proper_subset(A,B)|subset(A,B).
% 1.86/2.08 ** KEPT (pick-wt=6): 34 [] -proper_subset(A,B)|A!=B.
% 1.86/2.08 ** KEPT (pick-wt=9): 35 [] proper_subset(A,B)| -subset(A,B)|A=B.
% 1.86/2.08 ** KEPT (pick-wt=6): 36 [] empty(A)| -empty(set_union2(A,B)).
% 1.86/2.08 ** KEPT (pick-wt=6): 37 [] empty(A)| -empty(set_union2(B,A)).
% 1.86/2.08 ** KEPT (pick-wt=3): 38 [] -proper_subset(A,A).
% 1.86/2.08 ** KEPT (pick-wt=4): 39 [] singleton(A)!=empty_set.
% 1.86/2.08 ** KEPT (pick-wt=7): 40 [] -subset(singleton($c2),$c1)| -in($c2,$c1).
% 1.86/2.08 ** KEPT (pick-wt=8): 41 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.86/2.08 ** KEPT (pick-wt=8): 42 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.86/2.08 ** KEPT (pick-wt=2): 43 [] -empty($c4).
% 1.86/2.08 ** KEPT (pick-wt=6): 44 [] -disjoint(A,B)|disjoint(B,A).
% 1.86/2.08 ** KEPT (pick-wt=8): 45 [] -subset(A,B)|set_union2(A,B)=B.
% 1.86/2.08 ** KEPT (pick-wt=11): 46 [] -subset(A,B)| -subset(A,C)|subset(A,set_intersection2(B,C)).
% 1.86/2.08 ** KEPT (pick-wt=9): 47 [] -subset(A,B)| -subset(B,C)|subset(A,C).
% 1.86/2.08 ** KEPT (pick-wt=10): 48 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 1.86/2.08 ** KEPT (pick-wt=8): 49 [] -subset(A,B)|set_intersection2(A,B)=A.
% 1.86/2.08 ** KEPT (pick-wt=13): 50 [] -in($f8(A,B),A)| -in($f8(A,B),B)|A=B.
% 1.86/2.08 ** KEPT (pick-wt=10): 51 [] -subset(A,B)|subset(set_difference(A,C),set_difference(B,C)).
% 1.86/2.08 Following clause subsumed by 41 during input processing: 0 [] set_difference(A,B)!=empty_set|subset(A,B).
% 1.86/2.08 Following clause subsumed by 42 during input processing: 0 [] set_difference(A,B)=empty_set| -subset(A,B).
% 1.86/2.08 ** KEPT (pick-wt=9): 52 [] -in(A,B)| -in(A,C)| -disjoint(B,C).
% 1.86/2.08 ** KEPT (pick-wt=6): 53 [] -subset(A,empty_set)|A=empty_set.
% 1.86/2.08 ** KEPT (pick-wt=10): 55 [copy,54,flip.2] -subset(A,B)|set_union2(A,set_difference(B,A))=B.
% 1.86/2.08 ** KEPT (pick-wt=8): 56 [] -in(A,set_intersection2(B,C))| -disjoint(B,C).
% 1.86/2.08 ** KEPT (pick-wt=6): 57 [] -subset(A,B)| -proper_subset(B,A).
% 1.86/2.08 ** KEPT (pick-wt=9): 58 [] -subset(A,B)| -disjoint(B,C)|disjoint(A,C).
% 1.86/2.08 ** KEPT (pick-wt=5): 59 [] -empty(A)|A=empty_set.
% 1.86/2.08 ** KEPT (pick-wt=5): 60 [] -in(A,B)| -empty(B).
% 1.86/2.08 ** KEPT (pick-wt=8): 61 [] -disjoint(A,B)|set_difference(A,B)=A.
% 1.86/2.08 ** KEPT (pick-wt=8): 62 [] disjoint(A,B)|set_difference(A,B)!=A.
% 1.86/2.08 ** KEPT (pick-wt=7): 63 [] -empty(A)|A=B| -empty(B).
% 1.86/2.08 ** KEPT (pick-wt=11): 64 [] -subset(A,B)| -subset(C,B)|subset(set_union2(A,C),B).
% 1.86/2.08
% 1.86/2.08 ------------> process sos:
% 1.86/2.08 ** KEPT (pick-wt=3): 84 [] A=A.
% 1.86/2.08 ** KEPT (pick-wt=7): 85 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.86/2.08 ** KEPT (pick-wt=7): 86 [] set_union2(A,B)=set_union2(B,A).
% 1.86/2.08 ** KEPT (pick-wt=7): 87 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.86/2.08 ** KEPT (pick-wt=14): 88 [] A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B.
% 1.86/2.08 ** KEPT (pick-wt=7): 89 [] A=empty_set|in($f2(A),A).
% 1.86/2.08 ** KEPT (pick-wt=23): 90 [] A=unordered_pair(B,C)|in($f3(B,C,A),A)|$f3(B,C,A)=B|$f3(B,C,A)=C.
% 1.86/2.08 ** KEPT (pick-wt=23): 91 [] A=set_union2(B,C)|in($f4(B,C,A),A)|in($f4(B,C,A),B)|in($f4(B,C,A),C).
% 1.86/2.08 ** KEPT (pick-wt=8): 92 [] subset(A,B)|in($f5(A,B),A).
% 1.86/2.08 ** KEPT (pick-wt=17): 93 [] A=set_intersection2(B,C)|in($f6(B,C,A),A)|in($f6(B,C,A),B).
% 1.86/2.08 ** KEPT (pick-wt=17): 94 [] A=set_intersection2(B,C)|in($f6(B,C,A),A)|in($f6(B,C,A),C).
% 1.86/2.08 ** KEPT (pick-wt=17): 95 [] A=set_difference(B,C)|in($f7(B,C,A),A)|in($f7(B,C,A),B).
% 1.86/2.08 ** KEPT (pick-wt=2): 96 [] empty(empty_set).
% 1.86/2.08 ** KEPT (pick-wt=5): 97 [] set_union2(A,A)=A.
% 1.86/2.08 ---> New Demodulator: 98 [new_demod,97] set_union2(A,A)=A.
% 1.86/2.08 ** KEPT (pick-wt=5): 99 [] set_intersection2(A,A)=A.
% 1.86/2.08 ---> New Demodulator: 100 [new_demod,99] set_intersection2(A,A)=A.
% 1.86/2.08 ** KEPT (pick-wt=7): 101 [] subset(singleton($c2),$c1)|in($c2,$c1).
% 1.86/2.08 ** KEPT (pick-wt=2): 102 [] empty($c3).
% 1.86/2.08 ** KEPT (pick-wt=3): 103 [] subset(A,A).
% 1.86/2.08 ** KEPT (pick-wt=5): 104 [] subset(set_intersection2(A,B),A).
% 1.86/2.08 ** KEPT (pick-wt=5): 105 [] set_union2(A,empty_set)=A.
% 1.86/2.08 ---> New Demodulator: 106 [new_demod,105] set_union2(A,empty_set)=A.
% 1.86/2.08 ** KEPT (pick-wt=5): 107 [] set_intersection2(A,empty_set)=empty_set.
% 1.86/2.08 ---> New Demodulator: 108 [new_demod,107] set_intersection2(A,empty_set)=empty_set.
% 1.86/2.08 ** KEPT (pick-wt=13): 109 [] in($f8(A,B),A)|in($f8(A,B),B)|A=B.
% 1.86/2.08 ** KEPT (pick-wt=3): 110 [] subset(empty_set,A).
% 1.86/2.08 ** KEPT (pick-wt=5): 111 [] subset(set_difference(A,B),A).
% 1.86/2.08 ** KEPT (pick-wt=9): 112 [] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 1.86/2.08 ---> New Demodulator: 113 [new_demod,112] set_union2(A,set_difference(B,A))=set_union2(A,B).
% 1.86/2.08 ** KEPT (pick-wt=5): 114 [] set_difference(A,empty_set)=A.
% 1.86/2.08 ---> New Demodulator: 115 [new_demod,114] set_difference(A,empty_set)=A.
% 1.86/2.08 ** KEPT (pick-wt=8): 116 [] disjoint(A,B)|in($f9(A,B),A).
% 1.86/2.08 ** KEPT (pick-wt=8): 117 [] disjoint(A,B)|in($f9(A,B),B).
% 1.86/2.08 ** KEPT (pick-wt=9): 118 [] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 1.86/2.08 ---> New Demodulator: 119 [new_demod,118] set_difference(set_union2(A,B),B)=set_difference(A,B).
% 1.86/2.08 ** KEPT (pick-wt=9): 121 [copy,120,flip.1] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 1.86/2.08 ---> New Demodulator: 122 [new_demod,121] set_intersection2(A,B)=set_difference(A,set_difference(A,B)).
% 1.86/2.08 ** KEPT (pick-wt=5): 123 [] set_difference(empty_set,A)=empty_set.
% 1.86/2.08 ---> New Demodulator: 124 [new_demod,123] set_difference(empty_set,A)=empty_set.
% 1.86/2.08 ** KEPT (pick-wt=12): 126 [copy,125,demod,122] disjoint(A,B)|in($f10(A,B),set_difference(A,set_difference(A,B))).
% 1.86/2.08 ** KEPT (pickAlarm clock
% 299.94/300.09 Otter interrupted
% 299.94/300.09 PROOF NOT FOUND
%------------------------------------------------------------------------------