Average Error: 0 → 0
Time: 575.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 r116185 = x;
        double r116186 = r116185 + r116185;
        double r116187 = r116186 + r116185;
        double r116188 = r116187 + r116185;
        double r116189 = r116188 + r116185;
        return r116189;
}
↓
double f(double x) {
        double r116190 = x;
        double r116191 = r116190 + r116190;
        double r116192 = r116191 + r116190;
        double r116193 = r116192 + r116190;
        double r116194 = r116193 + r116190;
        return r116194;
}

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