Metrics for Rectangular parallelepiped of dimension a×b×c

start0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated

analyze0.0ms (0%)

Memory

0.3MiB live, 0.3MiB allocated

Algorithm

1×

random

Compiler

Compiled 23 to 12 computations (47.8% saved)

sample871.0ms (57.2%)

Memory

-10.2MiB live, 1 342.9MiB allocated

Samples

632.0ms

8 256×

valid

Precisions

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

ival-mult: 285.0ms (54.4% of total)

ival-div: 134.0ms (25.6% of total)

ival-add: 86.0ms (16.4% of total)

exact: 10.0ms (1.9% of total)

ival-true: 5.0ms (1% of total)

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

Bogosity

explain334.0ms (22%)

Memory

-6.0MiB live, 229.0MiB 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

34.0ms

512×

valid

Compiler

Compiled 405 to 196 computations (51.6% saved)

Precisions

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

ival-mult: 12.0ms (52.7% of total)

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

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

exact: 1.0ms (4.4% of total)

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

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

preprocess10.0ms (0.6%)

Memory

11.2MiB live, 11.2MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	0	0
0	10	1
0	28	1
1	30	1
0	30	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

0.9MiB live, 0.9MiB 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)

simplify3.0ms (0.2%)

Memory

2.4MiB live, 2.4MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 4 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	10
0	28	10
1	30	10
0	30	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)

localize122.0ms (8%)

Memory

-33.0MiB live, 25.8MiB allocated

Localize:

Found 4 expressions of interest:

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

Samples

115.0ms

256×

valid

Compiler

Compiled 154 to 22 computations (85.7% saved)

Precisions

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

ival-mult: 103.0ms (94.2% of total)

ival-div: 3.0ms (2.7% of total)

ival-add: 3.0ms (2.7% 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.2MiB live, 0.2MiB allocated

Counts

5 → 0

Calls

Call 1

Inputs
#s(alt (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (patch (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #<representation binary64>) () ())
#s(alt (.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)))) (patch (.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)))) #<representation binary64>) () ())
#s(alt (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (patch (.f64 #s(literal 1 binary64) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) #<representation binary64>) () ())
#s(alt (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) (patch (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) (/.f64 #s(literal 1 binary64) #s(literal 9 binary64))) #<representation binary64>) () ())
#s(alt (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64)) (patch (.f64 (/.f64 #s(literal 1 binary64) #s(literal 9 binary64)) #s(literal 1 binary64)) #<representation binary64>) () ())

Outputs

simplify2.0ms (0.1%)

Memory

0.7MiB live, 0.7MiB 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

rewrite12.0ms (0.8%)

Memory

8.7MiB live, 8.7MiB allocated

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	5
0	28	5
1	30	5
0	30	5

Stop Event

1×	saturated
1×	saturated
1×	iter limit

Counts

5 → 5

Calls

Call 1

Inputs
(/.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)))
(*.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
#<batchref>
#<batchref>
#<batchref>
#<batchref>
#<batchref>

eval1.0ms (0.1%)

Memory: 1.3MiB live, 1.3MiB allocated
Compiler: Compiled 126 to 34 computations (73% saved)

prune1.0ms (0.1%)

Memory

1.1MiB live, 1.1MiB allocated

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	7	1	8
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	8	1	9

Accuracy

100.0%

Counts

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

simplify2.0ms (0.1%)

Memory

1.0MiB live, 1.0MiB 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)

localize9.0ms (0.6%)

Memory

9.3MiB live, 9.3MiB allocated

Samples

6.0ms

256×

valid

Compiler

Compiled 4 to 4 computations (0% saved)

Precisions

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

const: 4.0ms (102.6% 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

simplify2.0ms (0.1%)

Memory

1.2MiB live, 1.2MiB 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

rewrite4.0ms (0.3%)

Memory

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

prune1.0ms (0.1%)

Memory

1.8MiB live, 1.8MiB 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)

simplify73.0ms (4.8%)

Memory

-26.6MiB live, 50.5MiB 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)

soundness6.0ms (0.4%)

Memory

6.6MiB live, 6.6MiB allocated

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	5
0	28	5
1	30	5
0	30	5

Stop Event

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

Compiler

Compiled 23 to 12 computations (47.8% saved)

preprocess68.0ms (4.5%)

Memory: 15.4MiB live, 53.1MiB 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%)

sample871.0ms (57.2%)

explain334.0ms (22%)

preprocess10.0ms (0.6%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify3.0ms (0.2%)

localize122.0ms (8%)

series0.0ms (0%)

simplify2.0ms (0.1%)

rewrite12.0ms (0.8%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

simplify2.0ms (0.1%)

localize9.0ms (0.6%)

series0.0ms (0%)

simplify2.0ms (0.1%)

rewrite4.0ms (0.3%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify73.0ms (4.8%)

soundness6.0ms (0.4%)

preprocess68.0ms (4.5%)

end0.0ms (0%)

Profiling