Average Error: 0.0 → 0.0
Time: 1.3s
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 r434833 = 2.0;
        double r434834 = x;
        double r434835 = r434834 * r434834;
        double r434836 = y;
        double r434837 = r434834 * r434836;
        double r434838 = r434835 - r434837;
        double r434839 = r434833 * r434838;
        return r434839;
}
↓
double f(double x, double y) {
        double r434840 = x;
        double r434841 = y;
        double r434842 = r434840 - r434841;
        double r434843 = r434840 * r434842;
        double r434844 = 2.0;
        double r434845 = r434843 * r434844;
        return r434845;
}

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 2020001 +o rules:numerics
(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))))