Average Error: 0 → 0
Time: 50.7s
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 r118457 = x;
        double r118458 = r118457 + r118457;
        double r118459 = r118458 + r118457;
        double r118460 = r118459 + r118457;
        double r118461 = r118460 + r118457;
        return r118461;
}
↓
double f(double x) {
        double r118462 = x;
        double r118463 = r118462 + r118462;
        double r118464 = r118463 + r118462;
        double r118465 = r118464 + r118462;
        double r118466 = r118465 + r118462;
        return r118466;
}

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