Average Error: 0.0 → 0.0
Time: 7.7s
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 r321195 = 2.0;
        double r321196 = x;
        double r321197 = r321196 * r321196;
        double r321198 = y;
        double r321199 = r321196 * r321198;
        double r321200 = r321197 - r321199;
        double r321201 = r321195 * r321200;
        return r321201;
}
↓
double f(double x, double y) {
        double r321202 = x;
        double r321203 = y;
        double r321204 = r321202 - r321203;
        double r321205 = r321202 * r321204;
        double r321206 = 2.0;
        double r321207 = r321205 * r321206;
        return r321207;
}

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