Average Error: 0.0 → 0
Time: 477.0ms
Precision: 64
\[\left(x + y\right) + x\]
↓
\[y + \left(x + x\right)\]
\left(x + y\right) + x
↓
y + \left(x + x\right)
double code(double x, double y) {
	return ((double) (((double) (x + y)) + x));
}
↓
double code(double x, double y) {
	return ((double) (y + ((double) (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. Using strategy rm

  3. Applied +-commutative0.0

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

  4. Applied associate-+l+0

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

  5. Final simplification0

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

Reproduce

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

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

  (+ (+ x y) x))