Average Error: 0 → 0
Time: 562.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 r75905 = x;
        double r75906 = r75905 + r75905;
        double r75907 = r75906 + r75905;
        double r75908 = r75907 + r75905;
        double r75909 = r75908 + r75905;
        return r75909;
}
↓
double f(double x) {
        double r75910 = x;
        double r75911 = r75910 + r75910;
        double r75912 = r75911 + r75910;
        double r75913 = r75912 + r75910;
        double r75914 = r75913 + r75910;
        return r75914;
}

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