Average Error: 0.0 → 0.0
Time: 12.3s
Precision: 64
\[2 \cdot \left(x \cdot x + x \cdot y\right)\]
↓
\[\left(2 \cdot x\right) \cdot \left(x + y\right)\]
2 \cdot \left(x \cdot x + x \cdot y\right)
↓
\left(2 \cdot x\right) \cdot \left(x + y\right)
double f(double x, double y) {
        double r355886 = 2.0;
        double r355887 = x;
        double r355888 = r355887 * r355887;
        double r355889 = y;
        double r355890 = r355887 * r355889;
        double r355891 = r355888 + r355890;
        double r355892 = r355886 * r355891;
        return r355892;
}
↓
double f(double x, double y) {
        double r355893 = 2.0;
        double r355894 = x;
        double r355895 = r355893 * r355894;
        double r355896 = y;
        double r355897 = r355894 + r355896;
        double r355898 = r355895 * r355897;
        return r355898;
}

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. Using strategy rm

  3. Applied distribute-lft-out0.0

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

  4. Applied associate-*r*0.0

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

  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019326 +o rules:numerics
(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))))