Average Error: 0 → 0
Time: 4.5s
Precision: 64
\[\left(\left(\left(x + x\right) + x\right) + x\right) + x\]
↓
\[x \cdot 5\]
\left(\left(\left(x + x\right) + x\right) + x\right) + x
↓
x \cdot 5
double f(double x) {
        double r115334 = x;
        double r115335 = r115334 + r115334;
        double r115336 = r115335 + r115334;
        double r115337 = r115336 + r115334;
        double r115338 = r115337 + r115334;
        return r115338;
}
↓
double f(double x) {
        double r115339 = x;
        double r115340 = 5.0;
        double r115341 = r115339 * r115340;
        return r115341;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0

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

  2. Simplified0

    \[\leadsto \color{blue}{x \cdot 5}\]

  3. Final simplification0

    \[\leadsto x \cdot 5\]

Reproduce

herbie shell --seed 2020047 +o rules:numerics
(FPCore (x)
  :name "Main:i from "
  :precision binary64
  (+ (+ (+ (+ x x) x) x) x))