Average Error: 0 → 0
Time: 538.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 r82687 = x;
        double r82688 = r82687 + r82687;
        double r82689 = r82688 + r82687;
        double r82690 = r82689 + r82687;
        double r82691 = r82690 + r82687;
        return r82691;
}
↓
double f(double x) {
        double r82692 = x;
        double r82693 = 5.0;
        double r82694 = r82692 * r82693;
        return r82694;
}

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