Average Error: 0.0 → 0.0
Time: 1.3s
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 r11390593 = x;
        double r11390594 = y;
        double r11390595 = r11390594 + r11390594;
        double r11390596 = r11390593 * r11390595;
        return r11390596;
}
↓
double f(double x, double y) {
        double r11390597 = x;
        double r11390598 = y;
        double r11390599 = r11390598 + r11390598;
        double r11390600 = r11390597 * r11390599;
        return r11390600;
}

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