<PROBLEM>
<SYMBOLS>
# Name : [Unknown|Known|Alias] (* Optional comment *) ;
  i1 : Known (**);
  i2 : Known (**);
  O1 : Unknown (* *);    
  
</SYMBOLS>
<ALIASES>
# Name = BooleanFormula (* Optional comment *) ;
</ALIASES>
<REQUIREMENTS>
# Name : BooleanFormula [=<|=] BooleanFormula (* Optional comment *) ;
RR10 : (**)   
i1./O1=0;     

RR11 : (**)   
i2.O1=0;   
 
</REQUIREMENTS>
<ASSUMPTIONS>
# Name :  (* Optional comment *) 
# BooleanFormula = BooleanFormula ;
</ASSUMPTIONS>                                                                    
<PRIORITIES>
# [Name|{Name, Name}] >> Name (* Optional comment *) ;
</PRIORITIES>
<OPTIMUM CRITERIA>
# Name : [Minimal|Maximal] (* Comment *)
#         BooleanFormula ;
</OPTIMUM CRITERIA>
</PROBLEM>


Global Boolean equations system building:
* SubProblem 1:
  - Number of unknowns: 1
  - Number of optimum criteria: 0
  - Size of the BDD which represents the Boolean equation: 5
  - Time spent: 0 ms
- Time spent for all systems building: 0 ms
Results:
* SubProblem 1:
- The following consistent condition must be equal to 0.
      Consistent condition = i1.i2

Generation of the code :

Global Boolean equation solving:
* SubProblem 1:
  - The Boolean equations system has no solution.
  - Time spent for resolution : 0 ms
- Time spent for all resolutions : 1 ms


Details of BDD operations:
- BDD nodes stored    :   16
- Operations stored   :    4
- Operations not made :    0
