%------------------------------------------------------------------------------ % File : Otter---3.3 % Problem : NUM403+1 : TPTP v8.1.0. Released v3.2.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:08:15 EDT 2022 % Result : Timeout 299.87s 300.02s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : NUM403+1 : TPTP v8.1.0. Released v3.2.0. % 0.11/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 10:04:06 EDT 2022 % 0.12/0.33 % CPUTime : % 1.94/2.16 ----- Otter 3.3f, August 2004 ----- % 1.94/2.16 The process was started by sandbox2 on n027.cluster.edu, % 1.94/2.16 Wed Jul 27 10:04:07 2022 % 1.94/2.16 The command was "./otter". The process ID is 10004. % 1.94/2.16 % 1.94/2.16 set(prolog_style_variables). % 1.94/2.16 set(auto). % 1.94/2.16 dependent: set(auto1). % 1.94/2.16 dependent: set(process_input). % 1.94/2.16 dependent: clear(print_kept). % 1.94/2.16 dependent: clear(print_new_demod). % 1.94/2.16 dependent: clear(print_back_demod). % 1.94/2.16 dependent: clear(print_back_sub). % 1.94/2.16 dependent: set(control_memory). % 1.94/2.16 dependent: assign(max_mem, 12000). % 1.94/2.16 dependent: assign(pick_given_ratio, 4). % 1.94/2.16 dependent: assign(stats_level, 1). % 1.94/2.16 dependent: assign(max_seconds, 10800). % 1.94/2.16 clear(print_given). % 1.94/2.16 % 1.94/2.16 formula_list(usable). % 1.94/2.16 all A (A=A). % 1.94/2.16 all A B (in(A,B)-> -in(B,A)). % 1.94/2.16 all A (empty(A)->function(A)). % 1.94/2.16 all A (ordinal(A)->epsilon_transitive(A)&epsilon_connected(A)). % 1.94/2.16 all A (empty(A)->relation(A)). % 1.94/2.16 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)). % 1.94/2.16 all A (epsilon_transitive(A)&epsilon_connected(A)->ordinal(A)). % 1.94/2.16 all A (empty(A)->epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)). % 1.94/2.16 all A B (set_union2(A,B)=set_union2(B,A)). % 1.94/2.16 all A B (ordinal(A)&ordinal(B)->ordinal_subset(A,B)|ordinal_subset(B,A)). % 1.94/2.16 all A (succ(A)=set_union2(A,singleton(A))). % 1.94/2.16 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))). % 1.94/2.16 all A B (B=union(A)<-> (all C (in(C,B)<-> (exists D (in(C,D)&in(D,A)))))). % 1.94/2.16 all A exists B element(B,A). % 1.94/2.16 empty(empty_set). % 1.94/2.16 relation(empty_set). % 1.94/2.16 relation_empty_yielding(empty_set). % 1.94/2.16 all A (-empty(succ(A))). % 1.94/2.16 empty(empty_set). % 1.94/2.16 relation(empty_set). % 1.94/2.16 relation_empty_yielding(empty_set). % 1.94/2.16 function(empty_set). % 1.94/2.16 one_to_one(empty_set). % 1.94/2.16 empty(empty_set). % 1.94/2.16 epsilon_transitive(empty_set). % 1.94/2.16 epsilon_connected(empty_set). % 1.94/2.16 ordinal(empty_set). % 1.94/2.16 all A B (relation(A)&relation(B)->relation(set_union2(A,B))). % 1.94/2.16 all A B (-empty(A)-> -empty(set_union2(A,B))). % 1.94/2.16 all A (ordinal(A)-> -empty(succ(A))&epsilon_transitive(succ(A))&epsilon_connected(succ(A))&ordinal(succ(A))). % 1.94/2.16 all A B (-empty(A)-> -empty(set_union2(B,A))). % 1.94/2.16 all A (ordinal(A)->epsilon_transitive(union(A))&epsilon_connected(union(A))&ordinal(union(A))). % 1.94/2.16 empty(empty_set). % 1.94/2.16 relation(empty_set). % 1.94/2.16 all A B (set_union2(A,A)=A). % 1.94/2.16 exists A (relation(A)&function(A)). % 1.94/2.16 exists A (epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)). % 1.94/2.16 exists A (empty(A)&relation(A)). % 1.94/2.16 exists A empty(A). % 1.94/2.16 exists A (relation(A)&empty(A)&function(A)). % 1.94/2.16 exists A (relation(A)&function(A)&one_to_one(A)&empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)). % 1.94/2.16 exists A (-empty(A)&relation(A)). % 1.94/2.16 exists A (-empty(A)). % 1.94/2.16 exists A (relation(A)&function(A)&one_to_one(A)). % 1.94/2.16 exists A (-empty(A)&epsilon_transitive(A)&epsilon_connected(A)&ordinal(A)). % 1.94/2.16 exists A (relation(A)&relation_empty_yielding(A)). % 1.94/2.16 exists A (relation(A)&relation_empty_yielding(A)&function(A)). % 1.94/2.16 exists A (relation(A)&relation_non_empty(A)&function(A)). % 1.94/2.16 all A B (ordinal(A)&ordinal(B)-> (ordinal_subset(A,B)<->subset(A,B))). % 1.94/2.16 all A B (ordinal(A)&ordinal(B)->ordinal_subset(A,A)). % 1.94/2.16 all A B subset(A,A). % 1.94/2.16 all A (set_union2(A,empty_set)=A). % 1.94/2.16 all A B (in(A,B)->element(A,B)). % 1.94/2.16 all A (ordinal(A)->ordinal(succ(A))). % 1.94/2.16 all A B (element(A,B)->empty(B)|in(A,B)). % 1.94/2.16 all A (ordinal(A)-> (all B (ordinal(B)-> (in(A,succ(B))<->ordinal_subset(A,B))))). % 1.94/2.16 all A ((all B (in(B,A)->ordinal(B)))->ordinal(union(A))). % 1.94/2.16 -(all A (-((all B (in(B,A)->ordinal(B)))& (all B (ordinal(B)-> -subset(A,B)))))). % 1.94/2.16 all A B (element(A,powerset(B))<->subset(A,B)). % 1.94/2.16 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)). % 1.94/2.16 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))). % 1.94/2.16 all A (empty(A)->A=empty_set). % 1.94/2.16 all A B (-(in(A,B)&empty(B))). % 1.94/2.16 all A B (-(empty(A)&A!=B&empty(B))). % 1.94/2.16 end_of_list. % 1.94/2.16 % 1.94/2.16 -------> usable clausifies to: % 1.94/2.16 % 1.94/2.16 list(usable). % 1.94/2.16 0 [] A=A. % 1.94/2.16 0 [] -in(A,B)| -in(B,A). % 1.94/2.16 0 [] -empty(A)|function(A). % 1.94/2.16 0 [] -ordinal(A)|epsilon_transitive(A). % 1.94/2.16 0 [] -ordinal(A)|epsilon_connected(A). % 1.94/2.16 0 [] -empty(A)|relation(A). % 1.94/2.16 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A). % 1.94/2.16 0 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A). % 1.94/2.16 0 [] -empty(A)|epsilon_transitive(A). % 1.94/2.16 0 [] -empty(A)|epsilon_connected(A). % 1.94/2.16 0 [] -empty(A)|ordinal(A). % 1.94/2.16 0 [] set_union2(A,B)=set_union2(B,A). % 1.94/2.16 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)|ordinal_subset(B,A). % 1.94/2.16 0 [] succ(A)=set_union2(A,singleton(A)). % 1.94/2.16 0 [] -subset(A,B)| -in(C,A)|in(C,B). % 1.94/2.16 0 [] subset(A,B)|in($f1(A,B),A). % 1.94/2.16 0 [] subset(A,B)| -in($f1(A,B),B). % 1.94/2.16 0 [] B!=union(A)| -in(C,B)|in(C,$f2(A,B,C)). % 1.94/2.16 0 [] B!=union(A)| -in(C,B)|in($f2(A,B,C),A). % 1.94/2.16 0 [] B!=union(A)|in(C,B)| -in(C,D)| -in(D,A). % 1.94/2.16 0 [] B=union(A)|in($f4(A,B),B)|in($f4(A,B),$f3(A,B)). % 1.94/2.16 0 [] B=union(A)|in($f4(A,B),B)|in($f3(A,B),A). % 1.94/2.16 0 [] B=union(A)| -in($f4(A,B),B)| -in($f4(A,B),X1)| -in(X1,A). % 1.94/2.16 0 [] element($f5(A),A). % 1.94/2.16 0 [] empty(empty_set). % 1.94/2.16 0 [] relation(empty_set). % 1.94/2.16 0 [] relation_empty_yielding(empty_set). % 1.94/2.16 0 [] -empty(succ(A)). % 1.94/2.16 0 [] empty(empty_set). % 1.94/2.16 0 [] relation(empty_set). % 1.94/2.16 0 [] relation_empty_yielding(empty_set). % 1.94/2.16 0 [] function(empty_set). % 1.94/2.16 0 [] one_to_one(empty_set). % 1.94/2.16 0 [] empty(empty_set). % 1.94/2.16 0 [] epsilon_transitive(empty_set). % 1.94/2.16 0 [] epsilon_connected(empty_set). % 1.94/2.16 0 [] ordinal(empty_set). % 1.94/2.16 0 [] -relation(A)| -relation(B)|relation(set_union2(A,B)). % 1.94/2.16 0 [] empty(A)| -empty(set_union2(A,B)). % 1.94/2.16 0 [] -ordinal(A)| -empty(succ(A)). % 1.94/2.16 0 [] -ordinal(A)|epsilon_transitive(succ(A)). % 1.94/2.16 0 [] -ordinal(A)|epsilon_connected(succ(A)). % 1.94/2.16 0 [] -ordinal(A)|ordinal(succ(A)). % 1.94/2.16 0 [] empty(A)| -empty(set_union2(B,A)). % 1.94/2.16 0 [] -ordinal(A)|epsilon_transitive(union(A)). % 1.94/2.16 0 [] -ordinal(A)|epsilon_connected(union(A)). % 1.94/2.16 0 [] -ordinal(A)|ordinal(union(A)). % 1.94/2.16 0 [] empty(empty_set). % 1.94/2.16 0 [] relation(empty_set). % 1.94/2.16 0 [] set_union2(A,A)=A. % 1.94/2.16 0 [] relation($c1). % 1.94/2.16 0 [] function($c1). % 1.94/2.16 0 [] epsilon_transitive($c2). % 1.94/2.16 0 [] epsilon_connected($c2). % 1.94/2.16 0 [] ordinal($c2). % 1.94/2.16 0 [] empty($c3). % 1.94/2.16 0 [] relation($c3). % 1.94/2.16 0 [] empty($c4). % 1.94/2.16 0 [] relation($c5). % 1.94/2.16 0 [] empty($c5). % 1.94/2.16 0 [] function($c5). % 1.94/2.16 0 [] relation($c6). % 1.94/2.16 0 [] function($c6). % 1.94/2.16 0 [] one_to_one($c6). % 1.94/2.16 0 [] empty($c6). % 1.94/2.16 0 [] epsilon_transitive($c6). % 1.94/2.16 0 [] epsilon_connected($c6). % 1.94/2.16 0 [] ordinal($c6). % 1.94/2.16 0 [] -empty($c7). % 1.94/2.16 0 [] relation($c7). % 1.94/2.16 0 [] -empty($c8). % 1.94/2.16 0 [] relation($c9). % 1.94/2.16 0 [] function($c9). % 1.94/2.16 0 [] one_to_one($c9). % 1.94/2.16 0 [] -empty($c10). % 1.94/2.16 0 [] epsilon_transitive($c10). % 1.94/2.16 0 [] epsilon_connected($c10). % 1.94/2.16 0 [] ordinal($c10). % 1.94/2.16 0 [] relation($c11). % 1.94/2.16 0 [] relation_empty_yielding($c11). % 1.94/2.16 0 [] relation($c12). % 1.94/2.16 0 [] relation_empty_yielding($c12). % 1.94/2.16 0 [] function($c12). % 1.94/2.16 0 [] relation($c13). % 1.94/2.16 0 [] relation_non_empty($c13). % 1.94/2.16 0 [] function($c13). % 1.94/2.16 0 [] -ordinal(A)| -ordinal(B)| -ordinal_subset(A,B)|subset(A,B). % 1.94/2.16 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)| -subset(A,B). % 1.94/2.16 0 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,A). % 1.94/2.16 0 [] subset(A,A). % 1.94/2.16 0 [] set_union2(A,empty_set)=A. % 1.94/2.16 0 [] -in(A,B)|element(A,B). % 1.94/2.16 0 [] -ordinal(A)|ordinal(succ(A)). % 1.94/2.16 0 [] -element(A,B)|empty(B)|in(A,B). % 1.94/2.16 0 [] -ordinal(A)| -ordinal(B)| -in(A,succ(B))|ordinal_subset(A,B). % 1.94/2.16 0 [] -ordinal(A)| -ordinal(B)|in(A,succ(B))| -ordinal_subset(A,B). % 1.94/2.16 0 [] in($f6(A),A)|ordinal(union(A)). % 1.94/2.16 0 [] -ordinal($f6(A))|ordinal(union(A)). % 1.94/2.16 0 [] -in(B,$c14)|ordinal(B). % 1.94/2.16 0 [] -ordinal(X2)| -subset($c14,X2). % 1.94/2.16 0 [] -element(A,powerset(B))|subset(A,B). % 1.94/2.16 0 [] element(A,powerset(B))| -subset(A,B). % 1.94/2.16 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C). % 1.94/2.16 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C). % 1.94/2.16 0 [] -empty(A)|A=empty_set. % 1.94/2.16 0 [] -in(A,B)| -empty(B). % 1.94/2.16 0 [] -empty(A)|A=B| -empty(B). % 1.94/2.16 end_of_list. % 1.94/2.16 % 1.94/2.16 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4. % 1.94/2.16 % 1.94/2.16 This ia a non-Horn set with equality. The strategy will be % 1.94/2.16 Knuth-Bendix, ordered hyper_res, factoring, and unit % 1.94/2.16 deletion, with positive clauses in sos and nonpositive % 1.94/2.16 clauses in usable. % 1.94/2.16 % 1.94/2.16 dependent: set(knuth_bendix). % 1.94/2.16 dependent: set(anl_eq). % 1.94/2.16 dependent: set(para_from). % 1.94/2.16 dependent: set(para_into). % 1.94/2.16 dependent: clear(para_from_right). % 1.94/2.16 dependent: clear(para_into_right). % 1.94/2.16 dependent: set(para_from_vars). % 1.94/2.16 dependent: set(eq_units_both_ways). % 1.94/2.16 dependent: set(dynamic_demod_all). % 1.94/2.16 dependent: set(dynamic_demod). % 1.94/2.16 dependent: set(order_eq). % 1.94/2.16 dependent: set(back_demod). % 1.94/2.16 dependent: set(lrpo). % 1.94/2.16 dependent: set(hyper_res). % 1.94/2.16 dependent: set(unit_deletion). % 1.94/2.16 dependent: set(factor). % 1.94/2.16 % 1.94/2.16 ------------> process usable: % 1.94/2.16 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A). % 1.94/2.16 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A). % 1.94/2.16 ** KEPT (pick-wt=4): 3 [] -ordinal(A)|epsilon_transitive(A). % 1.94/2.16 ** KEPT (pick-wt=4): 4 [] -ordinal(A)|epsilon_connected(A). % 1.94/2.16 ** KEPT (pick-wt=4): 5 [] -empty(A)|relation(A). % 1.94/2.16 ** KEPT (pick-wt=8): 6 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A). % 1.94/2.16 ** KEPT (pick-wt=6): 7 [] -epsilon_transitive(A)| -epsilon_connected(A)|ordinal(A). % 1.94/2.16 ** KEPT (pick-wt=4): 8 [] -empty(A)|epsilon_transitive(A). % 1.94/2.16 ** KEPT (pick-wt=4): 9 [] -empty(A)|epsilon_connected(A). % 1.94/2.16 ** KEPT (pick-wt=4): 10 [] -empty(A)|ordinal(A). % 1.94/2.16 ** KEPT (pick-wt=10): 11 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)|ordinal_subset(B,A). % 1.94/2.16 ** KEPT (pick-wt=9): 12 [] -subset(A,B)| -in(C,A)|in(C,B). % 1.94/2.16 ** KEPT (pick-wt=8): 13 [] subset(A,B)| -in($f1(A,B),B). % 1.94/2.16 ** KEPT (pick-wt=13): 14 [] A!=union(B)| -in(C,A)|in(C,$f2(B,A,C)). % 1.94/2.16 ** KEPT (pick-wt=13): 15 [] A!=union(B)| -in(C,A)|in($f2(B,A,C),B). % 1.94/2.16 ** KEPT (pick-wt=13): 16 [] A!=union(B)|in(C,A)| -in(C,D)| -in(D,B). % 1.94/2.16 ** KEPT (pick-wt=17): 17 [] A=union(B)| -in($f4(B,A),A)| -in($f4(B,A),C)| -in(C,B). % 1.94/2.16 ** KEPT (pick-wt=3): 18 [] -empty(succ(A)). % 1.94/2.16 ** KEPT (pick-wt=8): 19 [] -relation(A)| -relation(B)|relation(set_union2(A,B)). % 1.94/2.16 ** KEPT (pick-wt=6): 20 [] empty(A)| -empty(set_union2(A,B)). % 1.94/2.16 Following clause subsumed by 18 during input processing: 0 [] -ordinal(A)| -empty(succ(A)). % 1.94/2.16 ** KEPT (pick-wt=5): 21 [] -ordinal(A)|epsilon_transitive(succ(A)). % 1.94/2.16 ** KEPT (pick-wt=5): 22 [] -ordinal(A)|epsilon_connected(succ(A)). % 1.94/2.16 ** KEPT (pick-wt=5): 23 [] -ordinal(A)|ordinal(succ(A)). % 1.94/2.16 ** KEPT (pick-wt=6): 24 [] empty(A)| -empty(set_union2(B,A)). % 1.94/2.16 ** KEPT (pick-wt=5): 25 [] -ordinal(A)|epsilon_transitive(union(A)). % 1.94/2.16 ** KEPT (pick-wt=5): 26 [] -ordinal(A)|epsilon_connected(union(A)). % 1.94/2.16 ** KEPT (pick-wt=5): 27 [] -ordinal(A)|ordinal(union(A)). % 1.94/2.16 ** KEPT (pick-wt=2): 28 [] -empty($c7). % 1.94/2.16 ** KEPT (pick-wt=2): 29 [] -empty($c8). % 1.94/2.16 ** KEPT (pick-wt=2): 30 [] -empty($c10). % 1.94/2.16 ** KEPT (pick-wt=10): 31 [] -ordinal(A)| -ordinal(B)| -ordinal_subset(A,B)|subset(A,B). % 1.94/2.16 ** KEPT (pick-wt=10): 32 [] -ordinal(A)| -ordinal(B)|ordinal_subset(A,B)| -subset(A,B). % 1.94/2.16 ** KEPT (pick-wt=5): 34 [copy,33,factor_simp] -ordinal(A)|ordinal_subset(A,A). % 1.94/2.16 ** KEPT (pick-wt=6): 35 [] -in(A,B)|element(A,B). % 1.94/2.16 Following clause subsumed by 23 during input processing: 0 [] -ordinal(A)|ordinal(succ(A)). % 1.94/2.16 ** KEPT (pick-wt=8): 36 [] -element(A,B)|empty(B)|in(A,B). % 1.94/2.16 ** KEPT (pick-wt=11): 37 [] -ordinal(A)| -ordinal(B)| -in(A,succ(B))|ordinal_subset(A,B). % 1.94/2.16 ** KEPT (pick-wt=11): 38 [] -ordinal(A)| -ordinal(B)|in(A,succ(B))| -ordinal_subset(A,B). % 1.94/2.16 ** KEPT (pick-wt=6): 39 [] -ordinal($f6(A))|ordinal(union(A)). % 1.94/2.16 ** KEPT (pick-wt=5): 40 [] -in(A,$c14)|ordinal(A). % 1.94/2.16 ** KEPT (pick-wt=5): 41 [] -ordinal(A)| -subset($c14,A). % 1.94/2.16 ** KEPT (pick-wt=7): 42 [] -element(A,powerset(B))|subset(A,B). % 1.94/2.16 ** KEPT (pick-wt=7): 43 [] element(A,powerset(B))| -subset(A,B). % 1.94/2.16 ** KEPT (pick-wt=10): 44 [] -in(A,B)| -element(B,powerset(C))|element(A,C). % 1.94/2.16 ** KEPT (pick-wt=9): 45 [] -in(A,B)| -element(B,powerset(C))| -empty(C). % 1.94/2.16 ** KEPT (pick-wt=5): 46 [] -empty(A)|A=empty_set. % 1.94/2.16 ** KEPT (pick-wt=5): 47 [] -in(A,B)| -empty(B). % 1.94/2.16 ** KEPT (pick-wt=7): 48 [] -empty(A)|A=B| -empty(B). % 1.94/2.16 % 1.94/2.16 ------------> process sos: % 1.94/2.16 ** KEPT (pick-wt=3): 55 [] A=A. % 1.94/2.16 ** KEPT (pick-wt=7): 56 [] set_union2(A,B)=set_union2(B,A). % 1.94/2.16 ** KEPT (pick-wt=7): 57 [] succ(A)=set_union2(A,singleton(A)). % 1.94/2.16 ---> New Demodulator: 58 [new_demod,57] succ(A)=set_union2(A,singleton(A)). % 1.94/2.16 ** KEPT (pick-wt=8): 59 [] subset(A,B)|in($f1(A,B),A). % 1.94/2.16 ** KEPT (pick-wt=16): 60 [] A=union(B)|in($f4(B,A),A)|in($f4(B,A),$f3(B,A)). % 1.94/2.16 ** KEPT (pick-wt=14): 61 [] A=union(B)|in($f4(B,A),A)|in($f3(B,A),B). % 1.94/2.16 ** KEPT (pick-wt=4): 62 [] element($f5(A),A). % 1.94/2.16 ** KEPT (pick-wt=2): 63 [] empty(empty_set). % 1.94/2.16 ** KEPT (pick-wt=2): 64 [] relation(empty_set). % 1.94/2.16 ** KEPT (pick-wt=2): 65 [] relation_empty_yielding(empty_set). % 1.94/2.16 Following clause subsumed by 63 during input processing: 0 [] empty(empty_set). % 1.94/2.16 Following clause subsumed by 64 during input processing: 0 [] relation(empty_set). % 1.94/2.16 Following clause subsumed by 65 during input processing: 0 [] relation_empty_yielding(empty_set). % 1.94/2.16 ** KEPT (pick-wt=2): 66 [] function(empty_set). % 1.94/2.16 ** KEPT (pick-wt=2): 67 [] one_to_one(empty_set). % 1.94/2.16 Following clause subsumed by 63 during input processing: 0 [] empty(empty_set). % 1.94/2.16 ** KEPT (pick-wt=2): Alarm clock % 299.87/300.02 Otter interrupted % 299.87/300.03 PROOF NOT FOUND %------------------------------------------------------------------------------