Average Error: 0 → 0
Time: 686.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 r110368 = x;
        double r110369 = r110368 + r110368;
        double r110370 = r110369 + r110368;
        double r110371 = r110370 + r110368;
        double r110372 = r110371 + r110368;
        return r110372;
}
↓
double f(double x) {
        double r110373 = x;
        double r110374 = r110373 + r110373;
        double r110375 = r110374 + r110373;
        double r110376 = r110375 + r110373;
        double r110377 = r110376 + r110373;
        return r110377;
}

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