Average Error: 0 → 0
Time: 307.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 r103692 = x;
        double r103693 = r103692 + r103692;
        double r103694 = r103693 + r103692;
        double r103695 = r103694 + r103692;
        double r103696 = r103695 + r103692;
        return r103696;
}
↓
double f(double x) {
        double r103697 = x;
        double r103698 = 5.0;
        double r103699 = r103697 * r103698;
        return r103699;
}

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