Average Error: 0.0 → 0.0
Time: 8.7s
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 r669039 = 2.0;
        double r669040 = x;
        double r669041 = r669040 * r669040;
        double r669042 = y;
        double r669043 = r669040 * r669042;
        double r669044 = r669041 - r669043;
        double r669045 = r669039 * r669044;
        return r669045;
}
↓
double f(double x, double y) {
        double r669046 = x;
        double r669047 = y;
        double r669048 = r669046 - r669047;
        double r669049 = r669046 * r669048;
        double r669050 = 2.0;
        double r669051 = r669049 * r669050;
        return r669051;
}

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