Average Error: 0 → 0
Time: 938.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 r69989 = x;
        double r69990 = r69989 + r69989;
        double r69991 = r69990 + r69989;
        double r69992 = r69991 + r69989;
        double r69993 = r69992 + r69989;
        return r69993;
}
↓
double f(double x) {
        double r69994 = x;
        double r69995 = 5.0;
        double r69996 = r69994 * r69995;
        return r69996;
}

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