Average Error: 0 → 0
Time: 5.4s
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 r124348 = x;
        double r124349 = r124348 + r124348;
        double r124350 = r124349 + r124348;
        double r124351 = r124350 + r124348;
        double r124352 = r124351 + r124348;
        return r124352;
}
↓
double f(double x) {
        double r124353 = x;
        double r124354 = r124353 + r124353;
        double r124355 = r124354 + r124353;
        double r124356 = r124355 + r124353;
        double r124357 = r124356 + r124353;
        return r124357;
}

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