Average Error: 0 → 0
Time: 608.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 r91311 = x;
        double r91312 = r91311 + r91311;
        double r91313 = r91312 + r91311;
        double r91314 = r91313 + r91311;
        double r91315 = r91314 + r91311;
        return r91315;
}
↓
double f(double x) {
        double r91316 = x;
        double r91317 = r91316 + r91316;
        double r91318 = r91317 + r91316;
        double r91319 = r91318 + r91316;
        double r91320 = r91319 + r91316;
        return r91320;
}

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