Average Error: 0 → 0
Time: 301.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 r36300 = x;
        double r36301 = r36300 + r36300;
        double r36302 = r36301 + r36300;
        double r36303 = r36302 + r36300;
        double r36304 = r36303 + r36300;
        return r36304;
}
↓
double f(double x) {
        double r36305 = x;
        double r36306 = 5.0;
        double r36307 = r36305 * r36306;
        return r36307;
}

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))