Average Error: 0 → 0
Time: 290.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 r120705 = x;
        double r120706 = r120705 + r120705;
        double r120707 = r120706 + r120705;
        double r120708 = r120707 + r120705;
        double r120709 = r120708 + r120705;
        return r120709;
}
↓
double f(double x) {
        double r120710 = x;
        double r120711 = 5.0;
        double r120712 = r120710 * r120711;
        return r120712;
}

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