Average Error: 0 → 0
Time: 4.1s
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 r88271 = x;
        double r88272 = r88271 + r88271;
        double r88273 = r88272 + r88271;
        double r88274 = r88273 + r88271;
        double r88275 = r88274 + r88271;
        return r88275;
}
↓
double f(double x) {
        double r88276 = x;
        double r88277 = 5.0;
        double r88278 = r88276 * r88277;
        return r88278;
}

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