Average Error: 0 → 0
Time: 547.0ms
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 r125592 = x;
        double r125593 = r125592 + r125592;
        double r125594 = r125593 + r125592;
        double r125595 = r125594 + r125592;
        double r125596 = r125595 + r125592;
        return r125596;
}
↓
double f(double x) {
        double r125597 = x;
        double r125598 = 5.0;
        double r125599 = r125597 * r125598;
        return r125599;
}

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. Simplified0

    \[\leadsto \color{blue}{x \cdot 5}\]

  3. Final simplification0

    \[\leadsto x \cdot 5\]

Reproduce

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