Average Error: 0 → 0
Time: 1.1s
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 r12951 = x;
        double r12952 = r12951 + r12951;
        double r12953 = r12952 + r12951;
        double r12954 = r12953 + r12951;
        double r12955 = r12954 + r12951;
        return r12955;
}
↓
double f(double x) {
        double r12956 = x;
        double r12957 = 5.0;
        double r12958 = r12956 * r12957;
        return r12958;
}

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