Metrics for Rectangular parallelepiped of dimension a×b×c

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

Algorithm

1×

random

Compiler

Compiled 23 to 12 computations (47.8% saved)

sample174.0ms (24.7%)

Memory

39.9MiB live, 317.5MiB allocated; 46ms collecting garbage

Samples

91.0ms

8 256×

valid

Precisions

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

adjust: 1.0ms (103.5% of total)

Bogosity

explain134.0ms (19%)

Memory

0.1MiB live, 194.3MiB allocated; 80ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))`
-	-	`#s(literal 1 binary64)`
-	-	`(/.f64 #s(literal 1 binary64) #s(literal 9 binary64))`
-	-	`#s(literal 9 binary64)`
-	-	`(+.f64 (+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64)))`
-	-	`(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))`
-	-	`#s(literal 2 binary64)`
-	-	`(+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))))`
-	-	`(.f64 #s(literal 2 binary64) (+.f64 (+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))))`
-	-	`(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))`

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

9.0ms

512×

valid

Compiler

Compiled 177 to 34 computations (80.8% saved)

Precisions

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

adjust: 0.0ms (0% of total)

preprocess310.0ms (44.1%)

Memory

3.7MiB live, 227.0MiB allocated; 41ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	1
1	50	1
2	152	1
3	458	1
4	1879	1
5	5780	1
0	10	1
0	28	1
1	31	1
2	35	1
3	46	1
4	96	1
5	392	1
6	3784	1
0	8099	1

Stop Event

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

Calls

Call 1

Inputs

(*.f64 #s(literal 2 binary64) (+.f64 (+.f64 (*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))))

Outputs

(*.f64 #s(literal 2 binary64) (+.f64 (+.f64 (*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))))

#s(literal 38/81 binary64)

Compiler

Compiled 21 to 10 computations (52.4% saved)

eval0.0ms (0%)

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

prune0.0ms (0.1%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(.f64 #s(literal 2 binary64) (+.f64 (+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))))

Status

Accuracy

Program

▶

100.0%

(*.f64 #s(literal 2 binary64) (+.f64 (+.f64 (*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))))

Compiler

Compiled 21 to 10 computations (52.4% saved)

series0.0ms (0%)

Memory

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

Counts

10 → 0

Calls

Call 1

Inputs
(.f64 #s(literal 2 binary64) (+.f64 (+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))))
#s(literal 2 binary64)
(+.f64 (+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64)))
(+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))))
(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
#s(literal 1 binary64)
(/.f64 #s(literal 1 binary64) #s(literal 9 binary64))
#s(literal 9 binary64)
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))

Outputs

rewrite41.0ms (5.8%)

Memory

-17.4MiB live, 39.9MiB allocated; 20ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	10
0	28	10
1	32	10
0	46	10

Stop Event

1×	saturated
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

10 → 10

Calls

Call 1

Inputs
(.f64 #s(literal 2 binary64) (+.f64 (+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))))
#s(literal 2 binary64)
(+.f64 (+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))) (*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64)))
(+.f64 (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))))
(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
#s(literal 1 binary64)
(/.f64 #s(literal 1 binary64) #s(literal 9 binary64))
#s(literal 9 binary64)
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))

Outputs
#s(literal 38/81 binary64)
#s(literal 2 binary64)
#s(literal 19/81 binary64)
#s(literal 10/81 binary64)
#s(literal 1/9 binary64)
#s(literal 1 binary64)
#s(literal 1/9 binary64)
#s(literal 9 binary64)
#s(literal 1/81 binary64)
#s(literal 1/9 binary64)

eval18.0ms (2.6%)

Memory: -19.7MiB live, 29.0MiB allocated; 3ms collecting garbage
Compiler: Compiled 276 to 24 computations (91.3% saved)

prune1.0ms (0.2%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	15	1	16
Fresh	0	0	0
Picked	1	0	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(literal 38/81 binary64)

Compiler

Compiled 1 to 1 computations (0% saved)

series0.0ms (0%)

Memory

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

Counts

1 → 0

Calls

Call 1

Inputs
#s(literal 38/81 binary64)

Outputs

rewrite6.0ms (0.8%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1
0	1	1
0	1	1

Stop Event

1×	saturated
1×	saturated
1×	saturated

Counts

1 → 1

Calls

Call 1

Inputs
#s(literal 38/81 binary64)

Outputs
#s(literal 38/81 binary64)

eval0.0ms (0%)

Memory: 0.3MiB live, 0.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 1 to 1 computations (0% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	1	0	1
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	1	1	2

Accuracy

100.0%

Counts

2 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(literal 38/81 binary64)

Compiler

Compiled 23 to 12 computations (47.8% saved)

derivations1.0ms (0.2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 1 to 1 computations (0% saved)

preprocess16.0ms (2.3%)

Memory: -10.2MiB live, 36.6MiB allocated; 2ms collecting garbage
Compiler: Compiled 94 to 46 computations (51.1% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample174.0ms (24.7%)

explain134.0ms (19%)

preprocess310.0ms (44.1%)

eval0.0ms (0%)

prune0.0ms (0.1%)

series0.0ms (0%)

rewrite41.0ms (5.8%)

eval18.0ms (2.6%)

prune1.0ms (0.2%)

series0.0ms (0%)

rewrite6.0ms (0.8%)

eval0.0ms (0%)

prune1.0ms (0.1%)

derivations1.0ms (0.2%)

preprocess16.0ms (2.3%)

end0.0ms (0%)

Profiling