Average Error: 0.0 → 0.0
Time: 2.4s
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 r432561 = 2.0;
        double r432562 = x;
        double r432563 = r432562 * r432562;
        double r432564 = y;
        double r432565 = r432562 * r432564;
        double r432566 = r432563 + r432565;
        double r432567 = r432561 * r432566;
        return r432567;
}
↓
double f(double x, double y) {
        double r432568 = x;
        double r432569 = y;
        double r432570 = r432568 + r432569;
        double r432571 = 2.0;
        double r432572 = r432570 * r432571;
        double r432573 = r432568 * r432572;
        return r432573;
}

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(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.0

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

  5. Final simplification0.0

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

Reproduce

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

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

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