Average Error: 0.0 → 0.0
Time: 504.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 r152313 = x;
        double r152314 = y;
        double r152315 = r152314 + r152314;
        double r152316 = r152313 * r152315;
        return r152316;
}
↓
double f(double x, double y) {
        double r152317 = x;
        double r152318 = y;
        double r152319 = r152318 + r152318;
        double r152320 = r152317 * r152319;
        return r152320;
}

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