Average Error: 0.0 → 0.0
Time: 786.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 r11098 = x;
        double r11099 = y;
        double r11100 = r11099 + r11099;
        double r11101 = r11098 * r11100;
        return r11101;
}
↓
double f(double x, double y) {
        double r11102 = x;
        double r11103 = y;
        double r11104 = r11103 + r11103;
        double r11105 = r11102 * r11104;
        return r11105;
}

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