Average Error: 0.0 → 0.0
Time: 336.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 r101114 = x;
        double r101115 = y;
        double r101116 = r101115 + r101115;
        double r101117 = r101114 * r101116;
        return r101117;
}
↓
double f(double x, double y) {
        double r101118 = x;
        double r101119 = y;
        double r101120 = r101119 + r101119;
        double r101121 = r101118 * r101120;
        return r101121;
}

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