Average Error: 0 → 0
Time: 876.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 r85631 = x;
        double r85632 = r85631 + r85631;
        double r85633 = r85632 + r85631;
        double r85634 = r85633 + r85631;
        double r85635 = r85634 + r85631;
        return r85635;
}
↓
double f(double x) {
        double r85636 = x;
        double r85637 = r85636 + r85636;
        double r85638 = r85637 + r85636;
        double r85639 = r85638 + r85636;
        double r85640 = r85639 + r85636;
        return r85640;
}

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