Average Error: 0.0 → 0.0
Time: 354.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 r82591 = x;
        double r82592 = y;
        double r82593 = r82592 + r82592;
        double r82594 = r82591 * r82593;
        return r82594;
}
↓
double f(double x, double y) {
        double r82595 = x;
        double r82596 = y;
        double r82597 = r82596 + r82596;
        double r82598 = r82595 * r82597;
        return r82598;
}

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