Average Error: 0.0 → 0.0
Time: 866.0ms
Precision: 64
\[2 \cdot \left(x \cdot x - x \cdot y\right)\]
↓
\[2 \cdot \left(x \cdot x - x \cdot y\right)\]
2 \cdot \left(x \cdot x - x \cdot y\right)
↓
2 \cdot \left(x \cdot x - x \cdot y\right)
double f(double x, double y) {
        double r504282 = 2.0;
        double r504283 = x;
        double r504284 = r504283 * r504283;
        double r504285 = y;
        double r504286 = r504283 * r504285;
        double r504287 = r504284 - r504286;
        double r504288 = r504282 * r504287;
        return r504288;
}
↓
double f(double x, double y) {
        double r504289 = 2.0;
        double r504290 = x;
        double r504291 = r504290 * r504290;
        double r504292 = y;
        double r504293 = r504290 * r504292;
        double r504294 = r504291 - r504293;
        double r504295 = r504289 * r504294;
        return r504295;
}

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

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

Reproduce

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