Average Error: 0.0 → 0.0
Time: 378.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 r81028 = x;
        double r81029 = y;
        double r81030 = r81029 + r81029;
        double r81031 = r81028 * r81030;
        return r81031;
}
↓
double f(double x, double y) {
        double r81032 = x;
        double r81033 = y;
        double r81034 = r81033 + r81033;
        double r81035 = r81032 * r81034;
        return r81035;
}

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