Average Error: 0.0 → 0.0
Time: 734.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 r505933 = 2.0;
        double r505934 = x;
        double r505935 = r505934 * r505934;
        double r505936 = y;
        double r505937 = r505934 * r505936;
        double r505938 = r505935 - r505937;
        double r505939 = r505933 * r505938;
        return r505939;
}
↓
double f(double x, double y) {
        double r505940 = x;
        double r505941 = y;
        double r505942 = r505940 - r505941;
        double r505943 = r505940 * r505942;
        double r505944 = 2.0;
        double r505945 = r505943 * r505944;
        return r505945;
}

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