Average Error: 0.0 → 0.0
Time: 801.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 r4805802 = x;
        double r4805803 = y;
        double r4805804 = r4805803 + r4805803;
        double r4805805 = r4805802 * r4805804;
        return r4805805;
}
↓
double f(double x, double y) {
        double r4805806 = x;
        double r4805807 = y;
        double r4805808 = r4805807 + r4805807;
        double r4805809 = r4805806 * r4805808;
        return r4805809;
}

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