Average Error: 0 → 0
Time: 566.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 r191429 = x;
        double r191430 = r191429 + r191429;
        double r191431 = r191430 + r191429;
        double r191432 = r191431 + r191429;
        double r191433 = r191432 + r191429;
        return r191433;
}
↓
double f(double x) {
        double r191434 = x;
        double r191435 = r191434 + r191434;
        double r191436 = r191435 + r191434;
        double r191437 = r191436 + r191434;
        double r191438 = r191437 + r191434;
        return r191438;
}

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