- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(app(nil,YS)) -> mark(YS) [2] active(app(cons(X,XS),YS)) -> mark(cons(X,app(XS,YS))) [3] active(from(X)) -> mark(cons(X,from(s(X)))) [4] active(zWadr(nil,YS)) -> mark(nil) [5] active(zWadr(XS,nil)) -> mark(nil) [6] active(zWadr(cons(X,XS),cons(Y,YS))) -> mark(cons(app(Y,cons(X,nil)),zWadr(XS,YS))) [7] active(prefix(L)) -> mark(cons(nil,zWadr(L,prefix(L)))) [8] active(app(X1,X2)) -> app(active(X1),X2) [9] active(app(X1,X2)) -> app(X1,active(X2)) [10] active(cons(X1,X2)) -> cons(active(X1),X2) [11] active(from(X)) -> from(active(X)) [12] active(s(X)) -> s(active(X)) [13] active(zWadr(X1,X2)) -> zWadr(active(X1),X2) [14] active(zWadr(X1,X2)) -> zWadr(X1,active(X2)) [15] active(prefix(X)) -> prefix(active(X)) [16] app(mark(X1),X2) -> mark(app(X1,X2)) [17] app(X1,mark(X2)) -> mark(app(X1,X2)) [18] cons(mark(X1),X2) -> mark(cons(X1,X2)) [19] from(mark(X)) -> mark(from(X)) [20] s(mark(X)) -> mark(s(X)) [21] zWadr(mark(X1),X2) -> mark(zWadr(X1,X2)) [22] zWadr(X1,mark(X2)) -> mark(zWadr(X1,X2)) [23] prefix(mark(X)) -> mark(prefix(X)) [24] proper(app(X1,X2)) -> app(proper(X1),proper(X2)) [25] proper(nil) -> ok(nil) [26] proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) [27] proper(from(X)) -> from(proper(X)) [28] proper(s(X)) -> s(proper(X)) [29] proper(zWadr(X1,X2)) -> zWadr(proper(X1),proper(X2)) [30] proper(prefix(X)) -> prefix(proper(X)) [31] app(ok(X1),ok(X2)) -> ok(app(X1,X2)) [32] cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) [33] from(ok(X)) -> ok(from(X)) [34] s(ok(X)) -> ok(s(X)) [35] zWadr(ok(X1),ok(X2)) -> ok(zWadr(X1,X2)) [36] prefix(ok(X)) -> ok(prefix(X)) [37] top(mark(X)) -> top(proper(X)) [38] top(ok(X)) -> top(active(X)) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 9 components: { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_top(mark(X)) >= Marked_top(proper(X)) ; Marked_top(ok(X)) >= Marked_top(active(X)) ; } + Disjunctions:{ { Marked_top(mark(X)) > Marked_top(proper(X)) ; } { Marked_top(ok(X)) > Marked_top(active(X)) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_top(mark(X)) >= Marked_top(proper(X)) constraint: Marked_top(ok(X)) >= Marked_top(active(X)) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_proper(app(X1,X2)) >= Marked_proper(X1) ; Marked_proper(app(X1,X2)) >= Marked_proper(X2) ; Marked_proper(cons(X1,X2)) >= Marked_proper(X1) ; Marked_proper(cons(X1,X2)) >= Marked_proper(X2) ; Marked_proper(from(X)) >= Marked_proper(X) ; Marked_proper(s(X)) >= Marked_proper(X) ; Marked_proper(zWadr(X1,X2)) >= Marked_proper(X1) ; Marked_proper(zWadr(X1,X2)) >= Marked_proper(X2) ; Marked_proper(prefix(X)) >= Marked_proper(X) ; } + Disjunctions:{ { Marked_proper(app(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(app(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(cons(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(cons(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(from(X)) > Marked_proper(X) ; } { Marked_proper(s(X)) > Marked_proper(X) ; } { Marked_proper(zWadr(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(zWadr(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(prefix(X)) > Marked_proper(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_proper(app(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(app(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(cons(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(cons(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(from(X)) >= Marked_proper(X) constraint: Marked_proper(s(X)) >= Marked_proper(X) constraint: Marked_proper(zWadr(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(zWadr(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(prefix(X)) >= Marked_proper(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_active(app(X1,X2)) >= Marked_active(X1) ; Marked_active(app(X1,X2)) >= Marked_active(X2) ; Marked_active(cons(X1,X2)) >= Marked_active(X1) ; Marked_active(from(X)) >= Marked_active(X) ; Marked_active(s(X)) >= Marked_active(X) ; Marked_active(zWadr(X1,X2)) >= Marked_active(X1) ; Marked_active(zWadr(X1,X2)) >= Marked_active(X2) ; Marked_active(prefix(X)) >= Marked_active(X) ; } + Disjunctions:{ { Marked_active(app(X1,X2)) > Marked_active(X1) ; } { Marked_active(app(X1,X2)) > Marked_active(X2) ; } { Marked_active(cons(X1,X2)) > Marked_active(X1) ; } { Marked_active(from(X)) > Marked_active(X) ; } { Marked_active(s(X)) > Marked_active(X) ; } { Marked_active(zWadr(X1,X2)) > Marked_active(X1) ; } { Marked_active(zWadr(X1,X2)) > Marked_active(X2) ; } { Marked_active(prefix(X)) > Marked_active(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_active(app(X1,X2)) >= Marked_active(X1) constraint: Marked_active(app(X1,X2)) >= Marked_active(X2) constraint: Marked_active(cons(X1,X2)) >= Marked_active(X1) constraint: Marked_active(from(X)) >= Marked_active(X) constraint: Marked_active(s(X)) >= Marked_active(X) constraint: Marked_active(zWadr(X1,X2)) >= Marked_active(X1) constraint: Marked_active(zWadr(X1,X2)) >= Marked_active(X2) constraint: Marked_active(prefix(X)) >= Marked_active(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_app(mark(X1),X2) >= Marked_app(X1,X2) ; Marked_app(ok(X1),ok(X2)) >= Marked_app(X1,X2) ; Marked_app(X1,mark(X2)) >= Marked_app(X1,X2) ; } + Disjunctions:{ { Marked_app(mark(X1),X2) > Marked_app(X1,X2) ; } { Marked_app(ok(X1),ok(X2)) > Marked_app(X1,X2) ; } { Marked_app(X1,mark(X2)) > Marked_app(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_app(mark(X1),X2) >= Marked_app(X1,X2) constraint: Marked_app(ok(X1),ok(X2)) >= Marked_app(X1,X2) constraint: Marked_app(X1,mark(X2)) >= Marked_app(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) ; Marked_cons(ok(X1),ok(X2)) >= Marked_cons(X1,X2) ; } + Disjunctions:{ { Marked_cons(mark(X1),X2) > Marked_cons(X1,X2) ; } { Marked_cons(ok(X1),ok(X2)) > Marked_cons(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) constraint: Marked_cons(ok(X1),ok(X2)) >= Marked_cons(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_from(mark(X)) >= Marked_from(X) ; Marked_from(ok(X)) >= Marked_from(X) ; } + Disjunctions:{ { Marked_from(mark(X)) > Marked_from(X) ; } { Marked_from(ok(X)) > Marked_from(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_from(mark(X)) >= Marked_from(X) constraint: Marked_from(ok(X)) >= Marked_from(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_s(mark(X)) >= Marked_s(X) ; Marked_s(ok(X)) >= Marked_s(X) ; } + Disjunctions:{ { Marked_s(mark(X)) > Marked_s(X) ; } { Marked_s(ok(X)) > Marked_s(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_s(mark(X)) >= Marked_s(X) constraint: Marked_s(ok(X)) >= Marked_s(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_zWadr(mark(X1),X2) >= Marked_zWadr(X1,X2) ; Marked_zWadr(ok(X1),ok(X2)) >= Marked_zWadr(X1,X2) ; Marked_zWadr(X1,mark(X2)) >= Marked_zWadr(X1,X2) ; } + Disjunctions:{ { Marked_zWadr(mark(X1),X2) > Marked_zWadr(X1,X2) ; } { Marked_zWadr(ok(X1),ok(X2)) > Marked_zWadr(X1,X2) ; } { Marked_zWadr(X1,mark(X2)) > Marked_zWadr(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_zWadr(mark(X1),X2) >= Marked_zWadr(X1,X2) constraint: Marked_zWadr(ok(X1),ok(X2)) >= Marked_zWadr(X1,X2) constraint: Marked_zWadr(X1,mark(X2)) >= Marked_zWadr(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_prefix(mark(X)) >= Marked_prefix(X) ; Marked_prefix(ok(X)) >= Marked_prefix(X) ; } + Disjunctions:{ { Marked_prefix(mark(X)) > Marked_prefix(X) ; } { Marked_prefix(ok(X)) > Marked_prefix(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_prefix(mark(X)) >= Marked_prefix(X) constraint: Marked_prefix(ok(X)) >= Marked_prefix(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_top(ok(X)) >= Marked_top(active(X)) ; } + Disjunctions:{ { Marked_top(ok(X)) > Marked_top(active(X)) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_top(ok(X)) >= Marked_top(active(X)) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_proper(app(X1,X2)) >= Marked_proper(X1) ; Marked_proper(app(X1,X2)) >= Marked_proper(X2) ; Marked_proper(s(X)) >= Marked_proper(X) ; Marked_proper(zWadr(X1,X2)) >= Marked_proper(X1) ; Marked_proper(zWadr(X1,X2)) >= Marked_proper(X2) ; } + Disjunctions:{ { Marked_proper(app(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(app(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(s(X)) > Marked_proper(X) ; } { Marked_proper(zWadr(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(zWadr(X1,X2)) > Marked_proper(X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_proper(app(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(app(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(s(X)) >= Marked_proper(X) constraint: Marked_proper(zWadr(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(zWadr(X1,X2)) >= Marked_proper(X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_proper(app(X1,X2)) >= Marked_proper(X1) ; Marked_proper(app(X1,X2)) >= Marked_proper(X2) ; Marked_proper(s(X)) >= Marked_proper(X) ; } + Disjunctions:{ { Marked_proper(app(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(app(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(s(X)) > Marked_proper(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_proper(app(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(app(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(s(X)) >= Marked_proper(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_proper(app(X1,X2)) >= Marked_proper(X1) ; Marked_proper(app(X1,X2)) >= Marked_proper(X2) ; } + Disjunctions:{ { Marked_proper(app(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(app(X1,X2)) > Marked_proper(X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_proper(app(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(app(X1,X2)) >= Marked_proper(X2) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_active(app(X1,X2)) >= Marked_active(X1) ; Marked_active(app(X1,X2)) >= Marked_active(X2) ; Marked_active(cons(X1,X2)) >= Marked_active(X1) ; Marked_active(from(X)) >= Marked_active(X) ; Marked_active(zWadr(X1,X2)) >= Marked_active(X1) ; Marked_active(zWadr(X1,X2)) >= Marked_active(X2) ; Marked_active(prefix(X)) >= Marked_active(X) ; } + Disjunctions:{ { Marked_active(app(X1,X2)) > Marked_active(X1) ; } { Marked_active(app(X1,X2)) > Marked_active(X2) ; } { Marked_active(cons(X1,X2)) > Marked_active(X1) ; } { Marked_active(from(X)) > Marked_active(X) ; } { Marked_active(zWadr(X1,X2)) > Marked_active(X1) ; } { Marked_active(zWadr(X1,X2)) > Marked_active(X2) ; } { Marked_active(prefix(X)) > Marked_active(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_active(app(X1,X2)) >= Marked_active(X1) constraint: Marked_active(app(X1,X2)) >= Marked_active(X2) constraint: Marked_active(cons(X1,X2)) >= Marked_active(X1) constraint: Marked_active(from(X)) >= Marked_active(X) constraint: Marked_active(zWadr(X1,X2)) >= Marked_active(X1) constraint: Marked_active(zWadr(X1,X2)) >= Marked_active(X2) constraint: Marked_active(prefix(X)) >= Marked_active(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_active(app(X1,X2)) >= Marked_active(X1) ; Marked_active(app(X1,X2)) >= Marked_active(X2) ; Marked_active(cons(X1,X2)) >= Marked_active(X1) ; Marked_active(zWadr(X1,X2)) >= Marked_active(X1) ; Marked_active(zWadr(X1,X2)) >= Marked_active(X2) ; Marked_active(prefix(X)) >= Marked_active(X) ; } + Disjunctions:{ { Marked_active(app(X1,X2)) > Marked_active(X1) ; } { Marked_active(app(X1,X2)) > Marked_active(X2) ; } { Marked_active(cons(X1,X2)) > Marked_active(X1) ; } { Marked_active(zWadr(X1,X2)) > Marked_active(X1) ; } { Marked_active(zWadr(X1,X2)) > Marked_active(X2) ; } { Marked_active(prefix(X)) > Marked_active(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_active(app(X1,X2)) >= Marked_active(X1) constraint: Marked_active(app(X1,X2)) >= Marked_active(X2) constraint: Marked_active(cons(X1,X2)) >= Marked_active(X1) constraint: Marked_active(zWadr(X1,X2)) >= Marked_active(X1) constraint: Marked_active(zWadr(X1,X2)) >= Marked_active(X2) constraint: Marked_active(prefix(X)) >= Marked_active(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_active(app(X1,X2)) >= Marked_active(X1) ; Marked_active(app(X1,X2)) >= Marked_active(X2) ; Marked_active(zWadr(X1,X2)) >= Marked_active(X1) ; Marked_active(zWadr(X1,X2)) >= Marked_active(X2) ; Marked_active(prefix(X)) >= Marked_active(X) ; } + Disjunctions:{ { Marked_active(app(X1,X2)) > Marked_active(X1) ; } { Marked_active(app(X1,X2)) > Marked_active(X2) ; } { Marked_active(zWadr(X1,X2)) > Marked_active(X1) ; } { Marked_active(zWadr(X1,X2)) > Marked_active(X2) ; } { Marked_active(prefix(X)) > Marked_active(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_active(app(X1,X2)) >= Marked_active(X1) constraint: Marked_active(app(X1,X2)) >= Marked_active(X2) constraint: Marked_active(zWadr(X1,X2)) >= Marked_active(X1) constraint: Marked_active(zWadr(X1,X2)) >= Marked_active(X2) constraint: Marked_active(prefix(X)) >= Marked_active(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_active(zWadr(X1,X2)) >= Marked_active(X1) ; Marked_active(zWadr(X1,X2)) >= Marked_active(X2) ; Marked_active(prefix(X)) >= Marked_active(X) ; } + Disjunctions:{ { Marked_active(zWadr(X1,X2)) > Marked_active(X1) ; } { Marked_active(zWadr(X1,X2)) > Marked_active(X2) ; } { Marked_active(prefix(X)) > Marked_active(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_active(zWadr(X1,X2)) >= Marked_active(X1) constraint: Marked_active(zWadr(X1,X2)) >= Marked_active(X2) constraint: Marked_active(prefix(X)) >= Marked_active(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_active(prefix(X)) >= Marked_active(X) ; } + Disjunctions:{ { Marked_active(prefix(X)) > Marked_active(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_active(prefix(X)) >= Marked_active(X) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_app(mark(X1),X2) >= Marked_app(X1,X2) ; Marked_app(ok(X1),ok(X2)) >= Marked_app(X1,X2) ; } + Disjunctions:{ { Marked_app(mark(X1),X2) > Marked_app(X1,X2) ; } { Marked_app(ok(X1),ok(X2)) > Marked_app(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_app(mark(X1),X2) >= Marked_app(X1,X2) constraint: Marked_app(ok(X1),ok(X2)) >= Marked_app(X1,X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_app(mark(X1),X2) >= Marked_app(X1,X2) ; } + Disjunctions:{ { Marked_app(mark(X1),X2) > Marked_app(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_app(mark(X1),X2) >= Marked_app(X1,X2) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) ; } + Disjunctions:{ { Marked_cons(mark(X1),X2) > Marked_cons(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_from(ok(X)) >= Marked_from(X) ; } + Disjunctions:{ { Marked_from(ok(X)) > Marked_from(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_from(ok(X)) >= Marked_from(X) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_s(mark(X)) >= Marked_s(X) ; } + Disjunctions:{ { Marked_s(mark(X)) > Marked_s(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_s(mark(X)) >= Marked_s(X) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_zWadr(ok(X1),ok(X2)) >= Marked_zWadr(X1,X2) ; Marked_zWadr(X1,mark(X2)) >= Marked_zWadr(X1,X2) ; } + Disjunctions:{ { Marked_zWadr(ok(X1),ok(X2)) > Marked_zWadr(X1,X2) ; } { Marked_zWadr(X1,mark(X2)) > Marked_zWadr(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_zWadr(ok(X1),ok(X2)) >= Marked_zWadr(X1,X2) constraint: Marked_zWadr(X1,mark(X2)) >= Marked_zWadr(X1,X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_zWadr(X1,mark(X2)) >= Marked_zWadr(X1,X2) ; } + Disjunctions:{ { Marked_zWadr(X1,mark(X2)) > Marked_zWadr(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_zWadr(X1,mark(X2)) >= Marked_zWadr(X1,X2) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(app(nil,YS)) >= mark(YS) ; active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) ; active(app(X1,X2)) >= app(active(X1),X2) ; active(app(X1,X2)) >= app(X1,active(X2)) ; active(cons(X1,X2)) >= cons(active(X1),X2) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(from(X)) >= from(active(X)) ; active(s(X)) >= s(active(X)) ; active(zWadr(nil,YS)) >= mark(nil) ; active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y,cons(X,nil)), zWadr(XS,YS))) ; active(zWadr(XS,nil)) >= mark(nil) ; active(zWadr(X1,X2)) >= zWadr(active(X1),X2) ; active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) ; active(prefix(X)) >= prefix(active(X)) ; active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) ; app(mark(X1),X2) >= mark(app(X1,X2)) ; app(ok(X1),ok(X2)) >= ok(app(X1,X2)) ; app(X1,mark(X2)) >= mark(app(X1,X2)) ; cons(mark(X1),X2) >= mark(cons(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(mark(X)) >= mark(from(X)) ; from(ok(X)) >= ok(from(X)) ; s(mark(X)) >= mark(s(X)) ; s(ok(X)) >= ok(s(X)) ; zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) ; zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) ; zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) ; prefix(mark(X)) >= mark(prefix(X)) ; prefix(ok(X)) >= ok(prefix(X)) ; proper(app(X1,X2)) >= app(proper(X1),proper(X2)) ; proper(nil) >= ok(nil) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; proper(s(X)) >= s(proper(X)) ; proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) ; proper(prefix(X)) >= prefix(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_prefix(mark(X)) >= Marked_prefix(X) ; } + Disjunctions:{ { Marked_prefix(mark(X)) > Marked_prefix(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: active(app(nil,YS)) >= mark(YS) constraint: active(app(cons(X,XS),YS)) >= mark(cons(X,app(XS,YS))) constraint: active(app(X1,X2)) >= app(active(X1),X2) constraint: active(app(X1,X2)) >= app(X1,active(X2)) constraint: active(cons(X1,X2)) >= cons(active(X1),X2) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(from(X)) >= from(active(X)) constraint: active(s(X)) >= s(active(X)) constraint: active(zWadr(nil,YS)) >= mark(nil) constraint: active(zWadr(cons(X,XS),cons(Y,YS))) >= mark(cons(app(Y, cons(X,nil)), zWadr(XS,YS))) constraint: active(zWadr(XS,nil)) >= mark(nil) constraint: active(zWadr(X1,X2)) >= zWadr(active(X1),X2) constraint: active(zWadr(X1,X2)) >= zWadr(X1,active(X2)) constraint: active(prefix(X)) >= prefix(active(X)) constraint: active(prefix(L)) >= mark(cons(nil,zWadr(L,prefix(L)))) constraint: app(mark(X1),X2) >= mark(app(X1,X2)) constraint: app(ok(X1),ok(X2)) >= ok(app(X1,X2)) constraint: app(X1,mark(X2)) >= mark(app(X1,X2)) constraint: cons(mark(X1),X2) >= mark(cons(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(mark(X)) >= mark(from(X)) constraint: from(ok(X)) >= ok(from(X)) constraint: s(mark(X)) >= mark(s(X)) constraint: s(ok(X)) >= ok(s(X)) constraint: zWadr(mark(X1),X2) >= mark(zWadr(X1,X2)) constraint: zWadr(ok(X1),ok(X2)) >= ok(zWadr(X1,X2)) constraint: zWadr(X1,mark(X2)) >= mark(zWadr(X1,X2)) constraint: prefix(mark(X)) >= mark(prefix(X)) constraint: prefix(ok(X)) >= ok(prefix(X)) constraint: proper(app(X1,X2)) >= app(proper(X1),proper(X2)) constraint: proper(nil) >= ok(nil) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(zWadr(X1,X2)) >= zWadr(proper(X1),proper(X2)) constraint: proper(prefix(X)) >= prefix(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_prefix(mark(X)) >= Marked_prefix(X) APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] active(app(nil,YS)) -> mark(YS) [2] active(app(cons(X,XS),YS)) -> mark(cons(X,app(XS,YS))) [3] active(from(X)) -> mark(cons(X,from(s(X)))) [4] active(zWadr(nil,YS)) -> mark(nil) [5] active(zWadr(XS,nil)) -> mark(nil) [6] active(zWadr(cons(X,XS),cons(Y,YS))) -> mark(cons(app(Y,cons(X,nil)),zWadr(XS,YS))) [7] active(prefix(L)) -> mark(cons(nil,zWadr(L,prefix(L)))) [8] active(app(X1,X2)) -> app(active(X1),X2) [9] active(app(X1,X2)) -> app(X1,active(X2)) [10] active(cons(X1,X2)) -> cons(active(X1),X2) [11] active(from(X)) -> from(active(X)) [12] active(s(X)) -> s(active(X)) [13] active(zWadr(X1,X2)) -> zWadr(active(X1),X2) [14] active(zWadr(X1,X2)) -> zWadr(X1,active(X2)) [15] active(prefix(X)) -> prefix(active(X)) [16] app(mark(X1),X2) -> mark(app(X1,X2)) [17] app(X1,mark(X2)) -> mark(app(X1,X2)) [18] cons(mark(X1),X2) -> mark(cons(X1,X2)) [19] from(mark(X)) -> mark(from(X)) [20] s(mark(X)) -> mark(s(X)) [21] zWadr(mark(X1),X2) -> mark(zWadr(X1,X2)) [22] zWadr(X1,mark(X2)) -> mark(zWadr(X1,X2)) [23] prefix(mark(X)) -> mark(prefix(X)) [24] proper(app(X1,X2)) -> app(proper(X1),proper(X2)) [25] proper(nil) -> ok(nil) [26] proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) [27] proper(from(X)) -> from(proper(X)) [28] proper(s(X)) -> s(proper(X)) [29] proper(zWadr(X1,X2)) -> zWadr(proper(X1),proper(X2)) [30] proper(prefix(X)) -> prefix(proper(X)) [31] app(ok(X1),ok(X2)) -> ok(app(X1,X2)) [32] cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) [33] from(ok(X)) -> ok(from(X)) [34] s(ok(X)) -> ok(s(X)) [35] zWadr(ok(X1),ok(X2)) -> ok(zWadr(X1,X2)) [36] prefix(ok(X)) -> ok(prefix(X)) [37] top(mark(X)) -> top(proper(X)) [38] top(ok(X)) -> top(active(X)) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0 + 2; [ prefix ] (X0) = 2*X0 + 3; [ cons ] (X0,X1) = 2*X0 + 1; [ Marked_top ] (X0) = 1*X0; [ app ] (X0,X1) = 1*X1 + 2*X0 + 2; [ ok ] (X0) = 1*X0; [ s ] (X0) = 2*X0; [ active ] (X0) = 1*X0; [ proper ] (X0) = 1*X0; [ from ] (X0) = 2*X0 + 3; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 3*X1 + 3*X0 + 3; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 0; [ prefix ] (X0) = 1*X0 + 0; [ cons ] (X0,X1) = 1 + 2*X0 + 0; [ Marked_top ] (X0) = 3*X0 + 0; [ app ] (X0,X1) = 1*X0 + 0; [ ok ] (X0) = 2 + 2*X0 + 0; [ s ] (X0) = 1 + 2*X0 + 0; [ active ] (X0) = 2*X0 + 0; [ proper ] (X0) = 2 + 3*X0 + 0; [ from ] (X0) = 1*X0 + 0; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 1*X1 + 0; ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2; [ prefix ] (X0) = 3*X0 + 2; [ cons ] (X0,X1) = 2*X1 + 1*X0 + 2; [ app ] (X0,X1) = 2*X1 + 2*X0; [ ok ] (X0) = 0; [ s ] (X0) = 1*X0; [ Marked_proper ] (X0) = 3*X0; [ active ] (X0) = 1*X0; [ proper ] (X0) = 1*X0; [ from ] (X0) = 1*X0 + 2; [ nil ] () = 2; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 2*X1 + 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ prefix ] (X0) = 1; [ cons ] (X0,X1) = 2; [ app ] (X0,X1) = 2*X1 + 2*X0; [ ok ] (X0) = 0; [ s ] (X0) = 1*X0; [ Marked_proper ] (X0) = 3*X0; [ active ] (X0) = 2*X0; [ proper ] (X0) = 2*X0; [ from ] (X0) = 2; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 2*X1 + 3*X0 + 1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ prefix ] (X0) = 2*X0; [ cons ] (X0,X1) = 0; [ app ] (X0,X1) = 2*X1 + 2*X0; [ ok ] (X0) = 0; [ s ] (X0) = 2*X0 + 1; [ Marked_proper ] (X0) = 3*X0; [ active ] (X0) = 1*X0; [ proper ] (X0) = 1*X0; [ from ] (X0) = 0; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1*X0 + 0; [ prefix ] (X0) = 1 + 0; [ cons ] (X0,X1) = 2*X1 + 0; [ app ] (X0,X1) = 1 + 2*X0 + 2*X1 + 0; [ ok ] (X0) = 0; [ s ] (X0) = 0; [ Marked_proper ] (X0) = 3*X0 + 0; [ active ] (X0) = 2*X0 + 0; [ proper ] (X0) = 1*X0 + 0; [ from ] (X0) = 2 + 0; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 1*X1 + 0; ]} ]} ]} ]} ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ prefix ] (X0) = 1*X0; [ cons ] (X0,X1) = 3*X1 + 2*X0; [ app ] (X0,X1) = 2*X1 + 2*X0; [ ok ] (X0) = 0; [ s ] (X0) = 1*X0 + 1; [ active ] (X0) = 1*X0; [ proper ] (X0) = 1*X0; [ from ] (X0) = 2*X0; [ Marked_active ] (X0) = 3*X0; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 3*X1 + 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ prefix ] (X0) = 2*X0; [ cons ] (X0,X1) = 2*X0; [ app ] (X0,X1) = 2*X1 + 2*X0; [ ok ] (X0) = 0; [ s ] (X0) = 0; [ active ] (X0) = 1*X0; [ proper ] (X0) = 1*X0; [ from ] (X0) = 2*X0 + 1; [ Marked_active ] (X0) = 3*X0; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 2*X1 + 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ prefix ] (X0) = 1*X0; [ cons ] (X0,X1) = 1*X1 + 3*X0 + 1; [ app ] (X0,X1) = 2*X1 + 3*X0; [ ok ] (X0) = 0; [ s ] (X0) = 2; [ active ] (X0) = 1*X0; [ proper ] (X0) = 1*X0; [ from ] (X0) = 0; [ Marked_active ] (X0) = 3*X0; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 2*X1 + 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ prefix ] (X0) = 2*X0; [ cons ] (X0,X1) = 2*X0 + 2; [ app ] (X0,X1) = 2*X1 + 2*X0 + 1; [ ok ] (X0) = 0; [ s ] (X0) = 2; [ active ] (X0) = 1*X0; [ proper ] (X0) = 1*X0; [ from ] (X0) = 0; [ Marked_active ] (X0) = 3*X0; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 3*X1 + 3*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ prefix ] (X0) = 2*X0; [ cons ] (X0,X1) = 0; [ app ] (X0,X1) = 0; [ ok ] (X0) = 0; [ s ] (X0) = 0; [ active ] (X0) = 1*X0; [ proper ] (X0) = 1*X0; [ from ] (X0) = 0; [ Marked_active ] (X0) = 3*X0; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 2*X1 + 2*X0 + 2; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 0; [ prefix ] (X0) = 2 + 1*X0 + 0; [ cons ] (X0,X1) = 3*X1 + 0; [ app ] (X0,X1) = 3*X0 + 0; [ ok ] (X0) = 0; [ s ] (X0) = 3 + 0; [ active ] (X0) = 3*X0 + 0; [ proper ] (X0) = 2*X0 + 0; [ from ] (X0) = 2*X0 + 0; [ Marked_active ] (X0) = 3*X0 + 0; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 2 + 0; ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0 + 2; [ prefix ] (X0) = 2*X0 + 3; [ cons ] (X0,X1) = 1*X0 + 1; [ Marked_app ] (X0,X1) = 2*X1; [ app ] (X0,X1) = 2*X1 + 2*X0 + 2; [ ok ] (X0) = 1*X0; [ s ] (X0) = 2*X0; [ active ] (X0) = 1*X0; [ proper ] (X0) = 1*X0; [ from ] (X0) = 2*X0 + 3; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 2*X1 + 2*X0 + 3; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ prefix ] (X0) = 2*X0; [ cons ] (X0,X1) = 3*X1 + 3*X0; [ Marked_app ] (X0,X1) = 1*X1; [ app ] (X0,X1) = 2*X0; [ ok ] (X0) = 2*X0 + 1; [ s ] (X0) = 2*X0 + 1; [ active ] (X0) = 2*X0; [ proper ] (X0) = 3*X0; [ from ] (X0) = 2*X0; [ nil ] () = 1; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 3*X1 + 3*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 2 + 1*X0 + 0; [ prefix ] (X0) = 1 + 1*X0 + 0; [ cons ] (X0,X1) = 2 + 2*X0 + 0; [ Marked_app ] (X0,X1) = 3*X0 + 0; [ app ] (X0,X1) = 1*X0 + 1*X1 + 0; [ ok ] (X0) = 0; [ s ] (X0) = 1*X0 + 0; [ active ] (X0) = 2 + 2*X0 + 0; [ proper ] (X0) = 2*X0 + 0; [ from ] (X0) = 3 + 2*X0 + 0; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 2 + 1*X0 + 2*X1 + 0; ]} ]} ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ prefix ] (X0) = 1*X0; [ cons ] (X0,X1) = 3*X1 + 3*X0; [ app ] (X0,X1) = 1*X1; [ ok ] (X0) = 2*X0 + 1; [ s ] (X0) = 3*X0 + 1; [ active ] (X0) = 2*X0; [ proper ] (X0) = 3*X0; [ from ] (X0) = 1*X0; [ nil ] () = 1; [ Marked_cons ] (X0,X1) = 1*X1; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 1*X0 + 0; [ prefix ] (X0) = 2 + 2*X0 + 0; [ cons ] (X0,X1) = 1*X0 + 0; [ app ] (X0,X1) = 1*X0 + 1*X1 + 0; [ ok ] (X0) = 1*X0 + 0; [ s ] (X0) = 3 + 2*X0 + 0; [ active ] (X0) = 1 + 2*X0 + 0; [ proper ] (X0) = 2*X0 + 0; [ from ] (X0) = 1*X0 + 0; [ nil ] () = 0; [ Marked_cons ] (X0,X1) = 3*X0 + 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 1*X0 + 1*X1 + 0; ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0 + 1; [ prefix ] (X0) = 2*X0 + 2; [ cons ] (X0,X1) = 1*X0; [ app ] (X0,X1) = 1*X1 + 1*X0 + 1; [ Marked_from ] (X0) = 3*X0; [ ok ] (X0) = 1*X0; [ s ] (X0) = 1*X0; [ active ] (X0) = 1*X0; [ proper ] (X0) = 1*X0; [ from ] (X0) = 1*X0 + 1; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 2*X1 + 1*X0 + 2; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 0; [ prefix ] (X0) = 2*X0 + 0; [ cons ] (X0,X1) = 2 + 3*X1 + 0; [ app ] (X0,X1) = 2*X1 + 0; [ Marked_from ] (X0) = 3*X0 + 0; [ ok ] (X0) = 1 + 2*X0 + 0; [ s ] (X0) = 1*X0 + 0; [ active ] (X0) = 2*X0 + 0; [ proper ] (X0) = 3*X0 + 0; [ from ] (X0) = 2*X0 + 0; [ nil ] () = 2 + 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 1*X0 + 3*X1 + 0; ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ prefix ] (X0) = 2*X0 + 1; [ cons ] (X0,X1) = 2*X1; [ app ] (X0,X1) = 1*X1; [ ok ] (X0) = 2*X0 + 1; [ s ] (X0) = 1*X0; [ active ] (X0) = 3*X0 + 2; [ Marked_s ] (X0) = 3*X0; [ proper ] (X0) = 3*X0; [ from ] (X0) = 2*X0 + 1; [ nil ] () = 2; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 1*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 1*X0 + 0; [ prefix ] (X0) = 1 + 1*X0 + 0; [ cons ] (X0,X1) = 2*X0 + 0; [ app ] (X0,X1) = 2 + 2*X0 + 2*X1 + 0; [ ok ] (X0) = 1*X0 + 0; [ s ] (X0) = 2*X0 + 0; [ active ] (X0) = 2*X0 + 0; [ Marked_s ] (X0) = 3*X0 + 0; [ proper ] (X0) = 1*X0 + 0; [ from ] (X0) = 2 + 1*X0 + 0; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 3 + 3*X0 + 1*X1 + 0; ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0 + 1; [ Marked_zWadr ] (X0,X1) = 2*X0; [ prefix ] (X0) = 3*X0 + 1; [ cons ] (X0,X1) = 1*X0; [ app ] (X0,X1) = 2*X1 + 1*X0 + 1; [ ok ] (X0) = 1*X0; [ s ] (X0) = 1*X0; [ active ] (X0) = 1*X0; [ proper ] (X0) = 1*X0; [ from ] (X0) = 2*X0 + 2; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 1*X1 + 2*X0 + 2; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ Marked_zWadr ] (X0,X1) = 1*X0; [ prefix ] (X0) = 1*X0; [ cons ] (X0,X1) = 1*X1; [ app ] (X0,X1) = 2*X0 + 1; [ ok ] (X0) = 2*X0 + 1; [ s ] (X0) = 1*X0; [ active ] (X0) = 2*X0; [ proper ] (X0) = 2*X0 + 1; [ from ] (X0) = 1*X0; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 2*X0 + 1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 1*X0 + 0; [ Marked_zWadr ] (X0,X1) = 3*X1 + 0; [ prefix ] (X0) = 2 + 2*X0 + 0; [ cons ] (X0,X1) = 1*X0 + 2*X1 + 0; [ app ] (X0,X1) = 1*X0 + 1*X1 + 0; [ ok ] (X0) = 0; [ s ] (X0) = 1*X0 + 0; [ active ] (X0) = 2 + 3*X0 + 0; [ proper ] (X0) = 1*X0 + 0; [ from ] (X0) = 1 + 2*X0 + 0; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 1*X0 + 1*X1 + 0; ]} ]} ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ prefix ] (X0) = 1*X0; [ cons ] (X0,X1) = 1*X1; [ app ] (X0,X1) = 2*X1 + 1; [ ok ] (X0) = 1*X0 + 1; [ s ] (X0) = 1*X0; [ active ] (X0) = 2*X0 + 1; [ proper ] (X0) = 2*X0; [ from ] (X0) = 1*X0; [ nil ] () = 1; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 1*X1; [ Marked_prefix ] (X0) = 3*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 2 + 1*X0 + 0; [ prefix ] (X0) = 3 + 2*X0 + 0; [ cons ] (X0,X1) = 1*X0 + 0; [ app ] (X0,X1) = 1*X0 + 1*X1 + 0; [ ok ] (X0) = 0; [ s ] (X0) = 2 + 2*X0 + 0; [ active ] (X0) = 2 + 2*X0 + 0; [ proper ] (X0) = 2*X0 + 0; [ from ] (X0) = 2 + 1*X0 + 0; [ nil ] () = 0; [ top ] (X0) = 0; [ zWadr ] (X0,X1) = 1*X0 + 1*X1 + 0; [ Marked_prefix ] (X0) = 3*X0 + 0; ]} ]} ]} ]} ]} Cime worked for 4.586150 seconds (real time) Cime Exit Status: 0