Average Error: 0.0 → 0.0
Time: 1.9s
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 r2190294 = x;
        double r2190295 = y;
        double r2190296 = r2190295 + r2190295;
        double r2190297 = r2190294 * r2190296;
        return r2190297;
}
↓
double f(double x, double y) {
        double r2190298 = x;
        double r2190299 = y;
        double r2190300 = r2190299 + r2190299;
        double r2190301 = r2190298 * r2190300;
        return r2190301;
}

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