Average Error: 0 → 0
Time: 572.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 r122451 = x;
        double r122452 = r122451 + r122451;
        double r122453 = r122452 + r122451;
        double r122454 = r122453 + r122451;
        double r122455 = r122454 + r122451;
        return r122455;
}
↓
double f(double x) {
        double r122456 = x;
        double r122457 = r122456 + r122456;
        double r122458 = r122457 + r122456;
        double r122459 = r122458 + r122456;
        double r122460 = r122459 + r122456;
        return r122460;
}

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