Average Error: 0 → 0
Time: 536.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 r155040 = x;
        double r155041 = r155040 + r155040;
        double r155042 = r155041 + r155040;
        double r155043 = r155042 + r155040;
        double r155044 = r155043 + r155040;
        return r155044;
}
↓
double f(double x) {
        double r155045 = x;
        double r155046 = r155045 + r155045;
        double r155047 = r155046 + r155045;
        double r155048 = r155047 + r155045;
        double r155049 = r155048 + r155045;
        return r155049;
}

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