Average Error: 0 → 0
Time: 542.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 r138522 = x;
        double r138523 = r138522 + r138522;
        double r138524 = r138523 + r138522;
        double r138525 = r138524 + r138522;
        double r138526 = r138525 + r138522;
        return r138526;
}
↓
double f(double x) {
        double r138527 = x;
        double r138528 = r138527 + r138527;
        double r138529 = r138528 + r138527;
        double r138530 = r138529 + r138527;
        double r138531 = r138530 + r138527;
        return r138531;
}

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