mirror of
https://git.cs.ou.nl/joshua.moerman/mealy-decompose.git
synced 2025-04-30 02:07:44 +02:00
better output
This commit is contained in:
parent
68a800829c
commit
45bbc2df85
1 changed files with 7 additions and 4 deletions
|
@ -87,6 +87,8 @@ with open(args.filename) as file:
|
|||
if args.verbose:
|
||||
print(machine)
|
||||
|
||||
print(f'Initial size: {len(machine.states)}')
|
||||
|
||||
|
||||
###################################
|
||||
# Utility function
|
||||
|
@ -223,6 +225,7 @@ with Solver(bootstrap_with=cnf) as solver:
|
|||
print('- actual solve')
|
||||
sat = solver.solve()
|
||||
|
||||
print('===============')
|
||||
if not sat:
|
||||
print('unsat :-(')
|
||||
exit()
|
||||
|
@ -259,7 +262,7 @@ with Solver(bootstrap_with=cnf) as solver:
|
|||
print(f'- representative state {s}')
|
||||
|
||||
# count moet gelijk zijn aan cost (of kleiner)
|
||||
print(f'total size = {count}')
|
||||
print(f'Reduced size = {count}')
|
||||
|
||||
projections = {}
|
||||
for rid in rids:
|
||||
|
|
Loading…
Add table
Reference in a new issue