Metrics for Numeric.Interval.Internal:scale from intervals-0.7.1, B

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 7 to 7 computations (0% saved)

sample828.0ms (58.7%)

Memory

32.1MiB live, 924.2MiB allocated; 202ms collecting garbage

Samples

508.0ms

8 256×

valid

Precisions

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

ival-mult: 163.0ms (62% of total)

ival-div: 89.0ms (33.9% of total)

exact: 5.0ms (1.9% of total)

adjust: 3.0ms (1.1% of total)

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

Bogosity

explain54.0ms (3.8%)

Memory

10.1MiB live, 99.7MiB allocated; 20ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`y`
-	-	`#s(literal 2 binary64)`
-	-	`(/.f64 (*.f64 x y) #s(literal 2 binary64))`
-	-	`(*.f64 x y)`
-	-	`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

25.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-mult: 4.0ms (47.8% of total)

ival-div: 3.0ms (35.8% 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)

preprocess251.0ms (17.8%)

Memory

-19.6MiB live, 219.3MiB allocated; 41ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	32
1	32	32
2	70	30
3	150	30
4	245	30
5	418	30
6	1518	30
7	4830	30
0	5	5
0	7	5
1	12	5
2	18	5
3	31	5
4	59	5
5	163	5
6	1040	5
7	5503	5
0	8410	5

Stop Event

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

Calls

Call 1

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

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

Symmetry

(negabs x)

(negabs y)

(sort x y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

Memory: 0.2MiB live, 0.2MiB 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 (*.f64 x y) #s(literal 2 binary64))

Compiler

Compiled 5 to 5 computations (0% saved)

series5.0ms (0.4%)

Memory

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

Counts

5 → 4

Calls

Call 1

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

Outputs
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* x y) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

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

rewrite53.0ms (3.7%)

Memory

-9.1MiB live, 90.4MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	35
0	14	35
1	26	35
0	64	35

Stop Event

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

Counts

9 → 17

Calls

Call 1

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

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

eval2.0ms (0.1%)

Memory: 6.4MiB live, 6.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 105 to 36 computations (65.7% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	16	1	17
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	17	1	18

Accuracy

100.0%

Counts

18 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 11 to 9 computations (18.2% saved)

series4.0ms (0.3%)

Memory

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

Counts

6 → 5

Calls

Call 1

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

Outputs
#s(approx (/ (* x y) 2) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* 1/2 (* y x)) #s(hole binary64 (* 1/2 (* x y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

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

rewrite48.0ms (3.4%)

Memory

-8.8MiB live, 79.4MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	57
0	20	57
1	36	57
0	73	57

Stop Event

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

Counts

11 → 17

Calls

Call 1

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

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

eval1.0ms (0.1%)

Memory: 4.4MiB live, 4.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 190 to 40 computations (78.9% saved)

prune4.0ms (0.3%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	16	0	16
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	16	1	17

Accuracy

100.0%

Counts

17 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 27 to 21 computations (22.2% saved)

regimes73.0ms (5.2%)

Memory

-54.4MiB live, 19.2MiB allocated; 91ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

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

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

Calls

4 calls:

67.0ms	y
3.0ms	x
1.0ms	(*.f64 x y)
1.0ms	(/.f64 (*.f64 x y) #s(literal 2 binary64))

Results

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

Compiler

Compiled 10 to 12 computations (-20% saved)

simplify54.0ms (3.8%)

Memory

14.0MiB live, 53.7MiB allocated; 25ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	11
1	14	11
2	20	11
3	34	11
4	74	11
5	412	11
6	3631	11

Stop Event

1×	node limit

Calls

Call 1

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

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

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 11 to 9 computations (18.2% saved)

preprocess31.0ms (2.2%)

Memory

-11.8MiB live, 79.1MiB allocated; 15ms collecting garbage

Remove

(sort x y)

(negabs y)

(negabs x)

Compiler

Compiled 98 to 82 computations (16.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample828.0ms (58.7%)

explain54.0ms (3.8%)

preprocess251.0ms (17.8%)

eval0.0ms (0%)

prune0.0ms (0%)

series5.0ms (0.4%)

rewrite53.0ms (3.7%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

series4.0ms (0.3%)

rewrite48.0ms (3.4%)

eval1.0ms (0.1%)

prune4.0ms (0.3%)

regimes73.0ms (5.2%)

simplify54.0ms (3.8%)

derivations1.0ms (0.1%)

preprocess31.0ms (2.2%)

end0.0ms (0%)

Profiling