Average Error: 0 → 0
Time: 547.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 r154499 = x;
        double r154500 = r154499 + r154499;
        double r154501 = r154500 + r154499;
        double r154502 = r154501 + r154499;
        double r154503 = r154502 + r154499;
        return r154503;
}
↓
double f(double x) {
        double r154504 = x;
        double r154505 = r154504 + r154504;
        double r154506 = r154505 + r154504;
        double r154507 = r154506 + r154504;
        double r154508 = r154507 + r154504;
        return r154508;
}

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