Average Error: 0.0 → 0.0
Time: 6.5s
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 r25639665 = 2.0;
        double r25639666 = x;
        double r25639667 = r25639666 * r25639666;
        double r25639668 = y;
        double r25639669 = r25639666 * r25639668;
        double r25639670 = r25639667 - r25639669;
        double r25639671 = r25639665 * r25639670;
        return r25639671;
}
↓
double f(double x, double y) {
        double r25639672 = x;
        double r25639673 = y;
        double r25639674 = r25639672 - r25639673;
        double r25639675 = 2.0;
        double r25639676 = r25639674 * r25639675;
        double r25639677 = r25639676 * r25639672;
        return r25639677;
}

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