Average Error: 0.0 → 0.0
Time: 6.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 r214203 = 2.0;
        double r214204 = x;
        double r214205 = r214204 * r214204;
        double r214206 = y;
        double r214207 = r214204 * r214206;
        double r214208 = r214205 - r214207;
        double r214209 = r214203 * r214208;
        return r214209;
}
↓
double f(double x, double y) {
        double r214210 = x;
        double r214211 = y;
        double r214212 = r214210 - r214211;
        double r214213 = r214210 * r214212;
        double r214214 = 2.0;
        double r214215 = r214213 * r214214;
        return r214215;
}

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