Average Error: 0 → 0
Time: 1.0s
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 r75756 = x;
        double r75757 = r75756 + r75756;
        double r75758 = r75757 + r75756;
        double r75759 = r75758 + r75756;
        double r75760 = r75759 + r75756;
        return r75760;
}
↓
double f(double x) {
        double r75761 = x;
        double r75762 = r75761 + r75761;
        double r75763 = r75762 + r75761;
        double r75764 = r75763 + r75761;
        double r75765 = r75764 + r75761;
        return r75765;
}

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