Average Error: 0.0 → 0.0
Time: 1.2s
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 r128132 = x;
        double r128133 = y;
        double r128134 = r128133 + r128133;
        double r128135 = r128132 * r128134;
        return r128135;
}
↓
double f(double x, double y) {
        double r128136 = x;
        double r128137 = y;
        double r128138 = r128137 + r128137;
        double r128139 = r128136 * r128138;
        return r128139;
}

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