Average Error: 0.0 → 0.0
Time: 4.7s
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 r758047 = 2.0;
        double r758048 = x;
        double r758049 = r758048 * r758048;
        double r758050 = y;
        double r758051 = r758048 * r758050;
        double r758052 = r758049 + r758051;
        double r758053 = r758047 * r758052;
        return r758053;
}
↓
double f(double x, double y) {
        double r758054 = 2.0;
        double r758055 = x;
        double r758056 = r758054 * r758055;
        double r758057 = y;
        double r758058 = r758055 + r758057;
        double r758059 = r758056 * r758058;
        return r758059;
}

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