Average Error: 0.0 → 0.0
Time: 332.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 r93606 = x;
        double r93607 = y;
        double r93608 = r93607 + r93607;
        double r93609 = r93606 * r93608;
        return r93609;
}
↓
double f(double x, double y) {
        double r93610 = x;
        double r93611 = y;
        double r93612 = r93611 + r93611;
        double r93613 = r93610 * r93612;
        return r93613;
}

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