Average Error: 0 → 0
Time: 20.6s
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 r116360 = x;
        double r116361 = r116360 + r116360;
        double r116362 = r116361 + r116360;
        double r116363 = r116362 + r116360;
        double r116364 = r116363 + r116360;
        return r116364;
}
↓
double f(double x) {
        double r116365 = x;
        double r116366 = r116365 + r116365;
        double r116367 = r116366 + r116365;
        double r116368 = r116367 + r116365;
        double r116369 = r116368 + r116365;
        return r116369;
}

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