Average Error: 0 → 0
Time: 333.0ms
Precision: 64
\[\left(\left(\left(x + x\right) + x\right) + x\right) + x\]
↓
\[\left(\left(\left(x + x\right) + x\right) + x\right) + x\]
\left(\left(\left(x + x\right) + x\right) + x\right) + x
↓
\left(\left(\left(x + x\right) + x\right) + x\right) + x
double f(double x) {
        double r81212 = x;
        double r81213 = r81212 + r81212;
        double r81214 = r81213 + r81212;
        double r81215 = r81214 + r81212;
        double r81216 = r81215 + r81212;
        return r81216;
}
↓
double f(double x) {
        double r81217 = x;
        double r81218 = r81217 + r81217;
        double r81219 = r81218 + r81217;
        double r81220 = r81219 + r81217;
        double r81221 = r81220 + r81217;
        return r81221;
}

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. Final simplification0

    \[\leadsto \left(\left(\left(x + x\right) + x\right) + x\right) + x\]

Reproduce

herbie shell --seed 2019351 +o rules:numerics
(FPCore (x)
  :name "Main:i from "
  :precision binary64
  (+ (+ (+ (+ x x) x) x) x))