Average Error: 0.0 → 0.0
Time: 1.8s
Precision: 64
\[2 \cdot \left(x \cdot x - x \cdot y\right)\]
↓
\[\left(2 \cdot x\right) \cdot \left(x - y\right)\]
2 \cdot \left(x \cdot x - x \cdot y\right)
↓
\left(2 \cdot x\right) \cdot \left(x - y\right)
double f(double x, double y) {
        double r586355 = 2.0;
        double r586356 = x;
        double r586357 = r586356 * r586356;
        double r586358 = y;
        double r586359 = r586356 * r586358;
        double r586360 = r586357 - r586359;
        double r586361 = r586355 * r586360;
        return r586361;
}
↓
double f(double x, double y) {
        double r586362 = 2.0;
        double r586363 = x;
        double r586364 = r586362 * r586363;
        double r586365 = y;
        double r586366 = r586363 - r586365;
        double r586367 = r586364 * r586366;
        return r586367;
}

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

  3. Applied distribute-lft-out--0.0

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

  4. Applied associate-*r*0.0

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

  5. Final simplification0.0

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

Reproduce

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