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

TRS termination of:
[1] active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
[2] active(__(X,nil)) -> mark(X)
[3] active(__(nil,X)) -> mark(X)
[4] active(and(tt,X)) -> mark(X)
[5] active(isNePal(__(I,__(P,I)))) -> mark(tt)
[6] active(__(X1,X2)) -> __(active(X1),X2)
[7] active(__(X1,X2)) -> __(X1,active(X2))
[8] active(and(X1,X2)) -> and(active(X1),X2)
[9] active(isNePal(X)) -> isNePal(active(X))
[10] __(mark(X1),X2) -> mark(__(X1,X2))
[11] __(X1,mark(X2)) -> mark(__(X1,X2))
[12] and(mark(X1),X2) -> mark(and(X1,X2))
[13] isNePal(mark(X)) -> mark(isNePal(X))
[14] proper(__(X1,X2)) -> __(proper(X1),proper(X2))
[15] proper(nil) -> ok(nil)
[16] proper(and(X1,X2)) -> and(proper(X1),proper(X2))
[17] proper(tt) -> ok(tt)
[18] proper(isNePal(X)) -> isNePal(proper(X))
[19] __(ok(X1),ok(X2)) -> ok(__(X1,X2))
[20] and(ok(X1),ok(X2)) -> ok(and(X1,X2))
[21] isNePal(ok(X)) -> ok(isNePal(X))
[22] top(mark(X)) -> top(proper(X))
[23] top(ok(X)) -> top(active(X))


Sub problem: 
guided: 

DP termination of:
<Marked_active(__(__(X,Y),Z)) , Marked___(X,__(Y,Z))>
<Marked_active(__(__(X,Y),Z)) , Marked___(Y,Z)>
<Marked_active(__(X1,X2)) , Marked___(active(X1),X2)>
<Marked_active(__(X1,X2)) , Marked_active(X1)>
<Marked_active(__(X1,X2)) , Marked___(X1,active(X2))>
<Marked_active(__(X1,X2)) , Marked_active(X2)>
<Marked_active(and(X1,X2)) , Marked_and(active(X1),X2)>
<Marked_active(and(X1,X2)) , Marked_active(X1)>
<Marked_active(isNePal(X)) , Marked_isNePal(active(X))>
<Marked_active(isNePal(X)) , Marked_active(X)>
<Marked___(mark(X1),X2) , Marked___(X1,X2)>
<Marked___(X1,mark(X2)) , Marked___(X1,X2)>
<Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
<Marked_isNePal(mark(X)) , Marked_isNePal(X)>
<Marked_proper(__(X1,X2)) , Marked___(proper(X1),proper(X2))>
<Marked_proper(__(X1,X2)) , Marked_proper(X1)>
<Marked_proper(__(X1,X2)) , Marked_proper(X2)>
<Marked_proper(and(X1,X2)) , Marked_and(proper(X1),proper(X2))>
<Marked_proper(and(X1,X2)) , Marked_proper(X1)>
<Marked_proper(and(X1,X2)) , Marked_proper(X2)>
<Marked_proper(isNePal(X)) , Marked_isNePal(proper(X))>
<Marked_proper(isNePal(X)) , Marked_proper(X)>
<Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)>
<Marked_and(ok(X1),ok(X2)) , Marked_and(X1,X2)>
<Marked_isNePal(ok(X)) , Marked_isNePal(X)>
<Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(mark(X)) , Marked_proper(X)>
<Marked_top(ok(X)) , Marked_top(active(X))>
<Marked_top(ok(X)) , Marked_active(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 6 components:

{  <Marked_top(ok(X)) , Marked_top(active(X))> 
      --> <Marked_top(ok(X)) , Marked_top(active(X))>
  <Marked_top(ok(X)) , Marked_top(active(X))> 
     --> <Marked_top(mark(X)) , Marked_top(proper(X))>
  <Marked_top(mark(X)) , Marked_top(proper(X))> 
     --> <Marked_top(ok(X)) , Marked_top(active(X))>
  <Marked_top(mark(X)) , Marked_top(proper(X))> 
     --> <Marked_top(mark(X)) , Marked_top(proper(X))>
}

{  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
      --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
}

{  <Marked_active(isNePal(X)) , Marked_active(X)> 
      --> <Marked_active(isNePal(X)) , Marked_active(X)>
  <Marked_active(isNePal(X)) , Marked_active(X)> 
     --> <Marked_active(and(X1,X2)) , Marked_active(X1)>
  <Marked_active(isNePal(X)) , Marked_active(X)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X2)>
  <Marked_active(isNePal(X)) , Marked_active(X)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X1)>
  <Marked_active(and(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(isNePal(X)) , Marked_active(X)>
  <Marked_active(and(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(and(X1,X2)) , Marked_active(X1)>
  <Marked_active(and(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X2)>
  <Marked_active(and(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X1)>
  <Marked_active(__(X1,X2)) , Marked_active(X2)> 
     --> <Marked_active(isNePal(X)) , Marked_active(X)>
  <Marked_active(__(X1,X2)) , Marked_active(X2)> 
     --> <Marked_active(and(X1,X2)) , Marked_active(X1)>
  <Marked_active(__(X1,X2)) , Marked_active(X2)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X2)>
  <Marked_active(__(X1,X2)) , Marked_active(X2)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X1)>
  <Marked_active(__(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(isNePal(X)) , Marked_active(X)>
  <Marked_active(__(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(and(X1,X2)) , Marked_active(X1)>
  <Marked_active(__(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X2)>
  <Marked_active(__(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X1)>
}

{  <Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)> 
      --> <Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)>
  <Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)> 
     --> <Marked___(X1,mark(X2)) , Marked___(X1,X2)>
  <Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)> 
     --> <Marked___(mark(X1),X2) , Marked___(X1,X2)>
  <Marked___(X1,mark(X2)) , Marked___(X1,X2)> 
     --> <Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)>
  <Marked___(X1,mark(X2)) , Marked___(X1,X2)> 
     --> <Marked___(X1,mark(X2)) , Marked___(X1,X2)>
  <Marked___(X1,mark(X2)) , Marked___(X1,X2)> 
     --> <Marked___(mark(X1),X2) , Marked___(X1,X2)>
  <Marked___(mark(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)>
  <Marked___(mark(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(X1,mark(X2)) , Marked___(X1,X2)>
  <Marked___(mark(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(mark(X1),X2) , Marked___(X1,X2)>
}

{  <Marked_and(ok(X1),ok(X2)) , Marked_and(X1,X2)> 
      --> <Marked_and(ok(X1),ok(X2)) , Marked_and(X1,X2)>
  <Marked_and(ok(X1),ok(X2)) , Marked_and(X1,X2)> 
     --> <Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
  <Marked_and(mark(X1),X2) , Marked_and(X1,X2)> 
     --> <Marked_and(ok(X1),ok(X2)) , Marked_and(X1,X2)>
  <Marked_and(mark(X1),X2) , Marked_and(X1,X2)> 
     --> <Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
}

{  <Marked_isNePal(ok(X)) , Marked_isNePal(X)> 
      --> <Marked_isNePal(ok(X)) , Marked_isNePal(X)>
  <Marked_isNePal(ok(X)) , Marked_isNePal(X)> 
     --> <Marked_isNePal(mark(X)) , Marked_isNePal(X)>
  <Marked_isNePal(mark(X)) , Marked_isNePal(X)> 
     --> <Marked_isNePal(ok(X)) , Marked_isNePal(X)>
  <Marked_isNePal(mark(X)) , Marked_isNePal(X)> 
     --> <Marked_isNePal(mark(X)) , Marked_isNePal(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(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: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(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:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_proper(__(X1,X2)) >= Marked_proper(X1) ;
  Marked_proper(__(X1,X2)) >= Marked_proper(X2) ;
  Marked_proper(and(X1,X2)) >= Marked_proper(X1) ;
  Marked_proper(and(X1,X2)) >= Marked_proper(X2) ;
  Marked_proper(isNePal(X)) >= Marked_proper(X) ;
 }
 + Disjunctions:{ 
{
  Marked_proper(__(X1,X2)) > Marked_proper(X1) ;
 }
{
  Marked_proper(__(X1,X2)) > Marked_proper(X2) ;
 }
{
  Marked_proper(and(X1,X2)) > Marked_proper(X1) ;
 }
{
  Marked_proper(and(X1,X2)) > Marked_proper(X2) ;
 }
{
  Marked_proper(isNePal(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: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_proper(__(X1,X2)) >= Marked_proper(X1)
constraint: Marked_proper(__(X1,X2)) >= Marked_proper(X2)
constraint: Marked_proper(and(X1,X2)) >= Marked_proper(X1)
constraint: Marked_proper(and(X1,X2)) >= Marked_proper(X2)
constraint: Marked_proper(isNePal(X)) >= Marked_proper(X)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_active(__(X1,X2)) >= Marked_active(X1) ;
  Marked_active(__(X1,X2)) >= Marked_active(X2) ;
  Marked_active(and(X1,X2)) >= Marked_active(X1) ;
  Marked_active(isNePal(X)) >= Marked_active(X) ;
 }
 + Disjunctions:{ 
{
  Marked_active(__(X1,X2)) > Marked_active(X1) ;
 }
{
  Marked_active(__(X1,X2)) > Marked_active(X2) ;
 }
{
  Marked_active(and(X1,X2)) > Marked_active(X1) ;
 }
{
  Marked_active(isNePal(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: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_active(__(X1,X2)) >= Marked_active(X1)
constraint: Marked_active(__(X1,X2)) >= Marked_active(X2)
constraint: Marked_active(and(X1,X2)) >= Marked_active(X1)
constraint: Marked_active(isNePal(X)) >= Marked_active(X)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked___(mark(X1),X2) >= Marked___(X1,X2) ;
  Marked___(ok(X1),ok(X2)) >= Marked___(X1,X2) ;
  Marked___(X1,mark(X2)) >= Marked___(X1,X2) ;
 }
 + Disjunctions:{ 
{
  Marked___(mark(X1),X2) > Marked___(X1,X2) ;
 }
{
  Marked___(ok(X1),ok(X2)) > Marked___(X1,X2) ;
 }
{
  Marked___(X1,mark(X2)) > Marked___(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: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked___(mark(X1),X2) >= Marked___(X1,X2)
constraint: Marked___(ok(X1),ok(X2)) >= Marked___(X1,X2)
constraint: Marked___(X1,mark(X2)) >= Marked___(X1,X2)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_and(mark(X1),X2) >= Marked_and(X1,X2) ;
  Marked_and(ok(X1),ok(X2)) >= Marked_and(X1,X2) ;
 }
 + Disjunctions:{ 
{
  Marked_and(mark(X1),X2) > Marked_and(X1,X2) ;
 }
{
  Marked_and(ok(X1),ok(X2)) > Marked_and(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: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_and(mark(X1),X2) >= Marked_and(X1,X2)
constraint: Marked_and(ok(X1),ok(X2)) >= Marked_and(X1,X2)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_isNePal(mark(X)) >= Marked_isNePal(X) ;
  Marked_isNePal(ok(X)) >= Marked_isNePal(X) ;
 }
 + Disjunctions:{ 
{
  Marked_isNePal(mark(X)) > Marked_isNePal(X) ;
 }
{
  Marked_isNePal(ok(X)) > Marked_isNePal(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(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_isNePal(mark(X)) >= Marked_isNePal(X)
constraint: Marked_isNePal(ok(X)) >= Marked_isNePal(X)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_top(ok(X)) , Marked_top(active(X))> 
      --> <Marked_top(ok(X)) , Marked_top(active(X))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(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: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(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:

{  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
      --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_proper(__(X1,X2)) >= Marked_proper(X1) ;
  Marked_proper(__(X1,X2)) >= Marked_proper(X2) ;
  Marked_proper(isNePal(X)) >= Marked_proper(X) ;
 }
 + Disjunctions:{ 
{
  Marked_proper(__(X1,X2)) > Marked_proper(X1) ;
 }
{
  Marked_proper(__(X1,X2)) > Marked_proper(X2) ;
 }
{
  Marked_proper(isNePal(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: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_proper(__(X1,X2)) >= Marked_proper(X1)
constraint: Marked_proper(__(X1,X2)) >= Marked_proper(X2)
constraint: Marked_proper(isNePal(X)) >= Marked_proper(X)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
      --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_proper(__(X1,X2)) >= Marked_proper(X1) ;
  Marked_proper(__(X1,X2)) >= Marked_proper(X2) ;
 }
 + Disjunctions:{ 
{
  Marked_proper(__(X1,X2)) > Marked_proper(X1) ;
 }
{
  Marked_proper(__(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: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_proper(__(X1,X2)) >= Marked_proper(X1)
constraint: Marked_proper(__(X1,X2)) >= Marked_proper(X2)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_active(isNePal(X)) , Marked_active(X)> 
      --> <Marked_active(isNePal(X)) , Marked_active(X)>
  <Marked_active(isNePal(X)) , Marked_active(X)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X2)>
  <Marked_active(isNePal(X)) , Marked_active(X)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X1)>
  <Marked_active(__(X1,X2)) , Marked_active(X2)> 
     --> <Marked_active(isNePal(X)) , Marked_active(X)>
  <Marked_active(__(X1,X2)) , Marked_active(X2)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X2)>
  <Marked_active(__(X1,X2)) , Marked_active(X2)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X1)>
  <Marked_active(__(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(isNePal(X)) , Marked_active(X)>
  <Marked_active(__(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X2)>
  <Marked_active(__(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X1)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_active(__(X1,X2)) >= Marked_active(X1) ;
  Marked_active(__(X1,X2)) >= Marked_active(X2) ;
  Marked_active(isNePal(X)) >= Marked_active(X) ;
 }
 + Disjunctions:{ 
{
  Marked_active(__(X1,X2)) > Marked_active(X1) ;
 }
{
  Marked_active(__(X1,X2)) > Marked_active(X2) ;
 }
{
  Marked_active(isNePal(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: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_active(__(X1,X2)) >= Marked_active(X1)
constraint: Marked_active(__(X1,X2)) >= Marked_active(X2)
constraint: Marked_active(isNePal(X)) >= Marked_active(X)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_active(isNePal(X)) , Marked_active(X)> 
      --> <Marked_active(isNePal(X)) , Marked_active(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_active(isNePal(X)) >= Marked_active(X) ;
 }
 + Disjunctions:{ 
{
  Marked_active(isNePal(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: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_active(isNePal(X)) >= Marked_active(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)> 
      --> <Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)>
  <Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)> 
     --> <Marked___(mark(X1),X2) , Marked___(X1,X2)>
  <Marked___(mark(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)>
  <Marked___(mark(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(mark(X1),X2) , Marked___(X1,X2)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked___(mark(X1),X2) >= Marked___(X1,X2) ;
  Marked___(ok(X1),ok(X2)) >= Marked___(X1,X2) ;
 }
 + Disjunctions:{ 
{
  Marked___(mark(X1),X2) > Marked___(X1,X2) ;
 }
{
  Marked___(ok(X1),ok(X2)) > Marked___(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: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked___(mark(X1),X2) >= Marked___(X1,X2)
constraint: Marked___(ok(X1),ok(X2)) >= Marked___(X1,X2)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked___(mark(X1),X2) , Marked___(X1,X2)> 
      --> <Marked___(mark(X1),X2) , Marked___(X1,X2)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked___(mark(X1),X2) >= Marked___(X1,X2) ;
 }
 + Disjunctions:{ 
{
  Marked___(mark(X1),X2) > Marked___(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: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked___(mark(X1),X2) >= Marked___(X1,X2)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_and(mark(X1),X2) , Marked_and(X1,X2)> 
      --> <Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_and(mark(X1),X2) >= Marked_and(X1,X2) ;
 }
 + Disjunctions:{ 
{
  Marked_and(mark(X1),X2) > Marked_and(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: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_and(mark(X1),X2) >= Marked_and(X1,X2)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_isNePal(ok(X)) , Marked_isNePal(X)> 
      --> <Marked_isNePal(ok(X)) , Marked_isNePal(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNePal(__(I,__(P,I)))) >= mark(tt) ;
  active(isNePal(X)) >= isNePal(active(X)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNePal(mark(X)) >= mark(isNePal(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_isNePal(ok(X)) >= Marked_isNePal(X) ;
 }
 + Disjunctions:{ 
{
  Marked_isNePal(ok(X)) > Marked_isNePal(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(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(X1,X2))
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(tt)
constraint: active(isNePal(X)) >= isNePal(active(X))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNePal(mark(X)) >= mark(isNePal(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_isNePal(ok(X)) >= Marked_isNePal(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
[2] active(__(X,nil)) -> mark(X)
[3] active(__(nil,X)) -> mark(X)
[4] active(and(tt,X)) -> mark(X)
[5] active(isNePal(__(I,__(P,I)))) -> mark(tt)
[6] active(__(X1,X2)) -> __(active(X1),X2)
[7] active(__(X1,X2)) -> __(X1,active(X2))
[8] active(and(X1,X2)) -> and(active(X1),X2)
[9] active(isNePal(X)) -> isNePal(active(X))
[10] __(mark(X1),X2) -> mark(__(X1,X2))
[11] __(X1,mark(X2)) -> mark(__(X1,X2))
[12] and(mark(X1),X2) -> mark(and(X1,X2))
[13] isNePal(mark(X)) -> mark(isNePal(X))
[14] proper(__(X1,X2)) -> __(proper(X1),proper(X2))
[15] proper(nil) -> ok(nil)
[16] proper(and(X1,X2)) -> and(proper(X1),proper(X2))
[17] proper(tt) -> ok(tt)
[18] proper(isNePal(X)) -> isNePal(proper(X))
[19] __(ok(X1),ok(X2)) -> ok(__(X1,X2))
[20] and(ok(X1),ok(X2)) -> ok(and(X1,X2))
[21] isNePal(ok(X)) -> ok(isNePal(X))
[22] top(mark(X)) -> top(proper(X))
[23] top(ok(X)) -> top(active(X))
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_active(__(__(X,Y),Z)) , Marked___(X,__(Y,Z))>
<Marked_active(__(__(X,Y),Z)) , Marked___(Y,Z)>
<Marked_active(__(X1,X2)) , Marked___(active(X1),X2)>
<Marked_active(__(X1,X2)) , Marked_active(X1)>
<Marked_active(__(X1,X2)) , Marked___(X1,active(X2))>
<Marked_active(__(X1,X2)) , Marked_active(X2)>
<Marked_active(and(X1,X2)) , Marked_and(active(X1),X2)>
<Marked_active(and(X1,X2)) , Marked_active(X1)>
<Marked_active(isNePal(X)) , Marked_isNePal(active(X))>
<Marked_active(isNePal(X)) , Marked_active(X)>
<Marked___(mark(X1),X2) , Marked___(X1,X2)>
<Marked___(X1,mark(X2)) , Marked___(X1,X2)>
<Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
<Marked_isNePal(mark(X)) , Marked_isNePal(X)>
<Marked_proper(__(X1,X2)) , Marked___(proper(X1),proper(X2))>
<Marked_proper(__(X1,X2)) , Marked_proper(X1)>
<Marked_proper(__(X1,X2)) , Marked_proper(X2)>
<Marked_proper(and(X1,X2)) , Marked_and(proper(X1),proper(X2))>
<Marked_proper(and(X1,X2)) , Marked_proper(X1)>
<Marked_proper(and(X1,X2)) , Marked_proper(X2)>
<Marked_proper(isNePal(X)) , Marked_isNePal(proper(X))>
<Marked_proper(isNePal(X)) , Marked_proper(X)>
<Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)>
<Marked_and(ok(X1),ok(X2)) , Marked_and(X1,X2)>
<Marked_isNePal(ok(X)) , Marked_isNePal(X)>
<Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(mark(X)) , Marked_proper(X)>
<Marked_top(ok(X)) , Marked_top(active(X))>
<Marked_top(ok(X)) , Marked_active(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(ok(X)) , Marked_top(active(X))>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0 + 2; 
 [ ok ] (X0) = 1*X0; 
 [ and ] (X0,X1) = 1*X1 + 1*X0 + 2; 
 [ active ] (X0) = 1*X0; 
 [ Marked_top ] (X0) = 1*X0; 
 [ isNePal ] (X0) = 3*X0 + 2; 
 [ __ ] (X0,X1) = 1*X1 + 3*X0 + 1; 
 [ top ] (X0) = 0; 
 [ tt ] () = 0; 
 [ nil ] () = 2; 
 [ proper ] (X0) = 1*X0; 
 removing <Marked_top(mark(X)),Marked_top(proper(X))>
 [ {
      
     DP termination of:
     <Marked_top(ok(X)) , Marked_top(active(X))>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_top(ok(X)) , Marked_top(active(X))>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 0; 
 [ ok ] (X0) = 2 + 2*X0 + 0; 
 [ and ] (X0,X1) = 1*X1 + 0; 
 [ active ] (X0) = 2*X0 + 0; 
 [ Marked_top ] (X0) = 3*X0 + 0; 
 [ isNePal ] (X0) = 1*X0 + 0; 
 [ __ ] (X0,X1) = 2 + 1*X0 + 2*X1 + 0; 
 [ top ] (X0) = 0; 
 [ tt ] () = 2 + 0; 
 [ nil ] () = 0; 
 [ proper ] (X0) = 2 + 3*X0 + 0; 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_proper(__(X1,X2)) , Marked_proper(X1)>
<Marked_proper(__(X1,X2)) , Marked_proper(X2)>
<Marked_proper(and(X1,X2)) , Marked_proper(X1)>
<Marked_proper(and(X1,X2)) , Marked_proper(X2)>
<Marked_proper(isNePal(X)) , Marked_proper(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 0; 
 [ and ] (X0,X1) = 2*X1 + 2*X0 + 1; 
 [ Marked_proper ] (X0) = 3*X0; 
 [ active ] (X0) = 2*X0; 
 [ isNePal ] (X0) = 2*X0; 
 [ __ ] (X0,X1) = 2*X1 + 1*X0; 
 [ top ] (X0) = 0; 
 [ tt ] () = 0; 
 [ nil ] () = 0; 
 [ proper ] (X0) = 1*X0; 
 removing <Marked_proper(and(X1,X2)),Marked_proper(X1)><Marked_proper(
                                                         and(X1,X2)),
Marked_proper(X2)>
 [ {
      
     DP termination of:
     <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
<Marked_proper(__(X1,X2)) , Marked_proper(X2)>
<Marked_proper(isNePal(X)) , Marked_proper(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
<Marked_proper(__(X1,X2)) , Marked_proper(X2)>
<Marked_proper(isNePal(X)) , Marked_proper(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 0; 
 [ and ] (X0,X1) = 1; 
 [ Marked_proper ] (X0) = 3*X0; 
 [ active ] (X0) = 1*X0; 
 [ isNePal ] (X0) = 1*X0 + 2; 
 [ __ ] (X0,X1) = 2*X1 + 2*X0; 
 [ top ] (X0) = 0; 
 [ tt ] () = 0; 
 [ nil ] () = 1; 
 [ proper ] (X0) = 2*X0; 
 removing <Marked_proper(isNePal(X)),Marked_proper(X)>
 [ {
      
     DP termination of:
     <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
<Marked_proper(__(X1,X2)) , Marked_proper(X2)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
<Marked_proper(__(X1,X2)) , Marked_proper(X2)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 0; 
 [ ok ] (X0) = 0; 
 [ and ] (X0,X1) = 0; 
 [ Marked_proper ] (X0) = 3*X0 + 0; 
 [ active ] (X0) = 2*X0 + 0; 
 [ isNePal ] (X0) = 2*X0 + 0; 
 [ __ ] (X0,X1) = 1 + 2*X0 + 1*X1 + 0; 
 [ top ] (X0) = 0; 
 [ tt ] () = 0; 
 [ nil ] () = 2 + 0; 
 [ proper ] (X0) = 1*X0 + 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_active(__(X1,X2)) , Marked_active(X1)>
<Marked_active(__(X1,X2)) , Marked_active(X2)>
<Marked_active(and(X1,X2)) , Marked_active(X1)>
<Marked_active(isNePal(X)) , Marked_active(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 0; 
 [ and ] (X0,X1) = 1*X0 + 1; 
 [ active ] (X0) = 1*X0; 
 [ isNePal ] (X0) = 1*X0; 
 [ __ ] (X0,X1) = 2*X1 + 2*X0; 
 [ top ] (X0) = 0; 
 [ tt ] () = 2; 
 [ nil ] () = 2; 
 [ Marked_active ] (X0) = 3*X0; 
 [ proper ] (X0) = 1*X0; 
 removing <Marked_active(and(X1,X2)),Marked_active(X1)>
 [ {
      
     DP termination of:
     <Marked_active(__(X1,X2)) , Marked_active(X1)>
<Marked_active(__(X1,X2)) , Marked_active(X2)>
<Marked_active(isNePal(X)) , Marked_active(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(__(X1,X2)) , Marked_active(X1)>
<Marked_active(__(X1,X2)) , Marked_active(X2)>
<Marked_active(isNePal(X)) , Marked_active(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 0; 
 [ and ] (X0,X1) = 0; 
 [ active ] (X0) = 2*X0; 
 [ isNePal ] (X0) = 1*X0; 
 [ __ ] (X0,X1) = 2*X1 + 2*X0 + 1; 
 [ top ] (X0) = 0; 
 [ tt ] () = 2; 
 [ nil ] () = 0; 
 [ Marked_active ] (X0) = 3*X0; 
 [ proper ] (X0) = 1*X0; 
 removing <Marked_active(__(X1,X2)),Marked_active(X1)><Marked_active(__(X1,X2)),
Marked_active(X2)>
 [ {
      
     DP termination of:
     <Marked_active(isNePal(X)) , Marked_active(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(isNePal(X)) , Marked_active(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 0; 
 [ ok ] (X0) = 2 + 2*X0 + 0; 
 [ and ] (X0,X1) = 1*X1 + 0; 
 [ active ] (X0) = 2*X0 + 0; 
 [ isNePal ] (X0) = 2 + 3*X0 + 0; 
 [ __ ] (X0,X1) = 2 + 3*X0 + 0; 
 [ top ] (X0) = 0; 
 [ tt ] () = 0; 
 [ nil ] () = 0; 
 [ Marked_active ] (X0) = 3*X0 + 0; 
 [ proper ] (X0) = 2 + 3*X0 + 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked___(mark(X1),X2) , Marked___(X1,X2)>
<Marked___(X1,mark(X2)) , Marked___(X1,X2)>
<Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0 + 1; 
 [ ok ] (X0) = 1*X0; 
 [ and ] (X0,X1) = 2*X1 + 2*X0; 
 [ active ] (X0) = 1*X0; 
 [ isNePal ] (X0) = 2*X0; 
 [ __ ] (X0,X1) = 1*X1 + 3*X0 + 1; 
 [ top ] (X0) = 0; 
 [ tt ] () = 2; 
 [ nil ] () = 0; 
 [ proper ] (X0) = 1*X0; 
 [ Marked___ ] (X0,X1) = 2*X1; 
 removing <Marked___(X1,mark(X2)),Marked___(X1,X2)>
 [ {
      
     DP termination of:
     <Marked___(mark(X1),X2) , Marked___(X1,X2)>
<Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked___(mark(X1),X2) , Marked___(X1,X2)>
<Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 2*X0 + 1; 
 [ and ] (X0,X1) = 3*X1 + 2*X0 + 3; 
 [ active ] (X0) = 1*X0; 
 [ isNePal ] (X0) = 1*X0; 
 [ __ ] (X0,X1) = 1*X1; 
 [ top ] (X0) = 0; 
 [ tt ] () = 1; 
 [ nil ] () = 1; 
 [ proper ] (X0) = 3*X0; 
 [ Marked___ ] (X0,X1) = 1*X1; 
 removing <Marked___(ok(X1),ok(X2)),Marked___(X1,X2)>
 [ {
      
     DP termination of:
     <Marked___(mark(X1),X2) , Marked___(X1,X2)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked___(mark(X1),X2) , Marked___(X1,X2)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 1*X0 + 0; 
 [ ok ] (X0) = 0; 
 [ and ] (X0,X1) = 1*X0 + 2*X1 + 0; 
 [ active ] (X0) = 1 + 3*X0 + 0; 
 [ isNePal ] (X0) = 1 + 2*X0 + 0; 
 [ __ ] (X0,X1) = 1 + 2*X0 + 1*X1 + 0; 
 [ top ] (X0) = 0; 
 [ tt ] () = 1 + 0; 
 [ nil ] () = 0; 
 [ proper ] (X0) = 1*X0 + 0; 
 [ Marked___ ] (X0,X1) = 3*X0 + 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
<Marked_and(ok(X1),ok(X2)) , Marked_and(X1,X2)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 2*X0 + 1; 
 [ and ] (X0,X1) = 1*X1; 
 [ active ] (X0) = 1*X0; 
 [ isNePal ] (X0) = 1*X0; 
 [ Marked_and ] (X0,X1) = 1*X1; 
 [ __ ] (X0,X1) = 1*X0; 
 [ top ] (X0) = 0; 
 [ tt ] () = 0; 
 [ nil ] () = 0; 
 [ proper ] (X0) = 1; 
 removing <Marked_and(ok(X1),ok(X2)),Marked_and(X1,X2)>
 [ {
      
     DP termination of:
     <Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 1*X0 + 0; 
 [ ok ] (X0) = 0; 
 [ and ] (X0,X1) = 1*X0 + 2*X1 + 0; 
 [ active ] (X0) = 2*X0 + 0; 
 [ isNePal ] (X0) = 2 + 2*X0 + 0; 
 [ Marked_and ] (X0,X1) = 3*X0 + 0; 
 [ __ ] (X0,X1) = 2 + 2*X0 + 2*X1 + 0; 
 [ top ] (X0) = 0; 
 [ tt ] () = 1 + 0; 
 [ nil ] () = 0; 
 [ proper ] (X0) = 2*X0 + 0; 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_isNePal(mark(X)) , Marked_isNePal(X)>
<Marked_isNePal(ok(X)) , Marked_isNePal(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0 + 1; 
 [ ok ] (X0) = 2*X0; 
 [ and ] (X0,X1) = 1*X1 + 1*X0; 
 [ active ] (X0) = 1*X0 + 1; 
 [ isNePal ] (X0) = 1*X0; 
 [ __ ] (X0,X1) = 1*X1 + 1*X0; 
 [ top ] (X0) = 0; 
 [ tt ] () = 0; 
 [ Marked_isNePal ] (X0) = 3*X0; 
 [ nil ] () = 0; 
 [ proper ] (X0) = 0; 
 removing <Marked_isNePal(mark(X)),Marked_isNePal(X)>
 [ {
      
     DP termination of:
     <Marked_isNePal(ok(X)) , Marked_isNePal(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_isNePal(ok(X)) , Marked_isNePal(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 1*X0 + 0; 
 [ ok ] (X0) = 1 + 1*X0 + 0; 
 [ and ] (X0,X1) = 2*X0 + 1*X1 + 0; 
 [ active ] (X0) = 2*X0 + 0; 
 [ isNePal ] (X0) = 2 + 2*X0 + 0; 
 [ __ ] (X0,X1) = 1 + 2*X0 + 1*X1 + 0; 
 [ top ] (X0) = 0; 
 [ tt ] () = 2 + 0; 
 [ Marked_isNePal ] (X0) = 3*X0 + 0; 
 [ nil ] () = 2 + 0; 
 [ proper ] (X0) = 2*X0 + 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 

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