Average Error: 0 → 0
Time: 585.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 r97508 = x;
        double r97509 = r97508 + r97508;
        double r97510 = r97509 + r97508;
        double r97511 = r97510 + r97508;
        double r97512 = r97511 + r97508;
        return r97512;
}
↓
double f(double x) {
        double r97513 = x;
        double r97514 = 5.0;
        double r97515 = r97513 * r97514;
        return r97515;
}

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