Average Error: 0.0 → 0.0
Time: 924.0ms
Precision: binary64
\[x \cdot \left(y + 1\right) \]
↓
\[x + y \cdot x \]
x \cdot \left(y + 1\right)
↓
x + y \cdot x

(FPCore (x y) :precision binary64 (* x (+ y 1.0)))
↓
(FPCore (x y) :precision binary64 (+ x (* y x)))
double code(double x, double y) {
	return x * (y + 1.0);
}
↓
double code(double x, double y) {
	return x + (y * x);
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[x + x \cdot y \]

Derivation

  1. Initial program 0.0

    \[x \cdot \left(y + 1\right) \]

  2. Taylor expanded around 0 0.0

    \[\leadsto \color{blue}{y \cdot x + x} \]

  3. Final simplification0.0

    \[\leadsto x + y \cdot x \]

Reproduce

herbie shell --seed 2021207 
(FPCore (x y)
  :name "Data.Colour.RGBSpace.HSL:hsl from colour-2.3.3, B"
  :precision binary64

  :herbie-target
  (+ x (* x y))

  (* x (+ y 1.0)))