Average Error: 0.0 → 0.0
Time: 1.1s
Precision: binary64
Cost: 320
\[x \cdot \left(y + 1\right)\]
↓
\[x \cdot \left(y + 1\right)\]
x \cdot \left(y + 1\right)
↓
x \cdot \left(y + 1\right)
(FPCore (x y) :precision binary64 (* x (+ y 1.0)))
↓
(FPCore (x y) :precision binary64 (* x (+ y 1.0)))
double code(double x, double y) {
	return x * (y + 1.0);
}
↓
double code(double x, double y) {
	return x * (y + 1.0);
}

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\]

Alternatives

Alternative 1
Error0.0
Cost320
\[x + x \cdot y\]
Alternative 2
Error35.3
Cost192
\[x \cdot y\]
Alternative 3
Error27.7
Cost64
\[x\]
Alternative 4
Error61.7
Cost64
\[1\]
Alternative 5
Error61.8
Cost64
\[0\]
Alternative 6
Error61.7
Cost64
\[-1\]

Error

Derivation

  1. Initial program 0.0

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

  2. Simplified0.0

    \[\leadsto \color{blue}{x \cdot \left(y + 1\right)}\]

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2021042 
(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)))