Average Error: 0.0 → 0.0
Time: 12.2s
Precision: 64
\[2 \cdot \left(x \cdot x - x \cdot y\right)\]
↓
\[x \cdot \left(\left(x - y\right) \cdot 2\right)\]
2 \cdot \left(x \cdot x - x \cdot y\right)
↓
x \cdot \left(\left(x - y\right) \cdot 2\right)
double f(double x, double y) {
        double r440910 = 2.0;
        double r440911 = x;
        double r440912 = r440911 * r440911;
        double r440913 = y;
        double r440914 = r440911 * r440913;
        double r440915 = r440912 - r440914;
        double r440916 = r440910 * r440915;
        return r440916;
}
↓
double f(double x, double y) {
        double r440917 = x;
        double r440918 = y;
        double r440919 = r440917 - r440918;
        double r440920 = 2.0;
        double r440921 = r440919 * r440920;
        double r440922 = r440917 * r440921;
        return r440922;
}

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. Using strategy rm

  4. Applied associate-*l*0.0

    \[\leadsto \color{blue}{x \cdot \left(\left(x - y\right) \cdot 2\right)}\]

  5. Final simplification0.0

    \[\leadsto x \cdot \left(\left(x - y\right) \cdot 2\right)\]

Reproduce

herbie shell --seed 2019303 
(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))))