Average Error: 0 → 0
Time: 299.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 r106502 = x;
        double r106503 = r106502 + r106502;
        double r106504 = r106503 + r106502;
        double r106505 = r106504 + r106502;
        double r106506 = r106505 + r106502;
        return r106506;
}
↓
double f(double x) {
        double r106507 = x;
        double r106508 = r106507 + r106507;
        double r106509 = r106508 + r106507;
        double r106510 = r106509 + r106507;
        double r106511 = r106510 + r106507;
        return r106511;
}

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