Average Error: 0.0 → 0.0
Time: 602.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 r111420 = x;
        double r111421 = y;
        double r111422 = r111421 + r111421;
        double r111423 = r111420 * r111422;
        return r111423;
}
↓
double f(double x, double y) {
        double r111424 = x;
        double r111425 = y;
        double r111426 = r111425 + r111425;
        double r111427 = r111424 * r111426;
        return r111427;
}

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