Average Error: 0 → 0
Time: 296.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 r142047 = x;
        double r142048 = r142047 + r142047;
        double r142049 = r142048 + r142047;
        double r142050 = r142049 + r142047;
        double r142051 = r142050 + r142047;
        return r142051;
}
↓
double f(double x) {
        double r142052 = x;
        double r142053 = r142052 + r142052;
        double r142054 = r142053 + r142052;
        double r142055 = r142054 + r142052;
        double r142056 = r142055 + r142052;
        return r142056;
}

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