TSTP Solution File: SET990+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET990+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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:38 EDT 2022
% Result : Timeout 299.89s 300.05s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET990+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n015.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 10:50:27 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.11/2.31 ----- Otter 3.3f, August 2004 -----
% 2.11/2.31 The process was started by sandbox2 on n015.cluster.edu,
% 2.11/2.31 Wed Jul 27 10:50:27 2022
% 2.11/2.31 The command was "./otter". The process ID is 22717.
% 2.11/2.31
% 2.11/2.31 set(prolog_style_variables).
% 2.11/2.31 set(auto).
% 2.11/2.31 dependent: set(auto1).
% 2.11/2.31 dependent: set(process_input).
% 2.11/2.31 dependent: clear(print_kept).
% 2.11/2.31 dependent: clear(print_new_demod).
% 2.11/2.31 dependent: clear(print_back_demod).
% 2.11/2.31 dependent: clear(print_back_sub).
% 2.11/2.31 dependent: set(control_memory).
% 2.11/2.31 dependent: assign(max_mem, 12000).
% 2.11/2.31 dependent: assign(pick_given_ratio, 4).
% 2.11/2.31 dependent: assign(stats_level, 1).
% 2.11/2.31 dependent: assign(max_seconds, 10800).
% 2.11/2.31 clear(print_given).
% 2.11/2.31
% 2.11/2.31 formula_list(usable).
% 2.11/2.31 all A (A=A).
% 2.11/2.31 all A B (in(A,B)-> -in(B,A)).
% 2.11/2.31 all A (empty(A)->function(A)).
% 2.11/2.31 all A (empty(A)->relation(A)).
% 2.11/2.31 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.11/2.31 all A (relation(A)<-> (all B (-(in(B,A)& (all C D (B!=ordered_pair(C,D))))))).
% 2.11/2.31 all A (relation(A)&function(A)-> (all B C ((in(B,relation_dom(A))-> (C=apply(A,B)<->in(ordered_pair(B,C),A)))& (-in(B,relation_dom(A))-> (C=apply(A,B)<->C=empty_set))))).
% 2.11/2.31 all A (relation(A)-> (all B (B=relation_dom(A)<-> (all C (in(C,B)<-> (exists D in(ordered_pair(C,D),A))))))).
% 2.11/2.31 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.11/2.31 all A exists B element(B,A).
% 2.11/2.31 empty(empty_set).
% 2.11/2.31 relation(empty_set).
% 2.11/2.31 relation_empty_yielding(empty_set).
% 2.11/2.31 all A (-empty(powerset(A))).
% 2.11/2.31 empty(empty_set).
% 2.11/2.31 all A B (-empty(ordered_pair(A,B))).
% 2.11/2.31 all A (-empty(singleton(A))).
% 2.11/2.31 all A B (-empty(unordered_pair(A,B))).
% 2.11/2.31 empty(empty_set).
% 2.11/2.31 relation(empty_set).
% 2.11/2.31 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 2.11/2.31 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 2.11/2.31 exists A (relation(A)&function(A)).
% 2.11/2.31 exists A (empty(A)&relation(A)).
% 2.11/2.31 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.11/2.31 exists A empty(A).
% 2.11/2.31 exists A (-empty(A)&relation(A)).
% 2.11/2.31 all A exists B (element(B,powerset(A))&empty(B)).
% 2.11/2.31 exists A (-empty(A)).
% 2.11/2.31 exists A (relation(A)&relation_empty_yielding(A)).
% 2.11/2.31 all A B subset(A,A).
% 2.11/2.31 all A B ((all C (-(in(C,A)& (all D E (C!=ordered_pair(D,E))))))& (all C (-(in(C,B)& (all D E (C!=ordered_pair(D,E))))))& (all C D (in(ordered_pair(C,D),A)<->in(ordered_pair(C,D),B)))->A=B).
% 2.11/2.31 all A B (in(A,B)->element(A,B)).
% 2.11/2.31 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.11/2.31 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.11/2.31 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.11/2.31 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.11/2.31 all A (empty(A)->A=empty_set).
% 2.11/2.31 all A B (-(in(A,B)&empty(B))).
% 2.11/2.31 all A B (-(empty(A)&A!=B&empty(B))).
% 2.11/2.31 -(all A (relation(A)&function(A)-> (all B (relation(B)&function(B)-> (relation_dom(A)=relation_dom(B)& (all C (in(C,relation_dom(A))->apply(A,C)=apply(B,C)))->A=B))))).
% 2.11/2.31 end_of_list.
% 2.11/2.31
% 2.11/2.31 -------> usable clausifies to:
% 2.11/2.31
% 2.11/2.31 list(usable).
% 2.11/2.31 0 [] A=A.
% 2.11/2.31 0 [] -in(A,B)| -in(B,A).
% 2.11/2.31 0 [] -empty(A)|function(A).
% 2.11/2.31 0 [] -empty(A)|relation(A).
% 2.11/2.31 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.11/2.31 0 [] -relation(A)| -in(B,A)|B=ordered_pair($f2(A,B),$f1(A,B)).
% 2.11/2.31 0 [] relation(A)|in($f3(A),A).
% 2.11/2.31 0 [] relation(A)|$f3(A)!=ordered_pair(C,D).
% 2.11/2.31 0 [] -relation(A)| -function(A)| -in(B,relation_dom(A))|C!=apply(A,B)|in(ordered_pair(B,C),A).
% 2.11/2.31 0 [] -relation(A)| -function(A)| -in(B,relation_dom(A))|C=apply(A,B)| -in(ordered_pair(B,C),A).
% 2.11/2.31 0 [] -relation(A)| -function(A)|in(B,relation_dom(A))|C!=apply(A,B)|C=empty_set.
% 2.11/2.31 0 [] -relation(A)| -function(A)|in(B,relation_dom(A))|C=apply(A,B)|C!=empty_set.
% 2.11/2.31 0 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f4(A,B,C)),A).
% 2.11/2.31 0 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 2.11/2.31 0 [] -relation(A)|B=relation_dom(A)|in($f6(A,B),B)|in(ordered_pair($f6(A,B),$f5(A,B)),A).
% 2.11/2.31 0 [] -relation(A)|B=relation_dom(A)| -in($f6(A,B),B)| -in(ordered_pair($f6(A,B),X1),A).
% 2.11/2.31 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.11/2.31 0 [] element($f7(A),A).
% 2.11/2.31 0 [] empty(empty_set).
% 2.11/2.31 0 [] relation(empty_set).
% 2.11/2.31 0 [] relation_empty_yielding(empty_set).
% 2.11/2.31 0 [] -empty(powerset(A)).
% 2.11/2.31 0 [] empty(empty_set).
% 2.11/2.31 0 [] -empty(ordered_pair(A,B)).
% 2.11/2.31 0 [] -empty(singleton(A)).
% 2.11/2.31 0 [] -empty(unordered_pair(A,B)).
% 2.11/2.31 0 [] empty(empty_set).
% 2.11/2.31 0 [] relation(empty_set).
% 2.11/2.31 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.11/2.31 0 [] -empty(A)|empty(relation_dom(A)).
% 2.11/2.31 0 [] -empty(A)|relation(relation_dom(A)).
% 2.11/2.31 0 [] relation($c1).
% 2.11/2.31 0 [] function($c1).
% 2.11/2.31 0 [] empty($c2).
% 2.11/2.31 0 [] relation($c2).
% 2.11/2.31 0 [] empty(A)|element($f8(A),powerset(A)).
% 2.11/2.31 0 [] empty(A)| -empty($f8(A)).
% 2.11/2.31 0 [] empty($c3).
% 2.11/2.31 0 [] -empty($c4).
% 2.11/2.31 0 [] relation($c4).
% 2.11/2.31 0 [] element($f9(A),powerset(A)).
% 2.11/2.31 0 [] empty($f9(A)).
% 2.11/2.31 0 [] -empty($c5).
% 2.11/2.31 0 [] relation($c6).
% 2.11/2.31 0 [] relation_empty_yielding($c6).
% 2.11/2.31 0 [] subset(A,A).
% 2.11/2.31 0 [] in($f10(A,B),A)|in($f11(A,B),B)|in(ordered_pair($f13(A,B),$f12(A,B)),A)|in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 0 [] in($f10(A,B),A)|in($f11(A,B),B)| -in(ordered_pair($f13(A,B),$f12(A,B)),A)| -in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 0 [] in($f10(A,B),A)|$f11(A,B)!=ordered_pair(X2,X3)|in(ordered_pair($f13(A,B),$f12(A,B)),A)|in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 0 [] in($f10(A,B),A)|$f11(A,B)!=ordered_pair(X2,X3)| -in(ordered_pair($f13(A,B),$f12(A,B)),A)| -in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 0 [] $f10(A,B)!=ordered_pair(D,E)|in($f11(A,B),B)|in(ordered_pair($f13(A,B),$f12(A,B)),A)|in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 0 [] $f10(A,B)!=ordered_pair(D,E)|in($f11(A,B),B)| -in(ordered_pair($f13(A,B),$f12(A,B)),A)| -in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 0 [] $f10(A,B)!=ordered_pair(D,E)|$f11(A,B)!=ordered_pair(X2,X3)|in(ordered_pair($f13(A,B),$f12(A,B)),A)|in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 0 [] $f10(A,B)!=ordered_pair(D,E)|$f11(A,B)!=ordered_pair(X2,X3)| -in(ordered_pair($f13(A,B),$f12(A,B)),A)| -in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 0 [] -in(A,B)|element(A,B).
% 2.11/2.31 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.11/2.31 0 [] -element(A,powerset(B))|subset(A,B).
% 2.11/2.31 0 [] element(A,powerset(B))| -subset(A,B).
% 2.11/2.31 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.11/2.31 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.11/2.31 0 [] -empty(A)|A=empty_set.
% 2.11/2.31 0 [] -in(A,B)| -empty(B).
% 2.11/2.31 0 [] -empty(A)|A=B| -empty(B).
% 2.11/2.31 0 [] relation($c8).
% 2.11/2.31 0 [] function($c8).
% 2.11/2.31 0 [] relation($c7).
% 2.11/2.31 0 [] function($c7).
% 2.11/2.31 0 [] relation_dom($c8)=relation_dom($c7).
% 2.11/2.31 0 [] -in(C,relation_dom($c8))|apply($c8,C)=apply($c7,C).
% 2.11/2.31 0 [] $c8!=$c7.
% 2.11/2.31 end_of_list.
% 2.11/2.31
% 2.11/2.31 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 2.11/2.31
% 2.11/2.31 This ia a non-Horn set with equality. The strategy will be
% 2.11/2.31 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.11/2.31 deletion, with positive clauses in sos and nonpositive
% 2.11/2.31 clauses in usable.
% 2.11/2.31
% 2.11/2.31 dependent: set(knuth_bendix).
% 2.11/2.31 dependent: set(anl_eq).
% 2.11/2.31 dependent: set(para_from).
% 2.11/2.31 dependent: set(para_into).
% 2.11/2.31 dependent: clear(para_from_right).
% 2.11/2.31 dependent: clear(para_into_right).
% 2.11/2.31 dependent: set(para_from_vars).
% 2.11/2.31 dependent: set(eq_units_both_ways).
% 2.11/2.31 dependent: set(dynamic_demod_all).
% 2.11/2.31 dependent: set(dynamic_demod).
% 2.11/2.31 dependent: set(order_eq).
% 2.11/2.31 dependent: set(back_demod).
% 2.11/2.31 dependent: set(lrpo).
% 2.11/2.31 dependent: set(hyper_res).
% 2.11/2.31 dependent: set(unit_deletion).
% 2.11/2.31 dependent: set(factor).
% 2.11/2.31
% 2.11/2.31 ------------> process usable:
% 2.11/2.31 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.11/2.31 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.11/2.31 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 2.11/2.31 ** KEPT (pick-wt=14): 5 [copy,4,flip.3] -relation(A)| -in(B,A)|ordered_pair($f2(A,B),$f1(A,B))=B.
% 2.11/2.31 ** KEPT (pick-wt=8): 6 [] relation(A)|$f3(A)!=ordered_pair(B,C).
% 2.11/2.31 ** KEPT (pick-wt=18): 7 [] -relation(A)| -function(A)| -in(B,relation_dom(A))|C!=apply(A,B)|in(ordered_pair(B,C),A).
% 2.11/2.31 ** KEPT (pick-wt=18): 8 [] -relation(A)| -function(A)| -in(B,relation_dom(A))|C=apply(A,B)| -in(ordered_pair(B,C),A).
% 2.11/2.31 ** KEPT (pick-wt=16): 9 [] -relation(A)| -function(A)|in(B,relation_dom(A))|C!=apply(A,B)|C=empty_set.
% 2.11/2.31 ** KEPT (pick-wt=16): 10 [] -relation(A)| -function(A)|in(B,relation_dom(A))|C=apply(A,B)|C!=empty_set.
% 2.11/2.31 ** KEPT (pick-wt=17): 11 [] -relation(A)|B!=relation_dom(A)| -in(C,B)|in(ordered_pair(C,$f4(A,B,C)),A).
% 2.11/2.31 ** KEPT (pick-wt=14): 12 [] -relation(A)|B!=relation_dom(A)|in(C,B)| -in(ordered_pair(C,D),A).
% 2.11/2.31 ** KEPT (pick-wt=20): 13 [] -relation(A)|B=relation_dom(A)|in($f6(A,B),B)|in(ordered_pair($f6(A,B),$f5(A,B)),A).
% 2.11/2.31 ** KEPT (pick-wt=18): 14 [] -relation(A)|B=relation_dom(A)| -in($f6(A,B),B)| -in(ordered_pair($f6(A,B),C),A).
% 2.11/2.31 ** KEPT (pick-wt=3): 15 [] -empty(powerset(A)).
% 2.11/2.31 ** KEPT (pick-wt=4): 16 [] -empty(ordered_pair(A,B)).
% 2.11/2.31 ** KEPT (pick-wt=3): 17 [] -empty(singleton(A)).
% 2.11/2.31 ** KEPT (pick-wt=4): 18 [] -empty(unordered_pair(A,B)).
% 2.11/2.31 ** KEPT (pick-wt=7): 19 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.11/2.31 ** KEPT (pick-wt=5): 20 [] -empty(A)|empty(relation_dom(A)).
% 2.11/2.31 ** KEPT (pick-wt=5): 21 [] -empty(A)|relation(relation_dom(A)).
% 2.11/2.31 ** KEPT (pick-wt=5): 22 [] empty(A)| -empty($f8(A)).
% 2.11/2.31 ** KEPT (pick-wt=2): 23 [] -empty($c4).
% 2.11/2.31 ** KEPT (pick-wt=2): 24 [] -empty($c5).
% 2.11/2.31 ** KEPT (pick-wt=31): 25 [] in($f10(A,B),A)|in($f11(A,B),B)| -in(ordered_pair($f13(A,B),$f12(A,B)),A)| -in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 ** KEPT (pick-wt=33): 26 [] in($f10(A,B),A)|$f11(A,B)!=ordered_pair(C,D)|in(ordered_pair($f13(A,B),$f12(A,B)),A)|in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 ** KEPT (pick-wt=33): 27 [] in($f10(A,B),A)|$f11(A,B)!=ordered_pair(C,D)| -in(ordered_pair($f13(A,B),$f12(A,B)),A)| -in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 ** KEPT (pick-wt=33): 28 [] $f10(A,B)!=ordered_pair(C,D)|in($f11(A,B),B)|in(ordered_pair($f13(A,B),$f12(A,B)),A)|in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 ** KEPT (pick-wt=33): 29 [] $f10(A,B)!=ordered_pair(C,D)|in($f11(A,B),B)| -in(ordered_pair($f13(A,B),$f12(A,B)),A)| -in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 ** KEPT (pick-wt=35): 30 [] $f10(A,B)!=ordered_pair(C,D)|$f11(A,B)!=ordered_pair(E,F)|in(ordered_pair($f13(A,B),$f12(A,B)),A)|in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 ** KEPT (pick-wt=35): 31 [] $f10(A,B)!=ordered_pair(C,D)|$f11(A,B)!=ordered_pair(E,F)| -in(ordered_pair($f13(A,B),$f12(A,B)),A)| -in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 ** KEPT (pick-wt=6): 32 [] -in(A,B)|element(A,B).
% 2.11/2.31 ** KEPT (pick-wt=8): 33 [] -element(A,B)|empty(B)|in(A,B).
% 2.11/2.31 ** KEPT (pick-wt=7): 34 [] -element(A,powerset(B))|subset(A,B).
% 2.11/2.31 ** KEPT (pick-wt=7): 35 [] element(A,powerset(B))| -subset(A,B).
% 2.11/2.31 ** KEPT (pick-wt=10): 36 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.11/2.31 ** KEPT (pick-wt=9): 37 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.11/2.31 ** KEPT (pick-wt=5): 38 [] -empty(A)|A=empty_set.
% 2.11/2.31 ** KEPT (pick-wt=5): 39 [] -in(A,B)| -empty(B).
% 2.11/2.31 ** KEPT (pick-wt=7): 40 [] -empty(A)|A=B| -empty(B).
% 2.11/2.31 ** KEPT (pick-wt=11): 41 [] -in(A,relation_dom($c8))|apply($c8,A)=apply($c7,A).
% 2.11/2.31 ** KEPT (pick-wt=3): 42 [] $c8!=$c7.
% 2.11/2.31
% 2.11/2.31 ------------> process sos:
% 2.11/2.31 ** KEPT (pick-wt=3): 52 [] A=A.
% 2.11/2.31 ** KEPT (pick-wt=7): 53 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.11/2.31 ** KEPT (pick-wt=6): 54 [] relation(A)|in($f3(A),A).
% 2.11/2.31 ** KEPT (pick-wt=10): 56 [copy,55,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.11/2.31 ---> New Demodulator: 57 [new_demod,56] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.11/2.31 ** KEPT (pick-wt=4): 58 [] element($f7(A),A).
% 2.11/2.31 ** KEPT (pick-wt=2): 59 [] empty(empty_set).
% 2.11/2.31 ** KEPT (pick-wt=2): 60 [] relation(empty_set).
% 2.11/2.31 ** KEPT (pick-wt=2): 61 [] relation_empty_yielding(empty_set).
% 2.11/2.31 Following clause subsumed by 59 during input processing: 0 [] empty(empty_set).
% 2.11/2.31 Following clause subsumed by 59 during input processing: 0 [] empty(empty_set).
% 2.11/2.31 Following clause subsumed by 60 during input processing: 0 [] relation(empty_set).
% 2.11/2.31 ** KEPT (pick-wt=2): 62 [] relation($c1).
% 2.11/2.31 ** KEPT (pick-wt=2): 63 [] function($c1).
% 2.11/2.31 ** KEPT (pick-wt=2): 64 [] empty($c2).
% 2.11/2.31 ** KEPT (pick-wt=2): 65 [] relation($c2).
% 2.11/2.31 ** KEPT (pick-wt=7): 66 [] empty(A)|element($f8(A),powerset(A)).
% 2.11/2.31 ** KEPT (pick-wt=2): 67 [] empty($c3).
% 2.11/2.31 ** KEPT (pick-wt=2): 68 [] relation($c4).
% 2.11/2.31 ** KEPT (pick-wt=5): 69 [] element($f9(A),powerset(A)).
% 2.11/2.31 ** KEPT (pick-wt=3): 70 [] empty($f9(A)).
% 2.11/2.31 ** KEPT (pick-wt=2): 71 [] relation($c6).
% 2.11/2.31 ** KEPT (pick-wt=2): 72 [] relation_empty_yielding($c6).
% 2.11/2.31 ** KEPT (pick-wt=3): 73 [] subset(A,A).
% 2.11/2.31 ** KEPT (pick-wt=31): 74 [] in($f10(A,B),A)|in($f11(A,B),B)|in(ordered_pair($f13(A,B),$f12(A,B)),A)|in(ordered_pair($f13(A,B),$f12(A,B)),B)|A=B.
% 2.11/2.31 ** KEPT (pick-wt=2): 75 [] relation($c8).
% 2.11/2.31 ** KEPT (pick-wt=2): 76 [] function($c8).
% 2.11/2.31 ** KEPT (pick-wt=2): 77 [] relation($c7).
% 2.11/2.31 ** KEPT (pick-wt=2): 78 [] function($c7).
% 2.11/2.31 ** KEPT (pick-wt=5): 79 [] relation_dAlarm clock
% 299.89/300.05 Otter interrupted
% 299.89/300.05 PROOF NOT FOUND
%------------------------------------------------------------------------------