Average Error: 0 → 0
Time: 1000.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 r103015 = x;
        double r103016 = y;
        double r103017 = r103016 + r103016;
        double r103018 = r103015 * r103017;
        return r103018;
}
↓
double f(double x, double y) {
        double r103019 = x;
        double r103020 = y;
        double r103021 = r103020 + r103020;
        double r103022 = r103019 * r103021;
        return r103022;
}

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

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

  2. Final simplification0

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

Reproduce

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