Average Error: 0 → 0
Time: 604.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 r107680 = x;
        double r107681 = r107680 + r107680;
        double r107682 = r107681 + r107680;
        double r107683 = r107682 + r107680;
        double r107684 = r107683 + r107680;
        return r107684;
}
↓
double f(double x) {
        double r107685 = x;
        double r107686 = r107685 + r107685;
        double r107687 = r107686 + r107685;
        double r107688 = r107687 + r107685;
        double r107689 = r107688 + r107685;
        return r107689;
}

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