Average Error: 0 → 0
Time: 5.3s
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 r163954 = x;
        double r163955 = r163954 + r163954;
        double r163956 = r163955 + r163954;
        double r163957 = r163956 + r163954;
        double r163958 = r163957 + r163954;
        return r163958;
}
↓
double f(double x) {
        double r163959 = x;
        double r163960 = 5.0;
        double r163961 = r163959 * r163960;
        return r163961;
}

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