Average Error: 0 → 0
Time: 558.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 r93651 = x;
        double r93652 = r93651 + r93651;
        double r93653 = r93652 + r93651;
        double r93654 = r93653 + r93651;
        double r93655 = r93654 + r93651;
        return r93655;
}
↓
double f(double x) {
        double r93656 = x;
        double r93657 = r93656 + r93656;
        double r93658 = r93657 + r93656;
        double r93659 = r93658 + r93656;
        double r93660 = r93659 + r93656;
        return r93660;
}

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