Average Error: 0.0 → 0.0
Time: 864.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 r13353414 = x;
        double r13353415 = y;
        double r13353416 = r13353415 + r13353415;
        double r13353417 = r13353414 * r13353416;
        return r13353417;
}
↓
double f(double x, double y) {
        double r13353418 = x;
        double r13353419 = y;
        double r13353420 = r13353419 + r13353419;
        double r13353421 = r13353418 * r13353420;
        return r13353421;
}

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