Average Error: 0 → 0
Time: 566.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 r121393 = x;
        double r121394 = r121393 + r121393;
        double r121395 = r121394 + r121393;
        double r121396 = r121395 + r121393;
        double r121397 = r121396 + r121393;
        return r121397;
}
↓
double f(double x) {
        double r121398 = x;
        double r121399 = r121398 + r121398;
        double r121400 = r121399 + r121398;
        double r121401 = r121400 + r121398;
        double r121402 = r121401 + r121398;
        return r121402;
}

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