Average Error: 0.0 → 0.0
Time: 3.1s
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 r399682 = 2.0;
        double r399683 = x;
        double r399684 = r399683 * r399683;
        double r399685 = y;
        double r399686 = r399683 * r399685;
        double r399687 = r399684 + r399686;
        double r399688 = r399682 * r399687;
        return r399688;
}
↓
double f(double x, double y) {
        double r399689 = x;
        double r399690 = y;
        double r399691 = r399689 + r399690;
        double r399692 = 2.0;
        double r399693 = r399691 * r399692;
        double r399694 = r399689 * r399693;
        return r399694;
}

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 +o rules:numerics
(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))))