TSTP Solution File: SEU053+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU053+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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:43 EDT 2022
% Result : Timeout 299.85s 300.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU053+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14 % Command : otter-tptp-script %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Jul 27 07:30:23 EDT 2022
% 0.14/0.35 % CPUTime :
% 2.01/2.20 ----- Otter 3.3f, August 2004 -----
% 2.01/2.20 The process was started by sandbox2 on n021.cluster.edu,
% 2.01/2.20 Wed Jul 27 07:30:23 2022
% 2.01/2.20 The command was "./otter". The process ID is 18922.
% 2.01/2.20
% 2.01/2.20 set(prolog_style_variables).
% 2.01/2.20 set(auto).
% 2.01/2.20 dependent: set(auto1).
% 2.01/2.20 dependent: set(process_input).
% 2.01/2.20 dependent: clear(print_kept).
% 2.01/2.20 dependent: clear(print_new_demod).
% 2.01/2.20 dependent: clear(print_back_demod).
% 2.01/2.20 dependent: clear(print_back_sub).
% 2.01/2.20 dependent: set(control_memory).
% 2.01/2.20 dependent: assign(max_mem, 12000).
% 2.01/2.20 dependent: assign(pick_given_ratio, 4).
% 2.01/2.20 dependent: assign(stats_level, 1).
% 2.01/2.20 dependent: assign(max_seconds, 10800).
% 2.01/2.20 clear(print_given).
% 2.01/2.20
% 2.01/2.20 formula_list(usable).
% 2.01/2.20 all A (A=A).
% 2.01/2.20 all A B (in(A,B)-> -in(B,A)).
% 2.01/2.20 all A (empty(A)->function(A)).
% 2.01/2.20 all A (empty(A)->relation(A)).
% 2.01/2.20 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.01/2.20 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.01/2.20 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 2.01/2.20 all A B (disjoint(A,B)<->set_intersection2(A,B)=empty_set).
% 2.01/2.20 all A (relation(A)&function(A)-> (one_to_one(A)<-> (all B C (in(B,relation_dom(A))&in(C,relation_dom(A))&apply(A,B)=apply(A,C)->B=C)))).
% 2.01/2.20 all A exists B element(B,A).
% 2.01/2.20 empty(empty_set).
% 2.01/2.20 relation(empty_set).
% 2.01/2.20 relation_empty_yielding(empty_set).
% 2.01/2.20 all A B (relation(A)&relation(B)->relation(set_intersection2(A,B))).
% 2.01/2.20 all A (-empty(powerset(A))).
% 2.01/2.20 empty(empty_set).
% 2.01/2.20 all A (-empty(singleton(A))).
% 2.01/2.20 empty(empty_set).
% 2.01/2.20 relation(empty_set).
% 2.01/2.20 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 2.01/2.20 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 2.01/2.20 all A B (set_intersection2(A,A)=A).
% 2.01/2.20 all A B (-empty(A)& -empty(B)-> -disjoint_nonempty(A,A)).
% 2.01/2.20 exists A (relation(A)&function(A)).
% 2.01/2.20 exists A (empty(A)&relation(A)).
% 2.01/2.20 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.01/2.20 exists A empty(A).
% 2.01/2.20 exists A (relation(A)&empty(A)&function(A)).
% 2.01/2.20 exists A (-empty(A)&relation(A)).
% 2.01/2.20 all A exists B (element(B,powerset(A))&empty(B)).
% 2.01/2.20 exists A (-empty(A)).
% 2.01/2.20 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.01/2.20 exists A (relation(A)&relation_empty_yielding(A)).
% 2.01/2.20 all A B (-empty(A)& -empty(B)-> (disjoint_nonempty(A,B)<->disjoint(A,B))).
% 2.01/2.20 all A B subset(A,A).
% 2.01/2.20 all A B (-empty(A)& -empty(B)-> (disjoint_nonempty(A,B)->disjoint_nonempty(B,A))).
% 2.01/2.20 all A B (disjoint(A,B)->disjoint(B,A)).
% 2.01/2.20 all A B (relation(B)&function(B)-> (in(A,relation_dom(B))->relation_image(B,singleton(A))=singleton(apply(B,A)))).
% 2.01/2.20 -(all A (relation(A)&function(A)-> ((all B C (relation_image(A,set_intersection2(B,C))=set_intersection2(relation_image(A,B),relation_image(A,C))))->one_to_one(A)))).
% 2.01/2.20 all A (relation(A)->relation_image(A,empty_set)=empty_set).
% 2.01/2.20 all A B (A!=B->disjoint(singleton(A),singleton(B))).
% 2.01/2.20 all A B (in(A,B)->element(A,B)).
% 2.01/2.20 all A (set_intersection2(A,empty_set)=empty_set).
% 2.01/2.20 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.01/2.20 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.01/2.20 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.01/2.20 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.01/2.20 all A (empty(A)->A=empty_set).
% 2.01/2.20 all A B (-(in(A,B)&empty(B))).
% 2.01/2.20 all A B (-(empty(A)&A!=B&empty(B))).
% 2.01/2.20 end_of_list.
% 2.01/2.20
% 2.01/2.20 -------> usable clausifies to:
% 2.01/2.20
% 2.01/2.20 list(usable).
% 2.01/2.20 0 [] A=A.
% 2.01/2.20 0 [] -in(A,B)| -in(B,A).
% 2.01/2.20 0 [] -empty(A)|function(A).
% 2.01/2.20 0 [] -empty(A)|relation(A).
% 2.01/2.20 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.01/2.20 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.01/2.20 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 2.01/2.20 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 2.01/2.20 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 2.01/2.20 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 2.01/2.20 0 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 2.01/2.20 0 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 2.01/2.20 0 [] -relation(A)| -function(A)| -one_to_one(A)| -in(B,relation_dom(A))| -in(C,relation_dom(A))|apply(A,B)!=apply(A,C)|B=C.
% 2.01/2.20 0 [] -relation(A)| -function(A)|one_to_one(A)|in($f3(A),relation_dom(A)).
% 2.01/2.20 0 [] -relation(A)| -function(A)|one_to_one(A)|in($f2(A),relation_dom(A)).
% 2.01/2.20 0 [] -relation(A)| -function(A)|one_to_one(A)|apply(A,$f3(A))=apply(A,$f2(A)).
% 2.01/2.20 0 [] -relation(A)| -function(A)|one_to_one(A)|$f3(A)!=$f2(A).
% 2.01/2.20 0 [] element($f4(A),A).
% 2.01/2.20 0 [] empty(empty_set).
% 2.01/2.20 0 [] relation(empty_set).
% 2.01/2.20 0 [] relation_empty_yielding(empty_set).
% 2.01/2.20 0 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 2.01/2.20 0 [] -empty(powerset(A)).
% 2.01/2.20 0 [] empty(empty_set).
% 2.01/2.20 0 [] -empty(singleton(A)).
% 2.01/2.20 0 [] empty(empty_set).
% 2.01/2.20 0 [] relation(empty_set).
% 2.01/2.20 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.01/2.20 0 [] -empty(A)|empty(relation_dom(A)).
% 2.01/2.20 0 [] -empty(A)|relation(relation_dom(A)).
% 2.01/2.20 0 [] set_intersection2(A,A)=A.
% 2.01/2.20 0 [] empty(A)|empty(B)| -disjoint_nonempty(A,A).
% 2.01/2.20 0 [] relation($c1).
% 2.01/2.20 0 [] function($c1).
% 2.01/2.20 0 [] empty($c2).
% 2.01/2.20 0 [] relation($c2).
% 2.01/2.20 0 [] empty(A)|element($f5(A),powerset(A)).
% 2.01/2.20 0 [] empty(A)| -empty($f5(A)).
% 2.01/2.20 0 [] empty($c3).
% 2.01/2.20 0 [] relation($c4).
% 2.01/2.20 0 [] empty($c4).
% 2.01/2.20 0 [] function($c4).
% 2.01/2.20 0 [] -empty($c5).
% 2.01/2.20 0 [] relation($c5).
% 2.01/2.20 0 [] element($f6(A),powerset(A)).
% 2.01/2.20 0 [] empty($f6(A)).
% 2.01/2.20 0 [] -empty($c6).
% 2.01/2.20 0 [] relation($c7).
% 2.01/2.20 0 [] function($c7).
% 2.01/2.20 0 [] one_to_one($c7).
% 2.01/2.20 0 [] relation($c8).
% 2.01/2.20 0 [] relation_empty_yielding($c8).
% 2.01/2.20 0 [] empty(A)|empty(B)| -disjoint_nonempty(A,B)|disjoint(A,B).
% 2.01/2.20 0 [] empty(A)|empty(B)|disjoint_nonempty(A,B)| -disjoint(A,B).
% 2.01/2.20 0 [] subset(A,A).
% 2.01/2.20 0 [] empty(A)|empty(B)| -disjoint_nonempty(A,B)|disjoint_nonempty(B,A).
% 2.01/2.20 0 [] -disjoint(A,B)|disjoint(B,A).
% 2.01/2.20 0 [] -relation(B)| -function(B)| -in(A,relation_dom(B))|relation_image(B,singleton(A))=singleton(apply(B,A)).
% 2.01/2.20 0 [] relation($c9).
% 2.01/2.20 0 [] function($c9).
% 2.01/2.20 0 [] relation_image($c9,set_intersection2(B,C))=set_intersection2(relation_image($c9,B),relation_image($c9,C)).
% 2.01/2.20 0 [] -one_to_one($c9).
% 2.01/2.20 0 [] -relation(A)|relation_image(A,empty_set)=empty_set.
% 2.01/2.20 0 [] A=B|disjoint(singleton(A),singleton(B)).
% 2.01/2.20 0 [] -in(A,B)|element(A,B).
% 2.01/2.20 0 [] set_intersection2(A,empty_set)=empty_set.
% 2.01/2.20 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.01/2.20 0 [] -element(A,powerset(B))|subset(A,B).
% 2.01/2.20 0 [] element(A,powerset(B))| -subset(A,B).
% 2.01/2.20 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.01/2.20 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.01/2.20 0 [] -empty(A)|A=empty_set.
% 2.01/2.20 0 [] -in(A,B)| -empty(B).
% 2.01/2.20 0 [] -empty(A)|A=B| -empty(B).
% 2.01/2.20 end_of_list.
% 2.01/2.20
% 2.01/2.20 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 2.01/2.20
% 2.01/2.20 This ia a non-Horn set with equality. The strategy will be
% 2.01/2.20 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.01/2.20 deletion, with positive clauses in sos and nonpositive
% 2.01/2.20 clauses in usable.
% 2.01/2.20
% 2.01/2.20 dependent: set(knuth_bendix).
% 2.01/2.20 dependent: set(anl_eq).
% 2.01/2.20 dependent: set(para_from).
% 2.01/2.20 dependent: set(para_into).
% 2.01/2.20 dependent: clear(para_from_right).
% 2.01/2.20 dependent: clear(para_into_right).
% 2.01/2.20 dependent: set(para_from_vars).
% 2.01/2.20 dependent: set(eq_units_both_ways).
% 2.01/2.20 dependent: set(dynamic_demod_all).
% 2.01/2.20 dependent: set(dynamic_demod).
% 2.01/2.20 dependent: set(order_eq).
% 2.01/2.20 dependent: set(back_demod).
% 2.01/2.20 dependent: set(lrpo).
% 2.01/2.20 dependent: set(hyper_res).
% 2.01/2.20 dependent: set(unit_deletion).
% 2.01/2.20 dependent: set(factor).
% 2.01/2.20
% 2.01/2.20 ------------> process usable:
% 2.01/2.20 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.01/2.20 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.01/2.20 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 2.01/2.20 ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.01/2.20 ** KEPT (pick-wt=10): 5 [] A!=singleton(B)| -in(C,A)|C=B.
% 2.01/2.20 ** KEPT (pick-wt=10): 6 [] A!=singleton(B)|in(C,A)|C!=B.
% 2.01/2.20 ** KEPT (pick-wt=14): 7 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 2.01/2.20 ** KEPT (pick-wt=8): 8 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 2.01/2.20 ** KEPT (pick-wt=8): 9 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 2.01/2.20 ** KEPT (pick-wt=24): 10 [] -relation(A)| -function(A)| -one_to_one(A)| -in(B,relation_dom(A))| -in(C,relation_dom(A))|apply(A,B)!=apply(A,C)|B=C.
% 2.01/2.20 ** KEPT (pick-wt=11): 11 [] -relation(A)| -function(A)|one_to_one(A)|in($f3(A),relation_dom(A)).
% 2.01/2.20 ** KEPT (pick-wt=11): 12 [] -relation(A)| -function(A)|one_to_one(A)|in($f2(A),relation_dom(A)).
% 2.01/2.20 ** KEPT (pick-wt=15): 13 [] -relation(A)| -function(A)|one_to_one(A)|apply(A,$f3(A))=apply(A,$f2(A)).
% 2.01/2.20 ** KEPT (pick-wt=11): 14 [] -relation(A)| -function(A)|one_to_one(A)|$f3(A)!=$f2(A).
% 2.01/2.20 ** KEPT (pick-wt=8): 15 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 2.01/2.20 ** KEPT (pick-wt=3): 16 [] -empty(powerset(A)).
% 2.01/2.20 ** KEPT (pick-wt=3): 17 [] -empty(singleton(A)).
% 2.01/2.20 ** KEPT (pick-wt=7): 18 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.01/2.20 ** KEPT (pick-wt=5): 19 [] -empty(A)|empty(relation_dom(A)).
% 2.01/2.20 ** KEPT (pick-wt=5): 20 [] -empty(A)|relation(relation_dom(A)).
% 2.01/2.20 ** KEPT (pick-wt=5): 22 [copy,21,factor_simp] empty(A)| -disjoint_nonempty(A,A).
% 2.01/2.20 ** KEPT (pick-wt=5): 23 [] empty(A)| -empty($f5(A)).
% 2.01/2.20 ** KEPT (pick-wt=2): 24 [] -empty($c5).
% 2.01/2.20 ** KEPT (pick-wt=2): 25 [] -empty($c6).
% 2.01/2.20 ** KEPT (pick-wt=10): 26 [] empty(A)|empty(B)| -disjoint_nonempty(A,B)|disjoint(A,B).
% 2.01/2.20 ** KEPT (pick-wt=10): 27 [] empty(A)|empty(B)|disjoint_nonempty(A,B)| -disjoint(A,B).
% 2.01/2.20 ** KEPT (pick-wt=10): 28 [] empty(A)|empty(B)| -disjoint_nonempty(A,B)|disjoint_nonempty(B,A).
% 2.01/2.20 ** KEPT (pick-wt=6): 29 [] -disjoint(A,B)|disjoint(B,A).
% 2.01/2.20 ** KEPT (pick-wt=17): 31 [copy,30,flip.4] -relation(A)| -function(A)| -in(B,relation_dom(A))|singleton(apply(A,B))=relation_image(A,singleton(B)).
% 2.01/2.20 ** KEPT (pick-wt=2): 32 [] -one_to_one($c9).
% 2.01/2.20 ** KEPT (pick-wt=7): 33 [] -relation(A)|relation_image(A,empty_set)=empty_set.
% 2.01/2.20 ** KEPT (pick-wt=6): 34 [] -in(A,B)|element(A,B).
% 2.01/2.20 ** KEPT (pick-wt=8): 35 [] -element(A,B)|empty(B)|in(A,B).
% 2.01/2.20 ** KEPT (pick-wt=7): 36 [] -element(A,powerset(B))|subset(A,B).
% 2.01/2.20 ** KEPT (pick-wt=7): 37 [] element(A,powerset(B))| -subset(A,B).
% 2.01/2.20 ** KEPT (pick-wt=10): 38 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.01/2.20 ** KEPT (pick-wt=9): 39 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.01/2.20 ** KEPT (pick-wt=5): 40 [] -empty(A)|A=empty_set.
% 2.01/2.20 ** KEPT (pick-wt=5): 41 [] -in(A,B)| -empty(B).
% 2.01/2.20 ** KEPT (pick-wt=7): 42 [] -empty(A)|A=B| -empty(B).
% 2.01/2.20
% 2.01/2.20 ------------> process sos:
% 2.01/2.20 ** KEPT (pick-wt=3): 48 [] A=A.
% 2.01/2.20 ** KEPT (pick-wt=7): 49 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.01/2.20 ** KEPT (pick-wt=14): 50 [] A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B.
% 2.01/2.20 ** KEPT (pick-wt=4): 51 [] element($f4(A),A).
% 2.01/2.20 ** KEPT (pick-wt=2): 52 [] empty(empty_set).
% 2.01/2.20 ** KEPT (pick-wt=2): 53 [] relation(empty_set).
% 2.01/2.20 ** KEPT (pick-wt=2): 54 [] relation_empty_yielding(empty_set).
% 2.01/2.20 Following clause subsumed by 52 during input processing: 0 [] empty(empty_set).
% 2.01/2.20 Following clause subsumed by 52 during input processing: 0 [] empty(empty_set).
% 2.01/2.20 Following clause subsumed by 53 during input processing: 0 [] relation(empty_set).
% 2.01/2.20 ** KEPT (pick-wt=5): 55 [] set_intersection2(A,A)=A.
% 2.01/2.20 ---> New Demodulator: 56 [new_demod,55] set_intersection2(A,A)=A.
% 2.01/2.20 ** KEPT (pick-wt=2): 57 [] relation($c1).
% 2.01/2.20 ** KEPT (pick-wt=2): 58 [] function($c1).
% 2.01/2.20 ** KEPT (pick-wt=2): 59 [] empty($c2).
% 2.01/2.20 ** KEPT (pick-wt=2): 60 [] relation($c2).
% 2.01/2.20 ** KEPT (pick-wt=7): 61 [] empty(A)|element($f5(A),powerset(A)).
% 2.01/2.20 ** KEPT (pick-wt=2): 62 [] empty($c3).
% 2.01/2.20 ** KEPT (pick-wt=2): 63 [] relation($c4).
% 2.01/2.20 ** KEPT (pick-wt=2): 64 [] empty($c4).
% 2.01/2.20 ** KEPT (pick-wt=2): 65 [] function($c4).
% 2.01/2.20 ** KEPT (pick-wt=2): 66 [] relation($c5).
% 2.01/2.20 ** KEPT (pick-wt=5): 67 [] element($f6(A),powerset(A)).
% 2.01/2.20 ** KEPT (pick-wt=3): 68 [] empty($f6(A)).
% 2.01/2.20 ** KEPT (pick-wt=2): 69 [] relation($c7).
% 2.01/2.20 ** KEPT (pick-wt=2): 70 [] function($c7).
% 2.01/2.20 ** KEPT (pick-wt=2): 71 [] one_to_one($c7).
% 2.01/2.20 ** KEPT (pick-wt=2): 72 [] relation($c8).
% 2.01/2.20 ** KEPT (pick-wt=2): 73 [] relation_empty_yielding($c8).
% 2.01/2.20 ** KEPT (pick-wt=3): 74 [] subset(A,A).
% 2.01/2.20 ** KEPT (pick-wt=2): 75 [] relation($c9).
% 2.01/2.20 ** KEPT (pick-wt=2): 76 [] function($c9).
% 2.01/2.20 ** KEPT (pick-wt=13): 78 [copy,77,flip.1] set_intersection2(relation_image($c9,A),relation_image($c9,B))=relation_image($c9,set_intersection2(A,B)).
% 2.01/2.20 ---> New Demodulator: 79 [new_demod,78] set_intersection2(relation_image($c9,A),relation_image($c9,B))=relation_image($c9,set_intersection2(A,B)).
% 2.01/2.20 ** KEPT (pick-wt=8): 80 [] A=B|disjoint(singleton(A),singleton(B)).
% 2.01/2.20 ** KEPT (pick-wt=5): 81 [] set_intersection2(A,empty_set)=empty_set.
% 2.01/2.20 ---> New Demodulator: 82 [new_demod,81] set_intersection2(A,empty_set)=empty_set.
% 2.01/2.20 Following clause subsumed by 48 during input processing: 0 [copy,48,flip.1] A=A.
% 2.01/2.20 48 back subsumes 47.
% 2.01/2.20 48 back subsumes 44.
% 2.01/2.20 Following clause subsumed by 49 during input processing: 0 [copy,49,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 2.01/2.20 >>>> Starting back demodulation with 56.
% 2.01/2.20 >> back demodulating 45 with 56.
% 2.01/2.20 >>>> Starting back demodulation with 79.
% 2.01/2.20 >>>> Starting back demodulation with 82.
% 2.01/2.20
% 2.01/2.20 ======= end of input processing =======
% 2.01/2.20
% 2.01/2.20 =========== sAlarm clock
% 299.85/300.02 Otter interrupted
% 299.85/300.02 PROOF NOT FOUND
%------------------------------------------------------------------------------