Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, C

Percentage Accurate: 97.5% → 97.5%

Time: 5.8s

Alternatives: 9

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ \left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (+ (- (+ (* x y) (/ (* z t) 16.0)) (/ (* a b) 4.0)) c))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (((x * y) + ((z * t) / 16.0d0)) - ((a * b) / 4.0d0)) + c
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
}

Python

def code(x, y, z, t, a, b, c):
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c

Julia

function code(x, y, z, t, a, b, c)
	return Float64(Float64(Float64(Float64(x * y) + Float64(Float64(z * t) / 16.0)) - Float64(Float64(a * b) / 4.0)) + c)
end

MATLAB

function tmp = code(x, y, z, t, a, b, c)
	tmp = (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(x * y), $MachinePrecision] + N[(N[(z * t), $MachinePrecision] / 16.0), $MachinePrecision]), $MachinePrecision] - N[(N[(a * b), $MachinePrecision] / 4.0), $MachinePrecision]), $MachinePrecision] + c), $MachinePrecision]

Initial Program: 97.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (+ (- (+ (* x y) (/ (* z t) 16.0)) (/ (* a b) 4.0)) c))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (((x * y) + ((z * t) / 16.0d0)) - ((a * b) / 4.0d0)) + c
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
}

Python

def code(x, y, z, t, a, b, c):
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c

Julia

function code(x, y, z, t, a, b, c)
	return Float64(Float64(Float64(Float64(x * y) + Float64(Float64(z * t) / 16.0)) - Float64(Float64(a * b) / 4.0)) + c)
end

MATLAB

function tmp = code(x, y, z, t, a, b, c)
	tmp = (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(x * y), $MachinePrecision] + N[(N[(z * t), $MachinePrecision] / 16.0), $MachinePrecision]), $MachinePrecision] - N[(N[(a * b), $MachinePrecision] / 4.0), $MachinePrecision]), $MachinePrecision] + c), $MachinePrecision]

Alternative 1: 97.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (+ (- (+ (* x y) (/ (* z t) 16.0)) (/ (* a b) 4.0)) c))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = (((x * y) + ((z * t) / 16.0d0)) - ((a * b) / 4.0d0)) + c
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
}

Python

def code(x, y, z, t, a, b, c):
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c

Julia

function code(x, y, z, t, a, b, c)
	return Float64(Float64(Float64(Float64(x * y) + Float64(Float64(z * t) / 16.0)) - Float64(Float64(a * b) / 4.0)) + c)
end

MATLAB

function tmp = code(x, y, z, t, a, b, c)
	tmp = (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := N[(N[(N[(N[(x * y), $MachinePrecision] + N[(N[(z * t), $MachinePrecision] / 16.0), $MachinePrecision]), $MachinePrecision] - N[(N[(a * b), $MachinePrecision] / 4.0), $MachinePrecision]), $MachinePrecision] + c), $MachinePrecision]

Derivation

1. Initial program 97.5%

   \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]
2. Add Preprocessing

Alternative 2: 90.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{a \cdot b}{4}\\ t_2 := \mathsf{fma}\left(-0.25, a \cdot b, 0.0625 \cdot \left(t \cdot z\right)\right) + c\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+88}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+42}:\\ \;\;\;\;\mathsf{fma}\left(z \cdot 0.0625, t, \mathsf{fma}\left(y, x, c\right)\right)\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+222}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-0.25, a \cdot b, x \cdot y\right) + c\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ (* a b) 4.0))
        (t_2 (+ (fma -0.25 (* a b) (* 0.0625 (* t z))) c)))
   (if (<= t_1 -1e+88)
     t_2
     (if (<= t_1 2e+42)
       (fma (* z 0.0625) t (fma y x c))
       (if (<= t_1 5e+222) t_2 (+ (fma -0.25 (* a b) (* x y)) c))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (a * b) / 4.0;
	double t_2 = fma(-0.25, (a * b), (0.0625 * (t * z))) + c;
	double tmp;
	if (t_1 <= -1e+88) {
		tmp = t_2;
	} else if (t_1 <= 2e+42) {
		tmp = fma((z * 0.0625), t, fma(y, x, c));
	} else if (t_1 <= 5e+222) {
		tmp = t_2;
	} else {
		tmp = fma(-0.25, (a * b), (x * y)) + c;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(a * b) / 4.0)
	t_2 = Float64(fma(-0.25, Float64(a * b), Float64(0.0625 * Float64(t * z))) + c)
	tmp = 0.0
	if (t_1 <= -1e+88)
		tmp = t_2;
	elseif (t_1 <= 2e+42)
		tmp = fma(Float64(z * 0.0625), t, fma(y, x, c));
	elseif (t_1 <= 5e+222)
		tmp = t_2;
	else
		tmp = Float64(fma(-0.25, Float64(a * b), Float64(x * y)) + c);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(a * b), $MachinePrecision] / 4.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(-0.25 * N[(a * b), $MachinePrecision] + N[(0.0625 * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + c), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+88], t$95$2, If[LessEqual[t$95$1, 2e+42], N[(N[(z * 0.0625), $MachinePrecision] * t + N[(y * x + c), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+222], t$95$2, N[(N[(-0.25 * N[(a * b), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision] + c), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 a b) #s(literal 4 binary64)) < -9.99999999999999959e87 or 2.00000000000000009e42 < (/.f64 (*.f64 a b) #s(literal 4 binary64)) < 5.00000000000000023e222

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\left(\frac{1}{16} \cdot \left(t \cdot z\right) - \frac{1}{4} \cdot \left(a \cdot b\right)\right)} + c \]

   4. Applied rewrites 73.7%

      \[\leadsto \color{blue}{\left(0.0625 \cdot \left(t \cdot z\right) - 0.25 \cdot \left(a \cdot b\right)\right)} + c \]

   5. Taylor expanded in a around 0

      \[\leadsto \left(\frac{-1}{4} \cdot \left(a \cdot b\right) + \color{blue}{\frac{1}{16} \cdot \left(t \cdot z\right)}\right) + c \]

   7. Applied rewrites 73.7%

      \[\leadsto \mathsf{fma}\left(-0.25, \color{blue}{a \cdot b}, 0.0625 \cdot \left(t \cdot z\right)\right) + c \]

   if -9.99999999999999959e87 < (/.f64 (*.f64 a b) #s(literal 4 binary64)) < 2.00000000000000009e42

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{c + \left(\frac{1}{16} \cdot \left(t \cdot z\right) + x \cdot y\right)} \]

   4. Applied rewrites 73.6%

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

   6. Applied rewrites 74.1%

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

   if 5.00000000000000023e222 < (/.f64 (*.f64 a b) #s(literal 4 binary64))

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\left(x \cdot y - \frac{1}{4} \cdot \left(a \cdot b\right)\right)} + c \]

   4. Applied rewrites 73.9%

      \[\leadsto \color{blue}{\left(x \cdot y - 0.25 \cdot \left(a \cdot b\right)\right)} + c \]

   5. Taylor expanded in a around 0

      \[\leadsto \left(\frac{-1}{4} \cdot \left(a \cdot b\right) + \color{blue}{x \cdot y}\right) + c \]

   7. Applied rewrites 73.9%

      \[\leadsto \mathsf{fma}\left(-0.25, \color{blue}{a \cdot b}, x \cdot y\right) + c \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 90.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{a \cdot b}{4}\\ t_2 := \mathsf{fma}\left(-0.25, a \cdot b, x \cdot y\right) + c\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+88}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+88}:\\ \;\;\;\;\mathsf{fma}\left(z \cdot 0.0625, t, \mathsf{fma}\left(y, x, c\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ (* a b) 4.0)) (t_2 (+ (fma -0.25 (* a b) (* x y)) c)))
   (if (<= t_1 -1e+88)
     t_2
     (if (<= t_1 2e+88) (fma (* z 0.0625) t (fma y x c)) t_2))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (a * b) / 4.0;
	double t_2 = fma(-0.25, (a * b), (x * y)) + c;
	double tmp;
	if (t_1 <= -1e+88) {
		tmp = t_2;
	} else if (t_1 <= 2e+88) {
		tmp = fma((z * 0.0625), t, fma(y, x, c));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(a * b) / 4.0)
	t_2 = Float64(fma(-0.25, Float64(a * b), Float64(x * y)) + c)
	tmp = 0.0
	if (t_1 <= -1e+88)
		tmp = t_2;
	elseif (t_1 <= 2e+88)
		tmp = fma(Float64(z * 0.0625), t, fma(y, x, c));
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(a * b), $MachinePrecision] / 4.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(-0.25 * N[(a * b), $MachinePrecision] + N[(x * y), $MachinePrecision]), $MachinePrecision] + c), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+88], t$95$2, If[LessEqual[t$95$1, 2e+88], N[(N[(z * 0.0625), $MachinePrecision] * t + N[(y * x + c), $MachinePrecision]), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 a b) #s(literal 4 binary64)) < -9.99999999999999959e87 or 1.99999999999999992e88 < (/.f64 (*.f64 a b) #s(literal 4 binary64))

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\left(x \cdot y - \frac{1}{4} \cdot \left(a \cdot b\right)\right)} + c \]

   4. Applied rewrites 73.9%

      \[\leadsto \color{blue}{\left(x \cdot y - 0.25 \cdot \left(a \cdot b\right)\right)} + c \]

   5. Taylor expanded in a around 0

      \[\leadsto \left(\frac{-1}{4} \cdot \left(a \cdot b\right) + \color{blue}{x \cdot y}\right) + c \]

   7. Applied rewrites 73.9%

      \[\leadsto \mathsf{fma}\left(-0.25, \color{blue}{a \cdot b}, x \cdot y\right) + c \]

   if -9.99999999999999959e87 < (/.f64 (*.f64 a b) #s(literal 4 binary64)) < 1.99999999999999992e88

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{c + \left(\frac{1}{16} \cdot \left(t \cdot z\right) + x \cdot y\right)} \]

   4. Applied rewrites 73.6%

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

   6. Applied rewrites 74.1%

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

Alternative 4: 85.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{a \cdot b}{4}\\ t_2 := -0.25 \cdot \left(a \cdot b\right) + c\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+88}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+88}:\\ \;\;\;\;\mathsf{fma}\left(z \cdot 0.0625, t, \mathsf{fma}\left(y, x, c\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ (* a b) 4.0)) (t_2 (+ (* -0.25 (* a b)) c)))
   (if (<= t_1 -1e+88)
     t_2
     (if (<= t_1 2e+88) (fma (* z 0.0625) t (fma y x c)) t_2))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (a * b) / 4.0;
	double t_2 = (-0.25 * (a * b)) + c;
	double tmp;
	if (t_1 <= -1e+88) {
		tmp = t_2;
	} else if (t_1 <= 2e+88) {
		tmp = fma((z * 0.0625), t, fma(y, x, c));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(a * b) / 4.0)
	t_2 = Float64(Float64(-0.25 * Float64(a * b)) + c)
	tmp = 0.0
	if (t_1 <= -1e+88)
		tmp = t_2;
	elseif (t_1 <= 2e+88)
		tmp = fma(Float64(z * 0.0625), t, fma(y, x, c));
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(a * b), $MachinePrecision] / 4.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(-0.25 * N[(a * b), $MachinePrecision]), $MachinePrecision] + c), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+88], t$95$2, If[LessEqual[t$95$1, 2e+88], N[(N[(z * 0.0625), $MachinePrecision] * t + N[(y * x + c), $MachinePrecision]), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 a b) #s(literal 4 binary64)) < -9.99999999999999959e87 or 1.99999999999999992e88 < (/.f64 (*.f64 a b) #s(literal 4 binary64))

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\left(x \cdot y - \frac{1}{4} \cdot \left(a \cdot b\right)\right)} + c \]

   4. Applied rewrites 73.9%

      \[\leadsto \color{blue}{\left(x \cdot y - 0.25 \cdot \left(a \cdot b\right)\right)} + c \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{-1}{4} \cdot \color{blue}{\left(a \cdot b\right)} + c \]

   7. Applied rewrites 48.8%

      \[\leadsto -0.25 \cdot \color{blue}{\left(a \cdot b\right)} + c \]

   if -9.99999999999999959e87 < (/.f64 (*.f64 a b) #s(literal 4 binary64)) < 1.99999999999999992e88

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{c + \left(\frac{1}{16} \cdot \left(t \cdot z\right) + x \cdot y\right)} \]

   4. Applied rewrites 73.6%

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

   6. Applied rewrites 74.1%

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

Alternative 5: 65.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{a \cdot b}{4}\\ t_2 := -0.25 \cdot \left(a \cdot b\right) + c\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+88}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-187}:\\ \;\;\;\;c + 0.0625 \cdot \left(t \cdot z\right)\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+42}:\\ \;\;\;\;\mathsf{fma}\left(y, x, c\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ (* a b) 4.0)) (t_2 (+ (* -0.25 (* a b)) c)))
   (if (<= t_1 -1e+88)
     t_2
     (if (<= t_1 2e-187)
       (+ c (* 0.0625 (* t z)))
       (if (<= t_1 2e+42) (fma y x c) t_2)))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (a * b) / 4.0;
	double t_2 = (-0.25 * (a * b)) + c;
	double tmp;
	if (t_1 <= -1e+88) {
		tmp = t_2;
	} else if (t_1 <= 2e-187) {
		tmp = c + (0.0625 * (t * z));
	} else if (t_1 <= 2e+42) {
		tmp = fma(y, x, c);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(a * b) / 4.0)
	t_2 = Float64(Float64(-0.25 * Float64(a * b)) + c)
	tmp = 0.0
	if (t_1 <= -1e+88)
		tmp = t_2;
	elseif (t_1 <= 2e-187)
		tmp = Float64(c + Float64(0.0625 * Float64(t * z)));
	elseif (t_1 <= 2e+42)
		tmp = fma(y, x, c);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(a * b), $MachinePrecision] / 4.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(-0.25 * N[(a * b), $MachinePrecision]), $MachinePrecision] + c), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+88], t$95$2, If[LessEqual[t$95$1, 2e-187], N[(c + N[(0.0625 * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+42], N[(y * x + c), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 a b) #s(literal 4 binary64)) < -9.99999999999999959e87 or 2.00000000000000009e42 < (/.f64 (*.f64 a b) #s(literal 4 binary64))

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\left(x \cdot y - \frac{1}{4} \cdot \left(a \cdot b\right)\right)} + c \]

   4. Applied rewrites 73.9%

      \[\leadsto \color{blue}{\left(x \cdot y - 0.25 \cdot \left(a \cdot b\right)\right)} + c \]

   5. Taylor expanded in x around 0

      \[\leadsto \frac{-1}{4} \cdot \color{blue}{\left(a \cdot b\right)} + c \]

   7. Applied rewrites 48.8%

      \[\leadsto -0.25 \cdot \color{blue}{\left(a \cdot b\right)} + c \]

   if -9.99999999999999959e87 < (/.f64 (*.f64 a b) #s(literal 4 binary64)) < 2e-187

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{c + \left(\frac{1}{16} \cdot \left(t \cdot z\right) + x \cdot y\right)} \]

   4. Applied rewrites 73.6%

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

   5. Taylor expanded in x around 0

      \[\leadsto c + \frac{1}{16} \cdot \color{blue}{\left(t \cdot z\right)} \]

   7. Applied rewrites 48.8%

      \[\leadsto c + 0.0625 \cdot \color{blue}{\left(t \cdot z\right)} \]

   if 2e-187 < (/.f64 (*.f64 a b) #s(literal 4 binary64)) < 2.00000000000000009e42

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{c + \left(\frac{1}{16} \cdot \left(t \cdot z\right) + x \cdot y\right)} \]

   4. Applied rewrites 73.6%

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

   5. Taylor expanded in z around 0

      \[\leadsto c + \color{blue}{x \cdot y} \]

   7. Applied rewrites 48.8%

      \[\leadsto c + \color{blue}{x \cdot y} \]

   9. Applied rewrites 48.9%

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

Alternative 6: 63.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{a \cdot b}{4}\\ t_2 := -0.25 \cdot \left(a \cdot b\right)\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+117}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-187}:\\ \;\;\;\;c + 0.0625 \cdot \left(t \cdot z\right)\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+79}:\\ \;\;\;\;\mathsf{fma}\left(y, x, c\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ (* a b) 4.0)) (t_2 (* -0.25 (* a b))))
   (if (<= t_1 -5e+117)
     t_2
     (if (<= t_1 2e-187)
       (+ c (* 0.0625 (* t z)))
       (if (<= t_1 5e+79) (fma y x c) t_2)))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (a * b) / 4.0;
	double t_2 = -0.25 * (a * b);
	double tmp;
	if (t_1 <= -5e+117) {
		tmp = t_2;
	} else if (t_1 <= 2e-187) {
		tmp = c + (0.0625 * (t * z));
	} else if (t_1 <= 5e+79) {
		tmp = fma(y, x, c);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(a * b) / 4.0)
	t_2 = Float64(-0.25 * Float64(a * b))
	tmp = 0.0
	if (t_1 <= -5e+117)
		tmp = t_2;
	elseif (t_1 <= 2e-187)
		tmp = Float64(c + Float64(0.0625 * Float64(t * z)));
	elseif (t_1 <= 5e+79)
		tmp = fma(y, x, c);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(a * b), $MachinePrecision] / 4.0), $MachinePrecision]}, Block[{t$95$2 = N[(-0.25 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+117], t$95$2, If[LessEqual[t$95$1, 2e-187], N[(c + N[(0.0625 * N[(t * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 5e+79], N[(y * x + c), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 a b) #s(literal 4 binary64)) < -4.99999999999999983e117 or 5e79 < (/.f64 (*.f64 a b) #s(literal 4 binary64))

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{-1}{4} \cdot \left(a \cdot b\right)} \]

   4. Applied rewrites 28.4%

      \[\leadsto \color{blue}{-0.25 \cdot \left(a \cdot b\right)} \]

   if -4.99999999999999983e117 < (/.f64 (*.f64 a b) #s(literal 4 binary64)) < 2e-187

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{c + \left(\frac{1}{16} \cdot \left(t \cdot z\right) + x \cdot y\right)} \]

   4. Applied rewrites 73.6%

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

   5. Taylor expanded in x around 0

      \[\leadsto c + \frac{1}{16} \cdot \color{blue}{\left(t \cdot z\right)} \]

   7. Applied rewrites 48.8%

      \[\leadsto c + 0.0625 \cdot \color{blue}{\left(t \cdot z\right)} \]

   if 2e-187 < (/.f64 (*.f64 a b) #s(literal 4 binary64)) < 5e79

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{c + \left(\frac{1}{16} \cdot \left(t \cdot z\right) + x \cdot y\right)} \]

   4. Applied rewrites 73.6%

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

   5. Taylor expanded in z around 0

      \[\leadsto c + \color{blue}{x \cdot y} \]

   7. Applied rewrites 48.8%

      \[\leadsto c + \color{blue}{x \cdot y} \]

   9. Applied rewrites 48.9%

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

Alternative 7: 62.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{a \cdot b}{4}\\ t_2 := -0.25 \cdot \left(a \cdot b\right)\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+117}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+79}:\\ \;\;\;\;\mathsf{fma}\left(y, x, c\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ (* a b) 4.0)) (t_2 (* -0.25 (* a b))))
   (if (<= t_1 -5e+117) t_2 (if (<= t_1 5e+79) (fma y x c) t_2))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (a * b) / 4.0;
	double t_2 = -0.25 * (a * b);
	double tmp;
	if (t_1 <= -5e+117) {
		tmp = t_2;
	} else if (t_1 <= 5e+79) {
		tmp = fma(y, x, c);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(a * b) / 4.0)
	t_2 = Float64(-0.25 * Float64(a * b))
	tmp = 0.0
	if (t_1 <= -5e+117)
		tmp = t_2;
	elseif (t_1 <= 5e+79)
		tmp = fma(y, x, c);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(a * b), $MachinePrecision] / 4.0), $MachinePrecision]}, Block[{t$95$2 = N[(-0.25 * N[(a * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+117], t$95$2, If[LessEqual[t$95$1, 5e+79], N[(y * x + c), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 a b) #s(literal 4 binary64)) < -4.99999999999999983e117 or 5e79 < (/.f64 (*.f64 a b) #s(literal 4 binary64))

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{-1}{4} \cdot \left(a \cdot b\right)} \]

   4. Applied rewrites 28.4%

      \[\leadsto \color{blue}{-0.25 \cdot \left(a \cdot b\right)} \]

   if -4.99999999999999983e117 < (/.f64 (*.f64 a b) #s(literal 4 binary64)) < 5e79

   1. Initial program 97.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around 0

      \[\leadsto \color{blue}{c + \left(\frac{1}{16} \cdot \left(t \cdot z\right) + x \cdot y\right)} \]

   4. Applied rewrites 73.6%

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

   5. Taylor expanded in z around 0

      \[\leadsto c + \color{blue}{x \cdot y} \]

   7. Applied rewrites 48.8%

      \[\leadsto c + \color{blue}{x \cdot y} \]

   9. Applied rewrites 48.9%

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

Alternative 8: 48.9% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(y, x, c\right) \end{array} \]

FPCore

(FPCore (x y z t a b c) :precision binary64 (fma y x c))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	return fma(y, x, c);
}

Julia

function code(x, y, z, t, a, b, c)
	return fma(y, x, c)
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := N[(y * x + c), $MachinePrecision]

Derivation

1. Initial program 97.5%

   \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

2. Taylor expanded in a around 0

   \[\leadsto \color{blue}{c + \left(\frac{1}{16} \cdot \left(t \cdot z\right) + x \cdot y\right)} \]

4. Applied rewrites 73.6%

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

5. Taylor expanded in z around 0

   \[\leadsto c + \color{blue}{x \cdot y} \]

7. Applied rewrites 48.8%

   \[\leadsto c + \color{blue}{x \cdot y} \]

9. Applied rewrites 48.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, c\right)} \]
10. Add Preprocessing

Alternative 9: 22.5% accurate, 24.7× speedup

Math

\[\begin{array}{l} \\ c \end{array} \]

FPCore

(FPCore (x y z t a b c) :precision binary64 c)

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	return c;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t, a, b, c)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    code = c
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	return c;
}

Python

def code(x, y, z, t, a, b, c):
	return c

Julia

function code(x, y, z, t, a, b, c)
	return c
end

MATLAB

function tmp = code(x, y, z, t, a, b, c)
	tmp = c;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := c

Derivation

1. Initial program 97.5%

   \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

2. Taylor expanded in a around 0

   \[\leadsto \color{blue}{c + \left(\frac{1}{16} \cdot \left(t \cdot z\right) + x \cdot y\right)} \]

4. Applied rewrites 73.6%

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

5. Taylor expanded in z around 0

   \[\leadsto c + \color{blue}{x \cdot y} \]

7. Applied rewrites 48.8%

   \[\leadsto c + \color{blue}{x \cdot y} \]

8. Taylor expanded in x around 0

   \[\leadsto c \]

10. Applied rewrites 22.5%

    \[\leadsto c \]
11. Add Preprocessing

Reproduce

herbie shell --seed 2025159 
(FPCore (x y z t a b c)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, C"
  :precision binary64
  (+ (- (+ (* x y) (/ (* z t) 16.0)) (/ (* a b) 4.0)) c))