Average Error: 0.0 → 0.0
Time: 39.0s
Precision: binary64
Cost: 320
\[x \cdot \left(x - 1\right)\]
↓
\[x \cdot x - x\]
x \cdot \left(x - 1\right)
↓
x \cdot x - x
(FPCore (x) :precision binary64 (* x (- x 1.0)))
↓
(FPCore (x) :precision binary64 (- (* x x) x))
double code(double x) {
	return x * (x - 1.0);
}
↓
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

Target

Original0.0
Target0.0
Herbie0.0
\[x \cdot x - x\]

Alternatives

Alternative 1
Error0.0
Cost320
\[x \cdot \left(x - 1\right)\]
Alternative 2
Error1.8
Cost520
\[\begin{array}{l} \mathbf{if}\;x \leq -0.9979022278705204 \lor \neg \left(x \leq 1.0150417341532645\right):\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array}\]
Alternative 3
Error21.3
Cost128
\[-x\]
Alternative 4
Error61.2
Cost64
\[0\]
Alternative 5
Error61.3
Cost64
\[1\]

Error

Time

Derivation

  1. Initial program 0.0

    \[x \cdot \left(x - 1\right)\]
  2. Using strategy rm

  3. Applied sub-neg_binary64_147340.0

    \[\leadsto x \cdot \color{blue}{\left(x + \left(-1\right)\right)}\]

  4. Applied distribute-rgt-in_binary64_146910.0

    \[\leadsto \color{blue}{x \cdot x + \left(-1\right) \cdot x}\]

  5. Simplified0.0

    \[\leadsto x \cdot x + \color{blue}{\left(-x\right)}\]
  6. Using strategy rm

  7. Applied pow1_binary64_148020.0

    \[\leadsto \color{blue}{{\left(x \cdot x + \left(-x\right)\right)}^{1}}\]

  8. Simplified0.0

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

  9. Final simplification0.0

    \[\leadsto x \cdot x - x\]

Reproduce

herbie shell --seed 2021040 
(FPCore (x)
  :name "Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2"
  :precision binary64

  :herbie-target
  (- (* x x) x)

  (* x (- x 1.0)))