Average Error: 0.0 → 0.0
Time: 6.9s
Precision: 64
\[2 \cdot \left(x \cdot x - x \cdot y\right)\]
↓
\[x \cdot \left(2 \cdot \left(x - y\right)\right)\]
2 \cdot \left(x \cdot x - x \cdot y\right)
↓
x \cdot \left(2 \cdot \left(x - y\right)\right)
double f(double x, double y) {
        double r715309 = 2.0;
        double r715310 = x;
        double r715311 = r715310 * r715310;
        double r715312 = y;
        double r715313 = r715310 * r715312;
        double r715314 = r715311 - r715313;
        double r715315 = r715309 * r715314;
        return r715315;
}
↓
double f(double x, double y) {
        double r715316 = x;
        double r715317 = 2.0;
        double r715318 = y;
        double r715319 = r715316 - r715318;
        double r715320 = r715317 * r715319;
        double r715321 = r715316 * r715320;
        return r715321;
}

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. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

herbie shell --seed 2020046 
(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))))