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.6MiB live, 0.6MiB 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)

sample868.0ms (56.8%)

Memory

1.5MiB live, 1 188.5MiB allocated; 264ms collecting garbage

Samples

546.0ms

8 256×

valid

Precisions

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

ival-mult: 84.0ms (49.6% of total)

ival-div: 70.0ms (41.3% of total)

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

exact: 5.0ms (3% of total)

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

adjust: 2.0ms (1.2% of total)

Bogosity

explain61.0ms (4%)

Memory

-21.8MiB live, 75.9MiB allocated; 22ms 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

32.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-div: 15.0ms (73.7% of total)

ival-mult: 4.0ms (19.7% 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)

preprocess285.0ms (18.6%)

Memory

16.7MiB live, 209.9MiB allocated; 69ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	30
1	31	27
2	70	25
3	152	25
4	247	25
5	420	25
6	1523	25
7	4833	25
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 y)

(negabs x)

(sort x y)

Compiler

Compiled 5 to 5 computations (0% 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.0MiB live, 1.0MiB 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.3%)

Memory

10.6MiB live, 10.6MiB 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
(* 1/2 (* x y))
(* x y)
x
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)

simplify4.0ms (0.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	10
1	9	10
2	16	10
3	18	10
0	18	10

Stop Event

1×	iter limit
1×	saturated

Counts

4 → 2

Calls

Call 1

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

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

rewrite34.0ms (2.2%)

Memory

-25.9MiB live, 64.1MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	16	11
0	47	11

Stop Event

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

Counts

5 → 13

Calls

Call 1

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

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)

eval2.0ms (0.1%)

Memory: 7.3MiB live, 7.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 91 to 30 computations (67% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	13	2	15
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	14	2	16

Accuracy

100.0%

Counts

16 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 16 to 14 computations (12.5% saved)

series11.0ms (0.8%)

Memory

-21.2MiB live, 21.4MiB allocated; 12ms collecting garbage

Counts

9 → 5

Calls

Call 1

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

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

Calls

6 calls:

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

simplify4.0ms (0.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	13
1	11	13
2	16	13
0	16	13

Stop Event

1×	iter limit
1×	saturated

Counts

5 → 3

Calls

Call 1

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

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

rewrite18.0ms (1.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	31
0	15	31
1	29	31
0	70	31

Stop Event

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

Counts

9 → 26

Calls

Call 1

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

Outputs
#s(approx (/ (* x y) 2) (.f64 #s(literal 1/2 binary64) (.f64 y x)))
(.f64 (.f64 #s(literal 1/2 binary64) y) x)
(.f64 (.f64 #s(literal 1/2 binary64) x) y)
(.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 y #s(literal 1/2 binary64)))
(*.f64 y x)
(*.f64 x y)
y
x
#s(literal 1/2 binary64)
(*.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 (neg.f64 (neg.f64 y)) #s(literal 2 binary64))
(/.f64 (neg.f64 y) #s(literal -2 binary64))
(/.f64 y #s(literal 2 binary64))
(neg.f64 (/.f64 (neg.f64 y) #s(literal 2 binary64)))
(neg.f64 (/.f64 y #s(literal -2 binary64)))
#s(literal 2 binary64)

eval77.0ms (5.1%)

Memory: -43.0MiB live, 10.3MiB allocated; 22ms collecting garbage
Compiler: Compiled 248 to 61 computations (75.4% saved)

prune4.0ms (0.2%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	29	1	30
Fresh	0	0	0
Picked	2	0	2
Done	0	0	0
Total	31	1	32

Accuracy

100.0%

Counts

32 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 9 to 8 computations (11.1% saved)

series3.0ms (0.2%)

Memory

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

Counts

6 → 4

Calls

Call 1

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

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

Calls

6 calls:

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

simplify3.0ms (0.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	10
1	11	10
2	16	10
0	16	10

Stop Event

1×	iter limit
1×	saturated

Counts

4 → 2

Calls

Call 1

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

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

rewrite18.0ms (1.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	22
0	10	22
1	18	22
0	39	22

Stop Event

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

Counts

6 → 8

Calls

Call 1

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

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

eval1.0ms (0.1%)

Memory: 1.1MiB live, 1.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 83 to 16 computations (80.7% saved)

prune49.0ms (3.2%)

Memory

-43.7MiB live, 2.7MiB allocated; 7ms collecting garbage

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	9	0	9
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	9	1	10

Accuracy

100.0%

Counts

10 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 39 to 26 computations (33.3% saved)

regimes10.0ms (0.6%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

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

Calls

4 calls:

4.0ms	y
2.0ms	x
2.0ms	(/.f64 (*.f64 x y) #s(literal 2 binary64))
2.0ms	(*.f64 x y)

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)

regimes4.0ms (0.3%)

Memory

8.0MiB live, 8.0MiB 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) 2) (.f64 (.f64 y x) #s(literal 1/2 binary64)))

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

Calls

4 calls:

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

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)

simplify39.0ms (2.6%)

Memory

-4.2MiB live, 39.8MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	20
1	17	20
2	23	20
3	37	20
4	77	20
5	415	20
6	3627	20

Stop Event

1×	node limit

Calls

Call 1

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

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

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 20 to 13 computations (35% saved)

preprocess24.0ms (1.6%)

Memory

19.3MiB live, 63.8MiB allocated; 7ms collecting garbage

Remove

(sort x y)

(negabs x)

(negabs y)

Compiler

Compiled 104 to 84 computations (19.2% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample868.0ms (56.8%)

explain61.0ms (4%)

preprocess285.0ms (18.6%)

eval0.0ms (0%)

prune0.0ms (0%)

series5.0ms (0.3%)

simplify4.0ms (0.2%)

rewrite34.0ms (2.2%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

series11.0ms (0.8%)

simplify4.0ms (0.3%)

rewrite18.0ms (1.2%)

eval77.0ms (5.1%)

prune4.0ms (0.2%)

series3.0ms (0.2%)

simplify3.0ms (0.2%)

rewrite18.0ms (1.2%)

eval1.0ms (0.1%)

prune49.0ms (3.2%)

regimes10.0ms (0.6%)

regimes4.0ms (0.3%)

simplify39.0ms (2.6%)

derivations1.0ms (0.1%)

preprocess24.0ms (1.6%)

end0.0ms (0%)

Profiling