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

TRS termination of:
[1] a__from(X) -> cons(mark(X),from(s(X)))
[2] a__length(nil) -> 0
[3] a__length(cons(X,Y)) -> s(a__length1(Y))
[4] a__length1(X) -> a__length(X)
[5] mark(from(X)) -> a__from(mark(X))
[6] mark(length(X)) -> a__length(X)
[7] mark(length1(X)) -> a__length1(X)
[8] mark(cons(X1,X2)) -> cons(mark(X1),X2)
[9] mark(s(X)) -> s(mark(X))
[10] mark(nil) -> nil
[11] mark(0) -> 0
[12] a__from(X) -> from(X)
[13] a__length(X) -> length(X)
[14] a__length1(X) -> length1(X)


Sub problem: 
guided: 

DP termination of:
<Marked_a__from(X) , Marked_mark(X)>
<Marked_a__length(cons(X,Y)) , Marked_a__length1(Y)>
<Marked_a__length1(X) , Marked_a__length(X)>
<Marked_mark(from(X)) , Marked_a__from(mark(X))>
<Marked_mark(from(X)) , Marked_mark(X)>
<Marked_mark(length(X)) , Marked_a__length(X)>
<Marked_mark(length1(X)) , Marked_a__length1(X)>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
<Marked_mark(s(X)) , Marked_mark(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 2 components:

{  <Marked_mark(s(X)) , Marked_mark(X)> 
      --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(from(X)) , Marked_mark(X)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(from(X)) , Marked_a__from(mark(X))>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(from(X)) , Marked_mark(X)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(from(X)) , Marked_a__from(mark(X))>
  <Marked_mark(from(X)) , Marked_mark(X)> 
     --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_mark(from(X)) , Marked_mark(X)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(from(X)) , Marked_mark(X)> 
     --> <Marked_mark(from(X)) , Marked_mark(X)>
  <Marked_mark(from(X)) , Marked_mark(X)> 
     --> <Marked_mark(from(X)) , Marked_a__from(mark(X))>
  <Marked_mark(from(X)) , Marked_a__from(mark(X))> 
     --> <Marked_a__from(X) , Marked_mark(X)>
  <Marked_a__from(X) , Marked_mark(X)> --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_a__from(X) , Marked_mark(X)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_a__from(X) , Marked_mark(X)> 
     --> <Marked_mark(from(X)) , Marked_mark(X)>
  <Marked_a__from(X) , Marked_mark(X)> 
     --> <Marked_mark(from(X)) , Marked_a__from(mark(X))>
}

{  <Marked_a__length1(X) , Marked_a__length(X)> 
      --> <Marked_a__length(cons(X,Y)) , Marked_a__length1(Y)>
  <Marked_a__length(cons(X,Y)) , Marked_a__length1(Y)> 
     --> <Marked_a__length1(X) , Marked_a__length(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(cons(X1,X2)) >= cons(mark(X1),X2) ;
  mark(from(X)) >= a__from(mark(X)) ;
  mark(s(X)) >= s(mark(X)) ;
  mark(0) >= 0 ;
  mark(nil) >= nil ;
  mark(length(X)) >= a__length(X) ;
  mark(length1(X)) >= a__length1(X) ;
  a__from(X) >= cons(mark(X),from(s(X))) ;
  a__from(X) >= from(X) ;
  a__length(cons(X,Y)) >= s(a__length1(Y)) ;
  a__length(nil) >= 0 ;
  a__length(X) >= length(X) ;
  a__length1(X) >= a__length(X) ;
  a__length1(X) >= length1(X) ;
  Marked_a__from(X) >= Marked_mark(X) ;
  Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ;
  Marked_mark(from(X)) >= Marked_a__from(mark(X)) ;
  Marked_mark(from(X)) >= Marked_mark(X) ;
  Marked_mark(s(X)) >= Marked_mark(X) ;
 }
 + Disjunctions:{ 
{
  Marked_a__from(X) > Marked_mark(X) ;
 }
{
  Marked_mark(cons(X1,X2)) > Marked_mark(X1) ;
 }
{
  Marked_mark(from(X)) > Marked_a__from(mark(X)) ;
 }
{
  Marked_mark(from(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(s(X)) > Marked_mark(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: mark(cons(X1,X2)) >= cons(mark(X1),X2)
constraint: mark(from(X)) >= a__from(mark(X))
constraint: mark(s(X)) >= s(mark(X))
constraint: mark(0) >= 0
constraint: mark(nil) >= nil
constraint: mark(length(X)) >= a__length(X)
constraint: mark(length1(X)) >= a__length1(X)
constraint: a__from(X) >= cons(mark(X),from(s(X)))
constraint: a__from(X) >= from(X)
constraint: a__length(cons(X,Y)) >= s(a__length1(Y))
constraint: a__length(nil) >= 0
constraint: a__length(X) >= length(X)
constraint: a__length1(X) >= a__length(X)
constraint: a__length1(X) >= length1(X)
constraint: Marked_a__from(X) >= Marked_mark(X)
constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1)
constraint: Marked_mark(from(X)) >= Marked_a__from(mark(X))
constraint: Marked_mark(from(X)) >= Marked_mark(X)
constraint: Marked_mark(s(X)) >= Marked_mark(X)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(cons(X1,X2)) >= cons(mark(X1),X2) ;
  mark(from(X)) >= a__from(mark(X)) ;
  mark(s(X)) >= s(mark(X)) ;
  mark(0) >= 0 ;
  mark(nil) >= nil ;
  mark(length(X)) >= a__length(X) ;
  mark(length1(X)) >= a__length1(X) ;
  a__from(X) >= cons(mark(X),from(s(X))) ;
  a__from(X) >= from(X) ;
  a__length(cons(X,Y)) >= s(a__length1(Y)) ;
  a__length(nil) >= 0 ;
  a__length(X) >= length(X) ;
  a__length1(X) >= a__length(X) ;
  a__length1(X) >= length1(X) ;
  Marked_a__length1(X) >= Marked_a__length(X) ;
  Marked_a__length(cons(X,Y)) >= Marked_a__length1(Y) ;
 }
 + Disjunctions:{ 
{
  Marked_a__length1(X) > Marked_a__length(X) ;
 }
{
  Marked_a__length(cons(X,Y)) > Marked_a__length1(Y) ;
 }
 } 
=== 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: mark(cons(X1,X2)) >= cons(mark(X1),X2)
constraint: mark(from(X)) >= a__from(mark(X))
constraint: mark(s(X)) >= s(mark(X))
constraint: mark(0) >= 0
constraint: mark(nil) >= nil
constraint: mark(length(X)) >= a__length(X)
constraint: mark(length1(X)) >= a__length1(X)
constraint: a__from(X) >= cons(mark(X),from(s(X)))
constraint: a__from(X) >= from(X)
constraint: a__length(cons(X,Y)) >= s(a__length1(Y))
constraint: a__length(nil) >= 0
constraint: a__length(X) >= length(X)
constraint: a__length1(X) >= a__length(X)
constraint: a__length1(X) >= length1(X)
constraint: Marked_a__length1(X) >= Marked_a__length(X)
constraint: Marked_a__length(cons(X,Y)) >= Marked_a__length1(Y)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(s(X)) , Marked_mark(X)> 
      --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(cons(X1,X2)) >= cons(mark(X1),X2) ;
  mark(from(X)) >= a__from(mark(X)) ;
  mark(s(X)) >= s(mark(X)) ;
  mark(0) >= 0 ;
  mark(nil) >= nil ;
  mark(length(X)) >= a__length(X) ;
  mark(length1(X)) >= a__length1(X) ;
  a__from(X) >= cons(mark(X),from(s(X))) ;
  a__from(X) >= from(X) ;
  a__length(cons(X,Y)) >= s(a__length1(Y)) ;
  a__length(nil) >= 0 ;
  a__length(X) >= length(X) ;
  a__length1(X) >= a__length(X) ;
  a__length1(X) >= length1(X) ;
  Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ;
  Marked_mark(s(X)) >= Marked_mark(X) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(cons(X1,X2)) > Marked_mark(X1) ;
 }
{
  Marked_mark(s(X)) > Marked_mark(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: mark(cons(X1,X2)) >= cons(mark(X1),X2)
constraint: mark(from(X)) >= a__from(mark(X))
constraint: mark(s(X)) >= s(mark(X))
constraint: mark(0) >= 0
constraint: mark(nil) >= nil
constraint: mark(length(X)) >= a__length(X)
constraint: mark(length1(X)) >= a__length1(X)
constraint: a__from(X) >= cons(mark(X),from(s(X)))
constraint: a__from(X) >= from(X)
constraint: a__length(cons(X,Y)) >= s(a__length1(Y))
constraint: a__length(nil) >= 0
constraint: a__length(X) >= length(X)
constraint: a__length1(X) >= a__length(X)
constraint: a__length1(X) >= length1(X)
constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1)
constraint: Marked_mark(s(X)) >= Marked_mark(X)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(s(X)) , Marked_mark(X)> 
      --> <Marked_mark(s(X)) , Marked_mark(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(cons(X1,X2)) >= cons(mark(X1),X2) ;
  mark(from(X)) >= a__from(mark(X)) ;
  mark(s(X)) >= s(mark(X)) ;
  mark(0) >= 0 ;
  mark(nil) >= nil ;
  mark(length(X)) >= a__length(X) ;
  mark(length1(X)) >= a__length1(X) ;
  a__from(X) >= cons(mark(X),from(s(X))) ;
  a__from(X) >= from(X) ;
  a__length(cons(X,Y)) >= s(a__length1(Y)) ;
  a__length(nil) >= 0 ;
  a__length(X) >= length(X) ;
  a__length1(X) >= a__length(X) ;
  a__length1(X) >= length1(X) ;
  Marked_mark(s(X)) >= Marked_mark(X) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(s(X)) > Marked_mark(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: mark(cons(X1,X2)) >= cons(mark(X1),X2)
constraint: mark(from(X)) >= a__from(mark(X))
constraint: mark(s(X)) >= s(mark(X))
constraint: mark(0) >= 0
constraint: mark(nil) >= nil
constraint: mark(length(X)) >= a__length(X)
constraint: mark(length1(X)) >= a__length1(X)
constraint: a__from(X) >= cons(mark(X),from(s(X)))
constraint: a__from(X) >= from(X)
constraint: a__length(cons(X,Y)) >= s(a__length1(Y))
constraint: a__length(nil) >= 0
constraint: a__length(X) >= length(X)
constraint: a__length1(X) >= a__length(X)
constraint: a__length1(X) >= length1(X)
constraint: Marked_mark(s(X)) >= Marked_mark(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] a__from(X) -> cons(mark(X),from(s(X)))
[2] a__length(nil) -> 0
[3] a__length(cons(X,Y)) -> s(a__length1(Y))
[4] a__length1(X) -> a__length(X)
[5] mark(from(X)) -> a__from(mark(X))
[6] mark(length(X)) -> a__length(X)
[7] mark(length1(X)) -> a__length1(X)
[8] mark(cons(X1,X2)) -> cons(mark(X1),X2)
[9] mark(s(X)) -> s(mark(X))
[10] mark(nil) -> nil
[11] mark(0) -> 0
[12] a__from(X) -> from(X)
[13] a__length(X) -> length(X)
[14] a__length1(X) -> length1(X)
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_a__from(X) , Marked_mark(X)>
<Marked_a__length(cons(X,Y)) , Marked_a__length1(Y)>
<Marked_a__length1(X) , Marked_a__length(X)>
<Marked_mark(from(X)) , Marked_a__from(mark(X))>
<Marked_mark(from(X)) , Marked_mark(X)>
<Marked_mark(length(X)) , Marked_a__length(X)>
<Marked_mark(length1(X)) , Marked_a__length1(X)>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
<Marked_mark(s(X)) , Marked_mark(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_a__from(X) , Marked_mark(X)>
<Marked_mark(from(X)) , Marked_a__from(mark(X))>
<Marked_mark(from(X)) , Marked_mark(X)>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
<Marked_mark(s(X)) , Marked_mark(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ cons ] (X0,X1) = 2*X0; 
 [ a__length1 ] (X0) = 0; 
 [ a__from ] (X0) = 2*X0 + 3; 
 [ from ] (X0) = 2*X0 + 3; 
 [ length1 ] (X0) = 0; 
 [ a__length ] (X0) = 0; 
 [ Marked_mark ] (X0) = 3*X0; 
 [ mark ] (X0) = 1*X0; 
 [ length ] (X0) = 0; 
 [ 0 ] () = 0; 
 [ Marked_a__from ] (X0) = 3*X0 + 1; 
 [ s ] (X0) = 2*X0; 
 [ nil ] () = 0; 
 removing <Marked_a__from(X),Marked_mark(X)><Marked_mark(from(X)),Marked_a__from(
                                                                   mark(
                                                                    X))><
Marked_mark(from(X)),Marked_mark(X)>
 [ {
      
     DP termination of:
     <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
<Marked_mark(s(X)) , Marked_mark(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
<Marked_mark(s(X)) , Marked_mark(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ cons ] (X0,X1) = 1*X0 + 1; 
 [ a__length1 ] (X0) = 0; 
 [ a__from ] (X0) = 2*X0 + 1; 
 [ from ] (X0) = 2*X0 + 1; 
 [ length1 ] (X0) = 0; 
 [ a__length ] (X0) = 0; 
 [ Marked_mark ] (X0) = 3*X0; 
 [ mark ] (X0) = 2*X0; 
 [ length ] (X0) = 0; 
 [ 0 ] () = 0; 
 [ s ] (X0) = 2*X0; 
 [ nil ] () = 0; 
 removing <Marked_mark(cons(X1,X2)),Marked_mark(X1)>
 [ {
      
     DP termination of:
     <Marked_mark(s(X)) , Marked_mark(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_mark(s(X)) , Marked_mark(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ cons ] (X0,X1) = 2 + 2*X1 + 0; 
 [ a__length1 ] (X0) = 1*X0 + 0; 
 [ a__from ] (X0) = 2 + 0; 
 [ from ] (X0) = 0; 
 [ length1 ] (X0) = 1*X0 + 0; 
 [ a__length ] (X0) = 1*X0 + 0; 
 [ Marked_mark ] (X0) = 3*X0 + 0; 
 [ mark ] (X0) = 2 + 3*X0 + 0; 
 [ length ] (X0) = 1*X0 + 0; 
 [ 0 ] () = 0; 
 [ s ] (X0) = 1 + 2*X0 + 0; 
 [ nil ] () = 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_a__length(cons(X,Y)) , Marked_a__length1(Y)>
<Marked_a__length1(X) , Marked_a__length(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ cons ] (X0,X1) = 2 + 1*X1 + 0; 
 [ a__length1 ] (X0) = 2 + 2*X0 + 0; 
 [ a__from ] (X0) = 2 + 0; 
 [ Marked_a__length ] (X0) = 2 + 3*X0 + 0; 
 [ from ] (X0) = 0; 
 [ length1 ] (X0) = 1*X0 + 0; 
 [ a__length ] (X0) = 2 + 2*X0 + 0; 
 [ mark ] (X0) = 2 + 2*X0 + 0; 
 [ length ] (X0) = 2*X0 + 0; 
 [ 0 ] () = 0; 
 [ s ] (X0) = 0; 
 [ Marked_a__length1 ] (X0) = 3 + 3*X0 + 0; 
 [ nil ] () = 0; 
 ]} 
 ]} 
 ]} 

Cime worked for 0.183408 seconds (real time)
Cime Exit Status: 0