Average Error: 0 → 0
Time: 656.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 r129983 = x;
        double r129984 = r129983 + r129983;
        double r129985 = r129984 + r129983;
        double r129986 = r129985 + r129983;
        double r129987 = r129986 + r129983;
        return r129987;
}
↓
double f(double x) {
        double r129988 = x;
        double r129989 = r129988 + r129988;
        double r129990 = r129989 + r129988;
        double r129991 = r129990 + r129988;
        double r129992 = r129991 + r129988;
        return r129992;
}

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