Average Error: 0 → 0
Time: 559.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 r95429 = x;
        double r95430 = r95429 + r95429;
        double r95431 = r95430 + r95429;
        double r95432 = r95431 + r95429;
        double r95433 = r95432 + r95429;
        return r95433;
}
↓
double f(double x) {
        double r95434 = x;
        double r95435 = r95434 + r95434;
        double r95436 = r95435 + r95434;
        double r95437 = r95436 + r95434;
        double r95438 = r95437 + r95434;
        return r95438;
}

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