Average Error: 0 → 0
Time: 342.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 r154391 = x;
        double r154392 = y;
        double r154393 = r154392 + r154392;
        double r154394 = r154391 * r154393;
        return r154394;
}
↓
double f(double x, double y) {
        double r154395 = x;
        double r154396 = y;
        double r154397 = r154396 + r154396;
        double r154398 = r154395 * r154397;
        return r154398;
}

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

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2020057 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))