Average Error: 0 → 0
Time: 657.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 r109998 = x;
        double r109999 = r109998 + r109998;
        double r110000 = r109999 + r109998;
        double r110001 = r110000 + r109998;
        double r110002 = r110001 + r109998;
        return r110002;
}
↓
double f(double x) {
        double r110003 = x;
        double r110004 = 5.0;
        double r110005 = r110003 * r110004;
        return r110005;
}

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