Average Error: 0.0 → 0.0
Time: 10.9s
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 r276758 = 2.0;
        double r276759 = x;
        double r276760 = r276759 * r276759;
        double r276761 = y;
        double r276762 = r276759 * r276761;
        double r276763 = r276760 - r276762;
        double r276764 = r276758 * r276763;
        return r276764;
}
↓
double f(double x, double y) {
        double r276765 = 2.0;
        double r276766 = x;
        double r276767 = r276765 * r276766;
        double r276768 = y;
        double r276769 = r276766 - r276768;
        double r276770 = r276767 * r276769;
        return r276770;
}

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