Average Error: 0 → 0
Time: 738.0ms
Precision: 64
\[\left(\left(\left(x + x\right) + x\right) + x\right) + x\]
↓
\[\left(x + \left(\left(x + x\right) + x\right)\right) + x\]
\left(\left(\left(x + x\right) + x\right) + x\right) + x
↓
\left(x + \left(\left(x + x\right) + x\right)\right) + x
double f(double x) {
        double r93704 = x;
        double r93705 = r93704 + r93704;
        double r93706 = r93705 + r93704;
        double r93707 = r93706 + r93704;
        double r93708 = r93707 + r93704;
        return r93708;
}
↓
double f(double x) {
        double r93709 = x;
        double r93710 = r93709 + r93709;
        double r93711 = r93710 + r93709;
        double r93712 = r93709 + r93711;
        double r93713 = r93712 + r93709;
        return r93713;
}

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(x + \left(\left(x + x\right) + x\right)\right) + x\]

Reproduce

herbie shell --seed 2019196 +o rules:numerics
(FPCore (x)
  :name "Main:i from "
  (+ (+ (+ (+ x x) x) x) x))