Average Error: 0 → 0
Time: 549.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 r108247 = x;
        double r108248 = r108247 + r108247;
        double r108249 = r108248 + r108247;
        double r108250 = r108249 + r108247;
        double r108251 = r108250 + r108247;
        return r108251;
}
↓
double f(double x) {
        double r108252 = x;
        double r108253 = 5.0;
        double r108254 = r108252 * r108253;
        return r108254;
}

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