Average Error: 0 → 0
Time: 576.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 r176101 = x;
        double r176102 = r176101 + r176101;
        double r176103 = r176102 + r176101;
        double r176104 = r176103 + r176101;
        double r176105 = r176104 + r176101;
        return r176105;
}
↓
double f(double x) {
        double r176106 = x;
        double r176107 = r176106 + r176106;
        double r176108 = r176107 + r176106;
        double r176109 = r176108 + r176106;
        double r176110 = r176109 + r176106;
        return r176110;
}

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