Average Error: 0.0 → 0.0
Time: 1.2s
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 r494041 = 2.0;
        double r494042 = x;
        double r494043 = r494042 * r494042;
        double r494044 = y;
        double r494045 = r494042 * r494044;
        double r494046 = r494043 - r494045;
        double r494047 = r494041 * r494046;
        return r494047;
}
↓
double f(double x, double y) {
        double r494048 = x;
        double r494049 = y;
        double r494050 = r494048 - r494049;
        double r494051 = r494048 * r494050;
        double r494052 = 2.0;
        double r494053 = r494051 * r494052;
        return r494053;
}

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