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

Derivation

  1. Initial program 0.0

    \[\left(x + y\right) + x\]
  2. Using strategy rm

  3. Applied add-cbrt-cube_binary64_1763442.8

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

  4. Simplified42.8

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

  5. Taylor expanded around -inf 0

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

  6. Simplified0

    \[\leadsto \color{blue}{\sqrt[3]{-1} \cdot \left(x \cdot -2 - y\right)}\]

  7. Final simplification0

    \[\leadsto \sqrt[3]{-1} \cdot \left(x \cdot -2 - y\right)\]

Reproduce

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