Average Error: 0 → 0
Time: 8.5s
Precision: 64
\[\left(\left(\left(x + x\right) + x\right) + x\right) + x\]
↓
\[x \cdot 5\]
\left(\left(\left(x + x\right) + x\right) + x\right) + x
↓
x \cdot 5
double f(double x) {
        double r116385 = x;
        double r116386 = r116385 + r116385;
        double r116387 = r116386 + r116385;
        double r116388 = r116387 + r116385;
        double r116389 = r116388 + r116385;
        return r116389;
}
↓
double f(double x) {
        double r116390 = x;
        double r116391 = 5.0;
        double r116392 = r116390 * r116391;
        return r116392;
}

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 x \cdot 5\]

Reproduce

herbie shell --seed 2019298 
(FPCore (x)
  :name "Main:i from "
  :precision binary64
  (+ (+ (+ (+ x x) x) x) x))