Average Error: 0.0 → 0.0
Time: 389.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 r154083 = x;
        double r154084 = y;
        double r154085 = r154084 + r154084;
        double r154086 = r154083 * r154085;
        return r154086;
}
↓
double f(double x, double y) {
        double r154087 = x;
        double r154088 = y;
        double r154089 = r154088 + r154088;
        double r154090 = r154087 * r154089;
        return r154090;
}

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