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

TRS termination of:
[1] admit(x,nil) -> nil
[2] admit(x,.(u,.(v,.(w,z)))) ->
 cond(=(sum(x,u,v),w),.(u,.(v,.(w,admit(carry(x,u,v),z)))))
[3] cond(true,y) -> y


Sub problem: 
guided: 

DP termination of:
<Marked_admit(x,.(u,.(v,.(w,z)))) , Marked_cond(=(sum(x,u,v),w),
                                     .(u,.(v,.(w,admit(carry(x,u,v),z)))))>
<Marked_admit(x,.(u,.(v,.(w,z)))) , Marked_admit(carry(x,u,v),z)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_admit(x,.(u,.(v,.(w,z)))) , Marked_admit(carry(x,u,v),z)> 
      --> <Marked_admit(x,.(u,.(v,.(w,z)))) , Marked_admit(carry(x,u,v),z)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  admit(x,nil) >= nil ;
  admit(x,.(u,.(v,.(w,z)))) >= cond(=(sum(x,u,v),w),
                                .(u,.(v,.(w,admit(carry(x,u,v),z))))) ;
  cond(true,y) >= y ;
  Marked_admit(x,.(u,.(v,.(w,z)))) >= Marked_admit(carry(x,u,v),z) ;
 }
 + Disjunctions:{ 
{
  Marked_admit(x,.(u,.(v,.(w,z)))) > Marked_admit(carry(x,u,v),z) ;
 }
 } 
=== 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: admit(x,nil) >= nil
constraint: admit(x,.(u,.(v,.(w,z)))) >= cond(=(sum(x,u,v),w),
                                          .(u,.(v,.(w,admit(carry(x,u,v),z)))))
constraint: cond(true,y) >= y
constraint: Marked_admit(x,.(u,.(v,.(w,z)))) >= Marked_admit(carry(x,u,v),z)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] admit(x,nil) -> nil
[2] admit(x,.(u,.(v,.(w,z)))) ->
 cond(=(sum(x,u,v),w),.(u,.(v,.(w,admit(carry(x,u,v),z)))))
[3] cond(true,y) -> y
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_admit(x,.(u,.(v,.(w,z)))) , Marked_cond(=(sum(x,u,v),w),
                                          .(u,.(v,.(w,admit(carry(x,u,v),z)))))>
<Marked_admit(x,.(u,.(v,.(w,z)))) , Marked_admit(carry(x,u,v),z)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_admit(x,.(u,.(v,.(w,z)))) , Marked_admit(carry(x,u,v),z)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ nil ] () = 0; 
 [ true ] () = 3 + 0; 
 [ sum ] (X0,X1,X2) = 1 + 1*X2 + 0; 
 [ cond ] (X0,X1) = 1*X0 + 1*X1 + 0; 
 [ Marked_admit ] (X0,X1) = 2*X1 + 0; 
 [ . ] (X0,X1) = 3*X0 + 3*X1 + 0; 
 [ admit ] (X0,X1) = 2*X1 + 0; 
 [ w ] () = 1 + 0; 
 [ = ] (X0,X1) = 1*X0 + 0; 
 [ carry ] (X0,X1,X2) = 0; 
 ]} 
 ]} 
 ]} 

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