
*** Yes
> > > 

*** TESTING COMPABS ***
*** Yes
> > |    |    |    |    
*** Yes
A = @, 
L1 = @, 
L2 = @, 
X = @, 
Y = @, 
Z = @.

--1> 
*** No
> > |    |    |    |    |    |    |    |    
*** Yes
X = @, 
Y = @.

--1> 
*** No
> 
*** Yes
> > 
dynamic(concat_proc)?
concat_proc(actions => [disjunc([unif(@,[]),
                                 unif(@,@)],
                                [unif(@,[@|@]),
                                 unif(@,[@|@]),
                                 abscall(concat,
                                         [@,@,@])],
                                global_vars => [@,
                                                @,
                                                @])],
            global_vars => [@,@,@]) :-
        succeed.

*** Yes
> 
dynamic(toto_proc)?
toto_proc(actions => [disjunc([unif(@,a),abscall(tata,[@])],
                              [disjunc([unif(@,b),
                                        abscall(tata,[@])],
                                       [disjunc([abscall(tutu,
                                                         [@,@]),
                                                 abscall(!,[])],
                                                [abscall(fail,[])],
                                                global_vars => [@,
                                                                @])],
                                       global_vars => [@,@])],
                              global_vars => [@,@])],
          global_vars => [@,@]) :-
        succeed.

*** Yes
--------------7> 
*** No
> > 

*** TESTING NORMALIZATION ***
*** Yes
> > 
t(...)
*** Yes
U = @(...), 
X = t(...).

--1> 
*** No
U = @(...), 
X = t(...).

--1> 
*** No
> > > > > > 

*** TESTING EXTEND AND FIND_NODE ***
*** Yes
> > 
*** Yes
SAT = hasse.

--1> 
*** No
> |    
*** Yes
New = true, 
NewNode = node(...), 
SAT = hasse(...).

--1> 
*** No
> |    
*** Yes
New = true, 
NewNode = node(...), 
SAT = hasse(...).

--1> 
*** No
> |    |    |    |    |    |    |    |    

true  true  true

true
*** Yes
New1 = true, 
New2 = true, 
New3 = false, 
New4 = true, 
New5 = true, 
Node1 = node(...), 
Node2 = node(...), 
Node3 = Node2, 
Node4 = node(...), 
Node5 = node(...), 
Node6 = Node2, 
SAT = hasse(...).

--1> 
*** No
> > > > > > 

*** TESTING ADJUST ***
*** Yes
> > |    |    

[...]
*** Yes
AT = node(...), 
Modified = [...], 
SAT = hasse(...).

--1> 
*** No
> |    |    

[...]
*** Yes
AT = node(...), 
Modified = [...], 
SAT = hasse(...).

--1> 
*** No
> > > > > 

*** TESTING SUSPENSION ***
*** Yes
> > |    |    |    |    |    |    |    |    |    |    |    |    |    |    |    |    |    

OK
*** Yes
Node = node(...), 
SAT = hasse(...).

--1> 
*** No
> > > > > 

*** TESTING DEPENDENCIES ***
*** Yes
> > |    |    |    |    |    |    |    

hasse(...)
*** Yes
Node = node(...), 
Node2 = node(...), 
SAT = hasse(...).

--1> 
*** No
> > 

*** TESTING ANALYSE WITH A SIMPLE DOMAIN ***
*** Yes
> > 
*** Yes
X = @, 
Y = @.

--1> 
*** No
> |    

enter solve_procedure tooo with [...]

exit solve_procedure tooo with [...]

hasse(...)
*** Yes
> > |    |    |    |    
*** Yes
X = @, 
Y = @.

----------------8> 
*** No
> 
*** Yes
> > |    

enter solve_procedure tata with [...]

enter solve_alter with [...]

exit solve_alter with [...]

enter solve_alter with [...]

enter solve_call succeed with []

enter solve_procedure succeed with []

exit solve_procedure succeed with []

exit solve_call succeed with []

exit solve_alter with [...]

  first  alternative:[...]

  second alternative:[...]

  union             :[...]

exit solve_procedure tata with [...]

hasse(...)
*** Yes
> > |    

enter solve_procedure concat with [...]

enter solve_alter with [...]

exit solve_alter with [...]

enter solve_alter with [...]

enter solve_call concat with [...]

exit solve_call concat with @

exit solve_alter with [...]

  first  alternative:[...]

  second alternative:[...]

  union             :[...]

exit solve_procedure concat with [...]

enter solve_procedure concat with [...]

enter solve_alter with [...]

exit solve_alter with [...]

enter solve_alter with [...]

enter solve_call concat with [...]

exit solve_call concat with [...]

exit solve_alter with [...]

  first  alternative:[...]

  second alternative:[...]

  union             :[...]

exit solve_procedure concat with [...]

hasse(...)
*** Yes
--------------7> --------------7> 
*** Yes
X = @, 
Y = @, 
Z = @.

------------------------------15> 
*** No
--------------7> 
*** Yes
X = @, 
Y = @.

------------------------------15> 
*** No
--------------7> |    

enter solve_procedure tutu with [...]

enter solve_call titi with [...]

enter solve_procedure titi with [...]

exit solve_procedure titi with [...]

exit solve_call titi with [...]

exit solve_procedure tutu with [...]

hasse(...)
*** Yes
----------------------------14> 
