Average Error: 0.0 → 0.0
Time: 927.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 r4420095 = x;
        double r4420096 = y;
        double r4420097 = r4420096 + r4420096;
        double r4420098 = r4420095 * r4420097;
        return r4420098;
}
↓
double f(double x, double y) {
        double r4420099 = x;
        double r4420100 = y;
        double r4420101 = r4420100 + r4420100;
        double r4420102 = r4420099 * r4420101;
        return r4420102;
}

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