Average Error: 0 → 0
Time: 549.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 r119402 = x;
        double r119403 = r119402 + r119402;
        double r119404 = r119403 + r119402;
        double r119405 = r119404 + r119402;
        double r119406 = r119405 + r119402;
        return r119406;
}
↓
double f(double x) {
        double r119407 = x;
        double r119408 = r119407 + r119407;
        double r119409 = r119408 + r119407;
        double r119410 = r119409 + r119407;
        double r119411 = r119410 + r119407;
        return r119411;
}

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