Average Error: 0 → 0
Time: 2.6s
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 r3866423 = x;
        double r3866424 = y;
        double r3866425 = r3866424 + r3866424;
        double r3866426 = r3866423 * r3866425;
        return r3866426;
}
↓
double f(double x, double y) {
        double r3866427 = x;
        double r3866428 = y;
        double r3866429 = r3866428 + r3866428;
        double r3866430 = r3866427 * r3866429;
        return r3866430;
}

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

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2019200 +o rules:numerics
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  (* x (+ y y)))