Average Error: 0 → 0
Time: 952.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 r93550 = x;
        double r93551 = r93550 + r93550;
        double r93552 = r93551 + r93550;
        double r93553 = r93552 + r93550;
        double r93554 = r93553 + r93550;
        return r93554;
}
↓
double f(double x) {
        double r93555 = x;
        double r93556 = r93555 + r93555;
        double r93557 = r93556 + r93555;
        double r93558 = r93557 + r93555;
        double r93559 = r93558 + r93555;
        return r93559;
}

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