Average Error: 0.0 → 0.0
Time: 740.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 r98484 = x;
        double r98485 = y;
        double r98486 = r98485 + r98485;
        double r98487 = r98484 * r98486;
        return r98487;
}
↓
double f(double x, double y) {
        double r98488 = x;
        double r98489 = y;
        double r98490 = r98489 + r98489;
        double r98491 = r98488 * r98490;
        return r98491;
}

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