Average Error: 0 → 0
Time: 766.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 r68859 = x;
        double r68860 = r68859 + r68859;
        double r68861 = r68860 + r68859;
        double r68862 = r68861 + r68859;
        double r68863 = r68862 + r68859;
        return r68863;
}
↓
double f(double x) {
        double r68864 = x;
        double r68865 = r68864 + r68864;
        double r68866 = r68865 + r68864;
        double r68867 = r68866 + r68864;
        double r68868 = r68867 + r68864;
        return r68868;
}

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