Average Error: 0 → 0
Time: 604.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 r92765 = x;
        double r92766 = r92765 + r92765;
        double r92767 = r92766 + r92765;
        double r92768 = r92767 + r92765;
        double r92769 = r92768 + r92765;
        return r92769;
}
↓
double f(double x) {
        double r92770 = x;
        double r92771 = r92770 + r92770;
        double r92772 = r92771 + r92770;
        double r92773 = r92772 + r92770;
        double r92774 = r92773 + r92770;
        return r92774;
}

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