Average Error: 0.0 → 0.0
Time: 460.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 r114451 = x;
        double r114452 = y;
        double r114453 = r114452 + r114452;
        double r114454 = r114451 * r114453;
        return r114454;
}
↓
double f(double x, double y) {
        double r114455 = x;
        double r114456 = y;
        double r114457 = r114456 + r114456;
        double r114458 = r114455 * r114457;
        return r114458;
}

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