Average Error: 0.0 → 0.0
Time: 7.1s
Precision: 64
\[2 \cdot \left(x \cdot x + x \cdot y\right)\]
↓
\[\left(2 \cdot x\right) \cdot \left(y + x\right)\]
2 \cdot \left(x \cdot x + x \cdot y\right)
↓
\left(2 \cdot x\right) \cdot \left(y + x\right)
double f(double x, double y) {
        double r362237 = 2.0;
        double r362238 = x;
        double r362239 = r362238 * r362238;
        double r362240 = y;
        double r362241 = r362238 * r362240;
        double r362242 = r362239 + r362241;
        double r362243 = r362237 * r362242;
        return r362243;
}
↓
double f(double x, double y) {
        double r362244 = 2.0;
        double r362245 = x;
        double r362246 = r362244 * r362245;
        double r362247 = y;
        double r362248 = r362247 + r362245;
        double r362249 = r362246 * r362248;
        return r362249;
}

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 + y\right) \cdot \left(2 \cdot x\right)}\]

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2019174 +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))))