TSTP Solution File: SEU109+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU109+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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:47 EDT 2022
% Result : Timeout 299.88s 300.04s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU109+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n010.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:23:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.85/2.04 ----- Otter 3.3f, August 2004 -----
% 1.85/2.04 The process was started by sandbox on n010.cluster.edu,
% 1.85/2.04 Wed Jul 27 07:23:24 2022
% 1.85/2.04 The command was "./otter". The process ID is 17641.
% 1.85/2.04
% 1.85/2.04 set(prolog_style_variables).
% 1.85/2.04 set(auto).
% 1.85/2.04 dependent: set(auto1).
% 1.85/2.04 dependent: set(process_input).
% 1.85/2.04 dependent: clear(print_kept).
% 1.85/2.04 dependent: clear(print_new_demod).
% 1.85/2.04 dependent: clear(print_back_demod).
% 1.85/2.04 dependent: clear(print_back_sub).
% 1.85/2.04 dependent: set(control_memory).
% 1.85/2.04 dependent: assign(max_mem, 12000).
% 1.85/2.04 dependent: assign(pick_given_ratio, 4).
% 1.85/2.04 dependent: assign(stats_level, 1).
% 1.85/2.04 dependent: assign(max_seconds, 10800).
% 1.85/2.04 clear(print_given).
% 1.85/2.04
% 1.85/2.04 formula_list(usable).
% 1.85/2.04 all A (A=A).
% 1.85/2.04 all A B (in(A,B)-> -in(B,A)).
% 1.85/2.04 all A (empty(A)->finite(A)).
% 1.85/2.04 all A (preboolean(A)->cup_closed(A)&diff_closed(A)).
% 1.85/2.04 all A (finite(A)-> (all B (element(B,powerset(A))->finite(B)))).
% 1.85/2.04 all A (cup_closed(A)&diff_closed(A)->preboolean(A)).
% 1.85/2.04 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.85/2.04 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.85/2.04 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 1.85/2.04 all A exists B element(B,A).
% 1.85/2.04 all A B (finite(B)->finite(set_intersection2(A,B))).
% 1.85/2.04 all A B (finite(A)->finite(set_intersection2(A,B))).
% 1.85/2.04 all A B (finite(A)->finite(set_difference(A,B))).
% 1.85/2.04 all A (-empty(powerset(A))&cup_closed(powerset(A))&diff_closed(powerset(A))&preboolean(powerset(A))).
% 1.85/2.04 all A (-empty(powerset(A))).
% 1.85/2.04 empty(empty_set).
% 1.85/2.04 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.85/2.04 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.85/2.04 all A B (finite(A)&finite(B)->finite(set_union2(A,B))).
% 1.85/2.04 all A B (set_union2(A,A)=A).
% 1.85/2.04 all A B (set_intersection2(A,A)=A).
% 1.85/2.04 exists A (-empty(A)&finite(A)).
% 1.85/2.04 exists A (-empty(A)&cup_closed(A)&cap_closed(A)&diff_closed(A)&preboolean(A)).
% 1.85/2.04 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.85/2.04 exists A empty(A).
% 1.85/2.04 all A exists B (element(B,powerset(A))&empty(B)&relation(B)&function(B)&one_to_one(B)&epsilon_transitive(B)&epsilon_connected(B)&ordinal(B)&natural(B)&finite(B)).
% 1.85/2.04 all A exists B (element(B,powerset(A))&empty(B)).
% 1.85/2.04 exists A (-empty(A)).
% 1.85/2.04 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.85/2.04 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 1.85/2.04 all A B subset(A,A).
% 1.85/2.04 all A (preboolean(A)<-> (all B C (in(B,A)&in(C,A)->in(set_union2(B,C),A)&in(set_difference(B,C),A)))).
% 1.85/2.04 all A (-empty(A)&preboolean(A)->in(empty_set,A)).
% 1.85/2.04 all A (set_union2(A,empty_set)=A).
% 1.85/2.04 all A B (in(A,B)->element(A,B)).
% 1.85/2.04 -(all A (-empty(A)&preboolean(A)-> (all B (-empty(B)&preboolean(B)-> -empty(set_intersection2(A,B))&preboolean(set_intersection2(A,B)))))).
% 1.85/2.04 all A (set_intersection2(A,empty_set)=empty_set).
% 1.85/2.04 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.85/2.04 all A (set_difference(A,empty_set)=A).
% 1.85/2.04 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.85/2.04 all A (set_difference(empty_set,A)=empty_set).
% 1.85/2.04 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.85/2.04 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.85/2.04 all A (empty(A)->A=empty_set).
% 1.85/2.04 all A B (-(in(A,B)&empty(B))).
% 1.85/2.04 all A B (-(empty(A)&A!=B&empty(B))).
% 1.85/2.04 end_of_list.
% 1.85/2.04
% 1.85/2.04 -------> usable clausifies to:
% 1.85/2.04
% 1.85/2.04 list(usable).
% 1.85/2.04 0 [] A=A.
% 1.85/2.04 0 [] -in(A,B)| -in(B,A).
% 1.85/2.04 0 [] -empty(A)|finite(A).
% 1.85/2.04 0 [] -preboolean(A)|cup_closed(A).
% 1.85/2.04 0 [] -preboolean(A)|diff_closed(A).
% 1.85/2.04 0 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.85/2.04 0 [] -cup_closed(A)| -diff_closed(A)|preboolean(A).
% 1.85/2.04 0 [] set_union2(A,B)=set_union2(B,A).
% 1.85/2.04 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.85/2.04 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 1.85/2.04 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 1.85/2.04 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 1.85/2.04 0 [] C=set_intersection2(A,B)|in($f1(A,B,C),C)|in($f1(A,B,C),A).
% 1.85/2.04 0 [] C=set_intersection2(A,B)|in($f1(A,B,C),C)|in($f1(A,B,C),B).
% 1.85/2.04 0 [] C=set_intersection2(A,B)| -in($f1(A,B,C),C)| -in($f1(A,B,C),A)| -in($f1(A,B,C),B).
% 1.85/2.04 0 [] element($f2(A),A).
% 1.85/2.04 0 [] -finite(B)|finite(set_intersection2(A,B)).
% 1.85/2.04 0 [] -finite(A)|finite(set_intersection2(A,B)).
% 1.85/2.04 0 [] -finite(A)|finite(set_difference(A,B)).
% 1.85/2.04 0 [] -empty(powerset(A)).
% 1.85/2.04 0 [] cup_closed(powerset(A)).
% 1.85/2.04 0 [] diff_closed(powerset(A)).
% 1.85/2.04 0 [] preboolean(powerset(A)).
% 1.85/2.04 0 [] -empty(powerset(A)).
% 1.85/2.04 0 [] empty(empty_set).
% 1.85/2.04 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.85/2.04 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.85/2.04 0 [] -finite(A)| -finite(B)|finite(set_union2(A,B)).
% 1.85/2.04 0 [] set_union2(A,A)=A.
% 1.85/2.04 0 [] set_intersection2(A,A)=A.
% 1.85/2.04 0 [] -empty($c1).
% 1.85/2.04 0 [] finite($c1).
% 1.85/2.04 0 [] -empty($c2).
% 1.85/2.04 0 [] cup_closed($c2).
% 1.85/2.04 0 [] cap_closed($c2).
% 1.85/2.04 0 [] diff_closed($c2).
% 1.85/2.04 0 [] preboolean($c2).
% 1.85/2.04 0 [] empty(A)|element($f3(A),powerset(A)).
% 1.85/2.04 0 [] empty(A)| -empty($f3(A)).
% 1.85/2.04 0 [] empty($c3).
% 1.85/2.04 0 [] element($f4(A),powerset(A)).
% 1.85/2.04 0 [] empty($f4(A)).
% 1.85/2.04 0 [] relation($f4(A)).
% 1.85/2.04 0 [] function($f4(A)).
% 1.85/2.04 0 [] one_to_one($f4(A)).
% 1.85/2.04 0 [] epsilon_transitive($f4(A)).
% 1.85/2.04 0 [] epsilon_connected($f4(A)).
% 1.85/2.04 0 [] ordinal($f4(A)).
% 1.85/2.04 0 [] natural($f4(A)).
% 1.85/2.04 0 [] finite($f4(A)).
% 1.85/2.04 0 [] element($f5(A),powerset(A)).
% 1.85/2.04 0 [] empty($f5(A)).
% 1.85/2.04 0 [] -empty($c4).
% 1.85/2.04 0 [] empty(A)|element($f6(A),powerset(A)).
% 1.85/2.04 0 [] empty(A)| -empty($f6(A)).
% 1.85/2.04 0 [] empty(A)|finite($f6(A)).
% 1.85/2.04 0 [] empty(A)|element($f7(A),powerset(A)).
% 1.85/2.04 0 [] empty(A)| -empty($f7(A)).
% 1.85/2.04 0 [] empty(A)|finite($f7(A)).
% 1.85/2.04 0 [] subset(A,A).
% 1.85/2.04 0 [] -preboolean(A)| -in(B,A)| -in(C,A)|in(set_union2(B,C),A).
% 1.85/2.04 0 [] -preboolean(A)| -in(B,A)| -in(C,A)|in(set_difference(B,C),A).
% 1.85/2.04 0 [] preboolean(A)|in($f9(A),A).
% 1.85/2.04 0 [] preboolean(A)|in($f8(A),A).
% 1.85/2.04 0 [] preboolean(A)| -in(set_union2($f9(A),$f8(A)),A)| -in(set_difference($f9(A),$f8(A)),A).
% 1.85/2.04 0 [] empty(A)| -preboolean(A)|in(empty_set,A).
% 1.85/2.04 0 [] set_union2(A,empty_set)=A.
% 1.85/2.04 0 [] -in(A,B)|element(A,B).
% 1.85/2.04 0 [] -empty($c6).
% 1.85/2.04 0 [] preboolean($c6).
% 1.85/2.04 0 [] -empty($c5).
% 1.85/2.04 0 [] preboolean($c5).
% 1.85/2.04 0 [] empty(set_intersection2($c6,$c5))| -preboolean(set_intersection2($c6,$c5)).
% 1.85/2.04 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.85/2.04 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.85/2.04 0 [] set_difference(A,empty_set)=A.
% 1.85/2.04 0 [] -element(A,powerset(B))|subset(A,B).
% 1.85/2.04 0 [] element(A,powerset(B))| -subset(A,B).
% 1.85/2.04 0 [] set_difference(empty_set,A)=empty_set.
% 1.85/2.04 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.85/2.04 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.85/2.04 0 [] -empty(A)|A=empty_set.
% 1.85/2.04 0 [] -in(A,B)| -empty(B).
% 1.85/2.04 0 [] -empty(A)|A=B| -empty(B).
% 1.85/2.04 end_of_list.
% 1.85/2.04
% 1.85/2.04 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.85/2.05
% 1.85/2.05 This ia a non-Horn set with equality. The strategy will be
% 1.85/2.05 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.85/2.05 deletion, with positive clauses in sos and nonpositive
% 1.85/2.05 clauses in usable.
% 1.85/2.05
% 1.85/2.05 dependent: set(knuth_bendix).
% 1.85/2.05 dependent: set(anl_eq).
% 1.85/2.05 dependent: set(para_from).
% 1.85/2.05 dependent: set(para_into).
% 1.85/2.05 dependent: clear(para_from_right).
% 1.85/2.05 dependent: clear(para_into_right).
% 1.85/2.05 dependent: set(para_from_vars).
% 1.85/2.05 dependent: set(eq_units_both_ways).
% 1.85/2.05 dependent: set(dynamic_demod_all).
% 1.85/2.05 dependent: set(dynamic_demod).
% 1.85/2.05 dependent: set(order_eq).
% 1.85/2.05 dependent: set(back_demod).
% 1.85/2.05 dependent: set(lrpo).
% 1.85/2.05 dependent: set(hyper_res).
% 1.85/2.05 dependent: set(unit_deletion).
% 1.85/2.05 dependent: set(factor).
% 1.85/2.05
% 1.85/2.05 ------------> process usable:
% 1.85/2.05 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.85/2.05 ** KEPT (pick-wt=4): 2 [] -empty(A)|finite(A).
% 1.85/2.05 ** KEPT (pick-wt=4): 3 [] -preboolean(A)|cup_closed(A).
% 1.85/2.05 ** KEPT (pick-wt=4): 4 [] -preboolean(A)|diff_closed(A).
% 1.85/2.05 ** KEPT (pick-wt=8): 5 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 1.85/2.05 ** KEPT (pick-wt=6): 6 [] -cup_closed(A)| -diff_closed(A)|preboolean(A).
% 1.85/2.05 ** KEPT (pick-wt=11): 7 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 1.85/2.05 ** KEPT (pick-wt=11): 8 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 1.85/2.05 ** KEPT (pick-wt=14): 9 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 1.85/2.05 ** KEPT (pick-wt=23): 10 [] A=set_intersection2(B,C)| -in($f1(B,C,A),A)| -in($f1(B,C,A),B)| -in($f1(B,C,A),C).
% 1.85/2.05 ** KEPT (pick-wt=6): 11 [] -finite(A)|finite(set_intersection2(B,A)).
% 1.85/2.05 ** KEPT (pick-wt=6): 12 [] -finite(A)|finite(set_intersection2(A,B)).
% 1.85/2.05 ** KEPT (pick-wt=6): 13 [] -finite(A)|finite(set_difference(A,B)).
% 1.85/2.05 ** KEPT (pick-wt=3): 14 [] -empty(powerset(A)).
% 1.85/2.05 Following clause subsumed by 14 during input processing: 0 [] -empty(powerset(A)).
% 1.85/2.05 ** KEPT (pick-wt=6): 15 [] empty(A)| -empty(set_union2(A,B)).
% 1.85/2.05 ** KEPT (pick-wt=6): 16 [] empty(A)| -empty(set_union2(B,A)).
% 1.85/2.05 ** KEPT (pick-wt=8): 17 [] -finite(A)| -finite(B)|finite(set_union2(A,B)).
% 1.85/2.05 ** KEPT (pick-wt=2): 18 [] -empty($c1).
% 1.85/2.05 ** KEPT (pick-wt=2): 19 [] -empty($c2).
% 1.85/2.05 ** KEPT (pick-wt=5): 20 [] empty(A)| -empty($f3(A)).
% 1.85/2.05 ** KEPT (pick-wt=2): 21 [] -empty($c4).
% 1.85/2.05 ** KEPT (pick-wt=5): 22 [] empty(A)| -empty($f6(A)).
% 1.85/2.05 ** KEPT (pick-wt=5): 23 [] empty(A)| -empty($f7(A)).
% 1.85/2.05 ** KEPT (pick-wt=13): 24 [] -preboolean(A)| -in(B,A)| -in(C,A)|in(set_union2(B,C),A).
% 1.85/2.05 ** KEPT (pick-wt=13): 25 [] -preboolean(A)| -in(B,A)| -in(C,A)|in(set_difference(B,C),A).
% 1.85/2.05 ** KEPT (pick-wt=16): 26 [] preboolean(A)| -in(set_union2($f9(A),$f8(A)),A)| -in(set_difference($f9(A),$f8(A)),A).
% 1.85/2.05 ** KEPT (pick-wt=7): 27 [] empty(A)| -preboolean(A)|in(empty_set,A).
% 1.85/2.05 ** KEPT (pick-wt=6): 28 [] -in(A,B)|element(A,B).
% 1.85/2.05 ** KEPT (pick-wt=2): 29 [] -empty($c6).
% 1.85/2.05 ** KEPT (pick-wt=2): 30 [] -empty($c5).
% 1.85/2.05 ** KEPT (pick-wt=8): 31 [] empty(set_intersection2($c6,$c5))| -preboolean(set_intersection2($c6,$c5)).
% 1.85/2.05 ** KEPT (pick-wt=8): 32 [] -element(A,B)|empty(B)|in(A,B).
% 1.85/2.05 ** KEPT (pick-wt=7): 33 [] -element(A,powerset(B))|subset(A,B).
% 1.85/2.05 ** KEPT (pick-wt=7): 34 [] element(A,powerset(B))| -subset(A,B).
% 1.85/2.05 ** KEPT (pick-wt=10): 35 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.85/2.05 ** KEPT (pick-wt=9): 36 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.85/2.05 ** KEPT (pick-wt=5): 37 [] -empty(A)|A=empty_set.
% 1.85/2.05 ** KEPT (pick-wt=5): 38 [] -in(A,B)| -empty(B).
% 1.85/2.05 ** KEPT (pick-wt=7): 39 [] -empty(A)|A=B| -empty(B).
% 1.85/2.05
% 1.85/2.05 ------------> process sos:
% 1.85/2.05 ** KEPT (pick-wt=3): 50 [] A=A.
% 1.85/2.05 ** KEPT (pick-wt=7): 51 [] set_union2(A,B)=set_union2(B,A).
% 1.85/2.05 ** KEPT (pick-wt=7): 52 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.85/2.05 ** KEPT (pick-wt=17): 53 [] A=set_intersection2(B,C)|in($f1(B,C,A),A)|in($f1(B,C,A),B).
% 1.85/2.05 ** KEPT (pick-wt=17): 54 [] A=set_intersection2(B,C)|in($f1(B,C,A),A)|in($f1(B,C,A),C).
% 1.85/2.05 ** KEPT (pick-wt=4): 55 [] element($f2(A),A).
% 1.85/2.05 ** KEPT (pick-wt=3): 56 [] cup_closed(powerset(A)).
% 1.85/2.05 ** KEPT (pick-wt=3): 57 [] diff_closed(powerset(A)).
% 1.85/2.05 ** KEPT (pick-wt=3): 58 [] preboolean(powerset(A)).
% 1.85/2.05 ** KEPT (pick-wt=2): 59 [] empty(empty_set).
% 1.85/2.05 ** KEPT (pick-wt=5): 60 [] set_union2(A,A)=A.
% 1.85/2.05 ---> New Demodulator: 61 [new_demod,60] set_union2(A,A)=A.
% 1.85/2.05 ** KEPT (pick-wt=5): 62 [] set_intersection2(A,A)=A.
% 1.85/2.05 ---> New Demodulator: 63 [new_demod,62] set_intersection2(A,A)=A.
% 1.85/2.05 ** KEPT (pick-wt=2): 64 [] finite($c1).
% 1.85/2.05 ** KEPT (pick-wt=2): 65 [] cup_closed($c2).
% 1.85/2.05 ** KEPT (pick-wt=2): 66 [] cap_closed($c2).
% 1.85/2.05 ** KEPT (pick-wt=2): 67 [] diff_closed($c2).
% 1.85/2.05 ** KEPT (pick-wt=2): 68 [] preboolean($c2).
% 1.85/2.05 ** KEPT (pick-wt=7): 69 [] empty(A)|element($f3(A),powerset(A)).
% 1.85/2.05 ** KEPT (pick-wt=2): 70 [] empty($c3).
% 1.85/2.05 ** KEPT (pick-wt=5): 71 [] element($f4(A),powerset(A)).
% 1.85/2.05 ** KEPT (pick-wt=3): 72 [] empty($f4(A)).
% 1.85/2.05 ** KEPT (pick-wt=3): 73 [] relation($f4(A)).
% 1.85/2.05 ** KEPT (pick-wt=3): 74 [] function($f4(A)).
% 1.85/2.05 ** KEPT (pick-wt=3): 75 [] one_to_one($f4(A)).
% 1.85/2.05 ** KEPT (pick-wt=3): 76 [] epsilon_transitive($f4(A)).
% 1.85/2.05 ** KEPT (pick-wt=3): 77 [] epsilon_connected($f4(A)).
% 1.85/2.05 ** KEPT (pick-wt=3): 78 [] ordinal($f4(A)).
% 1.85/2.05 ** KEPT (pick-wt=3): 79 [] natural($f4(A)).
% 1.85/2.05 ** KEPT (pick-wt=3): 80 [] finite($f4(A)).
% 1.85/2.05 ** KEPT (pick-wt=5): 81 [] element($f5(A),powerset(A)).
% 1.85/2.05 ** KEPT (pick-wt=3): 82 [] empty($f5(A)).
% 1.85/2.05 ** KEPT (pick-wt=7): 83 [] empty(A)|element($f6(A),powerset(A)).
% 1.85/2.05 ** KEPT (pick-wt=5): 84 [] empty(A)|finite($f6(A)).
% 1.85/2.05 ** KEPT (pick-wt=7): 85 [] empty(A)|element($f7(A),powerset(A)).
% 1.85/2.05 ** KEPT (pick-wt=5): 86 [] empty(A)|finite($f7(A)).
% 1.85/2.05 ** KEPT (pick-wt=3): 87 [] subset(A,A).
% 1.85/2.05 ** KEPT (pick-wt=6): 88 [] preboolean(A)|in($f9(A),A).
% 1.85/2.05 ** KEPT (pick-wt=6): 89 [] preboolean(A)|in($f8(A),A).
% 1.85/2.05 ** KEPT (pick-wt=5): 90 [] set_union2(A,empty_set)=A.
% 1.85/2.05 ---> New Demodulator: 91 [new_demod,90] set_union2(A,empty_set)=A.
% 1.85/2.05 ** KEPT (pick-wt=2): 92 [] preboolean($c6).
% 1.85/2.05 ** KEPT (pick-wt=2): 93 [] preboolean($c5).
% 1.85/2.05 ** KEPT (pick-wt=5): 94 [] set_intersection2(A,empty_set)=empty_set.
% 1.85/2.05 ---> New Demodulator: 95 [new_demod,94] set_intersection2(A,empty_set)=empty_set.
% 1.85/2.05 ** KEPT (pick-wt=5): 96 [] set_difference(A,empty_set)=A.
% 1.85/2.05 ---> New Demodulator: 97 [new_demod,96] set_difference(A,empty_set)=A.
% 1.85/2.05 ** KEPT (pick-wt=5): 98 [] set_difference(empty_set,A)=empty_set.
% 1.85/2.05 ---> New Demodulator: 99 [new_demod,98] set_difference(empty_set,A)=empty_set.
% 1.85/2.05 Following clause subsumed byAlarm clock
% 299.88/300.04 Otter interrupted
% 299.88/300.04 PROOF NOT FOUND
%------------------------------------------------------------------------------