Average Error: 0 → 0
Time: 534.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 r117733 = x;
        double r117734 = r117733 + r117733;
        double r117735 = r117734 + r117733;
        double r117736 = r117735 + r117733;
        double r117737 = r117736 + r117733;
        return r117737;
}
↓
double f(double x) {
        double r117738 = x;
        double r117739 = r117738 + r117738;
        double r117740 = r117739 + r117738;
        double r117741 = r117740 + r117738;
        double r117742 = r117741 + r117738;
        return r117742;
}

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