--format=human-long

--- tricky_0 ---

goal:
   00 01 11 10 
00 T  -  F  -
01 -  T  F  F
11 F  T  -  F
10 F  F  F  F

best fit:
   00 01 11 10 
00 T  T  F  F
01 T  T  F  F
11 F  T  T  F
10 F  F  F  F

solution:
(!a && !c) || (a && b && d)

Gate cost: NOTs = 2, ANDs = 3, ORs = 1


--- tricky_1 ---

goal:
   00 01 11 10 
00 -  -  -  F
01 -  T  -  F
11 -  -  -  T
10 F  F  -  -

best fit:
   00 01 11 10 
00 T  T  F  F
01 T  T  F  F
11 T  T  T  T
10 F  F  F  F

solution:
(a && b) || (!a && !c)

Gate cost: NOTs = 2, ANDs = 2, ORs = 1


=== optimized solution ===

Negated inputs: a, c
Products:
	[0] = a && b
	[1] = d && [0]
	[2] = !a && !c
Sums:
	"tricky_0" = [1] || [2]
	"tricky_1" = [0] || [2]

Gate cost: NOTs = 2, ANDs = 3, ORs = 2