Average Error: 0 → 0
Time: 602.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 r85899 = x;
        double r85900 = r85899 + r85899;
        double r85901 = r85900 + r85899;
        double r85902 = r85901 + r85899;
        double r85903 = r85902 + r85899;
        return r85903;
}
↓
double f(double x) {
        double r85904 = x;
        double r85905 = r85904 + r85904;
        double r85906 = r85905 + r85904;
        double r85907 = r85906 + r85904;
        double r85908 = r85907 + r85904;
        return r85908;
}

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