Average Error: 0 → 0
Time: 534.0ms
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 r101210 = x;
        double r101211 = r101210 + r101210;
        double r101212 = r101211 + r101210;
        double r101213 = r101212 + r101210;
        double r101214 = r101213 + r101210;
        return r101214;
}
↓
double f(double x) {
        double r101215 = x;
        double r101216 = 5.0;
        double r101217 = r101215 * r101216;
        return r101217;
}

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