Average Error: 0 → 0
Time: 46.9s
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 r141046 = x;
        double r141047 = r141046 + r141046;
        double r141048 = r141047 + r141046;
        double r141049 = r141048 + r141046;
        double r141050 = r141049 + r141046;
        return r141050;
}
↓
double f(double x) {
        double r141051 = x;
        double r141052 = r141051 + r141051;
        double r141053 = r141052 + r141051;
        double r141054 = r141053 + r141051;
        double r141055 = r141054 + r141051;
        return r141055;
}

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