Average Error: 0.0 → 0.0
Time: 361.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 r105328 = x;
        double r105329 = y;
        double r105330 = r105329 + r105329;
        double r105331 = r105328 * r105330;
        return r105331;
}
↓
double f(double x, double y) {
        double r105332 = x;
        double r105333 = y;
        double r105334 = r105333 + r105333;
        double r105335 = r105332 * r105334;
        return r105335;
}

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