Average Error: 0 → 0
Time: 287.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 r10056 = x;
        double r10057 = r10056 + r10056;
        double r10058 = r10057 + r10056;
        double r10059 = r10058 + r10056;
        double r10060 = r10059 + r10056;
        return r10060;
}
↓
double f(double x) {
        double r10061 = x;
        double r10062 = 5.0;
        double r10063 = r10061 * r10062;
        return r10063;
}

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