- : unit = ()
h : heuristic =
- : unit = ()
APPLY CRITERIA (Marked dependency pairs)
TRS termination of:
[1] f(a,y) -> f(y,g(y))
[2] g(a) -> b
[3] g(b) -> b
Sub problem:
guided:
DP termination of:
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:
{ -->
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
f(a,y) >= f(y,g(y)) ;
g(a) >= b ;
g(b) >= b ;
Marked_f(a,y) >= Marked_f(y,g(y)) ;
}
+ Disjunctions:{
{
Marked_f(a,y) > Marked_f(y,g(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: f(a,y) >= f(y,g(y))
constraint: g(a) >= b
constraint: g(b) >= b
constraint: Marked_f(a,y) >= Marked_f(y,g(y))
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
TRS termination of:
[1] f(a,y) -> f(y,g(y))
[2] g(a) -> b
[3] g(b) -> b
,
CRITERION: MDP
[ {
DP termination of:
,
CRITERION: SG
[ {
DP termination of:
,
CRITERION: ORD
[
Solution found:
polynomial interpretation =
[ f ] (X0,X1) = 2*X0 + 2*X1 + 0;
[ a ] () = 3 + 0;
[ g ] (X0) = 0;
[ Marked_f ] (X0,X1) = 2*X0 + 2*X1 + 0;
[ b ] () = 0;
]}
]}
]}
Cime worked for 0.013071 seconds (real time)
Cime Exit Status: 0