Linear.V3:cross from linear-1.19.1.3

Average Error: 0.0 → 0.0

Time: 3.4s

Precision: binary64

Cost: 6784

Math

\[x \cdot y - z \cdot t \]

↓

\[\mathsf{fma}\left(y, x, z \cdot \left(-t\right)\right) \]

FPCore

(FPCore (x y z t) :precision binary64 (- (* x y) (* z t)))

↓

(FPCore (x y z t) :precision binary64 (fma y x (* z (- t))))

C

double code(double x, double y, double z, double t) {
	return (x * y) - (z * t);
}

↓

double code(double x, double y, double z, double t) {
	return fma(y, x, (z * -t));
}

Julia

function code(x, y, z, t)
	return Float64(Float64(x * y) - Float64(z * t))
end

↓

function code(x, y, z, t)
	return fma(y, x, Float64(z * Float64(-t)))
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(x * y), $MachinePrecision] - N[(z * t), $MachinePrecision]), $MachinePrecision]

↓

code[x_, y_, z_, t_] := N[(y * x + N[(z * (-t)), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 0.0

   \[x \cdot y - z \cdot t \]

2. Applied egg-rr 0.0

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, -z \cdot t\right)} \]

3. Final simplification 0.0

   \[\leadsto \mathsf{fma}\left(y, x, z \cdot \left(-t\right)\right) \]

Alternatives

Alternative 1
Error	0.0
Cost	6784

\[\mathsf{fma}\left(-z, t, y \cdot x\right) \]

Alternative 2
Error	23.2
Cost	784

\[\begin{array}{l} t_1 := z \cdot \left(-t\right)\\ \mathbf{if}\;t \leq -1.3859660662917625 \cdot 10^{-157}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t \leq 490757721343045300:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;t \leq 4.401462691893915 \cdot 10^{+64}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;t \leq 2.5 \cdot 10^{+142}:\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]

Alternative 3
Error	0.0
Cost	448

\[y \cdot x - z \cdot t \]

Alternative 4
Error	31.0
Cost	192

\[y \cdot x \]

Reproduce

herbie shell --seed 2022316 
(FPCore (x y z t)
  :name "Linear.V3:cross from linear-1.19.1.3"
  :precision binary64
  (- (* x y) (* z t)))