Benchmark
incremental/UFLRA/asasp/hierarchy_implicit/bench_1_1_10_random6.smt2
Generated with ASASP.
ASASP (http://st.fbk.eu/technologies/asasp) implements a symbolic reachability procedure
for the analysis of administrative access control policies. A more detailed description
of the benchmarks can be found in the following paper: Efficient Symbolic Automated Analysis
of Administrative Attribute-based RBAC-Policies, by F. Alberti, A. Armando, and S. Ranise, in
ASIACCS 2011. For info contact Francesco Alberti <francesco.alberti@usi.ch>
| Status | sat |
| Inferred Status | None |
| Size | 5011 |
| Compressed Size | 1144 |
| Max. Term Depth | 5 |
| Asserts | 86 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 3 |
or | 4 |
and | 4 |
= | 36 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 5012 |
| Compressed Size | 1142 |
| Max. Term Depth | 5 |
| Asserts | 86 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 3 |
or | 4 |
and | 4 |
= | 36 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 5136 |
| Compressed Size | 1180 |
| Max. Term Depth | 5 |
| Asserts | 86 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 6 |
or | 4 |
and | 4 |
= | 35 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 5215 |
| Compressed Size | 1205 |
| Max. Term Depth | 5 |
| Asserts | 87 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 7 |
or | 4 |
and | 5 |
= | 36 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | unsat |
| Inferred Status | None |
| Size | 5193 |
| Compressed Size | 1201 |
| Max. Term Depth | 5 |
| Asserts | 87 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 7 |
or | 4 |
and | 4 |
= | 35 |
distinct | 1 |
forall | 7 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 5139 |
| Compressed Size | 1183 |
| Max. Term Depth | 5 |
| Asserts | 86 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 6 |
or | 4 |
and | 4 |
= | 35 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 5251 |
| Compressed Size | 1208 |
| Max. Term Depth | 5 |
| Asserts | 87 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 7 |
or | 4 |
and | 5 |
= | 36 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 5203 |
| Compressed Size | 1202 |
| Max. Term Depth | 5 |
| Asserts | 86 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 9 |
or | 4 |
and | 4 |
= | 39 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 5405 |
| Compressed Size | 1232 |
| Max. Term Depth | 5 |
| Asserts | 87 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 13 |
or | 4 |
and | 5 |
= | 39 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 5283 |
| Compressed Size | 1226 |
| Max. Term Depth | 5 |
| Asserts | 87 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 10 |
or | 4 |
and | 5 |
= | 40 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 5258 |
| Compressed Size | 1219 |
| Max. Term Depth | 5 |
| Asserts | 87 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 10 |
or | 4 |
and | 4 |
= | 39 |
distinct | 1 |
forall | 7 |
exists | 1 |
Real | 2 |
| | | | | |