Average Error: 0.0 → 0.0
Time: 373.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 r136032 = x;
        double r136033 = y;
        double r136034 = r136033 + r136033;
        double r136035 = r136032 * r136034;
        return r136035;
}
↓
double f(double x, double y) {
        double r136036 = x;
        double r136037 = y;
        double r136038 = r136037 + r136037;
        double r136039 = r136036 * r136038;
        return r136039;
}

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