Average Error: 0.0 → 0.0
Time: 457.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 r95595 = x;
        double r95596 = y;
        double r95597 = r95596 + r95596;
        double r95598 = r95595 * r95597;
        return r95598;
}
↓
double f(double x, double y) {
        double r95599 = x;
        double r95600 = y;
        double r95601 = r95600 + r95600;
        double r95602 = r95599 * r95601;
        return r95602;
}

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