Average Error: 0.0 → 0.0
Time: 1.0s
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 r5389529 = x;
        double r5389530 = y;
        double r5389531 = r5389530 + r5389530;
        double r5389532 = r5389529 * r5389531;
        return r5389532;
}
↓
double f(double x, double y) {
        double r5389533 = x;
        double r5389534 = y;
        double r5389535 = r5389534 + r5389534;
        double r5389536 = r5389533 * r5389535;
        return r5389536;
}

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