Average Error: 0 → 0
Time: 582.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 r116623 = x;
        double r116624 = r116623 + r116623;
        double r116625 = r116624 + r116623;
        double r116626 = r116625 + r116623;
        double r116627 = r116626 + r116623;
        return r116627;
}
↓
double f(double x) {
        double r116628 = x;
        double r116629 = r116628 + r116628;
        double r116630 = r116629 + r116628;
        double r116631 = r116630 + r116628;
        double r116632 = r116631 + r116628;
        return r116632;
}

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