Average Error: 0 → 0
Time: 544.0ms
Precision: 64
\[\left(\left(\left(x + x\right) + x\right) + x\right) + x\]
↓
\[\left(\left(\left(x + x\right) + x\right) + x\right) + x\]
\left(\left(\left(x + x\right) + x\right) + x\right) + x
↓
\left(\left(\left(x + x\right) + x\right) + x\right) + x
double f(double x) {
        double r137503 = x;
        double r137504 = r137503 + r137503;
        double r137505 = r137504 + r137503;
        double r137506 = r137505 + r137503;
        double r137507 = r137506 + r137503;
        return r137507;
}
↓
double f(double x) {
        double r137508 = x;
        double r137509 = r137508 + r137508;
        double r137510 = r137509 + r137508;
        double r137511 = r137510 + r137508;
        double r137512 = r137511 + r137508;
        return r137512;
}

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. Final simplification0

    \[\leadsto \left(\left(\left(x + x\right) + x\right) + x\right) + x\]

Reproduce

herbie shell --seed 2020062 +o rules:numerics
(FPCore (x)
  :name "Main:i from "
  :precision binary64
  (+ (+ (+ (+ x x) x) x) x))