Average Error: 0 → 0
Time: 309.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 r105740 = x;
        double r105741 = r105740 + r105740;
        double r105742 = r105741 + r105740;
        double r105743 = r105742 + r105740;
        double r105744 = r105743 + r105740;
        return r105744;
}
↓
double f(double x) {
        double r105745 = x;
        double r105746 = r105745 + r105745;
        double r105747 = r105746 + r105745;
        double r105748 = r105747 + r105745;
        double r105749 = r105748 + r105745;
        return r105749;
}

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