Average Error: 0 → 0
Time: 546.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 r109216 = x;
        double r109217 = r109216 + r109216;
        double r109218 = r109217 + r109216;
        double r109219 = r109218 + r109216;
        double r109220 = r109219 + r109216;
        return r109220;
}
↓
double f(double x) {
        double r109221 = x;
        double r109222 = r109221 + r109221;
        double r109223 = r109222 + r109221;
        double r109224 = r109223 + r109221;
        double r109225 = r109224 + r109221;
        return r109225;
}

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