Average Error: 0 → 0
Time: 565.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 r116751 = x;
        double r116752 = r116751 + r116751;
        double r116753 = r116752 + r116751;
        double r116754 = r116753 + r116751;
        double r116755 = r116754 + r116751;
        return r116755;
}
↓
double f(double x) {
        double r116756 = x;
        double r116757 = r116756 + r116756;
        double r116758 = r116757 + r116756;
        double r116759 = r116758 + r116756;
        double r116760 = r116759 + r116756;
        return r116760;
}

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