Average Error: 0.0 → 0.0
Time: 14.3s
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 r65509814 = 2.0;
        double r65509815 = x;
        double r65509816 = r65509815 * r65509815;
        double r65509817 = y;
        double r65509818 = r65509815 * r65509817;
        double r65509819 = r65509816 - r65509818;
        double r65509820 = r65509814 * r65509819;
        return r65509820;
}
↓
double f(double x, double y) {
        double r65509821 = x;
        double r65509822 = y;
        double r65509823 = r65509821 - r65509822;
        double r65509824 = 2.0;
        double r65509825 = r65509823 * r65509824;
        double r65509826 = r65509821 * r65509825;
        return r65509826;
}

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 2019173 +o rules:numerics
(FPCore (x y)
  :name "Linear.Matrix:fromQuaternion from linear-1.19.1.3, A"

  :herbie-target
  (* (* x 2.0) (- x y))

  (* 2.0 (- (* x x) (* x y))))