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 r118852 = x;
        double r118853 = r118852 + r118852;
        double r118854 = r118853 + r118852;
        double r118855 = r118854 + r118852;
        double r118856 = r118855 + r118852;
        return r118856;
}
↓
double f(double x) {
        double r118857 = x;
        double r118858 = r118857 + r118857;
        double r118859 = r118858 + r118857;
        double r118860 = r118859 + r118857;
        double r118861 = r118860 + r118857;
        return r118861;
}

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