Average Error: 0 → 0
Time: 671.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 r156991 = x;
        double r156992 = r156991 + r156991;
        double r156993 = r156992 + r156991;
        double r156994 = r156993 + r156991;
        double r156995 = r156994 + r156991;
        return r156995;
}
↓
double f(double x) {
        double r156996 = x;
        double r156997 = r156996 + r156996;
        double r156998 = r156997 + r156996;
        double r156999 = r156998 + r156996;
        double r157000 = r156999 + r156996;
        return r157000;
}

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