Examples.Basics.ProofTests:f4 from sbv-4.4

Average Error: 0.0 → 0.0

Time: 4.4s

Precision: binary64

Cost: 6976

Math

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

↓

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

FPCore

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

↓

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

C

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

↓

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

Julia

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

↓

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

Wolfram

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

↓

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

Target

Original	0.0
Target	0.0
Herbie	0.0

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

Derivation

1. Initial program 0.0

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

2. Simplified 0.0

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

   [Start] 0.0	\[ \left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]
   +-commutative [=>] 0.0	\[ \color{blue}{y \cdot y + \left(x \cdot x + \left(x \cdot 2\right) \cdot y\right)} \]
   fma-def [=>] 0.0	\[ \color{blue}{\mathsf{fma}\left(y, y, x \cdot x + \left(x \cdot 2\right) \cdot y\right)} \]
   +-commutative [=>] 0.0	\[ \mathsf{fma}\left(y, y, \color{blue}{\left(x \cdot 2\right) \cdot y + x \cdot x}\right) \]
   associate-*l* [=>] 0.0	\[ \mathsf{fma}\left(y, y, \color{blue}{x \cdot \left(2 \cdot y\right)} + x \cdot x\right) \]
   distribute-lft-out [=>] 0.0	\[ \mathsf{fma}\left(y, y, \color{blue}{x \cdot \left(2 \cdot y + x\right)}\right) \]

3. Final simplification 0.0

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

Alternatives

Alternative 1
Error	0.0
Cost	704

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

Alternative 2
Error	20.8
Cost	580

\[\begin{array}{l} \mathbf{if}\;y \leq 2.3 \cdot 10^{-148}:\\ \;\;\;\;x \cdot \left(x + y \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \]

Alternative 3
Error	20.8
Cost	580

\[\begin{array}{l} \mathbf{if}\;y \leq 1.15 \cdot 10^{-147}:\\ \;\;\;\;x \cdot \left(x + y \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(y + x \cdot 2\right)\\ \end{array} \]

Alternative 4
Error	21.0
Cost	324

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

Alternative 5
Error	28.3
Cost	192

\[x \cdot x \]

Reproduce

herbie shell --seed 2023039 
(FPCore (x y)
  :name "Examples.Basics.ProofTests:f4 from sbv-4.4"
  :precision binary64

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

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