Numeric.Log:$clog1p from log-domain-0.10.2.1, A

Average Error: 0.0 → 0.0

Time: 4.6s

Precision: binary64

Cost: 6848

Math

\[\left(x \cdot 2 + x \cdot x\right) + y \cdot y \]

↓

\[\mathsf{fma}\left(y, y, x \cdot \left(x + 2\right)\right) \]

FPCore

(FPCore (x y) :precision binary64 (+ (+ (* x 2.0) (* x x)) (* y y)))

↓

(FPCore (x y) :precision binary64 (fma y y (* x (+ x 2.0))))

C

double code(double x, double y) {
	return ((x * 2.0) + (x * x)) + (y * y);
}

↓

double code(double x, double y) {
	return fma(y, y, (x * (x + 2.0)));
}

Julia

function code(x, y)
	return Float64(Float64(Float64(x * 2.0) + Float64(x * x)) + Float64(y * y))
end

↓

function code(x, y)
	return fma(y, y, Float64(x * Float64(x + 2.0)))
end

Wolfram

code[x_, y_] := N[(N[(N[(x * 2.0), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision]

↓

code[x_, y_] := N[(y * y + N[(x * N[(x + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Target

Original	0.0
Target	0.0
Herbie	0.0

\[y \cdot y + \left(2 \cdot x + x \cdot x\right) \]

Derivation

1. Initial program 0.0

   \[\left(x \cdot 2 + x \cdot x\right) + y \cdot y \]

2. Simplified 0.0

   \[\leadsto \color{blue}{x \cdot \left(2 + x\right) + y \cdot y} \]
   Proof

   [Start] 0.0	\[ \left(x \cdot 2 + x \cdot x\right) + y \cdot y \]
   distribute-lft-out [=>] 0.0	\[ \color{blue}{x \cdot \left(2 + x\right)} + y \cdot y \]

3. Applied egg-rr 0.0

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, y, x \cdot \left(x + 2\right)\right)} \]

4. Final simplification 0.0

   \[\leadsto \mathsf{fma}\left(y, y, x \cdot \left(x + 2\right)\right) \]

Alternatives

Alternative 1
Error	22.7
Cost	984

\[\begin{array}{l} \mathbf{if}\;x \leq -2:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq -3.6 \cdot 10^{-139}:\\ \;\;\;\;x + x\\ \mathbf{elif}\;x \leq 3.2 \cdot 10^{-266}:\\ \;\;\;\;y \cdot y\\ \mathbf{elif}\;x \leq 1.65 \cdot 10^{-221}:\\ \;\;\;\;x + x\\ \mathbf{elif}\;x \leq 1.45 \cdot 10^{-121}:\\ \;\;\;\;y \cdot y\\ \mathbf{elif}\;x \leq 2:\\ \;\;\;\;x + x\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 2
Error	10.1
Cost	972

\[\begin{array}{l} \mathbf{if}\;y \cdot y \leq 5.8 \cdot 10^{-54}:\\ \;\;\;\;x \cdot \left(x + 2\right)\\ \mathbf{elif}\;y \cdot y \leq 450000000000:\\ \;\;\;\;y \cdot y\\ \mathbf{elif}\;y \cdot y \leq 1.8 \cdot 10^{+28}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \]

Alternative 3
Error	5.4
Cost	713

\[\begin{array}{l} \mathbf{if}\;x \leq -3.1 \cdot 10^{-13} \lor \neg \left(x \leq 3.9 \cdot 10^{-51}\right):\\ \;\;\;\;x \cdot \left(x + 2\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot y + x \cdot 2\\ \end{array} \]

Alternative 4
Error	1.3
Cost	713

\[\begin{array}{l} \mathbf{if}\;x \leq -950 \lor \neg \left(x \leq 2\right):\\ \;\;\;\;x \cdot x + y \cdot y\\ \mathbf{else}:\\ \;\;\;\;y \cdot y + x \cdot 2\\ \end{array} \]

Alternative 5
Error	5.4
Cost	712

\[\begin{array}{l} \mathbf{if}\;x \leq -1.85 \cdot 10^{-13}:\\ \;\;\;\;x \cdot x + x \cdot 2\\ \mathbf{elif}\;x \leq 3.9 \cdot 10^{-51}:\\ \;\;\;\;y \cdot y + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(x + 2\right)\\ \end{array} \]

Alternative 6
Error	0.0
Cost	704

\[\left(x \cdot x + x \cdot 2\right) + y \cdot y \]

Alternative 7
Error	0.0
Cost	576

\[y \cdot y + x \cdot \left(x + 2\right) \]

Alternative 8
Error	25.6
Cost	456

\[\begin{array}{l} \mathbf{if}\;x \leq -10600000000:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 3.9 \cdot 10^{-51}:\\ \;\;\;\;y \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 9
Error	44.7
Cost	192

\[x \cdot x \]

Reproduce

herbie shell --seed 2023046 
(FPCore (x y)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, A"
  :precision binary64

  :herbie-target
  (+ (* y y) (+ (* 2.0 x) (* x x)))

  (+ (+ (* x 2.0) (* x x)) (* y y)))