Average Error: 0 → 0
Time: 620.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 r109598 = x;
        double r109599 = r109598 + r109598;
        double r109600 = r109599 + r109598;
        double r109601 = r109600 + r109598;
        double r109602 = r109601 + r109598;
        return r109602;
}
↓
double f(double x) {
        double r109603 = x;
        double r109604 = r109603 + r109603;
        double r109605 = r109604 + r109603;
        double r109606 = r109605 + r109603;
        double r109607 = r109606 + r109603;
        return r109607;
}

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