Average Error: 0 → 0
Time: 592.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 r112478 = x;
        double r112479 = r112478 + r112478;
        double r112480 = r112479 + r112478;
        double r112481 = r112480 + r112478;
        double r112482 = r112481 + r112478;
        return r112482;
}
↓
double f(double x) {
        double r112483 = x;
        double r112484 = r112483 + r112483;
        double r112485 = r112484 + r112483;
        double r112486 = r112485 + r112483;
        double r112487 = r112486 + r112483;
        return r112487;
}

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