Average Error: 0 → 0
Time: 561.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 r117349 = x;
        double r117350 = r117349 + r117349;
        double r117351 = r117350 + r117349;
        double r117352 = r117351 + r117349;
        double r117353 = r117352 + r117349;
        return r117353;
}
↓
double f(double x) {
        double r117354 = x;
        double r117355 = r117354 + r117354;
        double r117356 = r117355 + r117354;
        double r117357 = r117356 + r117354;
        double r117358 = r117357 + r117354;
        return r117358;
}

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