@@ -49,30 +49,30 @@ void preservesRemainingBinderAfterSubstitution() {
4949 VCImplication implication = vc ("∀x:int. x == 3" , "∀y:int. y > x" , "y > 0" );
5050
5151 assertSimplificationSteps (substitution ::apply , implication ,
52- chain (expect ("y > 3" , "∀x:int. y > x" ), expect ("y > 0" , "y > 0" )));
52+ chain (expect ("y > 3" , "∀x:int. y > x" ), expect ("y > 0" )));
5353 }
5454
5555 @ Test
5656 void removesSourceNodeWhenItIsLastInChain () {
5757 VCImplication implication = vc ("x > 0" , "∀y:int. y == 1" );
5858
59- assertSimplificationSteps (substitution ::apply , implication , chain (expect ("x > 0" , "x > 0" )));
59+ assertSimplificationSteps (substitution ::apply , implication , chain (expect ("x > 0" )));
6060 }
6161
6262 @ Test
6363 void usesFirstSubstitutionFoundInChain () {
6464 VCImplication implication = vc ("∀x:int. x > 0" , "∀y:int. y == 4" , "x + y > 0" );
6565
6666 assertSimplificationSteps (substitution ::apply , implication ,
67- chain (expect ("x > 0" , "∀x:int. x > 0" ), expect ("x + 4 > 0" , "∀y:int. x + y > 0" )));
67+ chain (expect ("x > 0" ), expect ("x + 4 > 0" , "∀y:int. x + y > 0" )));
6868 }
6969
7070 @ Test
7171 void substitutesInnerKnownValueAcrossNestedImplications () {
7272 VCImplication implication = vc ("∀x:int. true" , "∀y:int. y == 1" , "∀z:int. z > y" , "y + z > 0" );
7373
74- assertSimplificationSteps (substitution ::apply , implication , chain ( expect ( "true" , "∀x:int. true" ),
75- expect ("z > 1" , "∀y:int. z > y" ), expect ("1 + z > 0" , "∀y:int. y + z > 0" )));
74+ assertSimplificationSteps (substitution ::apply , implication ,
75+ chain ( expect ( "true" ), expect ("z > 1" , "∀y:int. z > y" ), expect ("1 + z > 0" , "∀y:int. y + z > 0" )));
7676 }
7777
7878 @ Test
@@ -88,31 +88,27 @@ void substitutesOuterKnownValueIntoNestedBinderRefinements() {
8888 void ignoresRecursiveBinderEquality () {
8989 VCImplication implication = vc ("∀x:int. x == x + 1" , "x > 0" );
9090
91- assertSimplificationSteps (substitution ::apply , implication ,
92- chain (expect ("x == x + 1" , "∀x:int. x == x + 1" ), expect ("x > 0" , "x > 0" )));
91+ assertSimplificationSteps (substitution ::apply , implication , chain (expect ("x == x + 1" ), expect ("x > 0" )));
9392 }
9493
9594 @ Test
9695 void ignoresNonEqualityBinderRefinement () {
9796 VCImplication implication = vc ("∀x:int. x > 3" , "x > 0" );
9897
99- assertSimplificationSteps (substitution ::apply , implication ,
100- chain (expect ("x > 3" , "∀x:int. x > 3" ), expect ("x > 0" , "x > 0" )));
98+ assertSimplificationSteps (substitution ::apply , implication , chain (expect ("x > 3" ), expect ("x > 0" )));
10199 }
102100
103101 @ Test
104102 void ignoresDerivedBinderEquality () {
105103 VCImplication implication = vc ("∀x:int. x + 1 == 3" , "x > 0" );
106104
107- assertSimplificationSteps (substitution ::apply , implication ,
108- chain (expect ("x + 1 == 3" , "∀x:int. x + 1 == 3" ), expect ("x > 0" , "x > 0" )));
105+ assertSimplificationSteps (substitution ::apply , implication , chain (expect ("x + 1 == 3" ), expect ("x > 0" )));
109106 }
110107
111108 @ Test
112109 void ignoresEqualityWithoutBinder () {
113110 VCImplication implication = vc ("x == 3" , "x > 0" );
114111
115- assertSimplificationSteps (substitution ::apply , implication ,
116- chain (expect ("x == 3" , "x == 3" ), expect ("x > 0" , "x > 0" )));
112+ assertSimplificationSteps (substitution ::apply , implication , chain (expect ("x == 3" ), expect ("x > 0" )));
117113 }
118114}
0 commit comments