Average Error: 0 → 0
Time: 30.1s
Precision: 64
\[\left(\left(\left(x + x\right) + x\right) + x\right) + x\]
↓
\[5 \cdot x\]
\left(\left(\left(x + x\right) + x\right) + x\right) + x
↓
5 \cdot x
double f(double x) {
        double r6410194 = x;
        double r6410195 = r6410194 + r6410194;
        double r6410196 = r6410195 + r6410194;
        double r6410197 = r6410196 + r6410194;
        double r6410198 = r6410197 + r6410194;
        return r6410198;
}
↓
double f(double x) {
        double r6410199 = 5.0;
        double r6410200 = x;
        double r6410201 = r6410199 * r6410200;
        return r6410201;
}

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}{5 \cdot x}\]

  3. Final simplification0

    \[\leadsto 5 \cdot x\]

Reproduce

herbie shell --seed 2019158 
(FPCore (x)
  :name "Main:i from "
  (+ (+ (+ (+ x x) x) x) x))