MAYBE Problem: rec(rec(x)) -> sent(rec(x)) rec(sent(x)) -> sent(rec(x)) rec(no(x)) -> sent(rec(x)) rec(bot()) -> up(sent(bot())) rec(up(x)) -> up(rec(x)) sent(up(x)) -> up(sent(x)) no(up(x)) -> up(no(x)) top(rec(up(x))) -> top(check(rec(x))) top(sent(up(x))) -> top(check(rec(x))) top(no(up(x))) -> top(check(rec(x))) check(up(x)) -> up(check(x)) check(sent(x)) -> sent(check(x)) check(rec(x)) -> rec(check(x)) check(no(x)) -> no(check(x)) check(no(x)) -> no(x) Proof: DP Processor: DPs: rec#(rec(x)) -> sent#(rec(x)) rec#(sent(x)) -> rec#(x) rec#(sent(x)) -> sent#(rec(x)) rec#(no(x)) -> rec#(x) rec#(no(x)) -> sent#(rec(x)) rec#(bot()) -> sent#(bot()) rec#(up(x)) -> rec#(x) sent#(up(x)) -> sent#(x) no#(up(x)) -> no#(x) top#(rec(up(x))) -> rec#(x) top#(rec(up(x))) -> check#(rec(x)) top#(rec(up(x))) -> top#(check(rec(x))) top#(sent(up(x))) -> rec#(x) top#(sent(up(x))) -> check#(rec(x)) top#(sent(up(x))) -> top#(check(rec(x))) top#(no(up(x))) -> rec#(x) top#(no(up(x))) -> check#(rec(x)) top#(no(up(x))) -> top#(check(rec(x))) check#(up(x)) -> check#(x) check#(sent(x)) -> check#(x) check#(sent(x)) -> sent#(check(x)) check#(rec(x)) -> check#(x) check#(rec(x)) -> rec#(check(x)) check#(no(x)) -> check#(x) check#(no(x)) -> no#(check(x)) TRS: rec(rec(x)) -> sent(rec(x)) rec(sent(x)) -> sent(rec(x)) rec(no(x)) -> sent(rec(x)) rec(bot()) -> up(sent(bot())) rec(up(x)) -> up(rec(x)) sent(up(x)) -> up(sent(x)) no(up(x)) -> up(no(x)) top(rec(up(x))) -> top(check(rec(x))) top(sent(up(x))) -> top(check(rec(x))) top(no(up(x))) -> top(check(rec(x))) check(up(x)) -> up(check(x)) check(sent(x)) -> sent(check(x)) check(rec(x)) -> rec(check(x)) check(no(x)) -> no(check(x)) check(no(x)) -> no(x) CDG Processor: DPs: rec#(rec(x)) -> sent#(rec(x)) rec#(sent(x)) -> rec#(x) rec#(sent(x)) -> sent#(rec(x)) rec#(no(x)) -> rec#(x) rec#(no(x)) -> sent#(rec(x)) rec#(bot()) -> sent#(bot()) rec#(up(x)) -> rec#(x) sent#(up(x)) -> sent#(x) no#(up(x)) -> no#(x) top#(rec(up(x))) -> rec#(x) top#(rec(up(x))) -> check#(rec(x)) top#(rec(up(x))) -> top#(check(rec(x))) top#(sent(up(x))) -> rec#(x) top#(sent(up(x))) -> check#(rec(x)) top#(sent(up(x))) -> top#(check(rec(x))) top#(no(up(x))) -> rec#(x) top#(no(up(x))) -> check#(rec(x)) top#(no(up(x))) -> top#(check(rec(x))) check#(up(x)) -> check#(x) check#(sent(x)) -> check#(x) check#(sent(x)) -> sent#(check(x)) check#(rec(x)) -> check#(x) check#(rec(x)) -> rec#(check(x)) check#(no(x)) -> check#(x) check#(no(x)) -> no#(check(x)) TRS: rec(rec(x)) -> sent(rec(x)) rec(sent(x)) -> sent(rec(x)) rec(no(x)) -> sent(rec(x)) rec(bot()) -> up(sent(bot())) rec(up(x)) -> up(rec(x)) sent(up(x)) -> up(sent(x)) no(up(x)) -> up(no(x)) top(rec(up(x))) -> top(check(rec(x))) top(sent(up(x))) -> top(check(rec(x))) top(no(up(x))) -> top(check(rec(x))) check(up(x)) -> up(check(x)) check(sent(x)) -> sent(check(x)) check(rec(x)) -> rec(check(x)) check(no(x)) -> no(check(x)) check(no(x)) -> no(x) graph: check#(no(x)) -> no#(check(x)) -> no#(up(x)) -> no#(x) check#(sent(x)) -> sent#(check(x)) -> sent#(up(x)) -> sent#(x) check#(rec(x)) -> rec#(check(x)) -> rec#(rec(x)) -> sent#(rec(x)) check#(rec(x)) -> rec#(check(x)) -> rec#(sent(x)) -> rec#(x) check#(rec(x)) -> rec#(check(x)) -> rec#(sent(x)) -> sent#(rec(x)) check#(rec(x)) -> rec#(check(x)) -> rec#(no(x)) -> rec#(x) check#(rec(x)) -> rec#(check(x)) -> rec#(no(x)) -> sent#(rec(x)) check#(rec(x)) -> rec#(check(x)) -> rec#(bot()) -> sent#(bot()) check#(rec(x)) -> rec#(check(x)) -> rec#(up(x)) -> rec#(x) top#(no(up(x))) -> check#(rec(x)) -> check#(up(x)) -> check#(x) top#(no(up(x))) -> check#(rec(x)) -> check#(sent(x)) -> check#(x) top#(no(up(x))) -> check#(rec(x)) -> check#(sent(x)) -> sent#(check(x)) top#(no(up(x))) -> check#(rec(x)) -> check#(rec(x)) -> check#(x) top#(no(up(x))) -> check#(rec(x)) -> check#(rec(x)) -> rec#(check(x)) top#(no(up(x))) -> check#(rec(x)) -> check#(no(x)) -> check#(x) top#(no(up(x))) -> check#(rec(x)) -> check#(no(x)) -> no#(check(x)) top#(no(up(x))) -> top#(check(rec(x))) -> top#(rec(up(x))) -> rec#(x) top#(no(up(x))) -> top#(check(rec(x))) -> top#(rec(up(x))) -> check#(rec(x)) top#(no(up(x))) -> top#(check(rec(x))) -> top#(rec(up(x))) -> top#(check(rec(x))) top#(no(up(x))) -> top#(check(rec(x))) -> top#(sent(up(x))) -> rec#(x) top#(no(up(x))) -> top#(check(rec(x))) -> top#(sent(up(x))) -> check#(rec(x)) top#(no(up(x))) -> top#(check(rec(x))) -> top#(sent(up(x))) -> top#(check(rec(x))) top#(no(up(x))) -> top#(check(rec(x))) -> top#(no(up(x))) -> rec#(x) top#(no(up(x))) -> top#(check(rec(x))) -> top#(no(up(x))) -> check#(rec(x)) top#(no(up(x))) -> top#(check(rec(x))) -> top#(no(up(x))) -> top#(check(rec(x))) top#(sent(up(x))) -> check#(rec(x)) -> check#(up(x)) -> check#(x) top#(sent(up(x))) -> check#(rec(x)) -> check#(sent(x)) -> check#(x) top#(sent(up(x))) -> check#(rec(x)) -> check#(sent(x)) -> sent#(check(x)) top#(sent(up(x))) -> check#(rec(x)) -> check#(rec(x)) -> check#(x) top#(sent(up(x))) -> check#(rec(x)) -> check#(rec(x)) -> rec#(check(x)) top#(sent(up(x))) -> check#(rec(x)) -> check#(no(x)) -> check#(x) top#(sent(up(x))) -> check#(rec(x)) -> check#(no(x)) -> no#(check(x)) top#(sent(up(x))) -> top#(check(rec(x))) -> top#(rec(up(x))) -> rec#(x) top#(sent(up(x))) -> top#(check(rec(x))) -> top#(rec(up(x))) -> check#(rec(x)) top#(sent(up(x))) -> top#(check(rec(x))) -> top#(rec(up(x))) -> top#(check(rec(x))) top#(sent(up(x))) -> top#(check(rec(x))) -> top#(sent(up(x))) -> rec#(x) top#(sent(up(x))) -> top#(check(rec(x))) -> top#(sent(up(x))) -> check#(rec(x)) top#(sent(up(x))) -> top#(check(rec(x))) -> top#(sent(up(x))) -> top#(check(rec(x))) top#(sent(up(x))) -> top#(check(rec(x))) -> top#(no(up(x))) -> rec#(x) top#(sent(up(x))) -> top#(check(rec(x))) -> top#(no(up(x))) -> check#(rec(x)) top#(sent(up(x))) -> top#(check(rec(x))) -> top#(no(up(x))) -> top#(check(rec(x))) top#(rec(up(x))) -> check#(rec(x)) -> check#(up(x)) -> check#(x) top#(rec(up(x))) -> check#(rec(x)) -> check#(sent(x)) -> check#(x) top#(rec(up(x))) -> check#(rec(x)) -> check#(sent(x)) -> sent#(check(x)) top#(rec(up(x))) -> check#(rec(x)) -> check#(rec(x)) -> check#(x) top#(rec(up(x))) -> check#(rec(x)) -> check#(rec(x)) -> rec#(check(x)) top#(rec(up(x))) -> check#(rec(x)) -> check#(no(x)) -> check#(x) top#(rec(up(x))) -> check#(rec(x)) -> check#(no(x)) -> no#(check(x)) top#(rec(up(x))) -> top#(check(rec(x))) -> top#(rec(up(x))) -> rec#(x) top#(rec(up(x))) -> top#(check(rec(x))) -> top#(rec(up(x))) -> check#(rec(x)) top#(rec(up(x))) -> top#(check(rec(x))) -> top#(rec(up(x))) -> top#(check(rec(x))) top#(rec(up(x))) -> top#(check(rec(x))) -> top#(sent(up(x))) -> rec#(x) top#(rec(up(x))) -> top#(check(rec(x))) -> top#(sent(up(x))) -> check#(rec(x)) top#(rec(up(x))) -> top#(check(rec(x))) -> top#(sent(up(x))) -> top#(check(rec(x))) top#(rec(up(x))) -> top#(check(rec(x))) -> top#(no(up(x))) -> rec#(x) top#(rec(up(x))) -> top#(check(rec(x))) -> top#(no(up(x))) -> check#(rec(x)) top#(rec(up(x))) -> top#(check(rec(x))) -> top#(no(up(x))) -> top#(check(rec(x))) rec#(no(x)) -> sent#(rec(x)) -> sent#(up(x)) -> sent#(x) rec#(sent(x)) -> sent#(rec(x)) -> sent#(up(x)) -> sent#(x) rec#(rec(x)) -> sent#(rec(x)) -> sent#(up(x)) -> sent#(x) SCC Processor: #sccs: 1 #rules: 3 #arcs: 60/625 DPs: top#(no(up(x))) -> top#(check(rec(x))) top#(sent(up(x))) -> top#(check(rec(x))) top#(rec(up(x))) -> top#(check(rec(x))) TRS: rec(rec(x)) -> sent(rec(x)) rec(sent(x)) -> sent(rec(x)) rec(no(x)) -> sent(rec(x)) rec(bot()) -> up(sent(bot())) rec(up(x)) -> up(rec(x)) sent(up(x)) -> up(sent(x)) no(up(x)) -> up(no(x)) top(rec(up(x))) -> top(check(rec(x))) top(sent(up(x))) -> top(check(rec(x))) top(no(up(x))) -> top(check(rec(x))) check(up(x)) -> up(check(x)) check(sent(x)) -> sent(check(x)) check(rec(x)) -> rec(check(x)) check(no(x)) -> no(check(x)) check(no(x)) -> no(x) Open