Average Error: 0.0 → 0.0
Time: 657.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 r94909 = x;
        double r94910 = y;
        double r94911 = r94910 + r94910;
        double r94912 = r94909 * r94911;
        return r94912;
}
↓
double f(double x, double y) {
        double r94913 = x;
        double r94914 = y;
        double r94915 = r94914 + r94914;
        double r94916 = r94913 * r94915;
        return r94916;
}

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