Average Error: 0 → 0
Time: 550.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 r73273 = x;
        double r73274 = r73273 + r73273;
        double r73275 = r73274 + r73273;
        double r73276 = r73275 + r73273;
        double r73277 = r73276 + r73273;
        return r73277;
}
↓
double f(double x) {
        double r73278 = x;
        double r73279 = r73278 + r73278;
        double r73280 = r73279 + r73278;
        double r73281 = r73280 + r73278;
        double r73282 = r73281 + r73278;
        return r73282;
}

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