Average Error: 0 → 0
Time: 4.4s
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 r65082 = x;
        double r65083 = r65082 + r65082;
        double r65084 = r65083 + r65082;
        double r65085 = r65084 + r65082;
        double r65086 = r65085 + r65082;
        return r65086;
}
↓
double f(double x) {
        double r65087 = x;
        double r65088 = 5.0;
        double r65089 = r65087 * r65088;
        return r65089;
}

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