Average Error: 0 → 0
Time: 294.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 r119297 = x;
        double r119298 = r119297 + r119297;
        double r119299 = r119298 + r119297;
        double r119300 = r119299 + r119297;
        double r119301 = r119300 + r119297;
        return r119301;
}
↓
double f(double x) {
        double r119302 = x;
        double r119303 = r119302 + r119302;
        double r119304 = r119303 + r119302;
        double r119305 = r119304 + r119302;
        double r119306 = r119305 + r119302;
        return r119306;
}

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