Average Error: 0.0 → 0.0
Time: 1.4s
Precision: binary64
\[\left(x \cdot x + y\right) + y\]
↓
\[{x}^{2} + 2 \cdot y\]
\left(x \cdot x + y\right) + y
↓
{x}^{2} + 2 \cdot y
(FPCore (x y) :precision binary64 (+ (+ (* x x) y) y))
↓
(FPCore (x y) :precision binary64 (+ (pow x 2.0) (* 2.0 y)))
double code(double x, double y) {
	return ((x * x) + y) + y;
}
↓
double code(double x, double y) {
	return pow(x, 2.0) + (2.0 * y);
}

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
\[\left(y + y\right) + x \cdot x\]

Derivation

  1. Initial program 0.0

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

  2. Taylor expanded around 0 0.0

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

  3. Final simplification0.0

    \[\leadsto {x}^{2} + 2 \cdot y\]

Reproduce

herbie shell --seed 2021043 
(FPCore (x y)
  :name "Data.Random.Distribution.Normal:normalTail from random-fu-0.2.6.2"
  :precision binary64

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

  (+ (+ (* x x) y) y))