Rosa's FloatVsDoubleBenchmark

Percentage Accurate: 70.8% → 99.2%

Time: 11.2s

Alternatives: 18

Speedup: 6.9×

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

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right) \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1)))
   (+
    x1
    (+
     (+
      (+
       (+
        (*
         (+
          (* (* (* 2.0 x1) t_2) (- t_2 3.0))
          (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
         t_1)
        (* t_0 t_2))
       (* (* x1 x1) x1))
      x1)
     (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
}

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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    t_0 = (3.0d0 * x1) * x1
    t_1 = (x1 * x1) + 1.0d0
    t_2 = ((t_0 + (2.0d0 * x2)) - x1) / t_1
    code = x1 + (((((((((2.0d0 * x1) * t_2) * (t_2 - 3.0d0)) + ((x1 * x1) * ((4.0d0 * t_2) - 6.0d0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0d0 * (((t_0 - (2.0d0 * x2)) - x1) / t_1)))
end function

Java

public static double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
}

Python

def code(x1, x2):
	t_0 = (3.0 * x1) * x1
	t_1 = (x1 * x1) + 1.0
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)))

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	return Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
end

MATLAB

function tmp = code(x1, x2)
	t_0 = (3.0 * x1) * x1;
	t_1 = (x1 * x1) + 1.0;
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	tmp = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Initial Program: 70.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right) \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1)))
   (+
    x1
    (+
     (+
      (+
       (+
        (*
         (+
          (* (* (* 2.0 x1) t_2) (- t_2 3.0))
          (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
         t_1)
        (* t_0 t_2))
       (* (* x1 x1) x1))
      x1)
     (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
}

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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: t_2
    t_0 = (3.0d0 * x1) * x1
    t_1 = (x1 * x1) + 1.0d0
    t_2 = ((t_0 + (2.0d0 * x2)) - x1) / t_1
    code = x1 + (((((((((2.0d0 * x1) * t_2) * (t_2 - 3.0d0)) + ((x1 * x1) * ((4.0d0 * t_2) - 6.0d0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0d0 * (((t_0 - (2.0d0 * x2)) - x1) / t_1)))
end function

Java

public static double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
}

Python

def code(x1, x2):
	t_0 = (3.0 * x1) * x1
	t_1 = (x1 * x1) + 1.0
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1
	return x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)))

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	return Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
end

MATLAB

function tmp = code(x1, x2)
	t_0 = (3.0 * x1) * x1;
	t_1 = (x1 * x1) + 1.0;
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	tmp = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Alternative 1: 99.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ \mathbf{if}\;t\_3 \leq \infty:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1))))))
   (if (<= t_3 INFINITY)
     t_3
     (* x1 (- (* x1 (- (* x1 (- (* 6.0 x1) 3.0)) 3.0)) 17.0)))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double tmp;
	if (t_3 <= ((double) INFINITY)) {
		tmp = t_3;
	} else {
		tmp = x1 * ((x1 * ((x1 * ((6.0 * x1) - 3.0)) - 3.0)) - 17.0);
	}
	return tmp;
}

Java

public static double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double tmp;
	if (t_3 <= Double.POSITIVE_INFINITY) {
		tmp = t_3;
	} else {
		tmp = x1 * ((x1 * ((x1 * ((6.0 * x1) - 3.0)) - 3.0)) - 17.0);
	}
	return tmp;
}

Python

def code(x1, x2):
	t_0 = (3.0 * x1) * x1
	t_1 = (x1 * x1) + 1.0
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1
	t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)))
	tmp = 0
	if t_3 <= math.inf:
		tmp = t_3
	else:
		tmp = x1 * ((x1 * ((x1 * ((6.0 * x1) - 3.0)) - 3.0)) - 17.0)
	return tmp

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	tmp = 0.0
	if (t_3 <= Inf)
		tmp = t_3;
	else
		tmp = Float64(x1 * Float64(Float64(x1 * Float64(Float64(x1 * Float64(Float64(6.0 * x1) - 3.0)) - 3.0)) - 17.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	t_0 = (3.0 * x1) * x1;
	t_1 = (x1 * x1) + 1.0;
	t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	tmp = 0.0;
	if (t_3 <= Inf)
		tmp = t_3;
	else
		tmp = x1 * ((x1 * ((x1 * ((6.0 * x1) - 3.0)) - 3.0)) - 17.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, Infinity], t$95$3, N[(x1 * N[(N[(x1 * N[(N[(x1 * N[(N[(6.0 * x1), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision] - 17.0), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.5%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \left(-1 \cdot \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1} + 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \mathsf{fma}\left(-1, \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}, 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x1 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + \color{blue}{x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + \color{blue}{-2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}, x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right) \]

   8. Applied rewrites 100.0%

      \[\leadsto x1 \cdot \color{blue}{\mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \mathsf{fma}\left(4, 2 \cdot x2 - 3, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]

   9. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]
   10. Step-by-step derivation

       1. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       2. lower-*.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       3. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       4. lower-*.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       5. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       6. lower-*.f64 100.0

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

   11. Applied rewrites 100.0%

       \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 73.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ \mathbf{if}\;t\_3 \leq -1 \cdot 10^{+245}:\\ \;\;\;\;8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right)\\ \mathbf{elif}\;t\_3 \leq 5 \cdot 10^{+80}:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, x1 \cdot \left(-12 \cdot x2 - 1\right)\right)\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, x1 \cdot \left(8 \cdot \left(x2 \cdot x2\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x1 \cdot \left(9 \cdot x1 - 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1))))))
   (if (<= t_3 -1e+245)
     (* 8.0 (* x1 (* x2 x2)))
     (if (<= t_3 5e+80)
       (fma -6.0 x2 (* x1 (- (* -12.0 x2) 1.0)))
       (if (<= t_3 INFINITY)
         (fma -6.0 x2 (* x1 (* 8.0 (* x2 x2))))
         (* x1 (- (* 9.0 x1) 1.0)))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double tmp;
	if (t_3 <= -1e+245) {
		tmp = 8.0 * (x1 * (x2 * x2));
	} else if (t_3 <= 5e+80) {
		tmp = fma(-6.0, x2, (x1 * ((-12.0 * x2) - 1.0)));
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = fma(-6.0, x2, (x1 * (8.0 * (x2 * x2))));
	} else {
		tmp = x1 * ((9.0 * x1) - 1.0);
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	tmp = 0.0
	if (t_3 <= -1e+245)
		tmp = Float64(8.0 * Float64(x1 * Float64(x2 * x2)));
	elseif (t_3 <= 5e+80)
		tmp = fma(-6.0, x2, Float64(x1 * Float64(Float64(-12.0 * x2) - 1.0)));
	elseif (t_3 <= Inf)
		tmp = fma(-6.0, x2, Float64(x1 * Float64(8.0 * Float64(x2 * x2))));
	else
		tmp = Float64(x1 * Float64(Float64(9.0 * x1) - 1.0));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+245], N[(8.0 * N[(x1 * N[(x2 * x2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 5e+80], N[(-6.0 * x2 + N[(x1 * N[(N[(-12.0 * x2), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], N[(-6.0 * x2 + N[(x1 * N[(8.0 * N[(x2 * x2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x1 * N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -1.00000000000000004e245

   1. Initial program 99.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 65.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, x2 \cdot 14\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot {x2}^{2}\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot \color{blue}{{x2}^{2}}\right) \]

      2. lower-*.f64 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot {x2}^{\color{blue}{2}}\right) \]

      3. unpow2 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right) \]

      4. lower-*.f64 71.3

         \[\leadsto 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right) \]

   8. Applied rewrites 71.3%

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot \left(x2 \cdot x2\right)\right)} \]

   if -1.00000000000000004e245 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 4.99999999999999961e80

   1. Initial program 99.2%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 88.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(-12 \cdot x2 - 1\right)\right) \]
   7. Step-by-step derivation

      1. lower-*.f64 88.6

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(-12 \cdot x2 - 1\right)\right) \]

   8. Applied rewrites 88.6%

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(-12 \cdot x2 - 1\right)\right) \]

   if 4.99999999999999961e80 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 43.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, x2 \cdot 14\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(8 \cdot {x2}^{2}\right)\right) \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(8 \cdot {x2}^{2}\right)\right) \]

      2. unpow2 N/A

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(8 \cdot \left(x2 \cdot x2\right)\right)\right) \]

      3. lower-*.f64 44.2

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(8 \cdot \left(x2 \cdot x2\right)\right)\right) \]

   8. Applied rewrites 44.2%

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(8 \cdot \left(x2 \cdot x2\right)\right)\right) \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 51.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, x2 \cdot 14\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

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

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

      3. lower-*.f64 87.1

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   8. Applied rewrites 87.1%

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

Alternative 3: 73.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ t_4 := 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right)\\ \mathbf{if}\;t\_3 \leq -1 \cdot 10^{+245}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+185}:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, x1 \cdot \left(-12 \cdot x2 - 1\right)\right)\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;t\_4\\ \mathbf{else}:\\ \;\;\;\;x1 \cdot \left(9 \cdot x1 - 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1)))))
        (t_4 (* 8.0 (* x1 (* x2 x2)))))
   (if (<= t_3 -1e+245)
     t_4
     (if (<= t_3 2e+185)
       (fma -6.0 x2 (* x1 (- (* -12.0 x2) 1.0)))
       (if (<= t_3 INFINITY) t_4 (* x1 (- (* 9.0 x1) 1.0)))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double t_4 = 8.0 * (x1 * (x2 * x2));
	double tmp;
	if (t_3 <= -1e+245) {
		tmp = t_4;
	} else if (t_3 <= 2e+185) {
		tmp = fma(-6.0, x2, (x1 * ((-12.0 * x2) - 1.0)));
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = t_4;
	} else {
		tmp = x1 * ((9.0 * x1) - 1.0);
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	t_4 = Float64(8.0 * Float64(x1 * Float64(x2 * x2)))
	tmp = 0.0
	if (t_3 <= -1e+245)
		tmp = t_4;
	elseif (t_3 <= 2e+185)
		tmp = fma(-6.0, x2, Float64(x1 * Float64(Float64(-12.0 * x2) - 1.0)));
	elseif (t_3 <= Inf)
		tmp = t_4;
	else
		tmp = Float64(x1 * Float64(Float64(9.0 * x1) - 1.0));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(8.0 * N[(x1 * N[(x2 * x2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+245], t$95$4, If[LessEqual[t$95$3, 2e+185], N[(-6.0 * x2 + N[(x1 * N[(N[(-12.0 * x2), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, N[(x1 * N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -1.00000000000000004e245 or 2e185 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.8%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 45.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, x2 \cdot 14\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot {x2}^{2}\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot \color{blue}{{x2}^{2}}\right) \]

      2. lower-*.f64 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot {x2}^{\color{blue}{2}}\right) \]

      3. unpow2 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right) \]

      4. lower-*.f64 47.3

         \[\leadsto 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right) \]

   8. Applied rewrites 47.3%

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot \left(x2 \cdot x2\right)\right)} \]

   if -1.00000000000000004e245 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 2e185

   1. Initial program 99.3%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 85.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(-12 \cdot x2 - 1\right)\right) \]
   7. Step-by-step derivation

      1. lower-*.f64 84.9

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(-12 \cdot x2 - 1\right)\right) \]

   8. Applied rewrites 84.9%

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(-12 \cdot x2 - 1\right)\right) \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 51.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, x2 \cdot 14\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

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

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

      3. lower-*.f64 87.1

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   8. Applied rewrites 87.1%

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

Alternative 4: 73.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ t_4 := 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right)\\ \mathbf{if}\;t\_3 \leq -1 \cdot 10^{+245}:\\ \;\;\;\;t\_4\\ \mathbf{elif}\;t\_3 \leq 2 \cdot 10^{+185}:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, x1 \cdot -1\right)\\ \mathbf{elif}\;t\_3 \leq \infty:\\ \;\;\;\;t\_4\\ \mathbf{else}:\\ \;\;\;\;x1 \cdot \left(9 \cdot x1 - 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1)))))
        (t_4 (* 8.0 (* x1 (* x2 x2)))))
   (if (<= t_3 -1e+245)
     t_4
     (if (<= t_3 2e+185)
       (fma -6.0 x2 (* x1 -1.0))
       (if (<= t_3 INFINITY) t_4 (* x1 (- (* 9.0 x1) 1.0)))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double t_4 = 8.0 * (x1 * (x2 * x2));
	double tmp;
	if (t_3 <= -1e+245) {
		tmp = t_4;
	} else if (t_3 <= 2e+185) {
		tmp = fma(-6.0, x2, (x1 * -1.0));
	} else if (t_3 <= ((double) INFINITY)) {
		tmp = t_4;
	} else {
		tmp = x1 * ((9.0 * x1) - 1.0);
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	t_4 = Float64(8.0 * Float64(x1 * Float64(x2 * x2)))
	tmp = 0.0
	if (t_3 <= -1e+245)
		tmp = t_4;
	elseif (t_3 <= 2e+185)
		tmp = fma(-6.0, x2, Float64(x1 * -1.0));
	elseif (t_3 <= Inf)
		tmp = t_4;
	else
		tmp = Float64(x1 * Float64(Float64(9.0 * x1) - 1.0));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(8.0 * N[(x1 * N[(x2 * x2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+245], t$95$4, If[LessEqual[t$95$3, 2e+185], N[(-6.0 * x2 + N[(x1 * -1.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, Infinity], t$95$4, N[(x1 * N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -1.00000000000000004e245 or 2e185 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.8%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 45.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, x2 \cdot 14\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot {x2}^{2}\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot \color{blue}{{x2}^{2}}\right) \]

      2. lower-*.f64 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot {x2}^{\color{blue}{2}}\right) \]

      3. unpow2 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right) \]

      4. lower-*.f64 47.3

         \[\leadsto 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right) \]

   8. Applied rewrites 47.3%

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot \left(x2 \cdot x2\right)\right)} \]

   if -1.00000000000000004e245 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 2e185

   1. Initial program 99.3%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 85.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot -1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 84.9%

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot -1\right) \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 51.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, x2 \cdot 14\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

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

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

      3. lower-*.f64 87.1

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   8. Applied rewrites 87.1%

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

Alternative 5: 80.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ t_3 := x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right)\\ \mathbf{if}\;t\_3 \leq -1 \cdot 10^{+245}:\\ \;\;\;\;8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right)\\ \mathbf{elif}\;t\_3 \leq 5 \cdot 10^{+157}:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, x1 \cdot \left(-12 \cdot x2 - 1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1))
        (t_3
         (+
          x1
          (+
           (+
            (+
             (+
              (*
               (+
                (* (* (* 2.0 x1) t_2) (- t_2 3.0))
                (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
               t_1)
              (* t_0 t_2))
             (* (* x1 x1) x1))
            x1)
           (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1))))))
   (if (<= t_3 -1e+245)
     (* 8.0 (* x1 (* x2 x2)))
     (if (<= t_3 5e+157)
       (fma -6.0 x2 (* x1 (- (* -12.0 x2) 1.0)))
       (* x1 (- (* x1 (- (* x1 (- (* 6.0 x1) 3.0)) 3.0)) 17.0))))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double t_3 = x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)));
	double tmp;
	if (t_3 <= -1e+245) {
		tmp = 8.0 * (x1 * (x2 * x2));
	} else if (t_3 <= 5e+157) {
		tmp = fma(-6.0, x2, (x1 * ((-12.0 * x2) - 1.0)));
	} else {
		tmp = x1 * ((x1 * ((x1 * ((6.0 * x1) - 3.0)) - 3.0)) - 17.0);
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	t_3 = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1))))
	tmp = 0.0
	if (t_3 <= -1e+245)
		tmp = Float64(8.0 * Float64(x1 * Float64(x2 * x2)));
	elseif (t_3 <= 5e+157)
		tmp = fma(-6.0, x2, Float64(x1 * Float64(Float64(-12.0 * x2) - 1.0)));
	else
		tmp = Float64(x1 * Float64(Float64(x1 * Float64(Float64(x1 * Float64(Float64(6.0 * x1) - 3.0)) - 3.0)) - 17.0));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$3 = N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$3, -1e+245], N[(8.0 * N[(x1 * N[(x2 * x2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$3, 5e+157], N[(-6.0 * x2 + N[(x1 * N[(N[(-12.0 * x2), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x1 * N[(N[(x1 * N[(N[(x1 * N[(N[(6.0 * x1), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision] - 17.0), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < -1.00000000000000004e245

   1. Initial program 99.9%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 65.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, x2 \cdot 14\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around inf

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot {x2}^{2}\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot \color{blue}{{x2}^{2}}\right) \]

      2. lower-*.f64 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot {x2}^{\color{blue}{2}}\right) \]

      3. unpow2 N/A

         \[\leadsto 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right) \]

      4. lower-*.f64 71.3

         \[\leadsto 8 \cdot \left(x1 \cdot \left(x2 \cdot x2\right)\right) \]

   8. Applied rewrites 71.3%

      \[\leadsto 8 \cdot \color{blue}{\left(x1 \cdot \left(x2 \cdot x2\right)\right)} \]

   if -1.00000000000000004e245 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 4.99999999999999976e157

   1. Initial program 99.2%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 86.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(-12 \cdot x2 - 1\right)\right) \]
   7. Step-by-step derivation

      1. lower-*.f64 86.4

         \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(-12 \cdot x2 - 1\right)\right) \]

   8. Applied rewrites 86.4%

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot \left(-12 \cdot x2 - 1\right)\right) \]

   if 4.99999999999999976e157 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 38.2%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \left(-1 \cdot \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1} + 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   5. Applied rewrites 83.8%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \mathsf{fma}\left(-1, \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}, 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x1 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + \color{blue}{x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + \color{blue}{-2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}, x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right) \]

   8. Applied rewrites 84.0%

      \[\leadsto x1 \cdot \color{blue}{\mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \mathsf{fma}\left(4, 2 \cdot x2 - 3, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]

   9. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]
   10. Step-by-step derivation

       1. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       2. lower-*.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       3. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       4. lower-*.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       5. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       6. lower-*.f64 82.5

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

   11. Applied rewrites 82.5%

       \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 96.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x1 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \left(3 \cdot x1\right) \cdot x1\\ t_3 := \frac{\left(t\_2 + 2 \cdot x2\right) - x1}{t\_1}\\ t_4 := t\_2 \cdot t\_3\\ t_5 := \left(\left(2 \cdot x1\right) \cdot t\_3\right) \cdot \left(t\_3 - 3\right)\\ t_6 := 3 \cdot \frac{\left(t\_2 - 2 \cdot x2\right) - x1}{t\_1}\\ \mathbf{if}\;x1 + \left(\left(\left(\left(\left(t\_5 + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_3 - 6\right)\right) \cdot t\_1 + t\_4\right) + t\_0\right) + x1\right) + t\_6\right) \leq \infty:\\ \;\;\;\;x1 + \left(\left(\left(\left(\left(t\_5 + \left(x1 \cdot x1\right) \cdot 6\right) \cdot t\_1 + t\_4\right) + t\_0\right) + x1\right) + t\_6\right)\\ \mathbf{else}:\\ \;\;\;\;x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* x1 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (* (* 3.0 x1) x1))
        (t_3 (/ (- (+ t_2 (* 2.0 x2)) x1) t_1))
        (t_4 (* t_2 t_3))
        (t_5 (* (* (* 2.0 x1) t_3) (- t_3 3.0)))
        (t_6 (* 3.0 (/ (- (- t_2 (* 2.0 x2)) x1) t_1))))
   (if (<=
        (+
         x1
         (+
          (+
           (+ (+ (* (+ t_5 (* (* x1 x1) (- (* 4.0 t_3) 6.0))) t_1) t_4) t_0)
           x1)
          t_6))
        INFINITY)
     (+ x1 (+ (+ (+ (+ (* (+ t_5 (* (* x1 x1) 6.0)) t_1) t_4) t_0) x1) t_6))
     (* x1 (- (* x1 (- (* x1 (- (* 6.0 x1) 3.0)) 3.0)) 17.0)))))

C

double code(double x1, double x2) {
	double t_0 = (x1 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = (3.0 * x1) * x1;
	double t_3 = ((t_2 + (2.0 * x2)) - x1) / t_1;
	double t_4 = t_2 * t_3;
	double t_5 = ((2.0 * x1) * t_3) * (t_3 - 3.0);
	double t_6 = 3.0 * (((t_2 - (2.0 * x2)) - x1) / t_1);
	double tmp;
	if ((x1 + ((((((t_5 + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_1) + t_4) + t_0) + x1) + t_6)) <= ((double) INFINITY)) {
		tmp = x1 + ((((((t_5 + ((x1 * x1) * 6.0)) * t_1) + t_4) + t_0) + x1) + t_6);
	} else {
		tmp = x1 * ((x1 * ((x1 * ((6.0 * x1) - 3.0)) - 3.0)) - 17.0);
	}
	return tmp;
}

Java

public static double code(double x1, double x2) {
	double t_0 = (x1 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = (3.0 * x1) * x1;
	double t_3 = ((t_2 + (2.0 * x2)) - x1) / t_1;
	double t_4 = t_2 * t_3;
	double t_5 = ((2.0 * x1) * t_3) * (t_3 - 3.0);
	double t_6 = 3.0 * (((t_2 - (2.0 * x2)) - x1) / t_1);
	double tmp;
	if ((x1 + ((((((t_5 + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_1) + t_4) + t_0) + x1) + t_6)) <= Double.POSITIVE_INFINITY) {
		tmp = x1 + ((((((t_5 + ((x1 * x1) * 6.0)) * t_1) + t_4) + t_0) + x1) + t_6);
	} else {
		tmp = x1 * ((x1 * ((x1 * ((6.0 * x1) - 3.0)) - 3.0)) - 17.0);
	}
	return tmp;
}

Python

def code(x1, x2):
	t_0 = (x1 * x1) * x1
	t_1 = (x1 * x1) + 1.0
	t_2 = (3.0 * x1) * x1
	t_3 = ((t_2 + (2.0 * x2)) - x1) / t_1
	t_4 = t_2 * t_3
	t_5 = ((2.0 * x1) * t_3) * (t_3 - 3.0)
	t_6 = 3.0 * (((t_2 - (2.0 * x2)) - x1) / t_1)
	tmp = 0
	if (x1 + ((((((t_5 + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_1) + t_4) + t_0) + x1) + t_6)) <= math.inf:
		tmp = x1 + ((((((t_5 + ((x1 * x1) * 6.0)) * t_1) + t_4) + t_0) + x1) + t_6)
	else:
		tmp = x1 * ((x1 * ((x1 * ((6.0 * x1) - 3.0)) - 3.0)) - 17.0)
	return tmp

Julia

function code(x1, x2)
	t_0 = Float64(Float64(x1 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(3.0 * x1) * x1)
	t_3 = Float64(Float64(Float64(t_2 + Float64(2.0 * x2)) - x1) / t_1)
	t_4 = Float64(t_2 * t_3)
	t_5 = Float64(Float64(Float64(2.0 * x1) * t_3) * Float64(t_3 - 3.0))
	t_6 = Float64(3.0 * Float64(Float64(Float64(t_2 - Float64(2.0 * x2)) - x1) / t_1))
	tmp = 0.0
	if (Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(t_5 + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_3) - 6.0))) * t_1) + t_4) + t_0) + x1) + t_6)) <= Inf)
		tmp = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(t_5 + Float64(Float64(x1 * x1) * 6.0)) * t_1) + t_4) + t_0) + x1) + t_6));
	else
		tmp = Float64(x1 * Float64(Float64(x1 * Float64(Float64(x1 * Float64(Float64(6.0 * x1) - 3.0)) - 3.0)) - 17.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	t_0 = (x1 * x1) * x1;
	t_1 = (x1 * x1) + 1.0;
	t_2 = (3.0 * x1) * x1;
	t_3 = ((t_2 + (2.0 * x2)) - x1) / t_1;
	t_4 = t_2 * t_3;
	t_5 = ((2.0 * x1) * t_3) * (t_3 - 3.0);
	t_6 = 3.0 * (((t_2 - (2.0 * x2)) - x1) / t_1);
	tmp = 0.0;
	if ((x1 + ((((((t_5 + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_1) + t_4) + t_0) + x1) + t_6)) <= Inf)
		tmp = x1 + ((((((t_5 + ((x1 * x1) * 6.0)) * t_1) + t_4) + t_0) + x1) + t_6);
	else
		tmp = x1 * ((x1 * ((x1 * ((6.0 * x1) - 3.0)) - 3.0)) - 17.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$2 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$4 = N[(t$95$2 * t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$3), $MachinePrecision] * N[(t$95$3 - 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(3.0 * N[(N[(N[(t$95$2 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x1 + N[(N[(N[(N[(N[(N[(t$95$5 + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$3), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + t$95$4), $MachinePrecision] + t$95$0), $MachinePrecision] + x1), $MachinePrecision] + t$95$6), $MachinePrecision]), $MachinePrecision], Infinity], N[(x1 + N[(N[(N[(N[(N[(N[(t$95$5 + N[(N[(x1 * x1), $MachinePrecision] * 6.0), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + t$95$4), $MachinePrecision] + t$95$0), $MachinePrecision] + x1), $MachinePrecision] + t$95$6), $MachinePrecision]), $MachinePrecision], N[(x1 * N[(N[(x1 * N[(N[(x1 * N[(N[(6.0 * x1), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision] - 17.0), $MachinePrecision]), $MachinePrecision]]]]]]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.5%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around inf

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \color{blue}{6}\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   4. Step-by-step derivation

   5. Applied rewrites 96.5%

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \color{blue}{6}\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \left(-1 \cdot \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1} + 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \mathsf{fma}\left(-1, \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}, 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x1 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + \color{blue}{x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + \color{blue}{-2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}, x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right) \]

   8. Applied rewrites 100.0%

      \[\leadsto x1 \cdot \color{blue}{\mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \mathsf{fma}\left(4, 2 \cdot x2 - 3, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]

   9. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]
   10. Step-by-step derivation

       1. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       2. lower-*.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       3. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       4. lower-*.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       5. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       6. lower-*.f64 100.0

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

   11. Applied rewrites 100.0%

       \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 95.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x1 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \left(3 \cdot x1\right) \cdot x1\\ t_3 := \frac{\left(t\_2 + 2 \cdot x2\right) - x1}{t\_1}\\ t_4 := \left(\left(2 \cdot x1\right) \cdot t\_3\right) \cdot \left(t\_3 - 3\right)\\ t_5 := 3 \cdot \frac{\left(t\_2 - 2 \cdot x2\right) - x1}{t\_1}\\ \mathbf{if}\;x1 + \left(\left(\left(\left(\left(t\_4 + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_3 - 6\right)\right) \cdot t\_1 + t\_2 \cdot t\_3\right) + t\_0\right) + x1\right) + t\_5\right) \leq \infty:\\ \;\;\;\;x1 + \left(\left(\left(\left(\left(t\_4 + \left(x1 \cdot x1\right) \cdot 6\right) \cdot t\_1 + 6 \cdot \left(\left(x1 \cdot x1\right) \cdot x2\right)\right) + t\_0\right) + x1\right) + t\_5\right)\\ \mathbf{else}:\\ \;\;\;\;x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* x1 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (* (* 3.0 x1) x1))
        (t_3 (/ (- (+ t_2 (* 2.0 x2)) x1) t_1))
        (t_4 (* (* (* 2.0 x1) t_3) (- t_3 3.0)))
        (t_5 (* 3.0 (/ (- (- t_2 (* 2.0 x2)) x1) t_1))))
   (if (<=
        (+
         x1
         (+
          (+
           (+
            (+ (* (+ t_4 (* (* x1 x1) (- (* 4.0 t_3) 6.0))) t_1) (* t_2 t_3))
            t_0)
           x1)
          t_5))
        INFINITY)
     (+
      x1
      (+
       (+
        (+ (+ (* (+ t_4 (* (* x1 x1) 6.0)) t_1) (* 6.0 (* (* x1 x1) x2))) t_0)
        x1)
       t_5))
     (* x1 (- (* x1 (- (* x1 (- (* 6.0 x1) 3.0)) 3.0)) 17.0)))))

C

double code(double x1, double x2) {
	double t_0 = (x1 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = (3.0 * x1) * x1;
	double t_3 = ((t_2 + (2.0 * x2)) - x1) / t_1;
	double t_4 = ((2.0 * x1) * t_3) * (t_3 - 3.0);
	double t_5 = 3.0 * (((t_2 - (2.0 * x2)) - x1) / t_1);
	double tmp;
	if ((x1 + ((((((t_4 + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_1) + (t_2 * t_3)) + t_0) + x1) + t_5)) <= ((double) INFINITY)) {
		tmp = x1 + ((((((t_4 + ((x1 * x1) * 6.0)) * t_1) + (6.0 * ((x1 * x1) * x2))) + t_0) + x1) + t_5);
	} else {
		tmp = x1 * ((x1 * ((x1 * ((6.0 * x1) - 3.0)) - 3.0)) - 17.0);
	}
	return tmp;
}

Java

public static double code(double x1, double x2) {
	double t_0 = (x1 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = (3.0 * x1) * x1;
	double t_3 = ((t_2 + (2.0 * x2)) - x1) / t_1;
	double t_4 = ((2.0 * x1) * t_3) * (t_3 - 3.0);
	double t_5 = 3.0 * (((t_2 - (2.0 * x2)) - x1) / t_1);
	double tmp;
	if ((x1 + ((((((t_4 + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_1) + (t_2 * t_3)) + t_0) + x1) + t_5)) <= Double.POSITIVE_INFINITY) {
		tmp = x1 + ((((((t_4 + ((x1 * x1) * 6.0)) * t_1) + (6.0 * ((x1 * x1) * x2))) + t_0) + x1) + t_5);
	} else {
		tmp = x1 * ((x1 * ((x1 * ((6.0 * x1) - 3.0)) - 3.0)) - 17.0);
	}
	return tmp;
}

Python

def code(x1, x2):
	t_0 = (x1 * x1) * x1
	t_1 = (x1 * x1) + 1.0
	t_2 = (3.0 * x1) * x1
	t_3 = ((t_2 + (2.0 * x2)) - x1) / t_1
	t_4 = ((2.0 * x1) * t_3) * (t_3 - 3.0)
	t_5 = 3.0 * (((t_2 - (2.0 * x2)) - x1) / t_1)
	tmp = 0
	if (x1 + ((((((t_4 + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_1) + (t_2 * t_3)) + t_0) + x1) + t_5)) <= math.inf:
		tmp = x1 + ((((((t_4 + ((x1 * x1) * 6.0)) * t_1) + (6.0 * ((x1 * x1) * x2))) + t_0) + x1) + t_5)
	else:
		tmp = x1 * ((x1 * ((x1 * ((6.0 * x1) - 3.0)) - 3.0)) - 17.0)
	return tmp

Julia

function code(x1, x2)
	t_0 = Float64(Float64(x1 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(3.0 * x1) * x1)
	t_3 = Float64(Float64(Float64(t_2 + Float64(2.0 * x2)) - x1) / t_1)
	t_4 = Float64(Float64(Float64(2.0 * x1) * t_3) * Float64(t_3 - 3.0))
	t_5 = Float64(3.0 * Float64(Float64(Float64(t_2 - Float64(2.0 * x2)) - x1) / t_1))
	tmp = 0.0
	if (Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(t_4 + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_3) - 6.0))) * t_1) + Float64(t_2 * t_3)) + t_0) + x1) + t_5)) <= Inf)
		tmp = Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(t_4 + Float64(Float64(x1 * x1) * 6.0)) * t_1) + Float64(6.0 * Float64(Float64(x1 * x1) * x2))) + t_0) + x1) + t_5));
	else
		tmp = Float64(x1 * Float64(Float64(x1 * Float64(Float64(x1 * Float64(Float64(6.0 * x1) - 3.0)) - 3.0)) - 17.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	t_0 = (x1 * x1) * x1;
	t_1 = (x1 * x1) + 1.0;
	t_2 = (3.0 * x1) * x1;
	t_3 = ((t_2 + (2.0 * x2)) - x1) / t_1;
	t_4 = ((2.0 * x1) * t_3) * (t_3 - 3.0);
	t_5 = 3.0 * (((t_2 - (2.0 * x2)) - x1) / t_1);
	tmp = 0.0;
	if ((x1 + ((((((t_4 + ((x1 * x1) * ((4.0 * t_3) - 6.0))) * t_1) + (t_2 * t_3)) + t_0) + x1) + t_5)) <= Inf)
		tmp = x1 + ((((((t_4 + ((x1 * x1) * 6.0)) * t_1) + (6.0 * ((x1 * x1) * x2))) + t_0) + x1) + t_5);
	else
		tmp = x1 * ((x1 * ((x1 * ((6.0 * x1) - 3.0)) - 3.0)) - 17.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$3 = N[(N[(N[(t$95$2 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, Block[{t$95$4 = N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$3), $MachinePrecision] * N[(t$95$3 - 3.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$5 = N[(3.0 * N[(N[(N[(t$95$2 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(x1 + N[(N[(N[(N[(N[(N[(t$95$4 + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$3), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$2 * t$95$3), $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision] + x1), $MachinePrecision] + t$95$5), $MachinePrecision]), $MachinePrecision], Infinity], N[(x1 + N[(N[(N[(N[(N[(N[(t$95$4 + N[(N[(x1 * x1), $MachinePrecision] * 6.0), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(6.0 * N[(N[(x1 * x1), $MachinePrecision] * x2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$0), $MachinePrecision] + x1), $MachinePrecision] + t$95$5), $MachinePrecision]), $MachinePrecision], N[(x1 * N[(N[(x1 * N[(N[(x1 * N[(N[(6.0 * x1), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision] - 17.0), $MachinePrecision]), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < +inf.0

   1. Initial program 99.5%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around inf

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \color{blue}{6}\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   4. Step-by-step derivation

   5. Applied rewrites 96.5%

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \color{blue}{6}\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]

   6. Taylor expanded in x1 around 0

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot 6\right) \cdot \left(x1 \cdot x1 + 1\right) + \color{blue}{6 \cdot \left({x1}^{2} \cdot x2\right)}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot 6\right) \cdot \left(x1 \cdot x1 + 1\right) + 6 \cdot \color{blue}{\left({x1}^{2} \cdot x2\right)}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]

      2. lower-*.f64 N/A

         \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot 6\right) \cdot \left(x1 \cdot x1 + 1\right) + 6 \cdot \left({x1}^{2} \cdot \color{blue}{x2}\right)\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]

      3. pow2 N/A

         \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot 6\right) \cdot \left(x1 \cdot x1 + 1\right) + 6 \cdot \left(\left(x1 \cdot x1\right) \cdot x2\right)\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]

      4. lower-*.f64 95.0

         \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot 6\right) \cdot \left(x1 \cdot x1 + 1\right) + 6 \cdot \left(\left(x1 \cdot x1\right) \cdot x2\right)\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]

   8. Applied rewrites 95.0%

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot 6\right) \cdot \left(x1 \cdot x1 + 1\right) + \color{blue}{6 \cdot \left(\left(x1 \cdot x1\right) \cdot x2\right)}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]

   if +inf.0 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 0.0%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \left(-1 \cdot \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1} + 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \mathsf{fma}\left(-1, \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}, 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x1 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + \color{blue}{x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + \color{blue}{-2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}, x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right) \]

   8. Applied rewrites 100.0%

      \[\leadsto x1 \cdot \color{blue}{\mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \mathsf{fma}\left(4, 2 \cdot x2 - 3, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]

   9. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]
   10. Step-by-step derivation

       1. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       2. lower-*.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       3. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       4. lower-*.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       5. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       6. lower-*.f64 100.0

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

   11. Applied rewrites 100.0%

       \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 61.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(3 \cdot x1\right) \cdot x1\\ t_1 := x1 \cdot x1 + 1\\ t_2 := \frac{\left(t\_0 + 2 \cdot x2\right) - x1}{t\_1}\\ \mathbf{if}\;x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot t\_2\right) \cdot \left(t\_2 - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot t\_2 - 6\right)\right) \cdot t\_1 + t\_0 \cdot t\_2\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(t\_0 - 2 \cdot x2\right) - x1}{t\_1}\right) \leq 5 \cdot 10^{+157}:\\ \;\;\;\;\mathsf{fma}\left(-6, x2, x1 \cdot -1\right)\\ \mathbf{else}:\\ \;\;\;\;x1 \cdot \left(9 \cdot x1 - 1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (* (* 3.0 x1) x1))
        (t_1 (+ (* x1 x1) 1.0))
        (t_2 (/ (- (+ t_0 (* 2.0 x2)) x1) t_1)))
   (if (<=
        (+
         x1
         (+
          (+
           (+
            (+
             (*
              (+
               (* (* (* 2.0 x1) t_2) (- t_2 3.0))
               (* (* x1 x1) (- (* 4.0 t_2) 6.0)))
              t_1)
             (* t_0 t_2))
            (* (* x1 x1) x1))
           x1)
          (* 3.0 (/ (- (- t_0 (* 2.0 x2)) x1) t_1))))
        5e+157)
     (fma -6.0 x2 (* x1 -1.0))
     (* x1 (- (* 9.0 x1) 1.0)))))

C

double code(double x1, double x2) {
	double t_0 = (3.0 * x1) * x1;
	double t_1 = (x1 * x1) + 1.0;
	double t_2 = ((t_0 + (2.0 * x2)) - x1) / t_1;
	double tmp;
	if ((x1 + (((((((((2.0 * x1) * t_2) * (t_2 - 3.0)) + ((x1 * x1) * ((4.0 * t_2) - 6.0))) * t_1) + (t_0 * t_2)) + ((x1 * x1) * x1)) + x1) + (3.0 * (((t_0 - (2.0 * x2)) - x1) / t_1)))) <= 5e+157) {
		tmp = fma(-6.0, x2, (x1 * -1.0));
	} else {
		tmp = x1 * ((9.0 * x1) - 1.0);
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(3.0 * x1) * x1)
	t_1 = Float64(Float64(x1 * x1) + 1.0)
	t_2 = Float64(Float64(Float64(t_0 + Float64(2.0 * x2)) - x1) / t_1)
	tmp = 0.0
	if (Float64(x1 + Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(Float64(2.0 * x1) * t_2) * Float64(t_2 - 3.0)) + Float64(Float64(x1 * x1) * Float64(Float64(4.0 * t_2) - 6.0))) * t_1) + Float64(t_0 * t_2)) + Float64(Float64(x1 * x1) * x1)) + x1) + Float64(3.0 * Float64(Float64(Float64(t_0 - Float64(2.0 * x2)) - x1) / t_1)))) <= 5e+157)
		tmp = fma(-6.0, x2, Float64(x1 * -1.0));
	else
		tmp = Float64(x1 * Float64(Float64(9.0 * x1) - 1.0));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(3.0 * x1), $MachinePrecision] * x1), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x1 * x1), $MachinePrecision] + 1.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t$95$0 + N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]}, If[LessEqual[N[(x1 + N[(N[(N[(N[(N[(N[(N[(N[(N[(2.0 * x1), $MachinePrecision] * t$95$2), $MachinePrecision] * N[(t$95$2 - 3.0), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * N[(N[(4.0 * t$95$2), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * t$95$1), $MachinePrecision] + N[(t$95$0 * t$95$2), $MachinePrecision]), $MachinePrecision] + N[(N[(x1 * x1), $MachinePrecision] * x1), $MachinePrecision]), $MachinePrecision] + x1), $MachinePrecision] + N[(3.0 * N[(N[(N[(t$95$0 - N[(2.0 * x2), $MachinePrecision]), $MachinePrecision] - x1), $MachinePrecision] / t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 5e+157], N[(-6.0 * x2 + N[(x1 * -1.0), $MachinePrecision]), $MachinePrecision], N[(x1 * N[(N[(9.0 * x1), $MachinePrecision] - 1.0), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))))) < 4.99999999999999976e157

   1. Initial program 99.3%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 84.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot -1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 75.8%

      \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot -1\right) \]

   if 4.99999999999999976e157 < (+.f64 x1 (+.f64 (+.f64 (+.f64 (+.f64 (*.f64 (+.f64 (*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) (-.f64 (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) #s(literal 3 binary64))) (*.f64 (*.f64 x1 x1) (-.f64 (*.f64 #s(literal 4 binary64) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64)))) #s(literal 6 binary64)))) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))) (*.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (/.f64 (-.f64 (+.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))) (*.f64 (*.f64 x1 x1) x1)) x1) (*.f64 #s(literal 3 binary64) (/.f64 (-.f64 (-.f64 (*.f64 (*.f64 #s(literal 3 binary64) x1) x1) (*.f64 #s(literal 2 binary64) x2)) x1) (+.f64 (*.f64 x1 x1) #s(literal 1 binary64))))))

   1. Initial program 38.2%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(\left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) + x1 \cdot \left(\left(2 \cdot \left(-2 \cdot x2 + -1 \cdot \left(2 \cdot x2 - 3\right)\right) + \left(3 \cdot \left(3 - -2 \cdot x2\right) + \left(6 \cdot x2 + 8 \cdot x2\right)\right)\right) - 6\right)\right) - 1\right)} \]

   5. Applied rewrites 45.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(\mathsf{fma}\left(4, x2 \cdot \left(2 \cdot x2 - 3\right), x1 \cdot \left(\mathsf{fma}\left(2, \mathsf{fma}\left(-2, x2, -1 \cdot \left(2 \cdot x2 - 3\right)\right), \mathsf{fma}\left(3, 3 - -2 \cdot x2, x2 \cdot 14\right)\right) - 6\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

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

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - \color{blue}{1}\right) \]

      2. lower--.f64 N/A

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

      3. lower-*.f64 55.3

         \[\leadsto x1 \cdot \left(9 \cdot x1 - 1\right) \]

   8. Applied rewrites 55.3%

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

Alternative 9: 95.7% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 2 \cdot x2 - 3\\ t_1 := -2 \cdot \left(1 + 3 \cdot t\_0\right)\\ \mathbf{if}\;x1 \leq -6800000:\\ \;\;\;\;x1 \cdot \mathsf{fma}\left(-1, 1 + t\_1, x1 \cdot \left(9 + \mathsf{fma}\left(4, t\_0, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)\\ \mathbf{elif}\;x1 \leq 2800:\\ \;\;\;\;\mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x1 + \left({x1}^{4} \cdot \left(6 - \frac{3 - \frac{9 + \mathsf{fma}\left(-1, \frac{2 + t\_1}{x1}, 4 \cdot t\_0\right)}{x1}}{x1}\right) + 9\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (- (* 2.0 x2) 3.0)) (t_1 (* -2.0 (+ 1.0 (* 3.0 t_0)))))
   (if (<= x1 -6800000.0)
     (*
      x1
      (fma
       -1.0
       (+ 1.0 t_1)
       (* x1 (+ 9.0 (fma 4.0 t_0 (* x1 (- (* 6.0 x1) 3.0)))))))
     (if (<= x1 2800.0)
       (fma -1.0 x1 (* x2 (- (fma -12.0 x1 (* 8.0 (* x1 x2))) 6.0)))
       (+
        x1
        (+
         (*
          (pow x1 4.0)
          (-
           6.0
           (/
            (- 3.0 (/ (+ 9.0 (fma -1.0 (/ (+ 2.0 t_1) x1) (* 4.0 t_0))) x1))
            x1)))
         9.0))))))

C

double code(double x1, double x2) {
	double t_0 = (2.0 * x2) - 3.0;
	double t_1 = -2.0 * (1.0 + (3.0 * t_0));
	double tmp;
	if (x1 <= -6800000.0) {
		tmp = x1 * fma(-1.0, (1.0 + t_1), (x1 * (9.0 + fma(4.0, t_0, (x1 * ((6.0 * x1) - 3.0))))));
	} else if (x1 <= 2800.0) {
		tmp = fma(-1.0, x1, (x2 * (fma(-12.0, x1, (8.0 * (x1 * x2))) - 6.0)));
	} else {
		tmp = x1 + ((pow(x1, 4.0) * (6.0 - ((3.0 - ((9.0 + fma(-1.0, ((2.0 + t_1) / x1), (4.0 * t_0))) / x1)) / x1))) + 9.0);
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(2.0 * x2) - 3.0)
	t_1 = Float64(-2.0 * Float64(1.0 + Float64(3.0 * t_0)))
	tmp = 0.0
	if (x1 <= -6800000.0)
		tmp = Float64(x1 * fma(-1.0, Float64(1.0 + t_1), Float64(x1 * Float64(9.0 + fma(4.0, t_0, Float64(x1 * Float64(Float64(6.0 * x1) - 3.0)))))));
	elseif (x1 <= 2800.0)
		tmp = fma(-1.0, x1, Float64(x2 * Float64(fma(-12.0, x1, Float64(8.0 * Float64(x1 * x2))) - 6.0)));
	else
		tmp = Float64(x1 + Float64(Float64((x1 ^ 4.0) * Float64(6.0 - Float64(Float64(3.0 - Float64(Float64(9.0 + fma(-1.0, Float64(Float64(2.0 + t_1) / x1), Float64(4.0 * t_0))) / x1)) / x1))) + 9.0));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(2.0 * x2), $MachinePrecision] - 3.0), $MachinePrecision]}, Block[{t$95$1 = N[(-2.0 * N[(1.0 + N[(3.0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x1, -6800000.0], N[(x1 * N[(-1.0 * N[(1.0 + t$95$1), $MachinePrecision] + N[(x1 * N[(9.0 + N[(4.0 * t$95$0 + N[(x1 * N[(N[(6.0 * x1), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x1, 2800.0], N[(-1.0 * x1 + N[(x2 * N[(N[(-12.0 * x1 + N[(8.0 * N[(x1 * x2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x1 + N[(N[(N[Power[x1, 4.0], $MachinePrecision] * N[(6.0 - N[(N[(3.0 - N[(N[(9.0 + N[(-1.0 * N[(N[(2.0 + t$95$1), $MachinePrecision] / x1), $MachinePrecision] + N[(4.0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x1), $MachinePrecision]), $MachinePrecision] / x1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + 9.0), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if x1 < -6.8e6

   1. Initial program 29.6%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \left(-1 \cdot \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1} + 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   5. Applied rewrites 96.8%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \mathsf{fma}\left(-1, \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}, 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x1 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + \color{blue}{x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + \color{blue}{-2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}, x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right) \]

   8. Applied rewrites 96.9%

      \[\leadsto x1 \cdot \color{blue}{\mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \mathsf{fma}\left(4, 2 \cdot x2 - 3, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]

   if -6.8e6 < x1 < 2800

   1. Initial program 99.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 87.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto -1 \cdot x1 + \color{blue}{x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)} \]
   7. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      3. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      6. lower-*.f64 99.5

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

   8. Applied rewrites 99.5%

      \[\leadsto \mathsf{fma}\left(-1, \color{blue}{x1}, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

   if 2800 < x1

   1. Initial program 44.1%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around inf

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \color{blue}{6}\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   4. Step-by-step derivation

   5. Applied rewrites 40.2%

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \color{blue}{6}\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]

   6. Taylor expanded in x1 around inf

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot 6\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + \color{blue}{9}\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 40.2%

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot 6\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + \color{blue}{9}\right) \]

   9. Taylor expanded in x1 around 0

      \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot 6\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \color{blue}{\left(2 \cdot x2\right)}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 9\right) \]
   10. Step-by-step derivation

       1. lower-*.f64 37.3

          \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot 6\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \left(2 \cdot \color{blue}{x2}\right)\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 9\right) \]

   11. Applied rewrites 37.3%

       \[\leadsto x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot 6\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \color{blue}{\left(2 \cdot x2\right)}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 9\right) \]

   12. Taylor expanded in x1 around -inf

       \[\leadsto x1 + \left(\color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \left(-1 \cdot \frac{2 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1} + 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} + 9\right) \]

   14. Applied rewrites 89.8%

       \[\leadsto x1 + \left(\color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \mathsf{fma}\left(-1, \frac{2 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}, 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} + 9\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 96.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -6800000:\\ \;\;\;\;x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \mathsf{fma}\left(4, 2 \cdot x2 - 3, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)\\ \mathbf{elif}\;x1 \leq 2800:\\ \;\;\;\;\mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x1 + \left({x1}^{4} \cdot \left(6 - \frac{3 - \frac{9 + \mathsf{fma}\left(-1, \frac{2 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}, 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right) + 9\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 95.7% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 2 \cdot x2 - 3\\ t_1 := 1 + -2 \cdot \left(1 + 3 \cdot t\_0\right)\\ \mathbf{if}\;x1 \leq -6800000:\\ \;\;\;\;x1 \cdot \mathsf{fma}\left(-1, t\_1, x1 \cdot \left(9 + \mathsf{fma}\left(4, t\_0, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)\\ \mathbf{elif}\;x1 \leq 2800:\\ \;\;\;\;\mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x1 \cdot \mathsf{fma}\left(-1, t\_1, x1 \cdot \left(9 + \left(x1 \cdot x1\right) \cdot \left(6 - \frac{3 + -4 \cdot \frac{t\_0}{x1}}{x1}\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (- (* 2.0 x2) 3.0)) (t_1 (+ 1.0 (* -2.0 (+ 1.0 (* 3.0 t_0))))))
   (if (<= x1 -6800000.0)
     (*
      x1
      (fma -1.0 t_1 (* x1 (+ 9.0 (fma 4.0 t_0 (* x1 (- (* 6.0 x1) 3.0)))))))
     (if (<= x1 2800.0)
       (fma -1.0 x1 (* x2 (- (fma -12.0 x1 (* 8.0 (* x1 x2))) 6.0)))
       (*
        x1
        (fma
         -1.0
         t_1
         (*
          x1
          (+
           9.0
           (* (* x1 x1) (- 6.0 (/ (+ 3.0 (* -4.0 (/ t_0 x1))) x1)))))))))))

C

double code(double x1, double x2) {
	double t_0 = (2.0 * x2) - 3.0;
	double t_1 = 1.0 + (-2.0 * (1.0 + (3.0 * t_0)));
	double tmp;
	if (x1 <= -6800000.0) {
		tmp = x1 * fma(-1.0, t_1, (x1 * (9.0 + fma(4.0, t_0, (x1 * ((6.0 * x1) - 3.0))))));
	} else if (x1 <= 2800.0) {
		tmp = fma(-1.0, x1, (x2 * (fma(-12.0, x1, (8.0 * (x1 * x2))) - 6.0)));
	} else {
		tmp = x1 * fma(-1.0, t_1, (x1 * (9.0 + ((x1 * x1) * (6.0 - ((3.0 + (-4.0 * (t_0 / x1))) / x1))))));
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(2.0 * x2) - 3.0)
	t_1 = Float64(1.0 + Float64(-2.0 * Float64(1.0 + Float64(3.0 * t_0))))
	tmp = 0.0
	if (x1 <= -6800000.0)
		tmp = Float64(x1 * fma(-1.0, t_1, Float64(x1 * Float64(9.0 + fma(4.0, t_0, Float64(x1 * Float64(Float64(6.0 * x1) - 3.0)))))));
	elseif (x1 <= 2800.0)
		tmp = fma(-1.0, x1, Float64(x2 * Float64(fma(-12.0, x1, Float64(8.0 * Float64(x1 * x2))) - 6.0)));
	else
		tmp = Float64(x1 * fma(-1.0, t_1, Float64(x1 * Float64(9.0 + Float64(Float64(x1 * x1) * Float64(6.0 - Float64(Float64(3.0 + Float64(-4.0 * Float64(t_0 / x1))) / x1)))))));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(2.0 * x2), $MachinePrecision] - 3.0), $MachinePrecision]}, Block[{t$95$1 = N[(1.0 + N[(-2.0 * N[(1.0 + N[(3.0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x1, -6800000.0], N[(x1 * N[(-1.0 * t$95$1 + N[(x1 * N[(9.0 + N[(4.0 * t$95$0 + N[(x1 * N[(N[(6.0 * x1), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x1, 2800.0], N[(-1.0 * x1 + N[(x2 * N[(N[(-12.0 * x1 + N[(8.0 * N[(x1 * x2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x1 * N[(-1.0 * t$95$1 + N[(x1 * N[(9.0 + N[(N[(x1 * x1), $MachinePrecision] * N[(6.0 - N[(N[(3.0 + N[(-4.0 * N[(t$95$0 / x1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if x1 < -6.8e6

   1. Initial program 29.6%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \left(-1 \cdot \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1} + 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   5. Applied rewrites 96.8%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \mathsf{fma}\left(-1, \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}, 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x1 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + \color{blue}{x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + \color{blue}{-2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}, x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right) \]

   8. Applied rewrites 96.9%

      \[\leadsto x1 \cdot \color{blue}{\mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \mathsf{fma}\left(4, 2 \cdot x2 - 3, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]

   if -6.8e6 < x1 < 2800

   1. Initial program 99.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 87.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto -1 \cdot x1 + \color{blue}{x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)} \]
   7. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      3. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      6. lower-*.f64 99.5

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

   8. Applied rewrites 99.5%

      \[\leadsto \mathsf{fma}\left(-1, \color{blue}{x1}, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

   if 2800 < x1

   1. Initial program 44.1%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \left(-1 \cdot \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1} + 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   5. Applied rewrites 89.8%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \mathsf{fma}\left(-1, \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}, 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x1 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + \color{blue}{x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + \color{blue}{-2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}, x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right) \]

   8. Applied rewrites 89.8%

      \[\leadsto x1 \cdot \color{blue}{\mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \mathsf{fma}\left(4, 2 \cdot x2 - 3, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]

   9. Taylor expanded in x1 around -inf

      \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + {x1}^{2} \cdot \left(6 + -1 \cdot \frac{3 + -4 \cdot \frac{2 \cdot x2 - 3}{x1}}{x1}\right)\right)\right) \]
   10. Step-by-step derivation

       1. lower-*.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + {x1}^{2} \cdot \left(6 + -1 \cdot \frac{3 + -4 \cdot \frac{2 \cdot x2 - 3}{x1}}{x1}\right)\right)\right) \]

       2. pow2 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \left(x1 \cdot x1\right) \cdot \left(6 + -1 \cdot \frac{3 + -4 \cdot \frac{2 \cdot x2 - 3}{x1}}{x1}\right)\right)\right) \]

       3. lower-*.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \left(x1 \cdot x1\right) \cdot \left(6 + -1 \cdot \frac{3 + -4 \cdot \frac{2 \cdot x2 - 3}{x1}}{x1}\right)\right)\right) \]

       4. lower-+.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \left(x1 \cdot x1\right) \cdot \left(6 + -1 \cdot \frac{3 + -4 \cdot \frac{2 \cdot x2 - 3}{x1}}{x1}\right)\right)\right) \]

       5. lower-*.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \left(x1 \cdot x1\right) \cdot \left(6 + -1 \cdot \frac{3 + -4 \cdot \frac{2 \cdot x2 - 3}{x1}}{x1}\right)\right)\right) \]

       6. lower-/.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \left(x1 \cdot x1\right) \cdot \left(6 + -1 \cdot \frac{3 + -4 \cdot \frac{2 \cdot x2 - 3}{x1}}{x1}\right)\right)\right) \]

       7. lower-+.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \left(x1 \cdot x1\right) \cdot \left(6 + -1 \cdot \frac{3 + -4 \cdot \frac{2 \cdot x2 - 3}{x1}}{x1}\right)\right)\right) \]

       8. lower-*.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \left(x1 \cdot x1\right) \cdot \left(6 + -1 \cdot \frac{3 + -4 \cdot \frac{2 \cdot x2 - 3}{x1}}{x1}\right)\right)\right) \]

       9. lower-/.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \left(x1 \cdot x1\right) \cdot \left(6 + -1 \cdot \frac{3 + -4 \cdot \frac{2 \cdot x2 - 3}{x1}}{x1}\right)\right)\right) \]

       10. lower--.f64 N/A

           \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \left(x1 \cdot x1\right) \cdot \left(6 + -1 \cdot \frac{3 + -4 \cdot \frac{2 \cdot x2 - 3}{x1}}{x1}\right)\right)\right) \]

       11. lower-*.f64 89.8

           \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \left(x1 \cdot x1\right) \cdot \left(6 + -1 \cdot \frac{3 + -4 \cdot \frac{2 \cdot x2 - 3}{x1}}{x1}\right)\right)\right) \]

   11. Applied rewrites 89.8%

       \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \left(x1 \cdot x1\right) \cdot \left(6 + -1 \cdot \frac{3 + -4 \cdot \frac{2 \cdot x2 - 3}{x1}}{x1}\right)\right)\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 96.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -6800000:\\ \;\;\;\;x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \mathsf{fma}\left(4, 2 \cdot x2 - 3, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)\\ \mathbf{elif}\;x1 \leq 2800:\\ \;\;\;\;\mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right)\\ \mathbf{else}:\\ \;\;\;\;x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \left(x1 \cdot x1\right) \cdot \left(6 - \frac{3 + -4 \cdot \frac{2 \cdot x2 - 3}{x1}}{x1}\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 95.7% accurate, 3.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 2 \cdot x2 - 3\\ \mathbf{if}\;x1 \leq -6800000 \lor \neg \left(x1 \leq 2800\right):\\ \;\;\;\;x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot t\_0\right), x1 \cdot \left(9 + \mathsf{fma}\left(4, t\_0, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (let* ((t_0 (- (* 2.0 x2) 3.0)))
   (if (or (<= x1 -6800000.0) (not (<= x1 2800.0)))
     (*
      x1
      (fma
       -1.0
       (+ 1.0 (* -2.0 (+ 1.0 (* 3.0 t_0))))
       (* x1 (+ 9.0 (fma 4.0 t_0 (* x1 (- (* 6.0 x1) 3.0)))))))
     (fma -1.0 x1 (* x2 (- (fma -12.0 x1 (* 8.0 (* x1 x2))) 6.0))))))

C

double code(double x1, double x2) {
	double t_0 = (2.0 * x2) - 3.0;
	double tmp;
	if ((x1 <= -6800000.0) || !(x1 <= 2800.0)) {
		tmp = x1 * fma(-1.0, (1.0 + (-2.0 * (1.0 + (3.0 * t_0)))), (x1 * (9.0 + fma(4.0, t_0, (x1 * ((6.0 * x1) - 3.0))))));
	} else {
		tmp = fma(-1.0, x1, (x2 * (fma(-12.0, x1, (8.0 * (x1 * x2))) - 6.0)));
	}
	return tmp;
}

Julia

function code(x1, x2)
	t_0 = Float64(Float64(2.0 * x2) - 3.0)
	tmp = 0.0
	if ((x1 <= -6800000.0) || !(x1 <= 2800.0))
		tmp = Float64(x1 * fma(-1.0, Float64(1.0 + Float64(-2.0 * Float64(1.0 + Float64(3.0 * t_0)))), Float64(x1 * Float64(9.0 + fma(4.0, t_0, Float64(x1 * Float64(Float64(6.0 * x1) - 3.0)))))));
	else
		tmp = fma(-1.0, x1, Float64(x2 * Float64(fma(-12.0, x1, Float64(8.0 * Float64(x1 * x2))) - 6.0)));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := Block[{t$95$0 = N[(N[(2.0 * x2), $MachinePrecision] - 3.0), $MachinePrecision]}, If[Or[LessEqual[x1, -6800000.0], N[Not[LessEqual[x1, 2800.0]], $MachinePrecision]], N[(x1 * N[(-1.0 * N[(1.0 + N[(-2.0 * N[(1.0 + N[(3.0 * t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(x1 * N[(9.0 + N[(4.0 * t$95$0 + N[(x1 * N[(N[(6.0 * x1), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * x1 + N[(x2 * N[(N[(-12.0 * x1 + N[(8.0 * N[(x1 * x2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x1 < -6.8e6 or 2800 < x1

   1. Initial program 36.7%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \left(-1 \cdot \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1} + 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   5. Applied rewrites 93.4%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \mathsf{fma}\left(-1, \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}, 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x1 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + \color{blue}{x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + \color{blue}{-2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}, x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right) \]

   8. Applied rewrites 93.4%

      \[\leadsto x1 \cdot \color{blue}{\mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \mathsf{fma}\left(4, 2 \cdot x2 - 3, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]

   if -6.8e6 < x1 < 2800

   1. Initial program 99.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 87.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto -1 \cdot x1 + \color{blue}{x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)} \]
   7. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      3. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      6. lower-*.f64 99.5

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

   8. Applied rewrites 99.5%

      \[\leadsto \mathsf{fma}\left(-1, \color{blue}{x1}, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 96.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -6800000 \lor \neg \left(x1 \leq 2800\right):\\ \;\;\;\;x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \mathsf{fma}\left(4, 2 \cdot x2 - 3, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 94.2% accurate, 4.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x1 \leq -6800000 \lor \neg \left(x1 \leq 3200\right):\\ \;\;\;\;x1 \cdot \mathsf{fma}\left(-1, 17, x1 \cdot \left(x2 \cdot \left(\frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} + 8\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x1 -6800000.0) (not (<= x1 3200.0)))
   (*
    x1
    (fma
     -1.0
     17.0
     (* x1 (* x2 (+ (/ (- (* x1 (- (* 6.0 x1) 3.0)) 3.0) x2) 8.0)))))
   (fma -1.0 x1 (* x2 (- (fma -12.0 x1 (* 8.0 (* x1 x2))) 6.0)))))

C

double code(double x1, double x2) {
	double tmp;
	if ((x1 <= -6800000.0) || !(x1 <= 3200.0)) {
		tmp = x1 * fma(-1.0, 17.0, (x1 * (x2 * ((((x1 * ((6.0 * x1) - 3.0)) - 3.0) / x2) + 8.0))));
	} else {
		tmp = fma(-1.0, x1, (x2 * (fma(-12.0, x1, (8.0 * (x1 * x2))) - 6.0)));
	}
	return tmp;
}

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x1 <= -6800000.0) || !(x1 <= 3200.0))
		tmp = Float64(x1 * fma(-1.0, 17.0, Float64(x1 * Float64(x2 * Float64(Float64(Float64(Float64(x1 * Float64(Float64(6.0 * x1) - 3.0)) - 3.0) / x2) + 8.0)))));
	else
		tmp = fma(-1.0, x1, Float64(x2 * Float64(fma(-12.0, x1, Float64(8.0 * Float64(x1 * x2))) - 6.0)));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x1, -6800000.0], N[Not[LessEqual[x1, 3200.0]], $MachinePrecision]], N[(x1 * N[(-1.0 * 17.0 + N[(x1 * N[(x2 * N[(N[(N[(N[(x1 * N[(N[(6.0 * x1), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision] - 3.0), $MachinePrecision] / x2), $MachinePrecision] + 8.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(-1.0 * x1 + N[(x2 * N[(N[(-12.0 * x1 + N[(8.0 * N[(x1 * x2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x1 < -6.8e6 or 3200 < x1

   1. Initial program 36.7%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \left(-1 \cdot \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1} + 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   5. Applied rewrites 93.4%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \mathsf{fma}\left(-1, \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}, 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x1 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + \color{blue}{x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + \color{blue}{-2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}, x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right) \]

   8. Applied rewrites 93.4%

      \[\leadsto x1 \cdot \color{blue}{\mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \mathsf{fma}\left(4, 2 \cdot x2 - 3, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]

   9. Taylor expanded in x2 around -inf

      \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(-1 \cdot \left(x2 \cdot \left(-1 \cdot \frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} - 8\right)\right)\right)\right) \]
   10. Step-by-step derivation

       1. lower-*.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(-1 \cdot \left(x2 \cdot \left(-1 \cdot \frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} - 8\right)\right)\right)\right) \]

       2. lower-*.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(-1 \cdot \left(x2 \cdot \left(-1 \cdot \frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} - 8\right)\right)\right)\right) \]

       3. lower--.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(-1 \cdot \left(x2 \cdot \left(-1 \cdot \frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} - 8\right)\right)\right)\right) \]

       4. lower-*.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(-1 \cdot \left(x2 \cdot \left(-1 \cdot \frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} - 8\right)\right)\right)\right) \]

       5. lower-/.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(-1 \cdot \left(x2 \cdot \left(-1 \cdot \frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} - 8\right)\right)\right)\right) \]

       6. lower--.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(-1 \cdot \left(x2 \cdot \left(-1 \cdot \frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} - 8\right)\right)\right)\right) \]

       7. lower-*.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(-1 \cdot \left(x2 \cdot \left(-1 \cdot \frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} - 8\right)\right)\right)\right) \]

       8. lower--.f64 N/A

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(-1 \cdot \left(x2 \cdot \left(-1 \cdot \frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} - 8\right)\right)\right)\right) \]

       9. lower-*.f64 90.5

          \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(-1 \cdot \left(x2 \cdot \left(-1 \cdot \frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} - 8\right)\right)\right)\right) \]

   11. Applied rewrites 90.5%

       \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(-1 \cdot \left(x2 \cdot \left(-1 \cdot \frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} - 8\right)\right)\right)\right) \]

   12. Taylor expanded in x2 around 0

       \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 17, x1 \cdot \left(-1 \cdot \left(x2 \cdot \left(-1 \cdot \frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} - 8\right)\right)\right)\right) \]
   13. Step-by-step derivation

   14. Applied rewrites 90.5%

       \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 17, x1 \cdot \left(-1 \cdot \left(x2 \cdot \left(-1 \cdot \frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} - 8\right)\right)\right)\right) \]

   if -6.8e6 < x1 < 3200

   1. Initial program 99.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 87.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto -1 \cdot x1 + \color{blue}{x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)} \]
   7. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      3. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      6. lower-*.f64 99.5

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

   8. Applied rewrites 99.5%

      \[\leadsto \mathsf{fma}\left(-1, \color{blue}{x1}, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 95.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -6800000 \lor \neg \left(x1 \leq 3200\right):\\ \;\;\;\;x1 \cdot \mathsf{fma}\left(-1, 17, x1 \cdot \left(x2 \cdot \left(\frac{x1 \cdot \left(6 \cdot x1 - 3\right) - 3}{x2} + 8\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 92.6% accurate, 6.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x1 \leq -6.8 \cdot 10^{+37} \lor \neg \left(x1 \leq 2800\right):\\ \;\;\;\;x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x1 -6.8e+37) (not (<= x1 2800.0)))
   (* x1 (- (* x1 (- (* x1 (- (* 6.0 x1) 3.0)) 3.0)) 17.0))
   (fma -1.0 x1 (* x2 (- (fma -12.0 x1 (* 8.0 (* x1 x2))) 6.0)))))

C

double code(double x1, double x2) {
	double tmp;
	if ((x1 <= -6.8e+37) || !(x1 <= 2800.0)) {
		tmp = x1 * ((x1 * ((x1 * ((6.0 * x1) - 3.0)) - 3.0)) - 17.0);
	} else {
		tmp = fma(-1.0, x1, (x2 * (fma(-12.0, x1, (8.0 * (x1 * x2))) - 6.0)));
	}
	return tmp;
}

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x1 <= -6.8e+37) || !(x1 <= 2800.0))
		tmp = Float64(x1 * Float64(Float64(x1 * Float64(Float64(x1 * Float64(Float64(6.0 * x1) - 3.0)) - 3.0)) - 17.0));
	else
		tmp = fma(-1.0, x1, Float64(x2 * Float64(fma(-12.0, x1, Float64(8.0 * Float64(x1 * x2))) - 6.0)));
	end
	return tmp
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x1, -6.8e+37], N[Not[LessEqual[x1, 2800.0]], $MachinePrecision]], N[(x1 * N[(N[(x1 * N[(N[(x1 * N[(N[(6.0 * x1), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision] - 3.0), $MachinePrecision]), $MachinePrecision] - 17.0), $MachinePrecision]), $MachinePrecision], N[(-1.0 * x1 + N[(x2 * N[(N[(-12.0 * x1 + N[(8.0 * N[(x1 * x2), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 6.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x1 < -6.80000000000000011e37 or 2800 < x1

   1. Initial program 34.1%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around -inf

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \left(-1 \cdot \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1} + 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   5. Applied rewrites 94.0%

      \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \mathsf{fma}\left(-1, \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}, 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

   6. Taylor expanded in x1 around 0

      \[\leadsto x1 \cdot \color{blue}{\left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]
   7. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x1 \cdot \left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + \color{blue}{x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)}\right) \]

      2. lower-fma.f64 N/A

         \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + \color{blue}{-2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}, x1 \cdot \left(9 + \left(4 \cdot \left(2 \cdot x2 - 3\right) + x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right) \]

   8. Applied rewrites 94.0%

      \[\leadsto x1 \cdot \color{blue}{\mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + \mathsf{fma}\left(4, 2 \cdot x2 - 3, x1 \cdot \left(6 \cdot x1 - 3\right)\right)\right)\right)} \]

   9. Taylor expanded in x2 around 0

      \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]
   10. Step-by-step derivation

       1. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       2. lower-*.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       3. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       4. lower-*.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       5. lower--.f64 N/A

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

       6. lower-*.f64 91.2

          \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

   11. Applied rewrites 91.2%

       \[\leadsto x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right) \]

   if -6.80000000000000011e37 < x1 < 2800

   1. Initial program 99.4%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 86.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

      \[\leadsto -1 \cdot x1 + \color{blue}{x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)} \]
   7. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      3. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\left(-12 \cdot x1 + 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

      6. lower-*.f64 98.2

         \[\leadsto \mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]

   8. Applied rewrites 98.2%

      \[\leadsto \mathsf{fma}\left(-1, \color{blue}{x1}, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 94.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x1 \leq -6.8 \cdot 10^{+37} \lor \neg \left(x1 \leq 2800\right):\\ \;\;\;\;x1 \cdot \left(x1 \cdot \left(x1 \cdot \left(6 \cdot x1 - 3\right) - 3\right) - 17\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-1, x1, x2 \cdot \left(\mathsf{fma}\left(-12, x1, 8 \cdot \left(x1 \cdot x2\right)\right) - 6\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 33.0% accurate, 14.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x2 \leq -1.65 \cdot 10^{-195} \lor \neg \left(x2 \leq 3.8 \cdot 10^{-160}\right):\\ \;\;\;\;x1 + -6 \cdot x2\\ \mathbf{else}:\\ \;\;\;\;-x1\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x2 -1.65e-195) (not (<= x2 3.8e-160))) (+ x1 (* -6.0 x2)) (- x1)))

C

double code(double x1, double x2) {
	double tmp;
	if ((x2 <= -1.65e-195) || !(x2 <= 3.8e-160)) {
		tmp = x1 + (-6.0 * x2);
	} else {
		tmp = -x1;
	}
	return tmp;
}

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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: tmp
    if ((x2 <= (-1.65d-195)) .or. (.not. (x2 <= 3.8d-160))) then
        tmp = x1 + ((-6.0d0) * x2)
    else
        tmp = -x1
    end if
    code = tmp
end function

Java

public static double code(double x1, double x2) {
	double tmp;
	if ((x2 <= -1.65e-195) || !(x2 <= 3.8e-160)) {
		tmp = x1 + (-6.0 * x2);
	} else {
		tmp = -x1;
	}
	return tmp;
}

Python

def code(x1, x2):
	tmp = 0
	if (x2 <= -1.65e-195) or not (x2 <= 3.8e-160):
		tmp = x1 + (-6.0 * x2)
	else:
		tmp = -x1
	return tmp

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x2 <= -1.65e-195) || !(x2 <= 3.8e-160))
		tmp = Float64(x1 + Float64(-6.0 * x2));
	else
		tmp = Float64(-x1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	tmp = 0.0;
	if ((x2 <= -1.65e-195) || ~((x2 <= 3.8e-160)))
		tmp = x1 + (-6.0 * x2);
	else
		tmp = -x1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x2, -1.65e-195], N[Not[LessEqual[x2, 3.8e-160]], $MachinePrecision]], N[(x1 + N[(-6.0 * x2), $MachinePrecision]), $MachinePrecision], (-x1)]

Derivation

1. Split input into 2 regimes

2. if x2 < -1.65e-195 or 3.7999999999999998e-160 < x2

   1. Initial program 67.6%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto x1 + \color{blue}{-6 \cdot x2} \]
   4. Step-by-step derivation

   5. Applied rewrites 31.1%

      \[\leadsto x1 + \color{blue}{-6 \cdot x2} \]

   if -1.65e-195 < x2 < 3.7999999999999998e-160

   1. Initial program 73.1%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 56.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

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

      1. lower-*.f64 47.8

         \[\leadsto -1 \cdot x1 \]

   8. Applied rewrites 47.8%

      \[\leadsto -1 \cdot \color{blue}{x1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 34.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x2 \leq -1.65 \cdot 10^{-195} \lor \neg \left(x2 \leq 3.8 \cdot 10^{-160}\right):\\ \;\;\;\;x1 + -6 \cdot x2\\ \mathbf{else}:\\ \;\;\;\;-x1\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 32.8% accurate, 16.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x2 \leq -1.65 \cdot 10^{-195} \lor \neg \left(x2 \leq 3.8 \cdot 10^{-160}\right):\\ \;\;\;\;-6 \cdot x2\\ \mathbf{else}:\\ \;\;\;\;-x1\\ \end{array} \end{array} \]

FPCore

(FPCore (x1 x2)
 :precision binary64
 (if (or (<= x2 -1.65e-195) (not (<= x2 3.8e-160))) (* -6.0 x2) (- x1)))

C

double code(double x1, double x2) {
	double tmp;
	if ((x2 <= -1.65e-195) || !(x2 <= 3.8e-160)) {
		tmp = -6.0 * x2;
	} else {
		tmp = -x1;
	}
	return tmp;
}

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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    real(8) :: tmp
    if ((x2 <= (-1.65d-195)) .or. (.not. (x2 <= 3.8d-160))) then
        tmp = (-6.0d0) * x2
    else
        tmp = -x1
    end if
    code = tmp
end function

Java

public static double code(double x1, double x2) {
	double tmp;
	if ((x2 <= -1.65e-195) || !(x2 <= 3.8e-160)) {
		tmp = -6.0 * x2;
	} else {
		tmp = -x1;
	}
	return tmp;
}

Python

def code(x1, x2):
	tmp = 0
	if (x2 <= -1.65e-195) or not (x2 <= 3.8e-160):
		tmp = -6.0 * x2
	else:
		tmp = -x1
	return tmp

Julia

function code(x1, x2)
	tmp = 0.0
	if ((x2 <= -1.65e-195) || !(x2 <= 3.8e-160))
		tmp = Float64(-6.0 * x2);
	else
		tmp = Float64(-x1);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x1, x2)
	tmp = 0.0;
	if ((x2 <= -1.65e-195) || ~((x2 <= 3.8e-160)))
		tmp = -6.0 * x2;
	else
		tmp = -x1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x1_, x2_] := If[Or[LessEqual[x2, -1.65e-195], N[Not[LessEqual[x2, 3.8e-160]], $MachinePrecision]], N[(-6.0 * x2), $MachinePrecision], (-x1)]

Derivation

1. Split input into 2 regimes

2. if x2 < -1.65e-195 or 3.7999999999999998e-160 < x2

   1. Initial program 67.6%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2} \]
   4. Step-by-step derivation

   5. Applied rewrites 30.9%

      \[\leadsto \color{blue}{-6 \cdot x2} \]

   if -1.65e-195 < x2 < 3.7999999999999998e-160

   1. Initial program 73.1%

      \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x1 around 0

      \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 56.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)\right)} \]

   6. Taylor expanded in x2 around 0

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

      1. lower-*.f64 47.8

         \[\leadsto -1 \cdot x1 \]

   8. Applied rewrites 47.8%

      \[\leadsto -1 \cdot \color{blue}{x1} \]
3. Recombined 2 regimes into one program.

4. Final simplification 34.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x2 \leq -1.65 \cdot 10^{-195} \lor \neg \left(x2 \leq 3.8 \cdot 10^{-160}\right):\\ \;\;\;\;-6 \cdot x2\\ \mathbf{else}:\\ \;\;\;\;-x1\\ \end{array} \]
5. Add Preprocessing

Alternative 16: 39.3% accurate, 24.8× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(-6, x2, x1 \cdot -1\right) \end{array} \]

FPCore

(FPCore (x1 x2) :precision binary64 (fma -6.0 x2 (* x1 -1.0)))

C

double code(double x1, double x2) {
	return fma(-6.0, x2, (x1 * -1.0));
}

Julia

function code(x1, x2)
	return fma(-6.0, x2, Float64(x1 * -1.0))
end

Wolfram

code[x1_, x2_] := N[(-6.0 * x2 + N[(x1 * -1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 68.8%

   \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
2. Add Preprocessing

3. Taylor expanded in x1 around 0

   \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)} \]
4. Step-by-step derivation

5. Applied rewrites 56.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)\right)} \]

6. Taylor expanded in x2 around 0

   \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot -1\right) \]
7. Step-by-step derivation

8. Applied rewrites 39.6%

   \[\leadsto \mathsf{fma}\left(-6, x2, x1 \cdot -1\right) \]
9. Add Preprocessing

Alternative 17: 4.6% accurate, 49.7× speedup

Math

\[\begin{array}{l} \\ x1 \cdot -17 \end{array} \]

FPCore

(FPCore (x1 x2) :precision binary64 (* x1 -17.0))

C

double code(double x1, double x2) {
	return x1 * -17.0;
}

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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    code = x1 * (-17.0d0)
end function

Java

public static double code(double x1, double x2) {
	return x1 * -17.0;
}

Python

def code(x1, x2):
	return x1 * -17.0

Julia

function code(x1, x2)
	return Float64(x1 * -17.0)
end

MATLAB

function tmp = code(x1, x2)
	tmp = x1 * -17.0;
end

Wolfram

code[x1_, x2_] := N[(x1 * -17.0), $MachinePrecision]

Derivation

1. Initial program 68.8%

   \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
2. Add Preprocessing

3. Taylor expanded in x1 around -inf

   \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \left(-1 \cdot \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1} + 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

5. Applied rewrites 46.9%

   \[\leadsto \color{blue}{{x1}^{4} \cdot \left(6 + -1 \cdot \frac{3 + -1 \cdot \frac{9 + \mathsf{fma}\left(-1, \frac{1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}, 4 \cdot \left(2 \cdot x2 - 3\right)\right)}{x1}}{x1}\right)} \]

6. Taylor expanded in x1 around 0

   \[\leadsto x1 \cdot \color{blue}{\left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + x1 \cdot \left(9 + 4 \cdot \left(2 \cdot x2 - 3\right)\right)\right)} \]
7. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto x1 \cdot \left(-1 \cdot \left(1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)\right) + \color{blue}{x1 \cdot \left(9 + 4 \cdot \left(2 \cdot x2 - 3\right)\right)}\right) \]

   2. lower-fma.f64 N/A

      \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + \color{blue}{-2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}, x1 \cdot \left(9 + 4 \cdot \left(2 \cdot x2 - 3\right)\right)\right) \]

   3. lower-+.f64 N/A

      \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \color{blue}{\left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right)}, x1 \cdot \left(9 + 4 \cdot \left(2 \cdot x2 - 3\right)\right)\right) \]

   4. lower-*.f64 N/A

      \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + \color{blue}{3 \cdot \left(2 \cdot x2 - 3\right)}\right), x1 \cdot \left(9 + 4 \cdot \left(2 \cdot x2 - 3\right)\right)\right) \]

   5. lower-+.f64 N/A

      \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \color{blue}{\left(2 \cdot x2 - 3\right)}\right), x1 \cdot \left(9 + 4 \cdot \left(2 \cdot x2 - 3\right)\right)\right) \]

   6. lower-*.f64 N/A

      \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - \color{blue}{3}\right)\right), x1 \cdot \left(9 + 4 \cdot \left(2 \cdot x2 - 3\right)\right)\right) \]

   7. lower--.f64 N/A

      \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + 4 \cdot \left(2 \cdot x2 - 3\right)\right)\right) \]

   8. lower-*.f64 N/A

      \[\leadsto x1 \cdot \mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + 4 \cdot \left(2 \cdot x2 - 3\right)\right)\right) \]

8. Applied rewrites 14.9%

   \[\leadsto x1 \cdot \color{blue}{\mathsf{fma}\left(-1, 1 + -2 \cdot \left(1 + 3 \cdot \left(2 \cdot x2 - 3\right)\right), x1 \cdot \left(9 + 4 \cdot \left(2 \cdot x2 - 3\right)\right)\right)} \]

9. Taylor expanded in x2 around 0

   \[\leadsto x1 \cdot \left(-3 \cdot x1 - 17\right) \]
10. Step-by-step derivation

    1. lower--.f64 N/A

       \[\leadsto x1 \cdot \left(-3 \cdot x1 - 17\right) \]

    2. lower-*.f64 3.3

       \[\leadsto x1 \cdot \left(-3 \cdot x1 - 17\right) \]

11. Applied rewrites 3.3%

    \[\leadsto x1 \cdot \left(-3 \cdot x1 - 17\right) \]

12. Taylor expanded in x1 around 0

    \[\leadsto x1 \cdot -17 \]
13. Step-by-step derivation

14. Applied rewrites 4.7%

    \[\leadsto x1 \cdot -17 \]
15. Add Preprocessing

Alternative 18: 13.9% accurate, 99.3× speedup

Math

\[\begin{array}{l} \\ -x1 \end{array} \]

FPCore

(FPCore (x1 x2) :precision binary64 (- x1))

C

double code(double x1, double x2) {
	return -x1;
}

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(x1, x2)
use fmin_fmax_functions
    real(8), intent (in) :: x1
    real(8), intent (in) :: x2
    code = -x1
end function

Java

public static double code(double x1, double x2) {
	return -x1;
}

Python

def code(x1, x2):
	return -x1

Julia

function code(x1, x2)
	return Float64(-x1)
end

MATLAB

function tmp = code(x1, x2)
	tmp = -x1;
end

Wolfram

code[x1_, x2_] := (-x1)

Derivation

1. Initial program 68.8%

   \[x1 + \left(\left(\left(\left(\left(\left(\left(2 \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \cdot \left(\frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 3\right) + \left(x1 \cdot x1\right) \cdot \left(4 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1} - 6\right)\right) \cdot \left(x1 \cdot x1 + 1\right) + \left(\left(3 \cdot x1\right) \cdot x1\right) \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 + 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) + \left(x1 \cdot x1\right) \cdot x1\right) + x1\right) + 3 \cdot \frac{\left(\left(3 \cdot x1\right) \cdot x1 - 2 \cdot x2\right) - x1}{x1 \cdot x1 + 1}\right) \]
2. Add Preprocessing

3. Taylor expanded in x1 around 0

   \[\leadsto \color{blue}{-6 \cdot x2 + x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)} \]
4. Step-by-step derivation

5. Applied rewrites 56.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(-6, x2, x1 \cdot \left(4 \cdot \left(x2 \cdot \left(2 \cdot x2 - 3\right)\right) - 1\right)\right)} \]

6. Taylor expanded in x2 around 0

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

   1. lower-*.f64 15.2

      \[\leadsto -1 \cdot x1 \]

8. Applied rewrites 15.2%

   \[\leadsto -1 \cdot \color{blue}{x1} \]

9. Final simplification 15.2%

   \[\leadsto -x1 \]
10. Add Preprocessing

Reproduce

herbie shell --seed 2025044 
(FPCore (x1 x2)
  :name "Rosa's FloatVsDoubleBenchmark"
  :precision binary64
  (+ x1 (+ (+ (+ (+ (* (+ (* (* (* 2.0 x1) (/ (- (+ (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0))) (- (/ (- (+ (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0)) 3.0)) (* (* x1 x1) (- (* 4.0 (/ (- (+ (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0))) 6.0))) (+ (* x1 x1) 1.0)) (* (* (* 3.0 x1) x1) (/ (- (+ (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0)))) (* (* x1 x1) x1)) x1) (* 3.0 (/ (- (- (* (* 3.0 x1) x1) (* 2.0 x2)) x1) (+ (* x1 x1) 1.0))))))