Average Error: 0.0 → 0.0
Time: 756.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 r93416 = x;
        double r93417 = y;
        double r93418 = r93417 + r93417;
        double r93419 = r93416 * r93418;
        return r93419;
}
↓
double f(double x, double y) {
        double r93420 = x;
        double r93421 = y;
        double r93422 = r93421 + r93421;
        double r93423 = r93420 * r93422;
        return r93423;
}

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 2019304 +o rules:numerics
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))