Average Error: 0 → 0
Time: 292.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 r10415 = x;
        double r10416 = r10415 + r10415;
        double r10417 = r10416 + r10415;
        double r10418 = r10417 + r10415;
        double r10419 = r10418 + r10415;
        return r10419;
}
↓
double f(double x) {
        double r10420 = x;
        double r10421 = r10420 + r10420;
        double r10422 = r10421 + r10420;
        double r10423 = r10422 + r10420;
        double r10424 = r10423 + r10420;
        return r10424;
}

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