Average Error: 0.0 → 0.0
Time: 4.8s
Precision: 64
\[2 \cdot \left(x \cdot x - x \cdot y\right)\]
↓
\[\left(x \cdot \left(x - y\right)\right) \cdot 2\]
2 \cdot \left(x \cdot x - x \cdot y\right)
↓
\left(x \cdot \left(x - y\right)\right) \cdot 2
double f(double x, double y) {
        double r387242 = 2.0;
        double r387243 = x;
        double r387244 = r387243 * r387243;
        double r387245 = y;
        double r387246 = r387243 * r387245;
        double r387247 = r387244 - r387246;
        double r387248 = r387242 * r387247;
        return r387248;
}
↓
double f(double x, double y) {
        double r387249 = x;
        double r387250 = y;
        double r387251 = r387249 - r387250;
        double r387252 = r387249 * r387251;
        double r387253 = 2.0;
        double r387254 = r387252 * r387253;
        return r387254;
}

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. Final simplification0.0

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

Reproduce

herbie shell --seed 2019291 
(FPCore (x y)
  :name "Linear.Matrix:fromQuaternion from linear-1.19.1.3, A"
  :precision binary64

  :herbie-target
  (* (* x 2) (- x y))

  (* 2 (- (* x x) (* x y))))