Average Error: 0.0 → 0.0
Time: 657.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r83862 = x;
        double r83863 = r83862 * r83862;
        double r83864 = r83862 + r83863;
        return r83864;
}
↓
double f(double x) {
        double r83865 = x;
        double r83866 = r83865 * r83865;
        double r83867 = r83865 + r83866;
        return r83867;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x + x \cdot x\]

  2. Final simplification0.0

    \[\leadsto x + x \cdot x\]

Reproduce

herbie shell --seed 2020024 
(FPCore (x)
  :name "Main:bigenough1 from B"
  :precision binary64
  (+ x (* x x)))