Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, F

Time bar (total: 1.2s)

start0.0ms (0%)

Memory
0.2MiB live, 0.2MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory
0.6MiB live, 0.6MiB allocated; 0ms collecting garbage
Algorithm
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
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)

sample656.0ms (52.7%)

Memory
27.4MiB live, 626.7MiB allocated; 139ms collecting garbage
Samples
471.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 99.0ms
ival-mult!: 98.0ms (98.6% of total)
adjust: 2.0ms (2% of total)
Bogosity

explain85.0ms (6.8%)

Memory
-28.9MiB live, 64.5MiB allocated; 7ms collecting garbage
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
10-0-(*.f64 (*.f64 x #s(literal 27 binary64)) y)
00-0-#s(literal 27 binary64)
00-0-y
00-0-(*.f64 x #s(literal 27 binary64))
00-0-x
Explanations
Click to see full explanations table
OperatorSubexpressionExplanationCount
*.f64(*.f64 (*.f64 x #s(literal 27 binary64)) y)n*o10
Confusion
Predicted +Predicted -
+10
-0255
Precision
1.0
Recall
1.0
Confusion?
Predicted +Predicted MaybePredicted -
+100
-00255
Precision?
1.0
Recall?
1.0
Freqs
test
numberfreq
0255
11
Total Confusion?
Predicted +Predicted MaybePredicted -
+100
-000
Precision?
1.0
Recall?
1.0
Samples
45.0ms512×0valid
Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions
Click to see histograms. Total time spent on operations: 5.0ms
ival-mult!: 5.0ms (98.4% of total)
adjust: 0.0ms (0% of total)

preprocess95.0ms (7.6%)

Memory
-28.5MiB live, 36.0MiB allocated; 117ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01432
13530
27630
312530
055
075
1115
2185
3205
0205
Stop Event
iter limit
saturated
iter limit
saturated
Calls
Call 1
Inputs
(*.f64 (*.f64 x #s(literal 27 binary64)) y)
Outputs
(*.f64 (*.f64 x #s(literal 27 binary64)) y)
(*.f64 y (*.f64 #s(literal 27 binary64) x))
Symmetry

(negabs x)

(negabs y)

(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
0.9MiB live, 0.9MiB allocated; 0ms collecting garbage
Alt Table
Click to see full alt table
StatusAccuracyProgram
99.7%
(*.f64 (*.f64 x #s(literal 27 binary64)) y)
Compiler

Compiled 5 to 5 computations (0% saved)

series7.0ms (0.6%)

Memory
9.8MiB live, 9.8MiB allocated; 0ms collecting garbage
Counts
5 → 4
Calls
Call 1
Inputs
(*.f64 (*.f64 x #s(literal 27 binary64)) y)
(*.f64 x #s(literal 27 binary64))
x
#s(literal 27 binary64)
y
Outputs
#s(approx (* (* x 27) y) #s(hole binary64 (* 27 (* x y))))
#s(approx (* x 27) #s(hole binary64 (* 27 x)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))
Calls

6 calls:

TimeVariablePointExpression
2.0ms
x
@0
((* (* x 27) y) (* x 27) x 27 y)
1.0ms
y
@inf
((* (* x 27) y) (* x 27) x 27 y)
1.0ms
x
@inf
((* (* x 27) y) (* x 27) x 27 y)
1.0ms
x
@-inf
((* (* x 27) y) (* x 27) x 27 y)
1.0ms
y
@-inf
((* (* x 27) y) (* x 27) x 27 y)

rewrite16.0ms (1.3%)

Memory
21.3MiB live, 21.3MiB allocated; 0ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01435
01535
12335
22735
02735
Stop Event
iter limit
saturated
iter limit
Counts
9 → 15
Calls
Call 1
Inputs
(*.f64 (*.f64 x #s(literal 27 binary64)) y)
(*.f64 x #s(literal 27 binary64))
x
#s(literal 27 binary64)
y
#s(approx (* (* x 27) y) #s(hole binary64 (* 27 (* x y))))
#s(approx (* x 27) #s(hole binary64 (* 27 x)))
#s(approx x #s(hole binary64 x))
#s(approx y #s(hole binary64 y))
Outputs
(*.f64 (*.f64 y #s(literal 27 binary64)) x)
(*.f64 (*.f64 y x) #s(literal 27 binary64))
(*.f64 (*.f64 #s(literal 27 binary64) x) y)
(*.f64 y (*.f64 #s(literal 27 binary64) x))
(*.f64 #s(literal 27 binary64) (*.f64 y x))
(*.f64 x (*.f64 y #s(literal 27 binary64)))
(*.f64 #s(literal 27 binary64) x)
(*.f64 x #s(literal 27 binary64))
x
#s(literal 27 binary64)
y
#s(approx (* (* x 27) y) (*.f64 (*.f64 #s(literal 27 binary64) x) y))
#s(approx (* x 27) (*.f64 #s(literal 27 binary64) x))
#s(approx x x)
#s(approx y y)

eval1.0ms (0.1%)

Memory
2.3MiB live, 2.3MiB allocated; 0ms collecting garbage
Compiler

Compiled 89 to 25 computations (71.9% saved)

prune2.0ms (0.2%)

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

3 alts after pruning (2 fresh and 1 done)

PrunedKeptTotal
New13215
Fresh000
Picked011
Done000
Total13316
Accuracy
100.0%
Counts
16 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
99.6%
(*.f64 (*.f64 y x) #s(literal 27 binary64))
98.9%
(*.f64 (*.f64 y #s(literal 27 binary64)) x)
99.7%
(*.f64 (*.f64 x #s(literal 27 binary64)) y)
Compiler

Compiled 15 to 15 computations (0% saved)

series4.0ms (0.3%)

Memory
7.4MiB live, 7.4MiB allocated; 0ms collecting garbage
Counts
7 → 6
Calls
Call 1
Inputs
(*.f64 (*.f64 y #s(literal 27 binary64)) x)
(*.f64 y #s(literal 27 binary64))
y
#s(literal 27 binary64)
x
(*.f64 (*.f64 y x) #s(literal 27 binary64))
(*.f64 y x)
Outputs
#s(approx (* (* y 27) x) #s(hole binary64 (* 27 (* x y))))
#s(approx x #s(hole binary64 x))
#s(approx (* (* y x) 27) #s(hole binary64 (* 27 (* x y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx (* y 27) #s(hole binary64 (* 27 y)))
#s(approx y #s(hole binary64 y))
Calls

6 calls:

TimeVariablePointExpression
1.0ms
y
@-inf
((* (* y 27) x) (* y 27) y 27 x (* (* y x) 27) (* y x))
1.0ms
x
@-inf
((* (* y 27) x) (* y 27) y 27 x (* (* y x) 27) (* y x))
1.0ms
x
@inf
((* (* y 27) x) (* y 27) y 27 x (* (* y x) 27) (* y x))
1.0ms
y
@inf
((* (* y 27) x) (* y 27) y 27 x (* (* y x) 27) (* y x))
0.0ms
y
@0
((* (* y 27) x) (* y 27) y 27 x (* (* y x) 27) (* y x))

rewrite52.0ms (4.2%)

Memory
-38.2MiB live, 14.7MiB allocated; 11ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
02061
02361
13361
23461
03461
Stop Event
iter limit
saturated
iter limit
Counts
13 → 25
Calls
Call 1
Inputs
(*.f64 (*.f64 y #s(literal 27 binary64)) x)
(*.f64 y #s(literal 27 binary64))
y
#s(literal 27 binary64)
x
(*.f64 (*.f64 y x) #s(literal 27 binary64))
(*.f64 y x)
#s(approx (* (* y 27) x) #s(hole binary64 (* 27 (* x y))))
#s(approx x #s(hole binary64 x))
#s(approx (* (* y x) 27) #s(hole binary64 (* 27 (* x y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx (* y 27) #s(hole binary64 (* 27 y)))
#s(approx y #s(hole binary64 y))
Outputs
(*.f64 (*.f64 x #s(literal 27 binary64)) y)
(*.f64 (*.f64 x y) #s(literal 27 binary64))
(*.f64 x (*.f64 #s(literal 27 binary64) y))
(*.f64 (*.f64 #s(literal 27 binary64) y) x)
(*.f64 #s(literal 27 binary64) (*.f64 x y))
(*.f64 y (*.f64 x #s(literal 27 binary64)))
(*.f64 #s(literal 27 binary64) y)
(*.f64 y #s(literal 27 binary64))
y
#s(literal 27 binary64)
x
(*.f64 (*.f64 x #s(literal 27 binary64)) y)
(*.f64 (*.f64 x y) #s(literal 27 binary64))
(*.f64 x (*.f64 #s(literal 27 binary64) y))
(*.f64 (*.f64 #s(literal 27 binary64) y) x)
(*.f64 #s(literal 27 binary64) (*.f64 x y))
(*.f64 y (*.f64 x #s(literal 27 binary64)))
(*.f64 x y)
(*.f64 y x)
#s(approx (* (* y x) 27) (*.f64 x (*.f64 #s(literal 27 binary64) y)))
#s(approx x x)
#s(approx (* (* y x) 27) (*.f64 x (*.f64 #s(literal 27 binary64) y)))
#s(approx (* y x) (*.f64 x y))
#s(approx (* y 27) (*.f64 #s(literal 27 binary64) y))
#s(approx y y)

eval2.0ms (0.1%)

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

Compiled 137 to 34 computations (75.2% saved)

prune4.0ms (0.3%)

Memory
8.9MiB live, 8.9MiB allocated; 0ms collecting garbage
Pruning

3 alts after pruning (0 fresh and 3 done)

PrunedKeptTotal
New23023
Fresh000
Picked022
Done011
Total23326
Accuracy
100.0%
Counts
26 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
99.6%
(*.f64 (*.f64 y x) #s(literal 27 binary64))
98.9%
(*.f64 (*.f64 y #s(literal 27 binary64)) x)
99.7%
(*.f64 (*.f64 x #s(literal 27 binary64)) y)
Compiler

Compiled 30 to 24 computations (20% saved)

regimes7.0ms (0.5%)

Memory
17.0MiB live, 17.0MiB allocated; 0ms collecting garbage
Accuracy

Total -0.7b remaining (-365.8%)

Threshold costs -0.7b (-365.8%)

Counts
3 → 1
Calls
Call 1
Inputs
(*.f64 (*.f64 x #s(literal 27 binary64)) y)
(*.f64 (*.f64 y #s(literal 27 binary64)) x)
(*.f64 (*.f64 y x) #s(literal 27 binary64))
Outputs
(*.f64 (*.f64 x #s(literal 27 binary64)) y)
Calls

4 calls:

2.0ms
y
2.0ms
(*.f64 (*.f64 x #s(literal 27 binary64)) y)
1.0ms
(*.f64 x #s(literal 27 binary64))
1.0ms
x
Results
AccuracySegmentsBranch
99.7%1(*.f64 x #s(literal 27 binary64))
99.7%1(*.f64 (*.f64 x #s(literal 27 binary64)) y)
99.7%1x
99.7%1y
Compiler

Compiled 10 to 13 computations (-30% saved)

simplify12.0ms (1%)

Memory
-24.9MiB live, 19.9MiB allocated; 5ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
055
Stop Event
saturated
Calls
Call 1
Inputs
(*.f64 (*.f64 x #s(literal 27 binary64)) y)
Outputs
(*.f64 (*.f64 x #s(literal 27 binary64)) y)

derivations0.0ms (0%)

Memory
0.4MiB live, 0.4MiB allocated; 0ms collecting garbage
Stop Event
done
Compiler

Compiled 5 to 5 computations (0% saved)

preprocess300.0ms (24.1%)

Memory
28.7MiB live, 455.6MiB allocated; 59ms collecting garbage
Compiler

Compiled 80 to 80 computations (0% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...