Average Error: 0.0 → 0.0
Time: 1.8s
Precision: binary64
Cost: 320
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
(FPCore (x) :precision binary64 (+ x (* x x)))
↓
(FPCore (x) :precision binary64 (+ x (* x x)))
double code(double x) {
	return x + (x * x);
}
↓
double code(double x) {
	return x + (x * x);
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Alternatives

Alternative 1
Error22.0
Cost13504
\[\sqrt{x + x \cdot x} \cdot \sqrt{x + x \cdot x}\]
Alternative 2
Error29.8
Cost7168
\[\frac{x \cdot x - {x}^{4}}{x - x \cdot x}\]
Alternative 3
Error0.0
Cost320
\[x \cdot \left(x + 1\right)\]
Alternative 4
Error41.4
Cost192
\[x \cdot x\]
Alternative 5
Error21.1
Cost64
\[x\]
Alternative 6
Error61.2
Cost64
\[1\]
Alternative 7
Error61.2
Cost64
\[0\]
Alternative 8
Error62.1
Cost64
\[-1\]

Error

Derivation

  1. Initial program 0.0

    \[x + x \cdot x\]

  2. Simplified0.0

    \[\leadsto \color{blue}{x + x \cdot x}\]

  3. Final simplification0.0

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

Reproduce

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