Average Error: 0.0 → 0
Time: 1.0s
Precision: binary64
\[\left(x + y\right) + x\]
↓
\[y + \left(x + x\right)\]
\left(x + y\right) + x
↓
y + \left(x + x\right)
(FPCore (x y) :precision binary64 (+ (+ x y) x))
↓
(FPCore (x y) :precision binary64 (+ y (+ x x)))
double code(double x, double y) {
	return (x + y) + x;
}
↓
double code(double x, double y) {
	return y + (x + 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
Herbie0
\[y + 2 \cdot x\]

Derivation

  1. Initial program 0.0

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

  2. Taylor expanded around 0 0

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

  3. Simplified0

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

  4. Final simplification0

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

Reproduce

herbie shell --seed 2021044 
(FPCore (x y)
  :name "Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendOutside from plot-0.2.3.4, A"
  :precision binary64

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

  (+ (+ x y) x))