Metrics for Numeric.Interval.Internal:bisect from intervals-0.7.1, A

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 9 to 8 computations (11.1% saved)

sample1.1s (47.3%)

Memory

-2.3MiB live, 1 201.5MiB allocated; 297ms collecting garbage

Samples

597.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 347.0ms

ival-sub: 157.0ms (45.2% of total)

ival-add: 92.0ms (26.5% of total)

ival-div: 81.0ms (23.3% of total)

ival-true: 6.0ms (1.7% of total)

exact: 6.0ms (1.7% of total)

adjust: 3.0ms (0.9% of total)

ival-assert: 3.0ms (0.9% of total)

Bogosity

explain74.0ms (3.3%)

Memory

18.7MiB live, 151.3MiB allocated; 29ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))`
-	-	`(-.f64 y x)`
-	-	`y`
-	-	`#s(literal 2 binary64)`
-	-	`(/.f64 (-.f64 y x) #s(literal 2 binary64))`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

30.0ms

512×

valid

Compiler

Compiled 47 to 22 computations (53.2% saved)

Precisions

Click to see histograms. Total time spent on operations: 17.0ms

ival-sub: 10.0ms (59.3% of total)

ival-div: 4.0ms (23.7% of total)

ival-add: 2.0ms (11.9% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess240.0ms (10.7%)

Memory

-11.5MiB live, 176.6MiB allocated; 44ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	41
1	33	41
2	62	41
3	94	41
4	158	41
5	340	35
6	1612	35
7	5276	35
0	6	7
0	9	7
1	15	7
2	22	7
3	31	7
4	59	7
5	159	7
6	955	7
7	5206	7
0	8045	7

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

Calls

Call 1

Inputs
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))

Outputs
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))
(+.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) x)

Compiler

Compiled 7 to 6 computations (14.3% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

1.5MiB live, 1.5MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))

Compiler

Compiled 7 to 6 computations (14.3% saved)

series4.0ms (0.2%)

Memory

10.9MiB live, 10.9MiB allocated; 0ms collecting garbage

Counts

6 → 24

Calls

Call 1

Inputs
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))
x
(/.f64 (-.f64 y x) #s(literal 2 binary64))
(-.f64 y x)
y
#s(literal 2 binary64)

Outputs
(* 1/2 y)
(+ (* 1/2 x) (* 1/2 y))
x
(+ (* -1/2 x) (* 1/2 y))
y
(+ y (* -1 x))
(* 1/2 x)
(* x (+ 1/2 (* 1/2 (/ y x))))
(* -1/2 x)
(* x (- (* 1/2 (/ y x)) 1/2))
(* -1 x)
(* x (- (/ y x) 1))
(* -1 (* x (- (* -1/2 (/ y x)) 1/2)))
(* -1 (* x (+ 1/2 (* -1/2 (/ y x)))))
(* -1 (* x (+ 1 (* -1 (/ y x)))))
(+ x (* -1/2 x))
(+ x (+ (* -1/2 x) (* 1/2 y)))
(- y x)
(* y (+ 1/2 (+ (* -1/2 (/ x y)) (/ x y))))
(* y (+ 1/2 (* -1/2 (/ x y))))
(* y (+ 1 (* -1 (/ x y))))
(* -1 (* y (- (* -1 (/ (+ x (* -1/2 x)) y)) 1/2)))
(* -1 (* y (- (* 1/2 (/ x y)) 1/2)))
(* -1 (* y (- (/ x y) 1)))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	((+ x (/ (- y x) 2)) x (/ (- y x) 2) (- y x) y 2)
1.0ms	x	@	-inf	((+ x (/ (- y x) 2)) x (/ (- y x) 2) (- y x) y 2)
1.0ms	y	@	-inf	((+ x (/ (- y x) 2)) x (/ (- y x) 2) (- y x) y 2)
1.0ms	y	@	0	((+ x (/ (- y x) 2)) x (/ (- y x) 2) (- y x) y 2)
0.0ms	y	@	inf	((+ x (/ (- y x) 2)) x (/ (- y x) 2) (- y x) y 2)

simplify179.0ms (7.9%)

Memory

28.2MiB live, 269.4MiB allocated; 40ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	57	105
1	183	89
2	620	89
3	2406	89
0	8032	89

Stop Event

1×	iter limit
1×	node limit

Counts

24 → 22

Calls

Call 1

Inputs
(* 1/2 y)
(+ (* 1/2 x) (* 1/2 y))
x
(+ (* -1/2 x) (* 1/2 y))
y
(+ y (* -1 x))
(* 1/2 x)
(* x (+ 1/2 (* 1/2 (/ y x))))
(* -1/2 x)
(* x (- (* 1/2 (/ y x)) 1/2))
(* -1 x)
(* x (- (/ y x) 1))
(* -1 (* x (- (* -1/2 (/ y x)) 1/2)))
(* -1 (* x (+ 1/2 (* -1/2 (/ y x)))))
(* -1 (* x (+ 1 (* -1 (/ y x)))))
(+ x (* -1/2 x))
(+ x (+ (* -1/2 x) (* 1/2 y)))
(- y x)
(* y (+ 1/2 (+ (* -1/2 (/ x y)) (/ x y))))
(* y (+ 1/2 (* -1/2 (/ x y))))
(* y (+ 1 (* -1 (/ x y))))
(* -1 (* y (- (* -1 (/ (+ x (* -1/2 x)) y)) 1/2)))
(* -1 (* y (- (* 1/2 (/ x y)) 1/2)))
(* -1 (* y (- (/ x y) 1)))

Outputs
(* 1/2 y)
(*.f64 #s(literal 1/2 binary64) y)
(+ (* 1/2 x) (* 1/2 y))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
x
(+ (* -1/2 x) (* 1/2 y))
(*.f64 (-.f64 x y) #s(literal -1/2 binary64))
y
(+ y (* -1 x))
(-.f64 y x)
(* 1/2 x)
(*.f64 #s(literal 1/2 binary64) x)
(* x (+ 1/2 (* 1/2 (/ y x))))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(* -1/2 x)
(*.f64 #s(literal -1/2 binary64) x)
(* x (- (* 1/2 (/ y x)) 1/2))
(*.f64 (-.f64 x y) #s(literal -1/2 binary64))
(* -1 x)
(neg.f64 x)
(* x (- (/ y x) 1))
(-.f64 y x)
(* -1 (* x (- (* -1/2 (/ y x)) 1/2)))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(* -1 (* x (+ 1/2 (* -1/2 (/ y x)))))
(*.f64 (-.f64 x y) #s(literal -1/2 binary64))
(* -1 (* x (+ 1 (* -1 (/ y x)))))
(-.f64 y x)
(+ x (* -1/2 x))
(*.f64 #s(literal 1/2 binary64) x)
(+ x (+ (* -1/2 x) (* 1/2 y)))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(- y x)
(-.f64 y x)
(* y (+ 1/2 (+ (* -1/2 (/ x y)) (/ x y))))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(* y (+ 1/2 (* -1/2 (/ x y))))
(*.f64 (-.f64 x y) #s(literal -1/2 binary64))
(* y (+ 1 (* -1 (/ x y))))
(-.f64 y x)
(* -1 (* y (- (* -1 (/ (+ x (* -1/2 x)) y)) 1/2)))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(* -1 (* y (- (* 1/2 (/ x y)) 1/2)))
(*.f64 (-.f64 x y) #s(literal -1/2 binary64))
(* -1 (* y (- (/ x y) 1)))
(-.f64 y x)

rewrite57.0ms (2.5%)

Memory

-16.5MiB live, 117.6MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	18
0	9	18
1	42	18
0	312	18

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

6 → 33

Calls

Call 1

Inputs
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))
x
(/.f64 (-.f64 y x) #s(literal 2 binary64))
(-.f64 y x)
y
#s(literal 2 binary64)

Outputs
(/.f64 (-.f64 (pow.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) #s(literal 2 binary64)) (*.f64 x x)) (-.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) x))
(/.f64 (neg.f64 (-.f64 (*.f64 x x) (pow.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) #s(literal 2 binary64)))) (neg.f64 (-.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))))
(/.f64 (neg.f64 (+.f64 (pow.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) (-.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) x) (*.f64 x x))))
(/.f64 (-.f64 (*.f64 x x) (pow.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) #s(literal 2 binary64))) (-.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64))))
(/.f64 (+.f64 (pow.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (+.f64 (pow.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) #s(literal 2 binary64)) (-.f64 (.f64 x x) (.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) x))))
(/.f64 (+.f64 (pow.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) (-.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) x) (*.f64 x x)))
(-.f64 (+.f64 x (/.f64 y #s(literal 2 binary64))) (/.f64 x #s(literal 2 binary64)))
(-.f64 (/.f64 (*.f64 x x) (-.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))) (/.f64 (pow.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) #s(literal 2 binary64)) (-.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))))
(-.f64 (/.f64 y #s(literal 2 binary64)) (-.f64 (/.f64 x #s(literal 2 binary64)) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) (-.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) x) (.f64 x x))) (/.f64 (pow.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) #s(literal 3 binary64)) (fma.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) (-.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) x) (.f64 x x))))
(+.f64 (/.f64 (-.f64 y x) #s(literal 2 binary64)) x)
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))
x
(/.f64 (-.f64 (.f64 (/.f64 y #s(literal 2 binary64)) (/.f64 y #s(literal 2 binary64))) (.f64 (/.f64 x #s(literal 2 binary64)) (/.f64 x #s(literal 2 binary64)))) (+.f64 (/.f64 y #s(literal 2 binary64)) (/.f64 x #s(literal 2 binary64))))
(/.f64 (-.f64 (pow.f64 (/.f64 y #s(literal 2 binary64)) #s(literal 3 binary64)) (pow.f64 (/.f64 x #s(literal 2 binary64)) #s(literal 3 binary64))) (fma.f64 (/.f64 y #s(literal 2 binary64)) (/.f64 y #s(literal 2 binary64)) (fma.f64 (/.f64 x #s(literal 2 binary64)) (/.f64 x #s(literal 2 binary64)) (*.f64 (/.f64 y #s(literal 2 binary64)) (/.f64 x #s(literal 2 binary64))))))
(/.f64 (neg.f64 (neg.f64 (-.f64 y x))) #s(literal 2 binary64))
(/.f64 (-.f64 (.f64 y #s(literal 2 binary64)) (.f64 #s(literal 2 binary64) x)) #s(literal 4 binary64))
(/.f64 (.f64 (+.f64 y x) (-.f64 y x)) (.f64 (+.f64 y x) #s(literal 2 binary64)))
(/.f64 (-.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (.f64 (fma.f64 y y (.f64 x (+.f64 y x))) #s(literal 2 binary64)))
(/.f64 (neg.f64 (-.f64 y x)) #s(literal -2 binary64))
(/.f64 (-.f64 y x) #s(literal 2 binary64))
(neg.f64 (/.f64 (neg.f64 (-.f64 y x)) #s(literal 2 binary64)))
(neg.f64 (/.f64 (-.f64 y x) #s(literal -2 binary64)))
(-.f64 (/.f64 y #s(literal 2 binary64)) (/.f64 x #s(literal 2 binary64)))
(/.f64 (neg.f64 (*.f64 (+.f64 y x) (-.f64 y x))) (neg.f64 (+.f64 y x)))
(/.f64 (neg.f64 (-.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 y y (*.f64 x (+.f64 y x)))))
(/.f64 (*.f64 (+.f64 y x) (-.f64 y x)) (+.f64 y x))
(/.f64 (-.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 y y (*.f64 x (+.f64 y x))))
(-.f64 (/.f64 (.f64 y y) (+.f64 y x)) (/.f64 (.f64 x x) (+.f64 y x)))
(-.f64 (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y y (.f64 x (+.f64 y x)))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 y y (.f64 x (+.f64 y x)))))
(-.f64 y x)
y
#s(literal 2 binary64)

eval4.0ms (0.2%)

Memory: 17.1MiB live, 17.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 645 to 143 computations (77.8% saved)

prune2.0ms (0.1%)

Memory

8.7MiB live, 8.7MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	38	3	41
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	39	3	42

Accuracy

100.0%

Counts

42 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (+ x (/ (- y x) 2)) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
▶	47.1%	#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) y))
▶	53.5%	#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x))

Status

Accuracy

Program

▶

100.0%

#s(approx (+ x (/ (- y x) 2)) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))

▶

47.1%

#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) y))

▶

53.5%

#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x))

Compiler

Compiled 35 to 28 computations (20% saved)

series25.0ms (1.1%)

Memory

-42.7MiB live, 19.8MiB allocated; 30ms collecting garbage

Counts

10 → 18

Calls

Call 1

Inputs
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x))
(*.f64 #s(literal 1/2 binary64) x)
#s(literal 1/2 binary64)
x
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)
y
#s(approx (+ x (/ (- y x) 2)) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(+.f64 y x)

Outputs
(* 1/2 y)
(+ (* 1/2 x) (* 1/2 y))
(* 1/2 x)
x
y
(+ x y)
(* x (+ 1/2 (* 1/2 (/ y x))))
(* x (+ 1 (/ y x)))
(* -1 (* x (- (* -1/2 (/ y x)) 1/2)))
(* -1 (* x (- (* -1 (/ y x)) 1)))
(+ x (* -1/2 x))
(+ x (+ (* -1/2 x) (* 1/2 y)))
(* y (+ 1/2 (+ (* -1/2 (/ x y)) (/ x y))))
(* y (+ 1/2 (* 1/2 (/ x y))))
(* y (+ 1 (/ x y)))
(* -1 (* y (- (* -1 (/ (+ x (* -1/2 x)) y)) 1/2)))
(* -1 (* y (- (* -1/2 (/ x y)) 1/2)))
(* -1 (* y (- (* -1 (/ x y)) 1)))

Calls

6 calls:

Time	Variable		Point	Expression
21.0ms	x	@	-inf	((+ x (/ (- y x) 2)) (* 1/2 x) 1/2 x (+ x (/ (- y x) 2)) (* 1/2 y) y (+ x (/ (- y x) 2)) (* (+ y x) 1/2) (+ y x))
1.0ms	y	@	0	((+ x (/ (- y x) 2)) (* 1/2 x) 1/2 x (+ x (/ (- y x) 2)) (* 1/2 y) y (+ x (/ (- y x) 2)) (* (+ y x) 1/2) (+ y x))
1.0ms	y	@	-inf	((+ x (/ (- y x) 2)) (* 1/2 x) 1/2 x (+ x (/ (- y x) 2)) (* 1/2 y) y (+ x (/ (- y x) 2)) (* (+ y x) 1/2) (+ y x))
1.0ms	x	@	inf	((+ x (/ (- y x) 2)) (* 1/2 x) 1/2 x (+ x (/ (- y x) 2)) (* 1/2 y) y (+ x (/ (- y x) 2)) (* (+ y x) 1/2) (+ y x))
1.0ms	y	@	inf	((+ x (/ (- y x) 2)) (* 1/2 x) 1/2 x (+ x (/ (- y x) 2)) (* 1/2 y) y (+ x (/ (- y x) 2)) (* (+ y x) 1/2) (+ y x))

simplify178.0ms (7.9%)

Memory

11.9MiB live, 200.3MiB allocated; 20ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	50	66
1	154	66
2	435	66
3	1698	66
4	5919	66
0	8195	66

Stop Event

1×	iter limit
1×	node limit

Counts

18 → 16

Calls

Call 1

Inputs
(* 1/2 y)
(+ (* 1/2 x) (* 1/2 y))
(* 1/2 x)
x
y
(+ x y)
(* x (+ 1/2 (* 1/2 (/ y x))))
(* x (+ 1 (/ y x)))
(* -1 (* x (- (* -1/2 (/ y x)) 1/2)))
(* -1 (* x (- (* -1 (/ y x)) 1)))
(+ x (* -1/2 x))
(+ x (+ (* -1/2 x) (* 1/2 y)))
(* y (+ 1/2 (+ (* -1/2 (/ x y)) (/ x y))))
(* y (+ 1/2 (* 1/2 (/ x y))))
(* y (+ 1 (/ x y)))
(* -1 (* y (- (* -1 (/ (+ x (* -1/2 x)) y)) 1/2)))
(* -1 (* y (- (* -1/2 (/ x y)) 1/2)))
(* -1 (* y (- (* -1 (/ x y)) 1)))

Outputs
(* 1/2 y)
(*.f64 #s(literal 1/2 binary64) y)
(+ (* 1/2 x) (* 1/2 y))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(* 1/2 x)
(*.f64 #s(literal 1/2 binary64) x)
x
y
(+ x y)
(+.f64 y x)
(* x (+ 1/2 (* 1/2 (/ y x))))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(* x (+ 1 (/ y x)))
(+.f64 y x)
(* -1 (* x (- (* -1/2 (/ y x)) 1/2)))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(* -1 (* x (- (* -1 (/ y x)) 1)))
(+.f64 y x)
(+ x (* -1/2 x))
(*.f64 #s(literal 1/2 binary64) x)
(+ x (+ (* -1/2 x) (* 1/2 y)))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(* y (+ 1/2 (+ (* -1/2 (/ x y)) (/ x y))))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(* y (+ 1/2 (* 1/2 (/ x y))))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(* y (+ 1 (/ x y)))
(+.f64 y x)
(* -1 (* y (- (* -1 (/ (+ x (* -1/2 x)) y)) 1/2)))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(* -1 (* y (- (* -1/2 (/ x y)) 1/2)))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(* -1 (* y (- (* -1 (/ x y)) 1)))
(+.f64 y x)

rewrite75.0ms (3.3%)

Memory

-1.5MiB live, 44.5MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	52
0	18	52
1	59	52
0	383	52

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

10 → 34

Calls

Call 1

Inputs
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x))
(*.f64 #s(literal 1/2 binary64) x)
#s(literal 1/2 binary64)
x
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)
y
#s(approx (+ x (/ (- y x) 2)) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(+.f64 y x)

Outputs
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x))
(*.f64 #s(literal 1/2 binary64) x)
(*.f64 x #s(literal 1/2 binary64))
#s(literal 1/2 binary64)
x
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) y))
(*.f64 #s(literal 1/2 binary64) y)
(*.f64 y #s(literal 1/2 binary64))
y
#s(approx (+ x (/ (- y x) 2)) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(*.f64 #s(literal 1/2 binary64) (+.f64 y x))
(/.f64 (.f64 (.f64 (+.f64 y x) (-.f64 y x)) #s(literal 1/2 binary64)) (-.f64 y x))
(/.f64 (.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) #s(literal 1/2 binary64)) (fma.f64 x (-.f64 x y) (.f64 y y)))
(/.f64 (.f64 #s(literal 1/2 binary64) (.f64 (+.f64 y x) (-.f64 y x))) (-.f64 y x))
(/.f64 (.f64 #s(literal 1/2 binary64) (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x (-.f64 x y) (.f64 y y)))
(fma.f64 #s(literal 1/2 binary64) y (*.f64 #s(literal 1/2 binary64) x))
(fma.f64 #s(literal 1/2 binary64) x (*.f64 #s(literal 1/2 binary64) y))
(fma.f64 y #s(literal 1/2 binary64) (*.f64 #s(literal 1/2 binary64) x))
(fma.f64 x #s(literal 1/2 binary64) (*.f64 #s(literal 1/2 binary64) y))
(+.f64 (.f64 #s(literal 1/2 binary64) y) (.f64 #s(literal 1/2 binary64) x))
(+.f64 (.f64 #s(literal 1/2 binary64) x) (.f64 #s(literal 1/2 binary64) y))
(.f64 (/.f64 (.f64 (+.f64 y x) (-.f64 y x)) (-.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 y y (*.f64 x (+.f64 y x))))
(.f64 (/.f64 (.f64 (+.f64 y x) (-.f64 y x)) (*.f64 (+.f64 y x) (-.f64 y x))) (+.f64 y x))
(/.f64 (-.f64 (.f64 x x) (.f64 y y)) (-.f64 x y))
(/.f64 (neg.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x (-.f64 x y) (*.f64 y y))))
(/.f64 (neg.f64 (*.f64 (+.f64 y x) (-.f64 y x))) (neg.f64 (-.f64 y x)))
(/.f64 (*.f64 (+.f64 y x) (-.f64 y x)) (-.f64 y x))
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 y y) (.f64 y x))))
(/.f64 (+.f64 (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x (-.f64 x y) (*.f64 y y)))
(-.f64 (/.f64 (.f64 y y) (-.f64 y x)) (/.f64 (.f64 x x) (-.f64 y x)))
(+.f64 (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 x (-.f64 x y) (.f64 y y))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x (-.f64 x y) (.f64 y y))))
(+.f64 y x)
(+.f64 x y)

eval4.0ms (0.2%)

Memory: 7.6MiB live, 7.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 715 to 115 computations (83.9% saved)

prune3.0ms (0.1%)

Memory

6.2MiB live, 6.2MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	41	0	41
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	41	3	44

Accuracy

100.0%

Counts

44 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (+ x (/ (- y x) 2)) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
✓	47.1%	#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) y))
✓	53.5%	#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x))

Status

Accuracy

Program

✓

100.0%

#s(approx (+ x (/ (- y x) 2)) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))

✓

47.1%

#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) y))

✓

53.5%

#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x))

Compiler

Compiled 77 to 46 computations (40.3% saved)

regimes6.0ms (0.3%)

Memory

11.8MiB live, 11.8MiB allocated; 0ms collecting garbage

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x))
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) y))
#s(approx (+ x (/ (- y x) 2)) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))

Outputs
#s(approx (+ x (/ (- y x) 2)) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))

Calls

3 calls:

2.0ms	y
2.0ms	x
2.0ms	(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))

Results

Accuracy	Segments	Branch
100.0%	1	`(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))`
100.0%	1	`x`
100.0%	1	`y`

Compiler

Compiled 9 to 10 computations (-11.1% saved)

regimes20.0ms (0.9%)

Memory

-30.9MiB live, 12.9MiB allocated; 11ms collecting garbage

Counts

2 → 3

Calls

Call 1

Inputs
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x))
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) y))

Outputs
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) y))
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x))
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) y))

Calls

3 calls:

17.0ms	x
1.0ms	(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))
1.0ms	y

Results

Accuracy	Segments	Branch
59.6%	4	`(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))`
76.1%	3	`x`
81.8%	3	`y`

Compiler

Compiled 9 to 10 computations (-11.1% saved)

regimes3.0ms (0.1%)

Memory

10.7MiB live, 10.7MiB allocated; 0ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x))

Outputs
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x))

Calls

3 calls:

1.0ms	(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))
1.0ms	y
1.0ms	x

Results

Accuracy	Segments	Branch
53.5%	1	`(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))`
53.5%	1	`x`
53.5%	1	`y`

Compiler

Compiled 9 to 10 computations (-11.1% saved)

bsearch23.0ms (1%)

Memory

-2.3MiB live, 42.1MiB allocated; 11ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
12.0ms	2.059462632664294e-59	5.792692601099407e-59
10.0ms	-3.0397510367389947e-62	-1.088298744664426e-66

Samples

9.0ms

208×

valid

Compiler

Compiled 296 to 271 computations (8.4% saved)

Precisions

Click to see histograms. Total time spent on operations: 4.0ms

ival-sub: 1.0ms (25.3% of total)

ival-div: 1.0ms (25.3% of total)

ival-add: 1.0ms (25.3% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

simplify42.0ms (1.9%)

Memory

0.6MiB live, 53.3MiB allocated; 16ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	55
1	29	55
2	36	55
3	46	55
4	86	55
5	420	55
6	3597	55

Stop Event

1×	node limit

Calls

Call 1

Inputs

#s(approx (+ x (/ (- y x) 2)) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))

(if (<=.f64 y #s(literal -7410693711188237/926336713898529563388567880069503262826159877325124512315660672063305037119488 binary64)) #s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) y)) (if (<=.f64 y #s(literal 3222729046155773/56539106072908298546665520023773392506479484700019806659891398441363832832 binary64)) #s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x)) #s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) y))))

#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x))

Outputs
#s(approx (+ x (/ (- y x) 2)) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
(if (<=.f64 y #s(literal -7410693711188237/926336713898529563388567880069503262826159877325124512315660672063305037119488 binary64)) #s(approx (+ x (/ (- y x) 2)) (.f64 #s(literal 1/2 binary64) y)) (if (<=.f64 y #s(literal 3222729046155773/56539106072908298546665520023773392506479484700019806659891398441363832832 binary64)) #s(approx (+ x (/ (- y x) 2)) (.f64 #s(literal 1/2 binary64) x)) #s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) y))))
(if (or (<=.f64 y #s(literal -7410693711188237/926336713898529563388567880069503262826159877325124512315660672063305037119488 binary64)) (not (<=.f64 y #s(literal 3222729046155773/56539106072908298546665520023773392506479484700019806659891398441363832832 binary64)))) #s(approx (+ x (/ (- y x) 2)) (.f64 #s(literal 1/2 binary64) y)) #s(approx (+ x (/ (- y x) 2)) (.f64 #s(literal 1/2 binary64) x)))
#s(approx (+ x (/ (- y x) 2)) (*.f64 #s(literal 1/2 binary64) x))

derivations204.0ms (9%)

Memory

-5.1MiB live, 128.7MiB allocated; 21ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 55 to 21 computations (61.8% saved)

preprocess45.0ms (2%)

Memory: 24.9MiB live, 72.6MiB allocated; 21ms collecting garbage
Compiler: Compiled 134 to 64 computations (52.2% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze0.0ms (0%)

sample1.1s (47.3%)

explain74.0ms (3.3%)

preprocess240.0ms (10.7%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.2%)

simplify179.0ms (7.9%)

rewrite57.0ms (2.5%)

eval4.0ms (0.2%)

prune2.0ms (0.1%)

series25.0ms (1.1%)

simplify178.0ms (7.9%)

rewrite75.0ms (3.3%)

eval4.0ms (0.2%)

prune3.0ms (0.1%)

regimes6.0ms (0.3%)

regimes20.0ms (0.9%)

regimes3.0ms (0.1%)

bsearch23.0ms (1%)

simplify42.0ms (1.9%)

derivations204.0ms (9%)

preprocess45.0ms (2%)

end0.0ms (0%)

Profiling