Metrics for Rectangular parallelepiped of dimension a×b×c

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze0.0ms (0%)

Memory

0.1MiB live, 0.1MiB allocated

Algorithm

1×

random

Compiler

Compiled 23 to 12 computations (47.8% saved)

sample689.0ms (69.7%)

Memory

47.3MiB live, 1 017.6MiB allocated

Samples

483.0ms

8 256×

valid

Precisions

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

ival-mult: 201.0ms (54.3% of total)

ival-div: 83.0ms (22.4% of total)

ival-add: 67.0ms (18.1% of total)

exact: 10.0ms (2.7% of total)

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

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

Bogosity

explain147.0ms (14.9%)

Memory

-30.8MiB live, 183.8MiB allocated

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

41.0ms

512×

valid

Compiler

Compiled 253 to 44 computations (82.6% saved)

Precisions

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

ival-mult: 20.0ms (66.4% of total)

ival-div: 5.0ms (16.6% of total)

ival-add: 4.0ms (13.3% of total)

exact: 1.0ms (3.3% of total)

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

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

preprocess20.0ms (2%)

Memory

-10.4MiB live, 27.3MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	0	0
0	10	1
0	28	1
1	31	1
0	31	1

Stop Event

1×	saturated
1×	saturated
1×	iter limit
1×	saturated

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.2MiB live, 0.2MiB allocated
Compiler: Compiled 0 to 0 computations (0% saved)

prune0.0ms (0%)

Memory

1.3MiB live, 1.3MiB allocated

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)

simplify4.0ms (0.4%)

Memory

8.1MiB live, 8.1MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 4 expressions of interest:

New	Metric	Score
cost-diff	2	(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
cost-diff	2	(+.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))))
cost-diff	2	(+.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)))
cost-diff	2	(.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))))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	10
0	28	10
1	31	10
0	31	10

Stop Event

1×	saturated
1×	saturated
1×	iter 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))))
#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
(.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)
#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 19/81 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))))
#s(literal 10/81 binary64)
(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
#s(literal 1/9 binary64)
#s(literal 1 binary64)
(/.f64 #s(literal 1 binary64) #s(literal 9 binary64))
#s(literal 1/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)))
#s(literal 1/81 binary64)
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))
#s(literal 1/9 binary64)

localize26.0ms (2.6%)

Memory

16.0MiB live, 53.7MiB allocated

Localize:

Found 4 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))
accuracy	0.0	(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))
accuracy	0.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))))
accuracy	0.0	(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))

Samples

18.0ms

256×

valid

Compiler

Compiled 154 to 22 computations (85.7% saved)

Precisions

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

ival-mult: 8.0ms (61.7% of total)

ival-div: 2.0ms (15.4% of total)

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

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

exact: 0.0ms (0% of total)

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

series0.0ms (0%)

Memory

0.3MiB live, 0.3MiB allocated

Counts

6 → 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))))
(+.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)))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))

Outputs

simplify3.0ms (0.3%)

Memory

4.9MiB live, 4.9MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	0	0
0	0	0

Stop Event

1×	saturated
1×	saturated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

rewrite20.0ms (2.1%)

Memory

-8.5MiB live, 28.1MiB allocated

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	6
0	28	6
1	32	6
2	33	6
0	33	6

Stop Event

1×	saturated
1×	saturated
1×	iter limit

Counts

6 → 6

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))))
(+.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)))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64))
(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)))

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

eval1.0ms (0.1%)

Memory: 1.5MiB live, 1.5MiB allocated
Compiler: Compiled 45 to 21 computations (53.3% saved)

prune0.0ms (0%)

Memory

1.1MiB live, 1.1MiB allocated

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	4	1	5
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	5	1	6

Accuracy

100.0%

Counts

6 → 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)

simplify3.0ms (0.3%)

Memory

5.6MiB live, 5.6MiB allocated

Algorithm

1×	egg-herbie

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

Calls

Call 1

Inputs
#s(literal 38/81 binary64)

Outputs
#s(literal 38/81 binary64)

localize16.0ms (1.6%)

Memory

-19.9MiB live, 24.4MiB allocated

Samples

14.0ms

256×

valid

Compiler

Compiled 4 to 4 computations (0% saved)

Precisions

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

const: 11.0ms (100.1% of total)

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

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

series0.0ms (0%)

Memory

0.0MiB live, 0.0MiB allocated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

simplify3.0ms (0.3%)

Memory

6.5MiB live, 6.5MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	0	0
0	0	0

Stop Event

1×	saturated
1×	saturated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

rewrite7.0ms (0.7%)

Memory

11.4MiB live, 11.4MiB allocated

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

1×	saturated
1×	saturated
1×	saturated

Counts

0 → 0

Calls

Call 1

Inputs

Outputs

eval0.0ms (0%)

Memory: 0.2MiB live, 0.2MiB allocated
Compiler: Compiled 0 to 0 computations (0% saved)

prune1.0ms (0.1%)

Memory

2.0MiB live, 2.0MiB allocated

Pruning

1 alts after pruning (0 fresh and 1 done)

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

Accuracy

100.0%

Counts

1 → 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)

simplify14.0ms (1.4%)

Memory

-14.4MiB live, 22.8MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1

Stop Event

1×

saturated

Calls

Call 1

Inputs
#s(literal 38/81 binary64)

Outputs
#s(literal 38/81 binary64)

soundness8.0ms (0.9%)

Memory

15.4MiB live, 15.3MiB allocated

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	6
0	28	6
1	32	6
2	33	6
0	33	6

Stop Event

1×	done
1×	saturated
1×	saturated
1×	iter limit

Compiler

Compiled 23 to 12 computations (47.8% saved)

preprocess23.0ms (2.3%)

Memory: 7.7MiB live, 46.2MiB allocated
Compiler: Compiled 94 to 46 computations (51.1% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

start0.0ms (0%)

analyze0.0ms (0%)

sample689.0ms (69.7%)

explain147.0ms (14.9%)

preprocess20.0ms (2%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify4.0ms (0.4%)

localize26.0ms (2.6%)

series0.0ms (0%)

simplify3.0ms (0.3%)

rewrite20.0ms (2.1%)

eval1.0ms (0.1%)

prune0.0ms (0%)

simplify3.0ms (0.3%)

localize16.0ms (1.6%)

series0.0ms (0%)

simplify3.0ms (0.3%)

rewrite7.0ms (0.7%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify14.0ms (1.4%)

soundness8.0ms (0.9%)

preprocess23.0ms (2.3%)

end0.0ms (0%)

Profiling