Average Error: 0.0 → 0.0
Time: 6.7s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r83064 = x;
        double r83065 = r83064 * r83064;
        double r83066 = r83064 + r83065;
        return r83066;
}
↓
double f(double x) {
        double r83067 = x;
        double r83068 = r83067 * r83067;
        double r83069 = r83067 + r83068;
        return r83069;
}

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 2019325 
(FPCore (x)
  :name "Main:bigenough1 from B"
  :precision binary64
  (+ x (* x x)))