Average Error: 0 → 0
Time: 716.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 r140817 = x;
        double r140818 = r140817 + r140817;
        double r140819 = r140818 + r140817;
        double r140820 = r140819 + r140817;
        double r140821 = r140820 + r140817;
        return r140821;
}
↓
double f(double x) {
        double r140822 = x;
        double r140823 = r140822 + r140822;
        double r140824 = r140823 + r140822;
        double r140825 = r140824 + r140822;
        double r140826 = r140825 + r140822;
        return r140826;
}

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