Average Error: 0.0 → 0.0
Time: 670.0ms
Precision: 64
\[2 \cdot \left(x \cdot x - x \cdot y\right)\]
↓
\[\left(x \cdot \left(x - y\right)\right) \cdot 2\]
2 \cdot \left(x \cdot x - x \cdot y\right)
↓
\left(x \cdot \left(x - y\right)\right) \cdot 2
double f(double x, double y) {
        double r611659 = 2.0;
        double r611660 = x;
        double r611661 = r611660 * r611660;
        double r611662 = y;
        double r611663 = r611660 * r611662;
        double r611664 = r611661 - r611663;
        double r611665 = r611659 * r611664;
        return r611665;
}
↓
double f(double x, double y) {
        double r611666 = x;
        double r611667 = y;
        double r611668 = r611666 - r611667;
        double r611669 = r611666 * r611668;
        double r611670 = 2.0;
        double r611671 = r611669 * r611670;
        return r611671;
}

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. Final simplification0.0

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

Reproduce

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