Tree_Rule.in

root Lambda variable $0 ^ ^ type e ^ ^ body Exists variable $1 ^ ^ body And arguments Apply predicate flight ^ ^ arguments Variable variable $0 ^ ^ ^ End ^ ^ ^ Apply predicate round_trip ^ ^ arguments Variable variable $1 ^ ^ ^ End ^ ^ ^ Apply predicate round_trip ^ ^ arguments Variable variable $1 ^ ^ ^ End ^ ^ ^ Apply predicate from ^ ^ arguments Variable variable $0 ^ ^ ^ Entity entity ci0 ^ ^ ^ End ^ ^ ^ Apply predicate to ^ ^ arguments Variable variable $0 ^ ^ ^ Entity entity ci2 ^ ^ ^ End ^ ^ ^ Apply predicate stop ^ ^ arguments Variable variable $0 ^ ^ ^ Entity entity ci1 ^ ^ ^ End ^ ^ ^ Apply predicate day_number ^ ^ arguments Variable variable $0 ^ ^ ^ Entity entity yr0 ^ ^ ^ End ^ ^ ^ Compare op Equal ^ ^ left Apply predicate fare ^ ^ arguments Variable variable $0 ^ ^ ^ End ^ ^ ^ ^ right Variable variable ^ ^ ^ ^ End ^ ^ ^ ^ ^ ^ ^ ^
2
pleas find a flight round trip from ci0 to ci2 washington with a stopov in ci1 not exceed the price of do0 for mn0 dn0 yr0