Average Error: 0.0 → 0.0
Time: 5.7s
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 r523351 = 2.0;
        double r523352 = x;
        double r523353 = r523352 * r523352;
        double r523354 = y;
        double r523355 = r523352 * r523354;
        double r523356 = r523353 - r523355;
        double r523357 = r523351 * r523356;
        return r523357;
}
↓
double f(double x, double y) {
        double r523358 = 2.0;
        double r523359 = x;
        double r523360 = r523359 * r523359;
        double r523361 = y;
        double r523362 = r523359 * r523361;
        double r523363 = r523360 - r523362;
        double r523364 = r523358 * r523363;
        return r523364;
}

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 +o rules:numerics
(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))))