Average Error: 0 → 0
Time: 344.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 r132108 = x;
        double r132109 = y;
        double r132110 = r132109 + r132109;
        double r132111 = r132108 * r132110;
        return r132111;
}
↓
double f(double x, double y) {
        double r132112 = x;
        double r132113 = y;
        double r132114 = r132113 + r132113;
        double r132115 = r132112 * r132114;
        return r132115;
}

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

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2020047 +o rules:numerics
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))