Average Error: 0 → 0
Time: 672.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 r11114 = x;
        double r11115 = r11114 + r11114;
        double r11116 = r11115 + r11114;
        double r11117 = r11116 + r11114;
        double r11118 = r11117 + r11114;
        return r11118;
}
↓
double f(double x) {
        double r11119 = x;
        double r11120 = r11119 + r11119;
        double r11121 = r11120 + r11119;
        double r11122 = r11121 + r11119;
        double r11123 = r11122 + r11119;
        return r11123;
}

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