Average Error: 0 → 0
Time: 565.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 r113255 = x;
        double r113256 = r113255 + r113255;
        double r113257 = r113256 + r113255;
        double r113258 = r113257 + r113255;
        double r113259 = r113258 + r113255;
        return r113259;
}
↓
double f(double x) {
        double r113260 = x;
        double r113261 = r113260 + r113260;
        double r113262 = r113261 + r113260;
        double r113263 = r113262 + r113260;
        double r113264 = r113263 + r113260;
        return r113264;
}

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