Average Error: 0 → 0
Time: 720.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 r120048 = x;
        double r120049 = r120048 + r120048;
        double r120050 = r120049 + r120048;
        double r120051 = r120050 + r120048;
        double r120052 = r120051 + r120048;
        return r120052;
}
↓
double f(double x) {
        double r120053 = x;
        double r120054 = r120053 + r120053;
        double r120055 = r120054 + r120053;
        double r120056 = r120055 + r120053;
        double r120057 = r120056 + r120053;
        return r120057;
}

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