Average Error: 0 → 0
Time: 330.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 r117898 = x;
        double r117899 = r117898 + r117898;
        double r117900 = r117899 + r117898;
        double r117901 = r117900 + r117898;
        double r117902 = r117901 + r117898;
        return r117902;
}
↓
double f(double x) {
        double r117903 = x;
        double r117904 = r117903 + r117903;
        double r117905 = r117904 + r117903;
        double r117906 = r117905 + r117903;
        double r117907 = r117906 + r117903;
        return r117907;
}

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