Average Error: 0.0 → 0.0
Time: 1.4s
Precision: 64
\[2.0 \cdot \left(x \cdot x - x \cdot y\right)\]
↓
\[\left(\left(x - y\right) \cdot 2.0\right) \cdot x\]
2.0 \cdot \left(x \cdot x - x \cdot y\right)
↓
\left(\left(x - y\right) \cdot 2.0\right) \cdot x
double f(double x, double y) {
        double r9059807 = 2.0;
        double r9059808 = x;
        double r9059809 = r9059808 * r9059808;
        double r9059810 = y;
        double r9059811 = r9059808 * r9059810;
        double r9059812 = r9059809 - r9059811;
        double r9059813 = r9059807 * r9059812;
        return r9059813;
}
↓
double f(double x, double y) {
        double r9059814 = x;
        double r9059815 = y;
        double r9059816 = r9059814 - r9059815;
        double r9059817 = 2.0;
        double r9059818 = r9059816 * r9059817;
        double r9059819 = r9059818 * r9059814;
        return r9059819;
}

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.0\right) \cdot \left(x - y\right)\]

Derivation

  1. Initial program 0.0

    \[2.0 \cdot \left(x \cdot x - x \cdot y\right)\]

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

herbie shell --seed 2019156 +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))))