Average Error: 0.0 → 0.0
Time: 363.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 r170907 = x;
        double r170908 = y;
        double r170909 = r170908 + r170908;
        double r170910 = r170907 * r170909;
        return r170910;
}
↓
double f(double x, double y) {
        double r170911 = x;
        double r170912 = y;
        double r170913 = r170912 + r170912;
        double r170914 = r170911 * r170913;
        return r170914;
}

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