Average Error: 0 → 0
Time: 4.6s
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 r108360 = x;
        double r108361 = r108360 + r108360;
        double r108362 = r108361 + r108360;
        double r108363 = r108362 + r108360;
        double r108364 = r108363 + r108360;
        return r108364;
}
↓
double f(double x) {
        double r108365 = x;
        double r108366 = 5.0;
        double r108367 = r108365 * r108366;
        return r108367;
}

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 2019297 
(FPCore (x)
  :name "Main:i from "
  :precision binary64
  (+ (+ (+ (+ x x) x) x) x))