Average Error: 0 → 0
Time: 434.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 r128314 = x;
        double r128315 = y;
        double r128316 = r128315 + r128315;
        double r128317 = r128314 * r128316;
        return r128317;
}
↓
double f(double x, double y) {
        double r128318 = x;
        double r128319 = y;
        double r128320 = r128319 + r128319;
        double r128321 = r128318 * r128320;
        return r128321;
}

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