Average Error: 0.0 → 0.0
Time: 388.0ms
Precision: 64
\[x \cdot \left(y + y\right)\]
↓
\[x \cdot \left(y + y\right)\]
x \cdot \left(y + y\right)
↓
x \cdot \left(y + y\right)
double f(double x, double y) {
        double r97919 = x;
        double r97920 = y;
        double r97921 = r97920 + r97920;
        double r97922 = r97919 * r97921;
        return r97922;
}
↓
double f(double x, double y) {
        double r97923 = x;
        double r97924 = y;
        double r97925 = r97924 + r97924;
        double r97926 = r97923 * r97925;
        return r97926;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0.0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2019346 +o rules:numerics
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))