Average Error: 0.0 → 0.0
Time: 5.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 r336724 = 2.0;
        double r336725 = x;
        double r336726 = r336725 * r336725;
        double r336727 = y;
        double r336728 = r336725 * r336727;
        double r336729 = r336726 + r336728;
        double r336730 = r336724 * r336729;
        return r336730;
}
↓
double f(double x, double y) {
        double r336731 = x;
        double r336732 = y;
        double r336733 = r336731 + r336732;
        double r336734 = 2.0;
        double r336735 = r336733 * r336734;
        double r336736 = r336731 * r336735;
        return r336736;
}

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 2019199 +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))))