Average Error: 0 → 0
Time: 301.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 r138448 = x;
        double r138449 = r138448 + r138448;
        double r138450 = r138449 + r138448;
        double r138451 = r138450 + r138448;
        double r138452 = r138451 + r138448;
        return r138452;
}
↓
double f(double x) {
        double r138453 = x;
        double r138454 = r138453 + r138453;
        double r138455 = r138454 + r138453;
        double r138456 = r138455 + r138453;
        double r138457 = r138456 + r138453;
        return r138457;
}

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