MAYBE Time: 0.271960 TRS: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} DP: DP: { mark# 2nd X -> mark# X, mark# 2nd X -> active# 2nd mark X, mark# 2nd X -> 2nd# mark X, mark# cons1(X1, X2) -> mark# X1, mark# cons1(X1, X2) -> mark# X2, mark# cons1(X1, X2) -> active# cons1(mark X1, mark X2), mark# cons1(X1, X2) -> cons1#(mark X1, mark X2), mark# cons(X1, X2) -> mark# X1, mark# cons(X1, X2) -> active# cons(mark X1, X2), mark# cons(X1, X2) -> cons#(mark X1, X2), mark# from X -> mark# X, mark# from X -> active# from mark X, mark# from X -> from# mark X, mark# s X -> mark# X, mark# s X -> active# s mark X, mark# s X -> s# mark X, active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, active# 2nd cons(X, X1) -> mark# 2nd cons1(X, X1), active# 2nd cons(X, X1) -> 2nd# cons1(X, X1), active# 2nd cons(X, X1) -> cons1#(X, X1), active# from X -> mark# cons(X, from s X), active# from X -> cons#(X, from s X), active# from X -> from# s X, active# from X -> s# X, 2nd# mark X -> 2nd# X, 2nd# active X -> 2nd# X, cons1#(X1, mark X2) -> cons1#(X1, X2), cons1#(X1, active X2) -> cons1#(X1, X2), cons1#(mark X1, X2) -> cons1#(X1, X2), cons1#(active X1, X2) -> cons1#(X1, X2), cons#(X1, mark X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2), cons#(active X1, X2) -> cons#(X1, X2), from# mark X -> from# X, from# active X -> from# X, s# mark X -> s# X, s# active X -> s# X} TRS: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} UR: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X, a(x, y) -> x, a(x, y) -> y} EDG: { (mark# from X -> from# mark X, from# active X -> from# X) (mark# from X -> from# mark X, from# mark X -> from# X) (active# 2nd cons(X, X1) -> cons1#(X, X1), cons1#(active X1, X2) -> cons1#(X1, X2)) (active# 2nd cons(X, X1) -> cons1#(X, X1), cons1#(mark X1, X2) -> cons1#(X1, X2)) (active# 2nd cons(X, X1) -> cons1#(X, X1), cons1#(X1, active X2) -> cons1#(X1, X2)) (active# 2nd cons(X, X1) -> cons1#(X, X1), cons1#(X1, mark X2) -> cons1#(X1, X2)) (active# from X -> mark# cons(X, from s X), mark# cons(X1, X2) -> cons#(mark X1, X2)) (active# from X -> mark# cons(X, from s X), mark# cons(X1, X2) -> active# cons(mark X1, X2)) (active# from X -> mark# cons(X, from s X), mark# cons(X1, X2) -> mark# X1) (mark# from X -> mark# X, mark# s X -> s# mark X) (mark# from X -> mark# X, mark# s X -> active# s mark X) (mark# from X -> mark# X, mark# s X -> mark# X) (mark# from X -> mark# X, mark# from X -> from# mark X) (mark# from X -> mark# X, mark# from X -> active# from mark X) (mark# from X -> mark# X, mark# from X -> mark# X) (mark# from X -> mark# X, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# from X -> mark# X, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# from X -> mark# X, mark# cons(X1, X2) -> mark# X1) (mark# from X -> mark# X, mark# cons1(X1, X2) -> cons1#(mark X1, mark X2)) (mark# from X -> mark# X, mark# cons1(X1, X2) -> active# cons1(mark X1, mark X2)) (mark# from X -> mark# X, mark# cons1(X1, X2) -> mark# X2) (mark# from X -> mark# X, mark# cons1(X1, X2) -> mark# X1) (mark# from X -> mark# X, mark# 2nd X -> 2nd# mark X) (mark# from X -> mark# X, mark# 2nd X -> active# 2nd mark X) (mark# from X -> mark# X, mark# 2nd X -> mark# X) (active# from X -> s# X, s# active X -> s# X) (active# from X -> s# X, s# mark X -> s# X) (2nd# active X -> 2nd# X, 2nd# active X -> 2nd# X) (2nd# active X -> 2nd# X, 2nd# mark X -> 2nd# X) (from# active X -> from# X, from# active X -> from# X) (from# active X -> from# X, from# mark X -> from# X) (s# active X -> s# X, s# active X -> s# X) (s# active X -> s# X, s# mark X -> s# X) (cons1#(X1, active X2) -> cons1#(X1, X2), cons1#(active X1, X2) -> cons1#(X1, X2)) (cons1#(X1, active X2) -> cons1#(X1, X2), cons1#(mark X1, X2) -> cons1#(X1, X2)) (cons1#(X1, active X2) -> cons1#(X1, X2), cons1#(X1, active X2) -> cons1#(X1, X2)) (cons1#(X1, active X2) -> cons1#(X1, X2), cons1#(X1, mark X2) -> cons1#(X1, X2)) (cons1#(active X1, X2) -> cons1#(X1, X2), cons1#(active X1, X2) -> cons1#(X1, X2)) (cons1#(active X1, X2) -> cons1#(X1, X2), cons1#(mark X1, X2) -> cons1#(X1, X2)) (cons1#(active X1, X2) -> cons1#(X1, X2), cons1#(X1, active X2) -> cons1#(X1, X2)) (cons1#(active X1, X2) -> cons1#(X1, X2), cons1#(X1, mark X2) -> cons1#(X1, X2)) (cons#(X1, active X2) -> cons#(X1, X2), cons#(active X1, X2) -> cons#(X1, X2)) (cons#(X1, active X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (cons#(X1, active X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2)) (cons#(X1, active X2) -> cons#(X1, X2), cons#(X1, mark X2) -> cons#(X1, X2)) (cons#(active X1, X2) -> cons#(X1, X2), cons#(active X1, X2) -> cons#(X1, X2)) (cons#(active X1, X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (cons#(active X1, X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2)) (cons#(active X1, X2) -> cons#(X1, X2), cons#(X1, mark X2) -> cons#(X1, X2)) (mark# cons1(X1, X2) -> mark# X2, mark# s X -> s# mark X) (mark# cons1(X1, X2) -> mark# X2, mark# s X -> active# s mark X) (mark# cons1(X1, X2) -> mark# X2, mark# s X -> mark# X) (mark# cons1(X1, X2) -> mark# X2, mark# from X -> from# mark X) (mark# cons1(X1, X2) -> mark# X2, mark# from X -> active# from mark X) (mark# cons1(X1, X2) -> mark# X2, mark# from X -> mark# X) (mark# cons1(X1, X2) -> mark# X2, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# cons1(X1, X2) -> mark# X2, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# cons1(X1, X2) -> mark# X2, mark# cons(X1, X2) -> mark# X1) (mark# cons1(X1, X2) -> mark# X2, mark# cons1(X1, X2) -> cons1#(mark X1, mark X2)) (mark# cons1(X1, X2) -> mark# X2, mark# cons1(X1, X2) -> active# cons1(mark X1, mark X2)) (mark# cons1(X1, X2) -> mark# X2, mark# cons1(X1, X2) -> mark# X2) (mark# cons1(X1, X2) -> mark# X2, mark# cons1(X1, X2) -> mark# X1) (mark# cons1(X1, X2) -> mark# X2, mark# 2nd X -> 2nd# mark X) (mark# cons1(X1, X2) -> mark# X2, mark# 2nd X -> active# 2nd mark X) (mark# cons1(X1, X2) -> mark# X2, mark# 2nd X -> mark# X) (mark# 2nd X -> active# 2nd mark X, active# 2nd cons(X, X1) -> cons1#(X, X1)) (mark# 2nd X -> active# 2nd mark X, active# 2nd cons(X, X1) -> 2nd# cons1(X, X1)) (mark# 2nd X -> active# 2nd mark X, active# 2nd cons(X, X1) -> mark# 2nd cons1(X, X1)) (mark# 2nd X -> active# 2nd mark X, active# 2nd cons1(X, cons(Y, Z)) -> mark# Y) (active# from X -> cons#(X, from s X), cons#(active X1, X2) -> cons#(X1, X2)) (active# from X -> cons#(X, from s X), cons#(mark X1, X2) -> cons#(X1, X2)) (mark# cons(X1, X2) -> mark# X1, mark# s X -> s# mark X) (mark# cons(X1, X2) -> mark# X1, mark# s X -> active# s mark X) (mark# cons(X1, X2) -> mark# X1, mark# s X -> mark# X) (mark# cons(X1, X2) -> mark# X1, mark# from X -> from# mark X) (mark# cons(X1, X2) -> mark# X1, mark# from X -> active# from mark X) (mark# cons(X1, X2) -> mark# X1, mark# from X -> mark# X) (mark# cons(X1, X2) -> mark# X1, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# cons(X1, X2) -> mark# X1, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# cons(X1, X2) -> mark# X1, mark# cons(X1, X2) -> mark# X1) (mark# cons(X1, X2) -> mark# X1, mark# cons1(X1, X2) -> cons1#(mark X1, mark X2)) (mark# cons(X1, X2) -> mark# X1, mark# cons1(X1, X2) -> active# cons1(mark X1, mark X2)) (mark# cons(X1, X2) -> mark# X1, mark# cons1(X1, X2) -> mark# X2) (mark# cons(X1, X2) -> mark# X1, mark# cons1(X1, X2) -> mark# X1) (mark# cons(X1, X2) -> mark# X1, mark# 2nd X -> 2nd# mark X) (mark# cons(X1, X2) -> mark# X1, mark# 2nd X -> active# 2nd mark X) (mark# cons(X1, X2) -> mark# X1, mark# 2nd X -> mark# X) (mark# cons1(X1, X2) -> mark# X1, mark# 2nd X -> mark# X) (mark# cons1(X1, X2) -> mark# X1, mark# 2nd X -> active# 2nd mark X) (mark# cons1(X1, X2) -> mark# X1, mark# 2nd X -> 2nd# mark X) (mark# cons1(X1, X2) -> mark# X1, mark# cons1(X1, X2) -> mark# X1) (mark# cons1(X1, X2) -> mark# X1, mark# cons1(X1, X2) -> mark# X2) (mark# cons1(X1, X2) -> mark# X1, mark# cons1(X1, X2) -> active# cons1(mark X1, mark X2)) (mark# cons1(X1, X2) -> mark# X1, mark# cons1(X1, X2) -> cons1#(mark X1, mark X2)) (mark# cons1(X1, X2) -> mark# X1, mark# cons(X1, X2) -> mark# X1) (mark# cons1(X1, X2) -> mark# X1, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# cons1(X1, X2) -> mark# X1, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# cons1(X1, X2) -> mark# X1, mark# from X -> mark# X) (mark# cons1(X1, X2) -> mark# X1, mark# from X -> active# from mark X) (mark# cons1(X1, X2) -> mark# X1, mark# from X -> from# mark X) (mark# cons1(X1, X2) -> mark# X1, mark# s X -> mark# X) (mark# cons1(X1, X2) -> mark# X1, mark# s X -> active# s mark X) (mark# cons1(X1, X2) -> mark# X1, mark# s X -> s# mark X) (active# 2nd cons(X, X1) -> mark# 2nd cons1(X, X1), mark# 2nd X -> mark# X) (active# 2nd cons(X, X1) -> mark# 2nd cons1(X, X1), mark# 2nd X -> active# 2nd mark X) (active# 2nd cons(X, X1) -> mark# 2nd cons1(X, X1), mark# 2nd X -> 2nd# mark X) (mark# from X -> active# from mark X, active# from X -> mark# cons(X, from s X)) (mark# from X -> active# from mark X, active# from X -> cons#(X, from s X)) (mark# from X -> active# from mark X, active# from X -> from# s X) (mark# from X -> active# from mark X, active# from X -> s# X) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# 2nd X -> mark# X) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# 2nd X -> active# 2nd mark X) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# 2nd X -> 2nd# mark X) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# cons1(X1, X2) -> mark# X1) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# cons1(X1, X2) -> mark# X2) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# cons1(X1, X2) -> active# cons1(mark X1, mark X2)) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# cons1(X1, X2) -> cons1#(mark X1, mark X2)) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# cons(X1, X2) -> mark# X1) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# cons(X1, X2) -> cons#(mark X1, X2)) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# from X -> mark# X) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# from X -> active# from mark X) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# from X -> from# mark X) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# s X -> mark# X) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# s X -> active# s mark X) (active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, mark# s X -> s# mark X) (mark# cons1(X1, X2) -> cons1#(mark X1, mark X2), cons1#(X1, mark X2) -> cons1#(X1, X2)) (mark# cons1(X1, X2) -> cons1#(mark X1, mark X2), cons1#(X1, active X2) -> cons1#(X1, X2)) (mark# cons1(X1, X2) -> cons1#(mark X1, mark X2), cons1#(mark X1, X2) -> cons1#(X1, X2)) (mark# cons1(X1, X2) -> cons1#(mark X1, mark X2), cons1#(active X1, X2) -> cons1#(X1, X2)) (cons#(mark X1, X2) -> cons#(X1, X2), cons#(X1, mark X2) -> cons#(X1, X2)) (cons#(mark X1, X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2)) (cons#(mark X1, X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (cons#(mark X1, X2) -> cons#(X1, X2), cons#(active X1, X2) -> cons#(X1, X2)) (cons#(X1, mark X2) -> cons#(X1, X2), cons#(X1, mark X2) -> cons#(X1, X2)) (cons#(X1, mark X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2)) (cons#(X1, mark X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (cons#(X1, mark X2) -> cons#(X1, X2), cons#(active X1, X2) -> cons#(X1, X2)) (cons1#(mark X1, X2) -> cons1#(X1, X2), cons1#(X1, mark X2) -> cons1#(X1, X2)) (cons1#(mark X1, X2) -> cons1#(X1, X2), cons1#(X1, active X2) -> cons1#(X1, X2)) (cons1#(mark X1, X2) -> cons1#(X1, X2), cons1#(mark X1, X2) -> cons1#(X1, X2)) (cons1#(mark X1, X2) -> cons1#(X1, X2), cons1#(active X1, X2) -> cons1#(X1, X2)) (cons1#(X1, mark X2) -> cons1#(X1, X2), cons1#(X1, mark X2) -> cons1#(X1, X2)) (cons1#(X1, mark X2) -> cons1#(X1, X2), cons1#(X1, active X2) -> cons1#(X1, X2)) (cons1#(X1, mark X2) -> cons1#(X1, X2), cons1#(mark X1, X2) -> cons1#(X1, X2)) (cons1#(X1, mark X2) -> cons1#(X1, X2), cons1#(active X1, X2) -> cons1#(X1, X2)) (s# mark X -> s# X, s# mark X -> s# X) (s# mark X -> s# X, s# active X -> s# X) (from# mark X -> from# X, from# mark X -> from# X) (from# mark X -> from# X, from# active X -> from# X) (2nd# mark X -> 2nd# X, 2nd# mark X -> 2nd# X) (2nd# mark X -> 2nd# X, 2nd# active X -> 2nd# X) (mark# s X -> mark# X, mark# 2nd X -> mark# X) (mark# s X -> mark# X, mark# 2nd X -> active# 2nd mark X) (mark# s X -> mark# X, mark# 2nd X -> 2nd# mark X) (mark# s X -> mark# X, mark# cons1(X1, X2) -> mark# X1) (mark# s X -> mark# X, mark# cons1(X1, X2) -> mark# X2) (mark# s X -> mark# X, mark# cons1(X1, X2) -> active# cons1(mark X1, mark X2)) (mark# s X -> mark# X, mark# cons1(X1, X2) -> cons1#(mark X1, mark X2)) (mark# s X -> mark# X, mark# cons(X1, X2) -> mark# X1) (mark# s X -> mark# X, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# s X -> mark# X, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# s X -> mark# X, mark# from X -> mark# X) (mark# s X -> mark# X, mark# from X -> active# from mark X) (mark# s X -> mark# X, mark# from X -> from# mark X) (mark# s X -> mark# X, mark# s X -> mark# X) (mark# s X -> mark# X, mark# s X -> active# s mark X) (mark# s X -> mark# X, mark# s X -> s# mark X) (mark# 2nd X -> mark# X, mark# 2nd X -> mark# X) (mark# 2nd X -> mark# X, mark# 2nd X -> active# 2nd mark X) (mark# 2nd X -> mark# X, mark# 2nd X -> 2nd# mark X) (mark# 2nd X -> mark# X, mark# cons1(X1, X2) -> mark# X1) (mark# 2nd X -> mark# X, mark# cons1(X1, X2) -> mark# X2) (mark# 2nd X -> mark# X, mark# cons1(X1, X2) -> active# cons1(mark X1, mark X2)) (mark# 2nd X -> mark# X, mark# cons1(X1, X2) -> cons1#(mark X1, mark X2)) (mark# 2nd X -> mark# X, mark# cons(X1, X2) -> mark# X1) (mark# 2nd X -> mark# X, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# 2nd X -> mark# X, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# 2nd X -> mark# X, mark# from X -> mark# X) (mark# 2nd X -> mark# X, mark# from X -> active# from mark X) (mark# 2nd X -> mark# X, mark# from X -> from# mark X) (mark# 2nd X -> mark# X, mark# s X -> mark# X) (mark# 2nd X -> mark# X, mark# s X -> active# s mark X) (mark# 2nd X -> mark# X, mark# s X -> s# mark X) (mark# cons(X1, X2) -> cons#(mark X1, X2), cons#(X1, mark X2) -> cons#(X1, X2)) (mark# cons(X1, X2) -> cons#(mark X1, X2), cons#(X1, active X2) -> cons#(X1, X2)) (mark# cons(X1, X2) -> cons#(mark X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (mark# cons(X1, X2) -> cons#(mark X1, X2), cons#(active X1, X2) -> cons#(X1, X2)) (mark# s X -> s# mark X, s# mark X -> s# X) (mark# s X -> s# mark X, s# active X -> s# X) (mark# 2nd X -> 2nd# mark X, 2nd# mark X -> 2nd# X) (mark# 2nd X -> 2nd# mark X, 2nd# active X -> 2nd# X) } STATUS: arrows: 0.867036 SCCS (6): Scc: { mark# 2nd X -> mark# X, mark# 2nd X -> active# 2nd mark X, mark# cons1(X1, X2) -> mark# X1, mark# cons1(X1, X2) -> mark# X2, mark# cons(X1, X2) -> mark# X1, mark# from X -> mark# X, mark# from X -> active# from mark X, mark# s X -> mark# X, active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, active# 2nd cons(X, X1) -> mark# 2nd cons1(X, X1), active# from X -> mark# cons(X, from s X)} Scc: { cons1#(X1, mark X2) -> cons1#(X1, X2), cons1#(X1, active X2) -> cons1#(X1, X2), cons1#(mark X1, X2) -> cons1#(X1, X2), cons1#(active X1, X2) -> cons1#(X1, X2)} Scc: { cons#(X1, mark X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2), cons#(active X1, X2) -> cons#(X1, X2)} Scc: { s# mark X -> s# X, s# active X -> s# X} Scc: { from# mark X -> from# X, from# active X -> from# X} Scc: { 2nd# mark X -> 2nd# X, 2nd# active X -> 2nd# X} SCC (11): Strict: { mark# 2nd X -> mark# X, mark# 2nd X -> active# 2nd mark X, mark# cons1(X1, X2) -> mark# X1, mark# cons1(X1, X2) -> mark# X2, mark# cons(X1, X2) -> mark# X1, mark# from X -> mark# X, mark# from X -> active# from mark X, mark# s X -> mark# X, active# 2nd cons1(X, cons(Y, Z)) -> mark# Y, active# 2nd cons(X, X1) -> mark# 2nd cons1(X, X1), active# from X -> mark# cons(X, from s X)} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} Fail SCC (4): Strict: { cons1#(X1, mark X2) -> cons1#(X1, X2), cons1#(X1, active X2) -> cons1#(X1, X2), cons1#(mark X1, X2) -> cons1#(X1, X2), cons1#(active X1, X2) -> cons1#(X1, X2)} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} POLY: Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true Interpretation: [cons1](x0, x1) = 0, [cons](x0, x1) = x0, [mark](x0) = x0, [active](x0) = x0 + 1, [2nd](x0) = 0, [from](x0) = 0, [s](x0) = 0, [cons1#](x0, x1) = x0 Strict: cons1#(active X1, X2) -> cons1#(X1, X2) 1 + 1X1 + 0X2 >= 0 + 1X1 + 0X2 cons1#(mark X1, X2) -> cons1#(X1, X2) 0 + 1X1 + 0X2 >= 0 + 1X1 + 0X2 cons1#(X1, active X2) -> cons1#(X1, X2) 0 + 1X1 + 0X2 >= 0 + 1X1 + 0X2 cons1#(X1, mark X2) -> cons1#(X1, X2) 0 + 1X1 + 0X2 >= 0 + 1X1 + 0X2 Weak: s active X -> s X 0 + 0X >= 0 + 0X s mark X -> s X 0 + 0X >= 0 + 0X from active X -> from X 0 + 0X >= 0 + 0X from mark X -> from X 0 + 0X >= 0 + 0X cons(active X1, X2) -> cons(X1, X2) 0 + 0X1 + 1X2 >= 0 + 0X1 + 1X2 cons(mark X1, X2) -> cons(X1, X2) 0 + 0X1 + 1X2 >= 0 + 0X1 + 1X2 cons(X1, active X2) -> cons(X1, X2) 1 + 0X1 + 1X2 >= 0 + 0X1 + 1X2 cons(X1, mark X2) -> cons(X1, X2) 0 + 0X1 + 1X2 >= 0 + 0X1 + 1X2 cons1(active X1, X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(mark X1, X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(X1, active X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(X1, mark X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 2nd active X -> 2nd X 0 + 0X >= 0 + 0X 2nd mark X -> 2nd X 0 + 0X >= 0 + 0X active from X -> mark cons(X, from s X) 1 + 0X >= 0 + 0X active 2nd cons(X, X1) -> mark 2nd cons1(X, X1) 1 + 0X + 0X1 >= 0 + 0X + 0X1 active 2nd cons1(X, cons(Y, Z)) -> mark Y 1 + 0Y + 0X + 0Z >= 0 + 1Y mark s X -> active s mark X 0 + 0X >= 1 + 0X mark from X -> active from mark X 0 + 0X >= 1 + 0X mark cons(X1, X2) -> active cons(mark X1, X2) 0 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 mark cons1(X1, X2) -> active cons1(mark X1, mark X2) 0 + 0X1 + 0X2 >= 1 + 0X1 + 0X2 mark 2nd X -> active 2nd mark X 0 + 0X >= 1 + 0X SCCS (1): Scc: { cons1#(X1, mark X2) -> cons1#(X1, X2), cons1#(X1, active X2) -> cons1#(X1, X2), cons1#(mark X1, X2) -> cons1#(X1, X2)} SCC (3): Strict: { cons1#(X1, mark X2) -> cons1#(X1, X2), cons1#(X1, active X2) -> cons1#(X1, X2), cons1#(mark X1, X2) -> cons1#(X1, X2)} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} POLY: Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true Interpretation: [cons1](x0, x1) = x0 + 1, [cons](x0, x1) = x0 + 1, [mark](x0) = x0 + 1, [active](x0) = x0, [2nd](x0) = x0 + 1, [from](x0) = x0 + 1, [s](x0) = 0, [cons1#](x0, x1) = x0 Strict: cons1#(mark X1, X2) -> cons1#(X1, X2) 1 + 1X1 + 0X2 >= 0 + 1X1 + 0X2 cons1#(X1, active X2) -> cons1#(X1, X2) 0 + 1X1 + 0X2 >= 0 + 1X1 + 0X2 cons1#(X1, mark X2) -> cons1#(X1, X2) 0 + 1X1 + 0X2 >= 0 + 1X1 + 0X2 Weak: s active X -> s X 0 + 0X >= 0 + 0X s mark X -> s X 0 + 0X >= 0 + 0X from active X -> from X 1 + 1X >= 1 + 1X from mark X -> from X 2 + 1X >= 1 + 1X cons(active X1, X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(mark X1, X2) -> cons(X1, X2) 2 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(X1, active X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(X1, mark X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons1(active X1, X2) -> cons1(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons1(mark X1, X2) -> cons1(X1, X2) 2 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons1(X1, active X2) -> cons1(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons1(X1, mark X2) -> cons1(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 2nd active X -> 2nd X 1 + 1X >= 1 + 1X 2nd mark X -> 2nd X 2 + 1X >= 1 + 1X active from X -> mark cons(X, from s X) 1 + 1X >= 2 + 1X active 2nd cons(X, X1) -> mark 2nd cons1(X, X1) 2 + 1X + 0X1 >= 3 + 1X + 0X1 active 2nd cons1(X, cons(Y, Z)) -> mark Y 2 + 0Y + 1X + 0Z >= 1 + 1Y mark s X -> active s mark X 1 + 0X >= 0 + 0X mark from X -> active from mark X 2 + 1X >= 2 + 1X mark cons(X1, X2) -> active cons(mark X1, X2) 2 + 1X1 + 0X2 >= 2 + 1X1 + 0X2 mark cons1(X1, X2) -> active cons1(mark X1, mark X2) 2 + 1X1 + 0X2 >= 2 + 1X1 + 0X2 mark 2nd X -> active 2nd mark X 2 + 1X >= 2 + 1X SCCS (1): Scc: { cons1#(X1, mark X2) -> cons1#(X1, X2), cons1#(X1, active X2) -> cons1#(X1, X2)} SCC (2): Strict: { cons1#(X1, mark X2) -> cons1#(X1, X2), cons1#(X1, active X2) -> cons1#(X1, X2)} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} POLY: Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true Interpretation: [cons1](x0, x1) = 0, [cons](x0, x1) = 0, [mark](x0) = x0, [active](x0) = x0 + 1, [2nd](x0) = 0, [from](x0) = 0, [s](x0) = 0, [cons1#](x0, x1) = x0 Strict: cons1#(X1, active X2) -> cons1#(X1, X2) 1 + 0X1 + 1X2 >= 0 + 0X1 + 1X2 cons1#(X1, mark X2) -> cons1#(X1, X2) 0 + 0X1 + 1X2 >= 0 + 0X1 + 1X2 Weak: s active X -> s X 0 + 0X >= 0 + 0X s mark X -> s X 0 + 0X >= 0 + 0X from active X -> from X 0 + 0X >= 0 + 0X from mark X -> from X 0 + 0X >= 0 + 0X cons(active X1, X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(mark X1, X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(X1, active X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(X1, mark X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(active X1, X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(mark X1, X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(X1, active X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(X1, mark X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 2nd active X -> 2nd X 0 + 0X >= 0 + 0X 2nd mark X -> 2nd X 0 + 0X >= 0 + 0X active from X -> mark cons(X, from s X) 1 + 0X >= 0 + 0X active 2nd cons(X, X1) -> mark 2nd cons1(X, X1) 1 + 0X + 0X1 >= 0 + 0X + 0X1 active 2nd cons1(X, cons(Y, Z)) -> mark Y 1 + 0Y + 0X + 0Z >= 0 + 1Y mark s X -> active s mark X 0 + 0X >= 1 + 0X mark from X -> active from mark X 0 + 0X >= 1 + 0X mark cons(X1, X2) -> active cons(mark X1, X2) 0 + 0X1 + 0X2 >= 1 + 0X1 + 0X2 mark cons1(X1, X2) -> active cons1(mark X1, mark X2) 0 + 0X1 + 0X2 >= 1 + 0X1 + 0X2 mark 2nd X -> active 2nd mark X 0 + 0X >= 1 + 0X SCCS (1): Scc: {cons1#(X1, mark X2) -> cons1#(X1, X2)} SCC (1): Strict: {cons1#(X1, mark X2) -> cons1#(X1, X2)} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} POLY: Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true Interpretation: [cons1](x0, x1) = x0 + 1, [cons](x0, x1) = x0 + 1, [mark](x0) = x0 + 1, [active](x0) = x0, [2nd](x0) = x0 + 1, [from](x0) = x0 + 1, [s](x0) = x0 + 1, [cons1#](x0, x1) = x0 Strict: cons1#(X1, mark X2) -> cons1#(X1, X2) 1 + 0X1 + 1X2 >= 0 + 0X1 + 1X2 Weak: s active X -> s X 1 + 1X >= 1 + 1X s mark X -> s X 2 + 1X >= 1 + 1X from active X -> from X 1 + 1X >= 1 + 1X from mark X -> from X 2 + 1X >= 1 + 1X cons(active X1, X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(mark X1, X2) -> cons(X1, X2) 2 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(X1, active X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(X1, mark X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons1(active X1, X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(mark X1, X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(X1, active X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(X1, mark X2) -> cons1(X1, X2) 2 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 2nd active X -> 2nd X 1 + 1X >= 1 + 1X 2nd mark X -> 2nd X 2 + 1X >= 1 + 1X active from X -> mark cons(X, from s X) 1 + 1X >= 2 + 1X active 2nd cons(X, X1) -> mark 2nd cons1(X, X1) 2 + 1X + 0X1 >= 3 + 0X + 1X1 active 2nd cons1(X, cons(Y, Z)) -> mark Y 3 + 1Y + 0X + 0Z >= 1 + 1Y mark s X -> active s mark X 2 + 1X >= 2 + 1X mark from X -> active from mark X 2 + 1X >= 2 + 1X mark cons(X1, X2) -> active cons(mark X1, X2) 2 + 1X1 + 0X2 >= 2 + 1X1 + 0X2 mark cons1(X1, X2) -> active cons1(mark X1, mark X2) 2 + 0X1 + 1X2 >= 2 + 0X1 + 1X2 mark 2nd X -> active 2nd mark X 2 + 1X >= 2 + 1X Qed SCC (4): Strict: { cons#(X1, mark X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2), cons#(active X1, X2) -> cons#(X1, X2)} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} POLY: Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true Interpretation: [cons1](x0, x1) = 0, [cons](x0, x1) = x0, [mark](x0) = x0, [active](x0) = x0 + 1, [2nd](x0) = 0, [from](x0) = 0, [s](x0) = 0, [cons#](x0, x1) = x0 Strict: cons#(active X1, X2) -> cons#(X1, X2) 1 + 1X1 + 0X2 >= 0 + 1X1 + 0X2 cons#(mark X1, X2) -> cons#(X1, X2) 0 + 1X1 + 0X2 >= 0 + 1X1 + 0X2 cons#(X1, active X2) -> cons#(X1, X2) 0 + 1X1 + 0X2 >= 0 + 1X1 + 0X2 cons#(X1, mark X2) -> cons#(X1, X2) 0 + 1X1 + 0X2 >= 0 + 1X1 + 0X2 Weak: s active X -> s X 0 + 0X >= 0 + 0X s mark X -> s X 0 + 0X >= 0 + 0X from active X -> from X 0 + 0X >= 0 + 0X from mark X -> from X 0 + 0X >= 0 + 0X cons(active X1, X2) -> cons(X1, X2) 0 + 0X1 + 1X2 >= 0 + 0X1 + 1X2 cons(mark X1, X2) -> cons(X1, X2) 0 + 0X1 + 1X2 >= 0 + 0X1 + 1X2 cons(X1, active X2) -> cons(X1, X2) 1 + 0X1 + 1X2 >= 0 + 0X1 + 1X2 cons(X1, mark X2) -> cons(X1, X2) 0 + 0X1 + 1X2 >= 0 + 0X1 + 1X2 cons1(active X1, X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(mark X1, X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(X1, active X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(X1, mark X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 2nd active X -> 2nd X 0 + 0X >= 0 + 0X 2nd mark X -> 2nd X 0 + 0X >= 0 + 0X active from X -> mark cons(X, from s X) 1 + 0X >= 0 + 0X active 2nd cons(X, X1) -> mark 2nd cons1(X, X1) 1 + 0X + 0X1 >= 0 + 0X + 0X1 active 2nd cons1(X, cons(Y, Z)) -> mark Y 1 + 0Y + 0X + 0Z >= 0 + 1Y mark s X -> active s mark X 0 + 0X >= 1 + 0X mark from X -> active from mark X 0 + 0X >= 1 + 0X mark cons(X1, X2) -> active cons(mark X1, X2) 0 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 mark cons1(X1, X2) -> active cons1(mark X1, mark X2) 0 + 0X1 + 0X2 >= 1 + 0X1 + 0X2 mark 2nd X -> active 2nd mark X 0 + 0X >= 1 + 0X SCCS (1): Scc: { cons#(X1, mark X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)} SCC (3): Strict: { cons#(X1, mark X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} POLY: Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true Interpretation: [cons1](x0, x1) = x0 + 1, [cons](x0, x1) = x0 + 1, [mark](x0) = x0 + 1, [active](x0) = x0, [2nd](x0) = x0 + 1, [from](x0) = x0 + 1, [s](x0) = 0, [cons#](x0, x1) = x0 Strict: cons#(mark X1, X2) -> cons#(X1, X2) 1 + 1X1 + 0X2 >= 0 + 1X1 + 0X2 cons#(X1, active X2) -> cons#(X1, X2) 0 + 1X1 + 0X2 >= 0 + 1X1 + 0X2 cons#(X1, mark X2) -> cons#(X1, X2) 0 + 1X1 + 0X2 >= 0 + 1X1 + 0X2 Weak: s active X -> s X 0 + 0X >= 0 + 0X s mark X -> s X 0 + 0X >= 0 + 0X from active X -> from X 1 + 1X >= 1 + 1X from mark X -> from X 2 + 1X >= 1 + 1X cons(active X1, X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(mark X1, X2) -> cons(X1, X2) 2 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(X1, active X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(X1, mark X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons1(active X1, X2) -> cons1(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons1(mark X1, X2) -> cons1(X1, X2) 2 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons1(X1, active X2) -> cons1(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons1(X1, mark X2) -> cons1(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 2nd active X -> 2nd X 1 + 1X >= 1 + 1X 2nd mark X -> 2nd X 2 + 1X >= 1 + 1X active from X -> mark cons(X, from s X) 1 + 1X >= 2 + 1X active 2nd cons(X, X1) -> mark 2nd cons1(X, X1) 2 + 1X + 0X1 >= 3 + 1X + 0X1 active 2nd cons1(X, cons(Y, Z)) -> mark Y 2 + 0Y + 1X + 0Z >= 1 + 1Y mark s X -> active s mark X 1 + 0X >= 0 + 0X mark from X -> active from mark X 2 + 1X >= 2 + 1X mark cons(X1, X2) -> active cons(mark X1, X2) 2 + 1X1 + 0X2 >= 2 + 1X1 + 0X2 mark cons1(X1, X2) -> active cons1(mark X1, mark X2) 2 + 1X1 + 0X2 >= 2 + 1X1 + 0X2 mark 2nd X -> active 2nd mark X 2 + 1X >= 2 + 1X SCCS (1): Scc: { cons#(X1, mark X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2)} SCC (2): Strict: { cons#(X1, mark X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2)} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} POLY: Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true Interpretation: [cons1](x0, x1) = 0, [cons](x0, x1) = 0, [mark](x0) = x0, [active](x0) = x0 + 1, [2nd](x0) = 0, [from](x0) = 0, [s](x0) = 0, [cons#](x0, x1) = x0 Strict: cons#(X1, active X2) -> cons#(X1, X2) 1 + 0X1 + 1X2 >= 0 + 0X1 + 1X2 cons#(X1, mark X2) -> cons#(X1, X2) 0 + 0X1 + 1X2 >= 0 + 0X1 + 1X2 Weak: s active X -> s X 0 + 0X >= 0 + 0X s mark X -> s X 0 + 0X >= 0 + 0X from active X -> from X 0 + 0X >= 0 + 0X from mark X -> from X 0 + 0X >= 0 + 0X cons(active X1, X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(mark X1, X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(X1, active X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(X1, mark X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(active X1, X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(mark X1, X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(X1, active X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(X1, mark X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 2nd active X -> 2nd X 0 + 0X >= 0 + 0X 2nd mark X -> 2nd X 0 + 0X >= 0 + 0X active from X -> mark cons(X, from s X) 1 + 0X >= 0 + 0X active 2nd cons(X, X1) -> mark 2nd cons1(X, X1) 1 + 0X + 0X1 >= 0 + 0X + 0X1 active 2nd cons1(X, cons(Y, Z)) -> mark Y 1 + 0Y + 0X + 0Z >= 0 + 1Y mark s X -> active s mark X 0 + 0X >= 1 + 0X mark from X -> active from mark X 0 + 0X >= 1 + 0X mark cons(X1, X2) -> active cons(mark X1, X2) 0 + 0X1 + 0X2 >= 1 + 0X1 + 0X2 mark cons1(X1, X2) -> active cons1(mark X1, mark X2) 0 + 0X1 + 0X2 >= 1 + 0X1 + 0X2 mark 2nd X -> active 2nd mark X 0 + 0X >= 1 + 0X SCCS (1): Scc: {cons#(X1, mark X2) -> cons#(X1, X2)} SCC (1): Strict: {cons#(X1, mark X2) -> cons#(X1, X2)} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} POLY: Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true Interpretation: [cons1](x0, x1) = x0 + 1, [cons](x0, x1) = x0 + 1, [mark](x0) = x0 + 1, [active](x0) = x0, [2nd](x0) = x0 + 1, [from](x0) = x0 + 1, [s](x0) = x0 + 1, [cons#](x0, x1) = x0 Strict: cons#(X1, mark X2) -> cons#(X1, X2) 1 + 0X1 + 1X2 >= 0 + 0X1 + 1X2 Weak: s active X -> s X 1 + 1X >= 1 + 1X s mark X -> s X 2 + 1X >= 1 + 1X from active X -> from X 1 + 1X >= 1 + 1X from mark X -> from X 2 + 1X >= 1 + 1X cons(active X1, X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(mark X1, X2) -> cons(X1, X2) 2 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(X1, active X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(X1, mark X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons1(active X1, X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(mark X1, X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(X1, active X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(X1, mark X2) -> cons1(X1, X2) 2 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 2nd active X -> 2nd X 1 + 1X >= 1 + 1X 2nd mark X -> 2nd X 2 + 1X >= 1 + 1X active from X -> mark cons(X, from s X) 1 + 1X >= 2 + 1X active 2nd cons(X, X1) -> mark 2nd cons1(X, X1) 2 + 1X + 0X1 >= 3 + 0X + 1X1 active 2nd cons1(X, cons(Y, Z)) -> mark Y 3 + 1Y + 0X + 0Z >= 1 + 1Y mark s X -> active s mark X 2 + 1X >= 2 + 1X mark from X -> active from mark X 2 + 1X >= 2 + 1X mark cons(X1, X2) -> active cons(mark X1, X2) 2 + 1X1 + 0X2 >= 2 + 1X1 + 0X2 mark cons1(X1, X2) -> active cons1(mark X1, mark X2) 2 + 0X1 + 1X2 >= 2 + 0X1 + 1X2 mark 2nd X -> active 2nd mark X 2 + 1X >= 2 + 1X Qed SCC (2): Strict: { s# mark X -> s# X, s# active X -> s# X} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} POLY: Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true Interpretation: [cons1](x0, x1) = 0, [cons](x0, x1) = 0, [mark](x0) = x0, [active](x0) = x0 + 1, [2nd](x0) = 0, [from](x0) = 0, [s](x0) = 0, [s#](x0) = x0 Strict: s# active X -> s# X 1 + 1X >= 0 + 1X s# mark X -> s# X 0 + 1X >= 0 + 1X Weak: s active X -> s X 0 + 0X >= 0 + 0X s mark X -> s X 0 + 0X >= 0 + 0X from active X -> from X 0 + 0X >= 0 + 0X from mark X -> from X 0 + 0X >= 0 + 0X cons(active X1, X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(mark X1, X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(X1, active X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(X1, mark X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(active X1, X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(mark X1, X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(X1, active X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(X1, mark X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 2nd active X -> 2nd X 0 + 0X >= 0 + 0X 2nd mark X -> 2nd X 0 + 0X >= 0 + 0X active from X -> mark cons(X, from s X) 1 + 0X >= 0 + 0X active 2nd cons(X, X1) -> mark 2nd cons1(X, X1) 1 + 0X + 0X1 >= 0 + 0X + 0X1 active 2nd cons1(X, cons(Y, Z)) -> mark Y 1 + 0Y + 0X + 0Z >= 0 + 1Y mark s X -> active s mark X 0 + 0X >= 1 + 0X mark from X -> active from mark X 0 + 0X >= 1 + 0X mark cons(X1, X2) -> active cons(mark X1, X2) 0 + 0X1 + 0X2 >= 1 + 0X1 + 0X2 mark cons1(X1, X2) -> active cons1(mark X1, mark X2) 0 + 0X1 + 0X2 >= 1 + 0X1 + 0X2 mark 2nd X -> active 2nd mark X 0 + 0X >= 1 + 0X SCCS (1): Scc: {s# mark X -> s# X} SCC (1): Strict: {s# mark X -> s# X} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} POLY: Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true Interpretation: [cons1](x0, x1) = x0 + 1, [cons](x0, x1) = x0 + 1, [mark](x0) = x0 + 1, [active](x0) = x0, [2nd](x0) = x0 + 1, [from](x0) = x0 + 1, [s](x0) = x0 + 1, [s#](x0) = x0 Strict: s# mark X -> s# X 1 + 1X >= 0 + 1X Weak: s active X -> s X 1 + 1X >= 1 + 1X s mark X -> s X 2 + 1X >= 1 + 1X from active X -> from X 1 + 1X >= 1 + 1X from mark X -> from X 2 + 1X >= 1 + 1X cons(active X1, X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(mark X1, X2) -> cons(X1, X2) 2 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(X1, active X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(X1, mark X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons1(active X1, X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(mark X1, X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(X1, active X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(X1, mark X2) -> cons1(X1, X2) 2 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 2nd active X -> 2nd X 1 + 1X >= 1 + 1X 2nd mark X -> 2nd X 2 + 1X >= 1 + 1X active from X -> mark cons(X, from s X) 1 + 1X >= 2 + 1X active 2nd cons(X, X1) -> mark 2nd cons1(X, X1) 2 + 1X + 0X1 >= 3 + 0X + 1X1 active 2nd cons1(X, cons(Y, Z)) -> mark Y 3 + 1Y + 0X + 0Z >= 1 + 1Y mark s X -> active s mark X 2 + 1X >= 2 + 1X mark from X -> active from mark X 2 + 1X >= 2 + 1X mark cons(X1, X2) -> active cons(mark X1, X2) 2 + 1X1 + 0X2 >= 2 + 1X1 + 0X2 mark cons1(X1, X2) -> active cons1(mark X1, mark X2) 2 + 0X1 + 1X2 >= 2 + 0X1 + 1X2 mark 2nd X -> active 2nd mark X 2 + 1X >= 2 + 1X Qed SCC (2): Strict: { from# mark X -> from# X, from# active X -> from# X} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} POLY: Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true Interpretation: [cons1](x0, x1) = 0, [cons](x0, x1) = 0, [mark](x0) = x0, [active](x0) = x0 + 1, [2nd](x0) = 0, [from](x0) = 0, [s](x0) = 0, [from#](x0) = x0 Strict: from# active X -> from# X 1 + 1X >= 0 + 1X from# mark X -> from# X 0 + 1X >= 0 + 1X Weak: s active X -> s X 0 + 0X >= 0 + 0X s mark X -> s X 0 + 0X >= 0 + 0X from active X -> from X 0 + 0X >= 0 + 0X from mark X -> from X 0 + 0X >= 0 + 0X cons(active X1, X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(mark X1, X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(X1, active X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(X1, mark X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(active X1, X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(mark X1, X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(X1, active X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(X1, mark X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 2nd active X -> 2nd X 0 + 0X >= 0 + 0X 2nd mark X -> 2nd X 0 + 0X >= 0 + 0X active from X -> mark cons(X, from s X) 1 + 0X >= 0 + 0X active 2nd cons(X, X1) -> mark 2nd cons1(X, X1) 1 + 0X + 0X1 >= 0 + 0X + 0X1 active 2nd cons1(X, cons(Y, Z)) -> mark Y 1 + 0Y + 0X + 0Z >= 0 + 1Y mark s X -> active s mark X 0 + 0X >= 1 + 0X mark from X -> active from mark X 0 + 0X >= 1 + 0X mark cons(X1, X2) -> active cons(mark X1, X2) 0 + 0X1 + 0X2 >= 1 + 0X1 + 0X2 mark cons1(X1, X2) -> active cons1(mark X1, mark X2) 0 + 0X1 + 0X2 >= 1 + 0X1 + 0X2 mark 2nd X -> active 2nd mark X 0 + 0X >= 1 + 0X SCCS (1): Scc: {from# mark X -> from# X} SCC (1): Strict: {from# mark X -> from# X} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} POLY: Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true Interpretation: [cons1](x0, x1) = x0 + 1, [cons](x0, x1) = x0 + 1, [mark](x0) = x0 + 1, [active](x0) = x0, [2nd](x0) = x0 + 1, [from](x0) = x0 + 1, [s](x0) = x0 + 1, [from#](x0) = x0 Strict: from# mark X -> from# X 1 + 1X >= 0 + 1X Weak: s active X -> s X 1 + 1X >= 1 + 1X s mark X -> s X 2 + 1X >= 1 + 1X from active X -> from X 1 + 1X >= 1 + 1X from mark X -> from X 2 + 1X >= 1 + 1X cons(active X1, X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(mark X1, X2) -> cons(X1, X2) 2 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(X1, active X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(X1, mark X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons1(active X1, X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(mark X1, X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(X1, active X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(X1, mark X2) -> cons1(X1, X2) 2 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 2nd active X -> 2nd X 1 + 1X >= 1 + 1X 2nd mark X -> 2nd X 2 + 1X >= 1 + 1X active from X -> mark cons(X, from s X) 1 + 1X >= 2 + 1X active 2nd cons(X, X1) -> mark 2nd cons1(X, X1) 2 + 1X + 0X1 >= 3 + 0X + 1X1 active 2nd cons1(X, cons(Y, Z)) -> mark Y 3 + 1Y + 0X + 0Z >= 1 + 1Y mark s X -> active s mark X 2 + 1X >= 2 + 1X mark from X -> active from mark X 2 + 1X >= 2 + 1X mark cons(X1, X2) -> active cons(mark X1, X2) 2 + 1X1 + 0X2 >= 2 + 1X1 + 0X2 mark cons1(X1, X2) -> active cons1(mark X1, mark X2) 2 + 0X1 + 1X2 >= 2 + 0X1 + 1X2 mark 2nd X -> active 2nd mark X 2 + 1X >= 2 + 1X Qed SCC (2): Strict: { 2nd# mark X -> 2nd# X, 2nd# active X -> 2nd# X} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} POLY: Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true Interpretation: [cons1](x0, x1) = 0, [cons](x0, x1) = 0, [mark](x0) = x0, [active](x0) = x0 + 1, [2nd](x0) = 0, [from](x0) = 0, [s](x0) = 0, [2nd#](x0) = x0 Strict: 2nd# active X -> 2nd# X 1 + 1X >= 0 + 1X 2nd# mark X -> 2nd# X 0 + 1X >= 0 + 1X Weak: s active X -> s X 0 + 0X >= 0 + 0X s mark X -> s X 0 + 0X >= 0 + 0X from active X -> from X 0 + 0X >= 0 + 0X from mark X -> from X 0 + 0X >= 0 + 0X cons(active X1, X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(mark X1, X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(X1, active X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons(X1, mark X2) -> cons(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(active X1, X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(mark X1, X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(X1, active X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 cons1(X1, mark X2) -> cons1(X1, X2) 0 + 0X1 + 0X2 >= 0 + 0X1 + 0X2 2nd active X -> 2nd X 0 + 0X >= 0 + 0X 2nd mark X -> 2nd X 0 + 0X >= 0 + 0X active from X -> mark cons(X, from s X) 1 + 0X >= 0 + 0X active 2nd cons(X, X1) -> mark 2nd cons1(X, X1) 1 + 0X + 0X1 >= 0 + 0X + 0X1 active 2nd cons1(X, cons(Y, Z)) -> mark Y 1 + 0Y + 0X + 0Z >= 0 + 1Y mark s X -> active s mark X 0 + 0X >= 1 + 0X mark from X -> active from mark X 0 + 0X >= 1 + 0X mark cons(X1, X2) -> active cons(mark X1, X2) 0 + 0X1 + 0X2 >= 1 + 0X1 + 0X2 mark cons1(X1, X2) -> active cons1(mark X1, mark X2) 0 + 0X1 + 0X2 >= 1 + 0X1 + 0X2 mark 2nd X -> active 2nd mark X 0 + 0X >= 1 + 0X SCCS (1): Scc: {2nd# mark X -> 2nd# X} SCC (1): Strict: {2nd# mark X -> 2nd# X} Weak: { mark 2nd X -> active 2nd mark X, mark cons1(X1, X2) -> active cons1(mark X1, mark X2), mark cons(X1, X2) -> active cons(mark X1, X2), mark from X -> active from mark X, mark s X -> active s mark X, active 2nd cons1(X, cons(Y, Z)) -> mark Y, active 2nd cons(X, X1) -> mark 2nd cons1(X, X1), active from X -> mark cons(X, from s X), 2nd mark X -> 2nd X, 2nd active X -> 2nd X, cons1(X1, mark X2) -> cons1(X1, X2), cons1(X1, active X2) -> cons1(X1, X2), cons1(mark X1, X2) -> cons1(X1, X2), cons1(active X1, X2) -> cons1(X1, X2), cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), from mark X -> from X, from active X -> from X, s mark X -> s X, s active X -> s X} POLY: Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true Interpretation: [cons1](x0, x1) = x0 + 1, [cons](x0, x1) = x0 + 1, [mark](x0) = x0 + 1, [active](x0) = x0, [2nd](x0) = x0 + 1, [from](x0) = x0 + 1, [s](x0) = x0 + 1, [2nd#](x0) = x0 Strict: 2nd# mark X -> 2nd# X 1 + 1X >= 0 + 1X Weak: s active X -> s X 1 + 1X >= 1 + 1X s mark X -> s X 2 + 1X >= 1 + 1X from active X -> from X 1 + 1X >= 1 + 1X from mark X -> from X 2 + 1X >= 1 + 1X cons(active X1, X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(mark X1, X2) -> cons(X1, X2) 2 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(X1, active X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons(X1, mark X2) -> cons(X1, X2) 1 + 1X1 + 0X2 >= 1 + 1X1 + 0X2 cons1(active X1, X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(mark X1, X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(X1, active X2) -> cons1(X1, X2) 1 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 cons1(X1, mark X2) -> cons1(X1, X2) 2 + 0X1 + 1X2 >= 1 + 0X1 + 1X2 2nd active X -> 2nd X 1 + 1X >= 1 + 1X 2nd mark X -> 2nd X 2 + 1X >= 1 + 1X active from X -> mark cons(X, from s X) 1 + 1X >= 2 + 1X active 2nd cons(X, X1) -> mark 2nd cons1(X, X1) 2 + 1X + 0X1 >= 3 + 0X + 1X1 active 2nd cons1(X, cons(Y, Z)) -> mark Y 3 + 1Y + 0X + 0Z >= 1 + 1Y mark s X -> active s mark X 2 + 1X >= 2 + 1X mark from X -> active from mark X 2 + 1X >= 2 + 1X mark cons(X1, X2) -> active cons(mark X1, X2) 2 + 1X1 + 0X2 >= 2 + 1X1 + 0X2 mark cons1(X1, X2) -> active cons1(mark X1, mark X2) 2 + 0X1 + 1X2 >= 2 + 0X1 + 1X2 mark 2nd X -> active 2nd mark X 2 + 1X >= 2 + 1X Qed