- : unit = ()
h : heuristic = <heuristic>
- : unit = ()
APPLY CRITERIA (Marked dependency pairs)

TRS termination of:
[1] app(nil,YS) -> YS
[2] app(cons(X,XS),YS) -> cons(X,n__app(activate(XS),YS))
[3] from(X) -> cons(X,n__from(s(X)))
[4] zWadr(nil,YS) -> nil
[5] zWadr(XS,nil) -> nil
[6] zWadr(cons(X,XS),cons(Y,YS)) ->
 cons(app(Y,cons(X,n__nil)),n__zWadr(activate(XS),activate(YS)))
[7] prefix(L) -> cons(nil,n__zWadr(L,prefix(L)))
[8] app(X1,X2) -> n__app(X1,X2)
[9] from(X) -> n__from(X)
[10] nil -> n__nil
[11] zWadr(X1,X2) -> n__zWadr(X1,X2)
[12] activate(n__app(X1,X2)) -> app(X1,X2)
[13] activate(n__from(X)) -> from(X)
[14] activate(n__nil) -> nil
[15] activate(n__zWadr(X1,X2)) -> zWadr(X1,X2)
[16] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_app(cons(X,XS),YS) , Marked_activate(XS)>
<Marked_zWadr(cons(X,XS),cons(Y,YS)) , Marked_app(Y,cons(X,n__nil))>
<Marked_zWadr(cons(X,XS),cons(Y,YS)) , Marked_activate(XS)>
<Marked_zWadr(cons(X,XS),cons(Y,YS)) , Marked_activate(YS)>
<Marked_prefix(L) , Marked_nil>
<Marked_prefix(L) , Marked_prefix(L)>
<Marked_activate(n__app(X1,X2)) , Marked_app(X1,X2)>
<Marked_activate(n__from(X)) , Marked_from(X)>
<Marked_activate(n__nil) , Marked_nil>
<Marked_activate(n__zWadr(X1,X2)) , Marked_zWadr(X1,X2)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 2 components:

{  <Marked_prefix(L) , Marked_prefix(L)> 
      --> <Marked_prefix(L) , Marked_prefix(L)>
}

{  <Marked_activate(n__zWadr(X1,X2)) , Marked_zWadr(X1,X2)> 
      --> <Marked_zWadr(cons(X,XS),cons(Y,YS)) , Marked_activate(YS)>
  <Marked_activate(n__zWadr(X1,X2)) , Marked_zWadr(X1,X2)> 
     --> <Marked_zWadr(cons(X,XS),cons(Y,YS)) , Marked_activate(XS)>
  <Marked_activate(n__zWadr(X1,X2)) , Marked_zWadr(X1,X2)> 
     --> <Marked_zWadr(cons(X,XS),cons(Y,YS)) , Marked_app(Y,cons(X,n__nil))>
  <Marked_activate(n__app(X1,X2)) , Marked_app(X1,X2)> 
     --> <Marked_app(cons(X,XS),YS) , Marked_activate(XS)>
  <Marked_zWadr(cons(X,XS),cons(Y,YS)) , Marked_activate(YS)> 
     --> <Marked_activate(n__zWadr(X1,X2)) , Marked_zWadr(X1,X2)>
  <Marked_zWadr(cons(X,XS),cons(Y,YS)) , Marked_activate(YS)> 
     --> <Marked_activate(n__app(X1,X2)) , Marked_app(X1,X2)>
  <Marked_zWadr(cons(X,XS),cons(Y,YS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__zWadr(X1,X2)) , Marked_zWadr(X1,X2)>
  <Marked_zWadr(cons(X,XS),cons(Y,YS)) , Marked_activate(XS)> 
     --> <Marked_activate(n__app(X1,X2)) , Marked_app(X1,X2)>
  <Marked_zWadr(cons(X,XS),cons(Y,YS)) , Marked_app(Y,cons(X,n__nil))> 
     --> <Marked_app(cons(X,XS),YS) , Marked_activate(XS)>
  <Marked_app(cons(X,XS),YS) , Marked_activate(XS)> 
     --> <Marked_activate(n__zWadr(X1,X2)) , Marked_zWadr(X1,X2)>
  <Marked_app(cons(X,XS),YS) , Marked_activate(XS)> 
     --> <Marked_activate(n__app(X1,X2)) , Marked_app(X1,X2)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  app(nil,YS) >= YS ;
  app(cons(X,XS),YS) >= cons(X,n__app(activate(XS),YS)) ;
  app(X1,X2) >= n__app(X1,X2) ;
  nil >= n__nil ;
  activate(n__app(X1,X2)) >= app(X1,X2) ;
  activate(n__from(X)) >= from(X) ;
  activate(n__nil) >= nil ;
  activate(n__zWadr(X1,X2)) >= zWadr(X1,X2) ;
  activate(X) >= X ;
  from(X) >= cons(X,n__from(s(X))) ;
  from(X) >= n__from(X) ;
  zWadr(nil,YS) >= nil ;
  zWadr(cons(X,XS),cons(Y,YS)) >= cons(app(Y,cons(X,n__nil)),
                                   n__zWadr(activate(XS),activate(YS))) ;
  zWadr(XS,nil) >= nil ;
  zWadr(X1,X2) >= n__zWadr(X1,X2) ;
  prefix(L) >= cons(nil,n__zWadr(L,prefix(L))) ;
  Marked_prefix(L) >= Marked_prefix(L) ;
 }
 + Disjunctions:{ 
{
  Marked_prefix(L) > Marked_prefix(L) ;
 }
 } 
=== 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
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
Entering rpo_solver
=== TIMER virtual : 25.000000 ===
Search parameters: AFS type: 2 ; time limit: 25.. 
=== STOPING TIMER virtual ===
=== TIMER virtual : 15.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 15.000000 ===
=== STOPING TIMER real ===
Sat solver returned
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
=== TIMER virtual : 50.000000 ===
trying sub matrices of size: 1
Matrix interpretation constraints generated.
Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. 
Termination constraints generated.
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 50.000000 ===
=== STOPING TIMER real ===
Sat solver returned
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
No solution found for these constraints.
APPLY CRITERIA (ID_CRIT)
NOT SOLVED
No proof found
Cime worked for 0.123675 seconds (real time)
Cime Exit Status: 0