Average Error: 0.0 → 0.0
Time: 754.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 r4362372 = x;
        double r4362373 = y;
        double r4362374 = r4362373 + r4362373;
        double r4362375 = r4362372 * r4362374;
        return r4362375;
}
↓
double f(double x, double y) {
        double r4362376 = x;
        double r4362377 = y;
        double r4362378 = r4362377 + r4362377;
        double r4362379 = r4362376 * r4362378;
        return r4362379;
}

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