Average Error: 0.0 → 0.0
Time: 867.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 r65185 = x;
        double r65186 = y;
        double r65187 = r65186 + r65186;
        double r65188 = r65185 * r65187;
        return r65188;
}
↓
double f(double x, double y) {
        double r65189 = x;
        double r65190 = y;
        double r65191 = r65190 + r65190;
        double r65192 = r65189 * r65191;
        return r65192;
}

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