Average Error: 0 → 0
Time: 667.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 r88344 = x;
        double r88345 = r88344 + r88344;
        double r88346 = r88345 + r88344;
        double r88347 = r88346 + r88344;
        double r88348 = r88347 + r88344;
        return r88348;
}
↓
double f(double x) {
        double r88349 = x;
        double r88350 = r88349 + r88349;
        double r88351 = r88350 + r88349;
        double r88352 = r88351 + r88349;
        double r88353 = r88352 + r88349;
        return r88353;
}

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