Average Error: 0.0 → 0.0
Time: 753.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 r117979 = x;
        double r117980 = y;
        double r117981 = r117980 + r117980;
        double r117982 = r117979 * r117981;
        return r117982;
}
↓
double f(double x, double y) {
        double r117983 = x;
        double r117984 = y;
        double r117985 = r117984 + r117984;
        double r117986 = r117983 * r117985;
        return r117986;
}

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