Average Error: 0.1 → 0.1
Time: 950.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 r121876 = x;
        double r121877 = y;
        double r121878 = r121877 + r121877;
        double r121879 = r121876 * r121878;
        return r121879;
}
↓
double f(double x, double y) {
        double r121880 = x;
        double r121881 = y;
        double r121882 = r121881 + r121881;
        double r121883 = r121880 * r121882;
        return r121883;
}

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.1

    \[x \cdot \left(y + y\right)\]

  2. Final simplification0.1

    \[\leadsto x \cdot \left(y + y\right)\]

Reproduce

herbie shell --seed 2019308 
(FPCore (x y)
  :name "Numeric.Integration.TanhSinh:simpson  from integration-0.2.1"
  :precision binary64
  (* x (+ y y)))