Average Error: 0 → 0
Time: 737.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 r90952 = x;
        double r90953 = r90952 + r90952;
        double r90954 = r90953 + r90952;
        double r90955 = r90954 + r90952;
        double r90956 = r90955 + r90952;
        return r90956;
}
↓
double f(double x) {
        double r90957 = x;
        double r90958 = r90957 + r90957;
        double r90959 = r90958 + r90957;
        double r90960 = r90959 + r90957;
        double r90961 = r90960 + r90957;
        return r90961;
}

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