Average Error: 0 → 0
Time: 545.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 r130199 = x;
        double r130200 = r130199 + r130199;
        double r130201 = r130200 + r130199;
        double r130202 = r130201 + r130199;
        double r130203 = r130202 + r130199;
        return r130203;
}
↓
double f(double x) {
        double r130204 = x;
        double r130205 = r130204 + r130204;
        double r130206 = r130205 + r130204;
        double r130207 = r130206 + r130204;
        double r130208 = r130207 + r130204;
        return r130208;
}

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