Average Error: 0.0 → 0.0
Time: 346.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 r130091 = x;
        double r130092 = y;
        double r130093 = r130092 + r130092;
        double r130094 = r130091 * r130093;
        return r130094;
}
↓
double f(double x, double y) {
        double r130095 = x;
        double r130096 = y;
        double r130097 = r130096 + r130096;
        double r130098 = r130095 * r130097;
        return r130098;
}

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