Average Error: 0.0 → 0.0
Time: 344.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 r121064 = x;
        double r121065 = y;
        double r121066 = r121065 + r121065;
        double r121067 = r121064 * r121066;
        return r121067;
}
↓
double f(double x, double y) {
        double r121068 = x;
        double r121069 = y;
        double r121070 = r121069 + r121069;
        double r121071 = r121068 * r121070;
        return r121071;
}

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