Average Error: 0.0 → 0.1
Time: 1.5s
Precision: 64
\[2 \cdot \left(x \cdot x + x \cdot y\right)\]
↓
\[x \cdot \left(\left(x + y\right) \cdot 2\right)\]
2 \cdot \left(x \cdot x + x \cdot y\right)
↓
x \cdot \left(\left(x + y\right) \cdot 2\right)
double f(double x, double y) {
        double r497197 = 2.0;
        double r497198 = x;
        double r497199 = r497198 * r497198;
        double r497200 = y;
        double r497201 = r497198 * r497200;
        double r497202 = r497199 + r497201;
        double r497203 = r497197 * r497202;
        return r497203;
}
↓
double f(double x, double y) {
        double r497204 = x;
        double r497205 = y;
        double r497206 = r497204 + r497205;
        double r497207 = 2.0;
        double r497208 = r497206 * r497207;
        double r497209 = r497204 * r497208;
        return r497209;
}

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

Derivation

  1. Initial program 0.0

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

  2. Simplified0.0

    \[\leadsto \color{blue}{\left(x \cdot \left(x + y\right)\right) \cdot 2}\]
  3. Using strategy rm

  4. Applied associate-*l*0.1

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

  5. Final simplification0.1

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

Reproduce

herbie shell --seed 2019354 
(FPCore (x y)
  :name "Linear.Matrix:fromQuaternion from linear-1.19.1.3, B"
  :precision binary64

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

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