Average Error: 0.0 → 0.0
Time: 1.1s
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 r7006141 = x;
        double r7006142 = y;
        double r7006143 = r7006142 + r7006142;
        double r7006144 = r7006141 * r7006143;
        return r7006144;
}
↓
double f(double x, double y) {
        double r7006145 = x;
        double r7006146 = y;
        double r7006147 = r7006146 + r7006146;
        double r7006148 = r7006145 * r7006147;
        return r7006148;
}

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