Average Error: 0 → 0
Time: 719.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 r173687 = x;
        double r173688 = r173687 + r173687;
        double r173689 = r173688 + r173687;
        double r173690 = r173689 + r173687;
        double r173691 = r173690 + r173687;
        return r173691;
}
↓
double f(double x) {
        double r173692 = x;
        double r173693 = r173692 + r173692;
        double r173694 = r173693 + r173692;
        double r173695 = r173694 + r173692;
        double r173696 = r173695 + r173692;
        return r173696;
}

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