Average Error: 0.0 → 0.0
Time: 3.4s
Precision: 64
\[x + x \cdot x\]
↓
\[x \cdot x + x\]
x + x \cdot x
↓
x \cdot x + x
double f(double x) {
        double r103665 = x;
        double r103666 = r103665 * r103665;
        double r103667 = r103665 + r103666;
        return r103667;
}
↓
double f(double x) {
        double r103668 = x;
        double r103669 = r103668 * r103668;
        double r103670 = r103669 + r103668;
        return r103670;
}

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 \cdot x + x\]

Reproduce

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