TSTP Solution File: SEU383+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU383+1 : TPTP v8.1.0. Released v3.3.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:16:00 EDT 2022
% Result : Timeout 299.87s 300.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : SEU383+1 : TPTP v8.1.0. Released v3.3.0.
% 0.09/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 08:10:27 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.12/2.30 ----- Otter 3.3f, August 2004 -----
% 2.12/2.30 The process was started by sandbox2 on n015.cluster.edu,
% 2.12/2.30 Wed Jul 27 08:10:27 2022
% 2.12/2.30 The command was "./otter". The process ID is 19575.
% 2.12/2.30
% 2.12/2.30 set(prolog_style_variables).
% 2.12/2.30 set(auto).
% 2.12/2.30 dependent: set(auto1).
% 2.12/2.30 dependent: set(process_input).
% 2.12/2.30 dependent: clear(print_kept).
% 2.12/2.30 dependent: clear(print_new_demod).
% 2.12/2.30 dependent: clear(print_back_demod).
% 2.12/2.30 dependent: clear(print_back_sub).
% 2.12/2.30 dependent: set(control_memory).
% 2.12/2.30 dependent: assign(max_mem, 12000).
% 2.12/2.30 dependent: assign(pick_given_ratio, 4).
% 2.12/2.30 dependent: assign(stats_level, 1).
% 2.12/2.30 dependent: assign(max_seconds, 10800).
% 2.12/2.30 clear(print_given).
% 2.12/2.30
% 2.12/2.30 formula_list(usable).
% 2.12/2.30 all A (A=A).
% 2.12/2.30 all A B (in(A,B)-> -in(B,A)).
% 2.12/2.30 all A (empty(A)->finite(A)).
% 2.12/2.30 all A (rel_str(A)-> (empty_carrier(A)->v1_yellow_3(A))).
% 2.12/2.30 all A (finite(A)-> (all B (element(B,powerset(A))->finite(B)))).
% 2.12/2.30 all A (rel_str(A)-> (-v1_yellow_3(A)-> -empty_carrier(A))).
% 2.12/2.30 all A (rel_str(A)-> (-empty_carrier(A)&reflexive_relstr(A)-> -empty_carrier(A)& -v1_yellow_3(A))).
% 2.12/2.30 all A (rel_str(A)->bottom_of_relstr(A)=join_on_relstr(A,empty_set)).
% 2.12/2.30 all A (rel_str(A)-> (all B (element(B,powerset(the_carrier(A)))-> (upper_relstr_subset(B,A)<-> (all C (element(C,the_carrier(A))-> (all D (element(D,the_carrier(A))-> (in(C,B)&related(A,C,D)->in(D,B)))))))))).
% 2.12/2.30 $T.
% 2.12/2.30 all A B (rel_str(A)->element(join_on_relstr(A,B),the_carrier(A))).
% 2.12/2.30 $T.
% 2.12/2.30 all A (rel_str(A)->element(bottom_of_relstr(A),the_carrier(A))).
% 2.12/2.30 all A (rel_str(A)->one_sorted_str(A)).
% 2.12/2.30 $T.
% 2.12/2.30 $T.
% 2.12/2.30 $T.
% 2.12/2.30 exists A rel_str(A).
% 2.12/2.30 exists A one_sorted_str(A).
% 2.12/2.30 all A exists B element(B,A).
% 2.12/2.30 all A (-empty_carrier(A)&one_sorted_str(A)-> -empty(the_carrier(A))).
% 2.12/2.30 all A (-empty(powerset(A))).
% 2.12/2.30 empty(empty_set).
% 2.12/2.30 all A (-empty_carrier(A)&reflexive_relstr(A)&transitive_relstr(A)&rel_str(A)-> (exists B (element(B,powerset(the_carrier(A)))& -empty(B)&filtered_subset(B,A)&upper_relstr_subset(B,A)))).
% 2.12/2.30 exists A (-empty(A)&finite(A)).
% 2.12/2.30 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.12/2.30 exists A empty(A).
% 2.12/2.30 all A exists B (element(B,powerset(A))&empty(B)).
% 2.12/2.30 exists A (-empty(A)).
% 2.12/2.31 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 2.12/2.31 exists A (one_sorted_str(A)& -empty_carrier(A)).
% 2.12/2.31 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)&finite(B)))).
% 2.12/2.31 all A (-empty_carrier(A)&one_sorted_str(A)-> (exists B (element(B,powerset(the_carrier(A)))& -empty(B)))).
% 2.12/2.31 all A B subset(A,A).
% 2.12/2.31 all A B (in(A,B)->element(A,B)).
% 2.12/2.31 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.12/2.31 all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 2.12/2.31 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.12/2.31 all A (-empty_carrier(A)&antisymmetric_relstr(A)&lower_bounded_relstr(A)&rel_str(A)-> (all B (element(B,the_carrier(A))->related(A,bottom_of_relstr(A),B)))).
% 2.12/2.31 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.12/2.31 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.12/2.31 all A B (element(B,powerset(A))-> (proper_element(B,powerset(A))<->B!=A)).
% 2.12/2.31 all A (empty(A)->A=empty_set).
% 2.12/2.31 all A B (-(in(A,B)&empty(B))).
% 2.12/2.31 all A B (-(empty(A)&A!=B&empty(B))).
% 2.12/2.31 -(all A (-empty_carrier(A)&reflexive_relstr(A)&transitive_relstr(A)&antisymmetric_relstr(A)&lower_bounded_relstr(A)&rel_str(A)-> (all B (-empty(B)&filtered_subset(B,A)&upper_relstr_subset(B,A)&element(B,powerset(the_carrier(A)))-> (proper_element(B,powerset(the_carrier(A)))<-> -in(bottom_of_relstr(A),B)))))).
% 2.12/2.31 end_of_list.
% 2.12/2.31
% 2.12/2.31 -------> usable clausifies to:
% 2.12/2.31
% 2.12/2.31 list(usable).
% 2.12/2.31 0 [] A=A.
% 2.12/2.31 0 [] -in(A,B)| -in(B,A).
% 2.12/2.31 0 [] -empty(A)|finite(A).
% 2.12/2.31 0 [] -rel_str(A)| -empty_carrier(A)|v1_yellow_3(A).
% 2.12/2.31 0 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 2.12/2.31 0 [] -rel_str(A)|v1_yellow_3(A)| -empty_carrier(A).
% 2.12/2.31 0 [] -rel_str(A)|empty_carrier(A)| -reflexive_relstr(A)| -v1_yellow_3(A).
% 2.12/2.31 0 [] -rel_str(A)|bottom_of_relstr(A)=join_on_relstr(A,empty_set).
% 2.12/2.31 0 [] -rel_str(A)| -element(B,powerset(the_carrier(A)))| -upper_relstr_subset(B,A)| -element(C,the_carrier(A))| -element(D,the_carrier(A))| -in(C,B)| -related(A,C,D)|in(D,B).
% 2.12/2.31 0 [] -rel_str(A)| -element(B,powerset(the_carrier(A)))|upper_relstr_subset(B,A)|element($f2(A,B),the_carrier(A)).
% 2.12/2.31 0 [] -rel_str(A)| -element(B,powerset(the_carrier(A)))|upper_relstr_subset(B,A)|element($f1(A,B),the_carrier(A)).
% 2.12/2.31 0 [] -rel_str(A)| -element(B,powerset(the_carrier(A)))|upper_relstr_subset(B,A)|in($f2(A,B),B).
% 2.12/2.31 0 [] -rel_str(A)| -element(B,powerset(the_carrier(A)))|upper_relstr_subset(B,A)|related(A,$f2(A,B),$f1(A,B)).
% 2.12/2.31 0 [] -rel_str(A)| -element(B,powerset(the_carrier(A)))|upper_relstr_subset(B,A)| -in($f1(A,B),B).
% 2.12/2.31 0 [] $T.
% 2.12/2.31 0 [] -rel_str(A)|element(join_on_relstr(A,B),the_carrier(A)).
% 2.12/2.31 0 [] $T.
% 2.12/2.31 0 [] -rel_str(A)|element(bottom_of_relstr(A),the_carrier(A)).
% 2.12/2.31 0 [] -rel_str(A)|one_sorted_str(A).
% 2.12/2.31 0 [] $T.
% 2.12/2.31 0 [] $T.
% 2.12/2.31 0 [] $T.
% 2.12/2.31 0 [] rel_str($c1).
% 2.12/2.31 0 [] one_sorted_str($c2).
% 2.12/2.31 0 [] element($f3(A),A).
% 2.12/2.31 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 2.12/2.31 0 [] -empty(powerset(A)).
% 2.12/2.31 0 [] empty(empty_set).
% 2.12/2.31 0 [] empty_carrier(A)| -reflexive_relstr(A)| -transitive_relstr(A)| -rel_str(A)|element($f4(A),powerset(the_carrier(A))).
% 2.12/2.31 0 [] empty_carrier(A)| -reflexive_relstr(A)| -transitive_relstr(A)| -rel_str(A)| -empty($f4(A)).
% 2.12/2.31 0 [] empty_carrier(A)| -reflexive_relstr(A)| -transitive_relstr(A)| -rel_str(A)|filtered_subset($f4(A),A).
% 2.12/2.31 0 [] empty_carrier(A)| -reflexive_relstr(A)| -transitive_relstr(A)| -rel_str(A)|upper_relstr_subset($f4(A),A).
% 2.12/2.31 0 [] -empty($c3).
% 2.12/2.31 0 [] finite($c3).
% 2.12/2.31 0 [] empty(A)|element($f5(A),powerset(A)).
% 2.12/2.31 0 [] empty(A)| -empty($f5(A)).
% 2.12/2.31 0 [] empty($c4).
% 2.12/2.31 0 [] element($f6(A),powerset(A)).
% 2.12/2.31 0 [] empty($f6(A)).
% 2.12/2.31 0 [] -empty($c5).
% 2.12/2.31 0 [] empty(A)|element($f7(A),powerset(A)).
% 2.12/2.31 0 [] empty(A)| -empty($f7(A)).
% 2.12/2.31 0 [] empty(A)|finite($f7(A)).
% 2.12/2.31 0 [] one_sorted_str($c6).
% 2.12/2.31 0 [] -empty_carrier($c6).
% 2.12/2.31 0 [] empty(A)|element($f8(A),powerset(A)).
% 2.12/2.31 0 [] empty(A)| -empty($f8(A)).
% 2.12/2.31 0 [] empty(A)|finite($f8(A)).
% 2.12/2.31 0 [] empty_carrier(A)| -one_sorted_str(A)|element($f9(A),powerset(the_carrier(A))).
% 2.12/2.31 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f9(A)).
% 2.12/2.31 0 [] subset(A,A).
% 2.12/2.31 0 [] -in(A,B)|element(A,B).
% 2.12/2.31 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.12/2.31 0 [] in($f10(A,B),A)|in($f10(A,B),B)|A=B.
% 2.12/2.31 0 [] -in($f10(A,B),A)| -in($f10(A,B),B)|A=B.
% 2.12/2.31 0 [] -element(A,powerset(B))|subset(A,B).
% 2.12/2.31 0 [] element(A,powerset(B))| -subset(A,B).
% 2.12/2.31 0 [] empty_carrier(A)| -antisymmetric_relstr(A)| -lower_bounded_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))|related(A,bottom_of_relstr(A),B).
% 2.12/2.31 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.12/2.31 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.12/2.31 0 [] -element(B,powerset(A))| -proper_element(B,powerset(A))|B!=A.
% 2.12/2.31 0 [] -element(B,powerset(A))|proper_element(B,powerset(A))|B=A.
% 2.12/2.31 0 [] -empty(A)|A=empty_set.
% 2.12/2.31 0 [] -in(A,B)| -empty(B).
% 2.12/2.31 0 [] -empty(A)|A=B| -empty(B).
% 2.12/2.31 0 [] -empty_carrier($c8).
% 2.12/2.31 0 [] reflexive_relstr($c8).
% 2.12/2.31 0 [] transitive_relstr($c8).
% 2.12/2.31 0 [] antisymmetric_relstr($c8).
% 2.12/2.31 0 [] lower_bounded_relstr($c8).
% 2.12/2.31 0 [] rel_str($c8).
% 2.12/2.31 0 [] -empty($c7).
% 2.12/2.31 0 [] filtered_subset($c7,$c8).
% 2.12/2.31 0 [] upper_relstr_subset($c7,$c8).
% 2.12/2.31 0 [] element($c7,powerset(the_carrier($c8))).
% 2.12/2.31 0 [] proper_element($c7,powerset(the_carrier($c8)))| -in(bottom_of_relstr($c8),$c7).
% 2.12/2.31 0 [] -proper_element($c7,powerset(the_carrier($c8)))|in(bottom_of_relstr($c8),$c7).
% 2.12/2.31 end_of_list.
% 2.12/2.31
% 2.12/2.31 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 2.12/2.31
% 2.12/2.31 This ia a non-Horn set with equality. The strategy will be
% 2.12/2.31 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.12/2.31 deletion, with positive clauses in sos and nonpositive
% 2.12/2.31 clauses in usable.
% 2.12/2.31
% 2.12/2.31 dependent: set(knuth_bendix).
% 2.12/2.31 dependent: set(anl_eq).
% 2.12/2.31 dependent: set(para_from).
% 2.12/2.31 dependent: set(para_into).
% 2.12/2.31 dependent: clear(para_from_right).
% 2.12/2.31 dependent: clear(para_into_right).
% 2.12/2.31 dependent: set(para_from_vars).
% 2.12/2.31 dependent: set(eq_units_both_ways).
% 2.12/2.31 dependent: set(dynamic_demod_all).
% 2.12/2.31 dependent: set(dynamic_demod).
% 2.12/2.31 dependent: set(order_eq).
% 2.12/2.31 dependent: set(back_demod).
% 2.12/2.31 dependent: set(lrpo).
% 2.12/2.31 dependent: set(hyper_res).
% 2.12/2.31 dependent: set(unit_deletion).
% 2.12/2.31 dependent: set(factor).
% 2.12/2.31
% 2.12/2.31 ------------> process usable:
% 2.12/2.31 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.12/2.31 ** KEPT (pick-wt=4): 2 [] -empty(A)|finite(A).
% 2.12/2.31 ** KEPT (pick-wt=6): 3 [] -rel_str(A)| -empty_carrier(A)|v1_yellow_3(A).
% 2.12/2.31 ** KEPT (pick-wt=8): 4 [] -finite(A)| -element(B,powerset(A))|finite(B).
% 2.12/2.31 Following clause subsumed by 3 during input processing: 0 [] -rel_str(A)|v1_yellow_3(A)| -empty_carrier(A).
% 2.12/2.31 ** KEPT (pick-wt=8): 5 [] -rel_str(A)|empty_carrier(A)| -reflexive_relstr(A)| -v1_yellow_3(A).
% 2.12/2.31 ** KEPT (pick-wt=8): 6 [] -rel_str(A)|bottom_of_relstr(A)=join_on_relstr(A,empty_set).
% 2.12/2.31 ** KEPT (pick-wt=28): 7 [] -rel_str(A)| -element(B,powerset(the_carrier(A)))| -upper_relstr_subset(B,A)| -element(C,the_carrier(A))| -element(D,the_carrier(A))| -in(C,B)| -related(A,C,D)|in(D,B).
% 2.12/2.31 ** KEPT (pick-wt=16): 8 [] -rel_str(A)| -element(B,powerset(the_carrier(A)))|upper_relstr_subset(B,A)|element($f2(A,B),the_carrier(A)).
% 2.12/2.31 ** KEPT (pick-wt=16): 9 [] -rel_str(A)| -element(B,powerset(the_carrier(A)))|upper_relstr_subset(B,A)|element($f1(A,B),the_carrier(A)).
% 2.12/2.31 ** KEPT (pick-wt=15): 10 [] -rel_str(A)| -element(B,powerset(the_carrier(A)))|upper_relstr_subset(B,A)|in($f2(A,B),B).
% 2.12/2.31 ** KEPT (pick-wt=18): 11 [] -rel_str(A)| -element(B,powerset(the_carrier(A)))|upper_relstr_subset(B,A)|related(A,$f2(A,B),$f1(A,B)).
% 2.12/2.31 ** KEPT (pick-wt=15): 12 [] -rel_str(A)| -element(B,powerset(the_carrier(A)))|upper_relstr_subset(B,A)| -in($f1(A,B),B).
% 2.12/2.31 ** KEPT (pick-wt=8): 13 [] -rel_str(A)|element(join_on_relstr(A,B),the_carrier(A)).
% 2.12/2.31 ** KEPT (pick-wt=7): 14 [] -rel_str(A)|element(bottom_of_relstr(A),the_carrier(A)).
% 2.12/2.31 ** KEPT (pick-wt=4): 15 [] -rel_str(A)|one_sorted_str(A).
% 2.12/2.31 ** KEPT (pick-wt=7): 16 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 2.12/2.31 ** KEPT (pick-wt=3): 17 [] -empty(powerset(A)).
% 2.12/2.31 ** KEPT (pick-wt=14): 18 [] empty_carrier(A)| -reflexive_relstr(A)| -transitive_relstr(A)| -rel_str(A)|element($f4(A),powerset(the_carrier(A))).
% 2.12/2.31 ** KEPT (pick-wt=11): 19 [] empty_carrier(A)| -reflexive_relstr(A)| -transitive_relstr(A)| -rel_str(A)| -empty($f4(A)).
% 2.12/2.31 ** KEPT (pick-wt=12): 20 [] empty_carrier(A)| -reflexive_relstr(A)| -transitive_relstr(A)| -rel_str(A)|filtered_subset($f4(A),A).
% 2.12/2.31 ** KEPT (pick-wt=12): 21 [] empty_carrier(A)| -reflexive_relstr(A)| -transitive_relstr(A)| -rel_str(A)|upper_relstr_subset($f4(A),A).
% 2.12/2.31 ** KEPT (pick-wt=2): 22 [] -empty($c3).
% 2.12/2.31 ** KEPT (pick-wt=5): 23 [] empty(A)| -empty($f5(A)).
% 2.12/2.31 ** KEPT (pick-wt=2): 24 [] -empty($c5).
% 2.12/2.31 ** KEPT (pick-wt=5): 25 [] empty(A)| -empty($f7(A)).
% 2.12/2.31 ** KEPT (pick-wt=2): 26 [] -empty_carrier($c6).
% 2.12/2.31 ** KEPT (pick-wt=5): 27 [] empty(A)| -empty($f8(A)).
% 2.12/2.31 ** KEPT (pick-wt=10): 28 [] empty_carrier(A)| -one_sorted_str(A)|element($f9(A),powerset(the_carrier(A))).
% 2.12/2.31 ** KEPT (pick-wt=7): 29 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f9(A)).
% 2.12/2.31 ** KEPT (pick-wt=6): 30 [] -in(A,B)|element(A,B).
% 2.12/2.31 ** KEPT (pick-wt=8): 31 [] -element(A,B)|empty(B)|in(A,B).
% 2.12/2.31 ** KEPT (pick-wt=13): 32 [] -in($f10(A,B),A)| -in($f10(A,B),B)|A=B.
% 2.12/2.31 ** KEPT (pick-wt=7): 33 [] -element(A,powerset(B))|subset(A,B).
% 2.12/2.31 ** KEPT (pick-wt=7): 34 [] element(A,powerset(B))| -subset(A,B).
% 2.12/2.31 ** KEPT (pick-wt=17): 35 [] empty_carrier(A)| -antisymmetric_relstr(A)| -lower_bounded_relstr(A)| -rel_str(A)| -element(B,the_carrier(A))|related(A,bottom_of_relstr(A),B).
% 2.12/2.31 ** KEPT (pick-wt=10): 36 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.12/2.31 ** KEPT (pick-wt=9): 37 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.12/2.31 ** KEPT (pick-wt=11): 38 [] -element(A,powerset(B))| -proper_element(A,powerset(B))|A!=B.
% 2.12/2.31 ** KEPT (pick-wt=11): 39 [] -element(A,powerset(B))|proper_element(A,powerset(B))|A=B.
% 2.12/2.31 ** KEPT (pick-wt=5): 40 [] -empty(A)|A=empty_set.
% 2.12/2.31 ** KEPT (pick-wt=5): 41 [] -in(A,B)| -empty(B).
% 2.12/2.31 ** KEPT (pick-wt=7): 42 [] -empty(A)|A=B| -empty(B).
% 2.12/2.31 ** KEPT (pick-wt=2): 43 [] -empty_carrier($c8).
% 2.12/2.31 ** KEPT (pick-wt=2): 44 [] -empty($c7).
% 2.12/2.31 ** KEPT (pick-wt=9): 45 [] proper_element($c7,powerset(the_carrier($c8)))| -in(bottom_of_relstr($c8),$c7).
% 2.12/2.31 ** KEPT (pick-wt=9): 46 [] -proper_element($c7,powerset(the_carrier($c8)))|in(bottom_of_relstr($c8),$c7).
% 2.12/2.31
% 2.12/2.31 ------------> process sos:
% 2.12/2.31 ** KEPT (pick-wt=3): 50 [] A=A.
% 2.12/2.31 ** KEPT (pick-wt=2): 51 [] rel_str($c1).
% 2.12/2.31 ** KEPT (pick-wt=2): 52 [] one_sorted_str($c2).
% 2.12/2.31 ** KEPT (pick-wt=4): 53 [] element($f3(A),A).
% 2.12/2.31 ** KEPT (pick-wt=2): 54 [] empty(empty_set).
% 2.12/2.31 ** KEPT (pick-wt=2): 55 [] finite($c3).
% 2.12/2.31 ** KEPT (pick-wt=7): 56 [] empty(A)|element($f5(A),powerset(A)).
% 2.12/2.31 ** KEPT (pick-wt=2): 57 [] empty($c4).
% 2.12/2.31 ** KEPT (pick-wt=5): 58 [] element($f6(A)Alarm clock
% 299.87/300.02 Otter interrupted
% 299.87/300.02 PROOF NOT FOUND
%------------------------------------------------------------------------------