Average Error: 0 → 0
Time: 658.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 r67890 = x;
        double r67891 = r67890 + r67890;
        double r67892 = r67891 + r67890;
        double r67893 = r67892 + r67890;
        double r67894 = r67893 + r67890;
        return r67894;
}
↓
double f(double x) {
        double r67895 = x;
        double r67896 = r67895 + r67895;
        double r67897 = r67896 + r67895;
        double r67898 = r67897 + r67895;
        double r67899 = r67898 + r67895;
        return r67899;
}

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