Average Error: 0 → 0
Time: 290.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 r117723 = x;
        double r117724 = r117723 + r117723;
        double r117725 = r117724 + r117723;
        double r117726 = r117725 + r117723;
        double r117727 = r117726 + r117723;
        return r117727;
}
↓
double f(double x) {
        double r117728 = x;
        double r117729 = r117728 + r117728;
        double r117730 = r117729 + r117728;
        double r117731 = r117730 + r117728;
        double r117732 = r117731 + r117728;
        return r117732;
}

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