Average Error: 0 → 0
Time: 49.6s
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 r137326 = x;
        double r137327 = r137326 + r137326;
        double r137328 = r137327 + r137326;
        double r137329 = r137328 + r137326;
        double r137330 = r137329 + r137326;
        return r137330;
}
↓
double f(double x) {
        double r137331 = x;
        double r137332 = r137331 + r137331;
        double r137333 = r137332 + r137331;
        double r137334 = r137333 + r137331;
        double r137335 = r137334 + r137331;
        return r137335;
}

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