Data.Metrics.Snapshot:quantile from metrics-0.3.0.2

Percentage Accurate: 100.0% → 100.0%

Time: 6.9s

Alternatives: 7

Speedup: 1.0×

• 34.5% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ x + \left(y - z\right) \cdot \left(t - x\right) \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x + ((y - z) * (t - x))
end function

Java

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

Python

def code(x, y, z, t):
	return x + ((y - z) * (t - x))

Julia

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

MATLAB

function tmp = code(x, y, z, t)
	tmp = x + ((y - z) * (t - x));
end

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \left(y - z\right) \cdot \left(t - x\right) \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x + ((y - z) * (t - x))
end function

Java

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

Python

def code(x, y, z, t):
	return x + ((y - z) * (t - x))

Julia

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

MATLAB

function tmp = code(x, y, z, t)
	tmp = x + ((y - z) * (t - x));
end

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(t - x\right) \cdot \left(y - z\right) + x \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = ((t - x) * (y - z)) + x
end function

Java

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

Python

def code(x, y, z, t):
	return ((t - x) * (y - z)) + x

Julia

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

MATLAB

function tmp = code(x, y, z, t)
	tmp = ((t - x) * (y - z)) + x;
end

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x + \left(y - z\right) \cdot \left(t - x\right) \]
2. Add Preprocessing

3. Final simplification 100.0%

   \[\leadsto \left(t - x\right) \cdot \left(y - z\right) + x \]
4. Add Preprocessing

Alternative 2: 49.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.6 \cdot 10^{+60}:\\ \;\;\;\;t \cdot y\\ \mathbf{elif}\;y \leq 45000000000000:\\ \;\;\;\;\mathsf{fma}\left(x, z, x\right)\\ \mathbf{elif}\;y \leq 5.4 \cdot 10^{+150}:\\ \;\;\;\;\left(-x\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;t \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -2.6e+60)
   (* t y)
   (if (<= y 45000000000000.0)
     (fma x z x)
     (if (<= y 5.4e+150) (* (- x) y) (* t y)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -2.6e+60) {
		tmp = t * y;
	} else if (y <= 45000000000000.0) {
		tmp = fma(x, z, x);
	} else if (y <= 5.4e+150) {
		tmp = -x * y;
	} else {
		tmp = t * y;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -2.6e+60)
		tmp = Float64(t * y);
	elseif (y <= 45000000000000.0)
		tmp = fma(x, z, x);
	elseif (y <= 5.4e+150)
		tmp = Float64(Float64(-x) * y);
	else
		tmp = Float64(t * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -2.6e+60], N[(t * y), $MachinePrecision], If[LessEqual[y, 45000000000000.0], N[(x * z + x), $MachinePrecision], If[LessEqual[y, 5.4e+150], N[((-x) * y), $MachinePrecision], N[(t * y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < -2.60000000000000008e60 or 5.40000000000000015e150 < y

   1. Initial program 100.0%

      \[x + \left(y - z\right) \cdot \left(t - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(t - x\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 91.3

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

   5. Applied rewrites 91.3%

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

   6. Taylor expanded in x around 0

      \[\leadsto t \cdot \color{blue}{y} \]
   7. Step-by-step derivation

   8. Applied rewrites 56.9%

      \[\leadsto t \cdot \color{blue}{y} \]

   if -2.60000000000000008e60 < y < 4.5e13

   1. Initial program 100.0%

      \[x + \left(y - z\right) \cdot \left(t - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -1 \cdot \left(y - z\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. unsub-neg N/A

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

      10. remove-double-neg N/A

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

      11. lower--.f64 63.1

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

   5. Applied rewrites 63.1%

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

   6. Taylor expanded in y around 0

      \[\leadsto x + \color{blue}{x \cdot z} \]
   7. Step-by-step derivation

   8. Applied rewrites 61.4%

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

   if 4.5e13 < y < 5.40000000000000015e150

   1. Initial program 100.0%

      \[x + \left(y - z\right) \cdot \left(t - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(t - x\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 72.2

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

   5. Applied rewrites 72.2%

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

   6. Taylor expanded in x around inf

      \[\leadsto -1 \cdot \color{blue}{\left(x \cdot y\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 49.6%

      \[\leadsto \left(-x\right) \cdot \color{blue}{y} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 84.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(t - x\right) \cdot y\\ \mathbf{if}\;y \leq -1.52 \cdot 10^{+41}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 2200000000000:\\ \;\;\;\;\mathsf{fma}\left(x - t, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- t x) y)))
   (if (<= y -1.52e+41)
     t_1
     (if (<= y 2200000000000.0) (fma (- x t) z x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (t - x) * y;
	double tmp;
	if (y <= -1.52e+41) {
		tmp = t_1;
	} else if (y <= 2200000000000.0) {
		tmp = fma((x - t), z, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(t - x) * y)
	tmp = 0.0
	if (y <= -1.52e+41)
		tmp = t_1;
	elseif (y <= 2200000000000.0)
		tmp = fma(Float64(x - t), z, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(t - x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -1.52e+41], t$95$1, If[LessEqual[y, 2200000000000.0], N[(N[(x - t), $MachinePrecision] * z + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.52000000000000002e41 or 2.2e12 < y

   1. Initial program 100.0%

      \[x + \left(y - z\right) \cdot \left(t - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(t - x\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 84.9

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

   5. Applied rewrites 84.9%

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

   if -1.52000000000000002e41 < y < 2.2e12

   1. Initial program 100.0%

      \[x + \left(y - z\right) \cdot \left(t - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{x + -1 \cdot \left(z \cdot \left(t - x\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(\color{blue}{\left(t + \left(\mathsf{neg}\left(x\right)\right)\right)}\right), z, x\right) \]

      7. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(\color{blue}{\left(\left(\mathsf{neg}\left(x\right)\right) + t\right)}\right), z, x\right) \]

      8. distribute-neg-in N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)\right) + \left(\mathsf{neg}\left(t\right)\right)}, z, x\right) \]

      9. unsub-neg N/A

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

      10. remove-double-neg N/A

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

      11. lower--.f64 90.0

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

   5. Applied rewrites 90.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x - t, z, x\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 67.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(t - x\right) \cdot y\\ \mathbf{if}\;y \leq -4.3 \cdot 10^{+18}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 1.95 \cdot 10^{-15}:\\ \;\;\;\;\mathsf{fma}\left(x, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- t x) y)))
   (if (<= y -4.3e+18) t_1 (if (<= y 1.95e-15) (fma x z x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (t - x) * y;
	double tmp;
	if (y <= -4.3e+18) {
		tmp = t_1;
	} else if (y <= 1.95e-15) {
		tmp = fma(x, z, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(t - x) * y)
	tmp = 0.0
	if (y <= -4.3e+18)
		tmp = t_1;
	elseif (y <= 1.95e-15)
		tmp = fma(x, z, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(t - x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -4.3e+18], t$95$1, If[LessEqual[y, 1.95e-15], N[(x * z + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if y < -4.3e18 or 1.95000000000000013e-15 < y

   1. Initial program 100.0%

      \[x + \left(y - z\right) \cdot \left(t - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(t - x\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 81.3

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

   5. Applied rewrites 81.3%

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

   if -4.3e18 < y < 1.95000000000000013e-15

   1. Initial program 100.0%

      \[x + \left(y - z\right) \cdot \left(t - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -1 \cdot \left(y - z\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. unsub-neg N/A

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

      10. remove-double-neg N/A

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

      11. lower--.f64 65.3

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

   5. Applied rewrites 65.3%

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

   6. Taylor expanded in y around 0

      \[\leadsto x + \color{blue}{x \cdot z} \]
   7. Step-by-step derivation

   8. Applied rewrites 65.3%

      \[\leadsto \mathsf{fma}\left(x, \color{blue}{z}, x\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 48.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.6 \cdot 10^{+60}:\\ \;\;\;\;t \cdot y\\ \mathbf{elif}\;y \leq 4.8 \cdot 10^{+105}:\\ \;\;\;\;\mathsf{fma}\left(x, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;t \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -2.6e+60) (* t y) (if (<= y 4.8e+105) (fma x z x) (* t y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -2.6e+60) {
		tmp = t * y;
	} else if (y <= 4.8e+105) {
		tmp = fma(x, z, x);
	} else {
		tmp = t * y;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -2.6e+60)
		tmp = Float64(t * y);
	elseif (y <= 4.8e+105)
		tmp = fma(x, z, x);
	else
		tmp = Float64(t * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -2.6e+60], N[(t * y), $MachinePrecision], If[LessEqual[y, 4.8e+105], N[(x * z + x), $MachinePrecision], N[(t * y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -2.60000000000000008e60 or 4.7999999999999995e105 < y

   1. Initial program 100.0%

      \[x + \left(y - z\right) \cdot \left(t - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(t - x\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 90.4

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

   5. Applied rewrites 90.4%

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

   6. Taylor expanded in x around 0

      \[\leadsto t \cdot \color{blue}{y} \]
   7. Step-by-step derivation

   8. Applied rewrites 52.8%

      \[\leadsto t \cdot \color{blue}{y} \]

   if -2.60000000000000008e60 < y < 4.7999999999999995e105

   1. Initial program 100.0%

      \[x + \left(y - z\right) \cdot \left(t - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -1 \cdot \left(y - z\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. unsub-neg N/A

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

      10. remove-double-neg N/A

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

      11. lower--.f64 63.2

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

   5. Applied rewrites 63.2%

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

   6. Taylor expanded in y around 0

      \[\leadsto x + \color{blue}{x \cdot z} \]
   7. Step-by-step derivation

   8. Applied rewrites 58.2%

      \[\leadsto \mathsf{fma}\left(x, \color{blue}{z}, x\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 38.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.3 \cdot 10^{+20}:\\ \;\;\;\;z \cdot x\\ \mathbf{elif}\;z \leq 4.1 \cdot 10^{+30}:\\ \;\;\;\;t \cdot y\\ \mathbf{else}:\\ \;\;\;\;z \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -3.3e+20) (* z x) (if (<= z 4.1e+30) (* t y) (* z x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -3.3e+20) {
		tmp = z * x;
	} else if (z <= 4.1e+30) {
		tmp = t * y;
	} else {
		tmp = z * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z <= (-3.3d+20)) then
        tmp = z * x
    else if (z <= 4.1d+30) then
        tmp = t * y
    else
        tmp = z * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -3.3e+20) {
		tmp = z * x;
	} else if (z <= 4.1e+30) {
		tmp = t * y;
	} else {
		tmp = z * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -3.3e+20:
		tmp = z * x
	elif z <= 4.1e+30:
		tmp = t * y
	else:
		tmp = z * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -3.3e+20)
		tmp = Float64(z * x);
	elseif (z <= 4.1e+30)
		tmp = Float64(t * y);
	else
		tmp = Float64(z * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -3.3e+20)
		tmp = z * x;
	elseif (z <= 4.1e+30)
		tmp = t * y;
	else
		tmp = z * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -3.3e+20], N[(z * x), $MachinePrecision], If[LessEqual[z, 4.1e+30], N[(t * y), $MachinePrecision], N[(z * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.3e20 or 4.10000000000000005e30 < z

   1. Initial program 100.0%

      \[x + \left(y - z\right) \cdot \left(t - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(1 + -1 \cdot \left(y - z\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. distribute-lft1-in N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. unsub-neg N/A

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

      10. remove-double-neg N/A

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

      11. lower--.f64 59.2

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

   5. Applied rewrites 59.2%

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

   6. Taylor expanded in z around inf

      \[\leadsto x \cdot \color{blue}{z} \]
   7. Step-by-step derivation

   8. Applied rewrites 47.6%

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

   if -3.3e20 < z < 4.10000000000000005e30

   1. Initial program 100.0%

      \[x + \left(y - z\right) \cdot \left(t - x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y \cdot \left(t - x\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 57.5

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

   5. Applied rewrites 57.5%

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

   6. Taylor expanded in x around 0

      \[\leadsto t \cdot \color{blue}{y} \]
   7. Step-by-step derivation

   8. Applied rewrites 36.2%

      \[\leadsto t \cdot \color{blue}{y} \]
3. Recombined 2 regimes into one program.

4. Final simplification 41.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.3 \cdot 10^{+20}:\\ \;\;\;\;z \cdot x\\ \mathbf{elif}\;z \leq 4.1 \cdot 10^{+30}:\\ \;\;\;\;t \cdot y\\ \mathbf{else}:\\ \;\;\;\;z \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 26.0% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ t \cdot y \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = t * y
end function

Java

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

Python

def code(x, y, z, t):
	return t * y

Julia

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

MATLAB

function tmp = code(x, y, z, t)
	tmp = t * y;
end

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x + \left(y - z\right) \cdot \left(t - x\right) \]
2. Add Preprocessing

3. Taylor expanded in y around inf

   \[\leadsto \color{blue}{y \cdot \left(t - x\right)} \]
4. Step-by-step derivation

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower--.f64 46.0

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

5. Applied rewrites 46.0%

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

6. Taylor expanded in x around 0

   \[\leadsto t \cdot \color{blue}{y} \]
7. Step-by-step derivation

8. Applied rewrites 28.4%

   \[\leadsto t \cdot \color{blue}{y} \]
9. Add Preprocessing

Developer Target 1: 96.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ x + \left(t \cdot \left(y - z\right) + \left(-x\right) \cdot \left(y - z\right)\right) \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x + ((t * (y - z)) + (-x * (y - z)))
end function

Java

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

Python

def code(x, y, z, t):
	return x + ((t * (y - z)) + (-x * (y - z)))

Julia

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

MATLAB

function tmp = code(x, y, z, t)
	tmp = x + ((t * (y - z)) + (-x * (y - z)));
end

Wolfram

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

Reproduce

herbie shell --seed 2024294 
(FPCore (x y z t)
  :name "Data.Metrics.Snapshot:quantile from metrics-0.3.0.2"
  :precision binary64

  :alt
  (! :herbie-platform default (+ x (+ (* t (- y z)) (* (- x) (- y z)))))

  (+ x (* (- y z) (- t x))))