-
Notifications
You must be signed in to change notification settings - Fork 22
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
4851e39
commit 655e753
Showing
66 changed files
with
1,102 additions
and
16 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
3 changes: 3 additions & 0 deletions
3
tests/custom/flatten_lex/find_v_given/matrix_2_bools/matrix.essence
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
given A : matrix indexed by [int(0..1)] of (bool,bool) | ||
find B : matrix indexed by [int(0..1)] of (bool,bool) | ||
such that A .< B |
1 change: 1 addition & 0 deletions
1
tests/custom/flatten_lex/find_v_given/matrix_2_bools/matrix.param
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1 @@ | ||
letting A be [(true,false),(false,true);int(0..1)] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,5 @@ | ||
conjure solve *.essence *.param | ||
cat conjure-output/*.eprime | ||
cat *.solution | ||
rm *.solution | ||
rm -r conjure-output |
92 changes: 92 additions & 0 deletions
92
tests/custom/flatten_lex/find_v_given/matrix_2_bools/stdout.expected
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,92 @@ | ||
Generating models for matrix.essence | ||
Generated models: model000001.eprime | ||
Saved under: conjure-output | ||
Savile Row: model000001.eprime matrix.param | ||
Running minion for domain filtering. | ||
Running solver: minion | ||
Copying solution to: matrix-matrix.solution | ||
language ESSENCE' 1.0 | ||
|
||
given A_1: matrix indexed by [int(0..1)] of bool | ||
given A_2: matrix indexed by [int(0..1)] of bool | ||
find B_1: matrix indexed by [int(0..1)] of bool | ||
find B_2: matrix indexed by [int(0..1)] of bool | ||
branching on [B_1, B_2] | ||
such that | ||
flatten([flatten([[-toInt(A_1[q2]); int(1)], [-toInt(A_2[q2]); int(1)]; int(1..2)]) | q2 : int(0..1)]) <lex | ||
flatten([flatten([[-toInt(B_1[q3]); int(1)], [-toInt(B_2[q3]); int(1)]; int(1..2)]) | q3 : int(0..1)]) | ||
|
||
$ Conjure's | ||
$ {"finds": [{"Name": "B"}], | ||
$ "givens": [{"Name": "A"}], | ||
$ "enumGivens": [], | ||
$ "enumLettings": [], | ||
$ "lettings": [], | ||
$ "unnameds": [], | ||
$ "strategyQ": {"PickFirst": []}, | ||
$ "strategyA": {"Compact": []}, | ||
$ "trailCompact": [[1, 1, 1], [1, 1, 1], [1, 1, 1], [1, 1, 1], [1, 1, 1], [1, 1, 1], [1, 1, 1], [1, 1, 1]], | ||
$ "trailVerbose": [], | ||
$ "trailRewrites": [], | ||
$ "nameGenState": [["q", 4]], | ||
$ "nbExtraGivens": 0, | ||
$ "representations": | ||
$ [[{"Name": "A"}, | ||
$ {"DomainMatrix": | ||
$ [{"DomainInt": | ||
$ [{"TagInt": []}, | ||
$ [{"RangeBounded": | ||
$ [{"Constant": {"ConstantInt": [{"TagInt": []}, 0]}}, | ||
$ {"Constant": {"ConstantInt": [{"TagInt": []}, 1]}}]}]]}, | ||
$ {"DomainTuple": [{"DomainBool": []}, {"DomainBool": []}]}]}], | ||
$ [{"Name": "B"}, | ||
$ {"DomainMatrix": | ||
$ [{"DomainInt": | ||
$ [{"TagInt": []}, | ||
$ [{"RangeBounded": | ||
$ [{"Constant": {"ConstantInt": [{"TagInt": []}, 0]}}, | ||
$ {"Constant": {"ConstantInt": [{"TagInt": []}, 1]}}]}]]}, | ||
$ {"DomainTuple": [{"DomainBool": []}, {"DomainBool": []}]}]}]], | ||
$ "representationsTree": | ||
$ [[{"Name": "A"}, | ||
$ [{"rootLabel": null, | ||
$ "subForest": | ||
$ [{"rootLabel": null, | ||
$ "subForest": | ||
$ [{"rootLabel": null, | ||
$ "subForest": []}, | ||
$ {"rootLabel": null, | ||
$ "subForest": []}]}]}]], | ||
$ [{"Name": "B"}, | ||
$ [{"rootLabel": null, | ||
$ "subForest": | ||
$ [{"rootLabel": null, | ||
$ "subForest": | ||
$ [{"rootLabel": null, | ||
$ "subForest": []}, | ||
$ {"rootLabel": null, | ||
$ "subForest": []}]}]}]]], | ||
$ "originalDomains": | ||
$ [[{"Name": "A"}, | ||
$ {"DomainMatrix": | ||
$ [{"DomainInt": | ||
$ [{"TagInt": []}, | ||
$ [{"RangeBounded": | ||
$ [{"Constant": {"ConstantInt": [{"TagInt": []}, 0]}}, | ||
$ {"Constant": {"ConstantInt": [{"TagInt": []}, 1]}}]}]]}, | ||
$ {"DomainTuple": [{"DomainBool": []}, {"DomainBool": []}]}]}], | ||
$ [{"Name": "B"}, | ||
$ {"DomainMatrix": | ||
$ [{"DomainInt": | ||
$ [{"TagInt": []}, | ||
$ [{"RangeBounded": | ||
$ [{"Constant": {"ConstantInt": [{"TagInt": []}, 0]}}, | ||
$ {"Constant": {"ConstantInt": [{"TagInt": []}, 1]}}]}]]}, | ||
$ {"DomainTuple": [{"DomainBool": []}, {"DomainBool": []}]}]}]]} | ||
language Essence 1.3 | ||
|
||
letting B be [(false, false), (false, false); int(0..1)] | ||
$ Visualisation for B | ||
$ _ _ | ||
$ _ _ | ||
|
3 changes: 3 additions & 0 deletions
3
tests/custom/flatten_lex/find_v_given/matrix_2_mixed/matrix.essence
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
given A : matrix indexed by [int(0..1)] of (bool,int(5..7)) | ||
find B : matrix indexed by [int(0..1)] of (bool,int(2..7)) | ||
such that A .< B |
1 change: 1 addition & 0 deletions
1
tests/custom/flatten_lex/find_v_given/matrix_2_mixed/matrix.param
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1 @@ | ||
letting A be [(false, 5), (false, 5); int(0..1)] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,5 @@ | ||
conjure solve *.essence *.param | ||
cat conjure-output/*.eprime | ||
cat *.solution | ||
rm *.solution | ||
rm -r conjure-output |
116 changes: 116 additions & 0 deletions
116
tests/custom/flatten_lex/find_v_given/matrix_2_mixed/stdout.expected
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,116 @@ | ||
Generating models for matrix.essence | ||
Generated models: model000001.eprime | ||
Saved under: conjure-output | ||
Savile Row: model000001.eprime matrix.param | ||
Running minion for domain filtering. | ||
Running solver: minion | ||
Copying solution to: matrix-matrix.solution | ||
language ESSENCE' 1.0 | ||
|
||
given A_1: matrix indexed by [int(0..1)] of bool | ||
given A_2: matrix indexed by [int(0..1)] of int(5..7) | ||
find B_1: matrix indexed by [int(0..1)] of bool | ||
find B_2: matrix indexed by [int(0..1)] of int(2..7) | ||
branching on [B_1, B_2] | ||
such that | ||
flatten([flatten([[-toInt(A_1[q2]); int(1)], [A_2[q2]; int(1)]; int(1..2)]) | q2 : int(0..1)]) <lex | ||
flatten([flatten([[-toInt(B_1[q3]); int(1)], [B_2[q3]; int(1)]; int(1..2)]) | q3 : int(0..1)]) | ||
|
||
$ Conjure's | ||
$ {"finds": [{"Name": "B"}], | ||
$ "givens": [{"Name": "A"}], | ||
$ "enumGivens": [], | ||
$ "enumLettings": [], | ||
$ "lettings": [], | ||
$ "unnameds": [], | ||
$ "strategyQ": {"PickFirst": []}, | ||
$ "strategyA": {"Compact": []}, | ||
$ "trailCompact": [[1, 1, 1], [1, 1, 1], [1, 1, 1], [1, 1, 1], [1, 1, 1], [1, 1, 1], [1, 1, 1], [1, 1, 1]], | ||
$ "trailVerbose": [], | ||
$ "trailRewrites": [], | ||
$ "nameGenState": [["q", 4]], | ||
$ "nbExtraGivens": 0, | ||
$ "representations": | ||
$ [[{"Name": "A"}, | ||
$ {"DomainMatrix": | ||
$ [{"DomainInt": | ||
$ [{"TagInt": []}, | ||
$ [{"RangeBounded": | ||
$ [{"Constant": {"ConstantInt": [{"TagInt": []}, 0]}}, | ||
$ {"Constant": {"ConstantInt": [{"TagInt": []}, 1]}}]}]]}, | ||
$ {"DomainTuple": | ||
$ [{"DomainBool": []}, | ||
$ {"DomainInt": | ||
$ [{"TagInt": []}, | ||
$ [{"RangeBounded": | ||
$ [{"Constant": {"ConstantInt": [{"TagInt": []}, 5]}}, | ||
$ {"Constant": {"ConstantInt": [{"TagInt": []}, 7]}}]}]]}]}]}], | ||
$ [{"Name": "B"}, | ||
$ {"DomainMatrix": | ||
$ [{"DomainInt": | ||
$ [{"TagInt": []}, | ||
$ [{"RangeBounded": | ||
$ [{"Constant": {"ConstantInt": [{"TagInt": []}, 0]}}, | ||
$ {"Constant": {"ConstantInt": [{"TagInt": []}, 1]}}]}]]}, | ||
$ {"DomainTuple": | ||
$ [{"DomainBool": []}, | ||
$ {"DomainInt": | ||
$ [{"TagInt": []}, | ||
$ [{"RangeBounded": | ||
$ [{"Constant": {"ConstantInt": [{"TagInt": []}, 2]}}, | ||
$ {"Constant": {"ConstantInt": [{"TagInt": []}, 7]}}]}]]}]}]}]], | ||
$ "representationsTree": | ||
$ [[{"Name": "A"}, | ||
$ [{"rootLabel": null, | ||
$ "subForest": | ||
$ [{"rootLabel": null, | ||
$ "subForest": | ||
$ [{"rootLabel": null, | ||
$ "subForest": []}, | ||
$ {"rootLabel": null, | ||
$ "subForest": []}]}]}]], | ||
$ [{"Name": "B"}, | ||
$ [{"rootLabel": null, | ||
$ "subForest": | ||
$ [{"rootLabel": null, | ||
$ "subForest": | ||
$ [{"rootLabel": null, | ||
$ "subForest": []}, | ||
$ {"rootLabel": null, | ||
$ "subForest": []}]}]}]]], | ||
$ "originalDomains": | ||
$ [[{"Name": "A"}, | ||
$ {"DomainMatrix": | ||
$ [{"DomainInt": | ||
$ [{"TagInt": []}, | ||
$ [{"RangeBounded": | ||
$ [{"Constant": {"ConstantInt": [{"TagInt": []}, 0]}}, | ||
$ {"Constant": {"ConstantInt": [{"TagInt": []}, 1]}}]}]]}, | ||
$ {"DomainTuple": | ||
$ [{"DomainBool": []}, | ||
$ {"DomainInt": | ||
$ [{"TagInt": []}, | ||
$ [{"RangeBounded": | ||
$ [{"Constant": {"ConstantInt": [{"TagInt": []}, 5]}}, | ||
$ {"Constant": {"ConstantInt": [{"TagInt": []}, 7]}}]}]]}]}]}], | ||
$ [{"Name": "B"}, | ||
$ {"DomainMatrix": | ||
$ [{"DomainInt": | ||
$ [{"TagInt": []}, | ||
$ [{"RangeBounded": | ||
$ [{"Constant": {"ConstantInt": [{"TagInt": []}, 0]}}, | ||
$ {"Constant": {"ConstantInt": [{"TagInt": []}, 1]}}]}]]}, | ||
$ {"DomainTuple": | ||
$ [{"DomainBool": []}, | ||
$ {"DomainInt": | ||
$ [{"TagInt": []}, | ||
$ [{"RangeBounded": | ||
$ [{"Constant": {"ConstantInt": [{"TagInt": []}, 2]}}, | ||
$ {"Constant": {"ConstantInt": [{"TagInt": []}, 7]}}]}]]}]}]}]]} | ||
language Essence 1.3 | ||
|
||
letting B be [(false, 5), (false, 6); int(0..1)] | ||
$ Visualisation for B | ||
$ _ 5 | ||
$ _ 6 | ||
|
3 changes: 3 additions & 0 deletions
3
tests/custom/flatten_lex/find_v_given/matrix_of_matrix/matrix.essence
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
given A : matrix indexed by [int(0..1)] of matrix indexed by [int(0..2)] of (bool,int(5..7)) | ||
find B : matrix indexed by [int(0..1)] of matrix indexed by [int(0..2)] of (bool,int(5..7)) | ||
such that A .< B |
2 changes: 2 additions & 0 deletions
2
tests/custom/flatten_lex/find_v_given/matrix_of_matrix/matrix.param
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,2 @@ | ||
letting A be | ||
[[(false, 5), (false, 5), (false, 5); int(0..2)], [(false, 5), (false, 5), (false, 5); int(0..2)]; int(0..1)] |
5 changes: 5 additions & 0 deletions
5
tests/custom/flatten_lex/find_v_given/matrix_of_matrix/run.sh
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,5 @@ | ||
conjure solve *.essence *.param | ||
cat conjure-output/*.eprime | ||
cat *.solution | ||
rm *.solution | ||
rm -r conjure-output |
Oops, something went wrong.