Average Error: 0 → 0
Time: 544.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 r116241 = x;
        double r116242 = r116241 + r116241;
        double r116243 = r116242 + r116241;
        double r116244 = r116243 + r116241;
        double r116245 = r116244 + r116241;
        return r116245;
}
↓
double f(double x) {
        double r116246 = x;
        double r116247 = r116246 + r116246;
        double r116248 = r116247 + r116246;
        double r116249 = r116248 + r116246;
        double r116250 = r116249 + r116246;
        return r116250;
}

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