Average Error: 0.0 → 0.0
Time: 8.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 r410956 = 2.0;
        double r410957 = x;
        double r410958 = r410957 * r410957;
        double r410959 = y;
        double r410960 = r410957 * r410959;
        double r410961 = r410958 - r410960;
        double r410962 = r410956 * r410961;
        return r410962;
}
↓
double f(double x, double y) {
        double r410963 = 2.0;
        double r410964 = x;
        double r410965 = r410963 * r410964;
        double r410966 = y;
        double r410967 = r410964 - r410966;
        double r410968 = r410965 * r410967;
        return r410968;
}

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 
(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))))