Average Error: 0.0 → 0.0
Time: 896.0ms
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 r626827 = 2.0;
        double r626828 = x;
        double r626829 = r626828 * r626828;
        double r626830 = y;
        double r626831 = r626828 * r626830;
        double r626832 = r626829 - r626831;
        double r626833 = r626827 * r626832;
        return r626833;
}
↓
double f(double x, double y) {
        double r626834 = x;
        double r626835 = y;
        double r626836 = r626834 - r626835;
        double r626837 = r626834 * r626836;
        double r626838 = 2.0;
        double r626839 = r626837 * r626838;
        return r626839;
}

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 
(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))))