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

RR11 : (**)   
O2./i2=0;   

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

OC2 : Maximal (**)
O2;
</OPTIMUM CRITERIA>
</PROBLEM>


Global Boolean equations system building:
* SubProblem 1:
  - Number of unknowns: 2
  - Number of optimum criteria: 2
  - Size of the BDD which represents the Boolean equation: 14
  - Time spent: 1 ms
- Time spent for all systems building: 1 ms
Results:
* SubProblem 1:
  - Solutions:
[One]            O1 = i1
[One]            O2 = /i1.i2
  - Optimum criteria:
[Min]              OC1 = i1
[Max]              OC2 = /i1.i2

Generation of the code :
O1 := i1;
O2 := NOT i1 AND i2;

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


Details of BDD operations:
- BDD nodes stored    :  102
- Operations stored   :   55
- Operations not made :    7
