Average Error: 0 → 0
Time: 569.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 r92434 = x;
        double r92435 = r92434 + r92434;
        double r92436 = r92435 + r92434;
        double r92437 = r92436 + r92434;
        double r92438 = r92437 + r92434;
        return r92438;
}
↓
double f(double x) {
        double r92439 = x;
        double r92440 = r92439 + r92439;
        double r92441 = r92440 + r92439;
        double r92442 = r92441 + r92439;
        double r92443 = r92442 + r92439;
        return r92443;
}

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