Average Error: 0.0 → 0.0
Time: 382.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 r95321 = x;
        double r95322 = y;
        double r95323 = r95322 + r95322;
        double r95324 = r95321 * r95323;
        return r95324;
}
↓
double f(double x, double y) {
        double r95325 = x;
        double r95326 = y;
        double r95327 = r95326 + r95326;
        double r95328 = r95325 * r95327;
        return r95328;
}

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