Average Error: 0 → 0
Time: 591.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 r76322 = x;
        double r76323 = r76322 + r76322;
        double r76324 = r76323 + r76322;
        double r76325 = r76324 + r76322;
        double r76326 = r76325 + r76322;
        return r76326;
}
↓
double f(double x) {
        double r76327 = x;
        double r76328 = r76327 + r76327;
        double r76329 = r76328 + r76327;
        double r76330 = r76329 + r76327;
        double r76331 = r76330 + r76327;
        return r76331;
}

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